dblp.uni-trier.dewww.uni-trier.de

Joan Boyar Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
49EEJoan Boyar, Sandy Irani, Kim S. Larsen: A Comparison of Performance Measures for Online Algorithms. WADS 2009: 119-130
2008
48EEJoan Boyar, Philip Matthews, René Peralta: On the Shortest Linear Straight-Line Program for Computing Linear Forms. MFCS 2008: 168-179
47EEJoan Boyar, Paul Medvedev: The relative worst order ratio applied to seat reservation. ACM Transactions on Algorithms 4(4): (2008)
46EEJoan Boyar, Sandy Irani, Kim S. Larsen: A Comparison of Performance Measures for Online Algorithms CoRR abs/0806.0983: (2008)
45EEJoan Boyar, René Peralta: Tight bounds for the multiplicative complexity of symmetric functions. Theor. Comput. Sci. 396(1-3): 223-246 (2008)
2007
44EEJoan Boyar, Lene M. Favrholdt: The relative worst order ratio for online algorithms. ACM Transactions on Algorithms 3(2): (2007)
43EEJoan Boyar, Lene M. Favrholdt, Kim S. Larsen: The relative worst-order ratio applied to paging. J. Comput. Syst. Sci. 73(5): 818-843 (2007)
2006
42EEJoan Boyar, René Peralta: Concrete Multiplicative Complexity of Symmetric Functions. MFCS 2006: 179-189
41EEJoan Boyar, Lene M. Favrholdt: Scheduling Jobs on Grid Processors. SWAT 2006: 17-28
40EEJoan Boyar, Martin R. Ehmsen, Kim S. Larsen: Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem. WAOA 2006: 95-107
39EEJoan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk: The maximum resource bin packing problem. Theor. Comput. Sci. 362(1-3): 127-139 (2006)
2005
38EEJoan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk: The Maximum Resource Bin Packing Problem. FCT 2005: 397-408
37EEJoan Boyar, Lene M. Favrholdt, Kim S. Larsen: The relative worst order ratio applied to paging. SODA 2005: 718-727
36EEJoan Boyar, René Peralta: The Exact Multiplicative Complexity of the Hamming Weight Function Electronic Colloquium on Computational Complexity (ECCC)(049): (2005)
2004
35EEJoan Boyar, Paul Medvedev: The Relative Worst Order Ratio Applied to Seat Reservation. SWAT 2004: 90-101
34EEAllan Borodin, Joan Boyar, Kim S. Larsen: Priority Algorithms for Graph Optimization Problems. WAOA 2004: 126-139
33EEJoan Boyar, Susan Krarup, Morten N. Nielsen: Seat reservation allowing seat changes. J. Algorithms 52(2): 169-192 (2004)
2003
32EEJoan Boyar, Lene M. Favrholdt: The Relative Worst Order Ratio for On-Line Algorithms. CIAC 2003: 58-69
31EEJoan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Extending the accommodating function. Acta Inf. 40(1): 3-35 (2003)
30 Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee: Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. J. Scheduling 6(2): 131-147 (2003)
2002
29EEJoan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Extending the Accommodating Function. COCOON 2002: 87-96
28EEYossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein: Fair versus Unrestricted Bin Packing. Algorithmica 34(2): 181-196 (2002)
2001
27EEJoan Boyar, Susan Krarup, Morten N. Nielsen: Seat Reservation Allowing Seat Changes. Electr. Notes Theor. Comput. Sci. 50(1): (2001)
26EEJoan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences. Nord. J. Comput. 8(4): 463-472 (2001)
25EEJoan Boyar, Kim S. Larsen, Morten N. Nielsen: The Accommodating Function: A Generalization of the Competitive Ratio. SIAM J. Comput. 31(1): 233-258 (2001)
2000
24EEEric Bach, Joan Boyar, Tao Jiang, Kim S. Larsen, Guo-Hui Lin: Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. COCOON 2000: 221-231
23EEYossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Fair versus Unrestricted Bin Packing. SWAT 2000: 200-213
22EEJoan Boyar, Ivan Damgård, René Peralta: Short Non-Interactive Cryptographic Proofs. J. Cryptology 13(4): 449-472 (2000)
21EEJoan Boyar, René Peralta, Denis Pochuev: On the multiplicative complexity of Boolean functions over the basis (cap, +, 1). Theor. Comput. Sci. 235(1): 43-57 (2000)
1999
20EEJoan Boyar, Kim S. Larsen, Morten N. Nielsen: The Accommodating Function - A Generalization of the Competitive Ratio. WADS 1999: 74-79
19EEJoan Boyar, Kim S. Larsen: The Seat Reservation Problem. Algorithmica 25(4): 403-417 (1999)
1997
18 Joan Boyar, Rolf Fagerberg, Kim S. Larsen: Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. J. Comput. Syst. Sci. 55(3): 504-521 (1997)
1996
17EEJoan Boyar, René Peralta: Short Discrete Proofs. EUROCRYPT 1996: 131-142
1995
16 Joan Boyar, Rolf Fagerberg, Kim S. Larsen: Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. WADS 1995: 270-281
15EEJoan Boyar, Gilles Brassard, René Peralta: Subquadratic Zero-Knowledge. J. ACM 42(6): 1169-1193 (1995)
1994
14EEJoan Boyar, Faith E. Fich, Kim S. Larsen: Bounds on Certain Multiplications of Affine Combinations. Discrete Applied Mathematics 52(2): 155-167 (1994)
13 Joan Boyar, Kim S. Larsen: Efficient Rebalancing of Chromatic Search Trees. J. Comput. Syst. Sci. 49(3): 667-682 (1994)
1993
12 Joan Boyar, Carsten Lund, René Peralta: On the Communication Complexity of Zero-Knowledge Proofs. J. Cryptology 6(2): 65-85 (1993)
1992
11EEJoan Boyar, Kim S. Larsen: Efficient Rebalancing of Chromatic Search Trees. SWAT 1992: 151-164
10 Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant: An Arithmetic Model of Computation Equivalent to Threshold Circuits. Theor. Comput. Sci. 93(2): 303-319 (1992)
1991
9 Joan Boyar, Gilles Brassard, René Peralta: Subquadratic Zero-Knowledge FOCS 1991: 69-78
8 Joan Boyar, Katalin Friedl, Carsten Lund: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. J. Cryptology 4(3): 185-206 (1991)
1990
7EEJoan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen: Convertible Undeniable Signatures. CRYPTO 1990: 189-205
6 Joan Boyar, S. A. Kurtz, Mark W. Krentel: A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs. J. Cryptology 2(2): 63-76 (1990)
1989
5EEJoan Boyar, René Peralta: On the Concrete Complexity of Zero-Knowledge Proofs. CRYPTO 1989: 507-525
4EEJoan Boyar, Katalin Friedl, Carsten Lund: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. EUROCRYPT 1989: 155-172
3EEJoan Boyar: Inferring sequences produced by pseudo-random number generators. J. ACM 36(1): 129-141 (1989)
2 Joan Boyar: Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits. J. Cryptology 1(3): 177-184 (1989)
1987
1 Joan Boyar, Howard J. Karloff: Coloring Planar Graphs in Parallel. J. Algorithms 8(4): 470-479 (1987)

Coauthor Index

1Yossi Azar [23] [28]
2Eric Bach [24] [30]
3Allan Borodin [34]
4Gilles Brassard [9] [15]
5David Chaum [7]
6Ivan Damgård [7] [22]
7Martin R. Ehmsen [40]
8Faith Ellen (Faith Ellen Fich, Faith E. Fich) [14]
9Leah Epstein [28] [30] [38] [39]
10Rolf Fagerberg [16] [18]
11Lene M. Favrholdt [23] [26] [28] [29] [30] [31] [32] [37] [38] [39] [41] [43] [44]
12Gudmund Skovbjerg Frandsen [10]
13Katalin Friedl [4] [8]
14Sandy Irani [46] [49]
15Tao Jiang [24] [30]
16Howard J. Karloff [1]
17Jens S. Kohrt (Jens S. Frederiksen) [38] [39]
18Susan Krarup [27] [33]
19Mark W. Krentel [6]
20S. A. Kurtz [6]
21Kim S. Larsen [11] [13] [14] [16] [18] [19] [20] [23] [24] [25] [26] [28] [29] [30] [31] [34] [37] [38] [39] [40] [43] [46] [49]
22Guohui Lin (Guo-Hui Lin) [24] [30]
23Carsten Lund [4] [8] [12]
24Philip Matthews [48]
25Paul Medvedev [35] [47]
26Morten N. Nielsen [20] [23] [25] [26] [27] [28] [29] [31] [33]
27Morten Monrad Pedersen [38] [39]
28Torben P. Pedersen [7]
29René Peralta [5] [9] [12] [15] [17] [21] [22] [36] [42] [45] [48]
30Denis Pochuev [21]
31Rob van Stee [30]
32Carl Sturtivant [10]
33Sanne Wøhlk [38] [39]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)