Joan Boyar

Joan B. Plumstead

	2012
62		Joan Boyar, Kim S. Larsen, Abyayananda Maiti: A Comparison of Performance Measures via Online Search. FAW-AAIM 2012: 303-314
61		Joan Boyar, Sushmita Gupta, Kim S. Larsen: Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis CoRR abs/1204.4047: (2012)
60		Joan Boyar, Lene M. Favrholdt: A new variable-sized bin packing problem. J. Scheduling 15(3): 273-287 (2012)
	2011
59		Joan Boyar, Kim S. Larsen, Abyayananda Maiti: A Comparison of Performance Measures via Online Search CoRR abs/1106.6136: (2011)
58		Joan Boyar, René Peralta: A depth-16 circuit for the AES S-box. IACR Cryptology ePrint Archive 2011: 332 (2011)
	2010
57		Joan Boyar, René Peralta: A New Combinational Logic Minimization Technique with Applications to Cryptology. SEA 2010: 178-189
56		Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen: A theoretical comparison of LRU and LRU-K. Acta Inf. 47(7-8): 359-374 (2010)
55		Joan Boyar, Lene M. Favrholdt: Scheduling Jobs on Grid Processors. Algorithmica 57(4): 819-847 (2010)
54		Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi: Priority algorithms for graph optimization problems. Theor. Comput. Sci. 411(1): 239-258 (2010)
53		Joan Boyar, Leah Epstein, Asaf Levin: Tight results for Next Fit and Worst Fit with resource augmentation. Theor. Comput. Sci. 411(26-28): 2572-2580 (2010)
	2009
52		Joan Boyar, Sandy Irani, Kim S. Larsen: A Comparison of Performance Measures for Online Algorithms. WADS 2009: 119-130
51		Joan Boyar, René Peralta: New logic minimization techniques with applications to cryptology. IACR Cryptology ePrint Archive 2009: 191 (2009)
	2008
50		Joan Boyar, Philip Matthews, René Peralta: On the Shortest Linear Straight-Line Program for Computing Linear Forms. MFCS 2008: 168-179
49		Joan Boyar, Paul Medvedev: The relative worst order ratio applied to seat reservation. ACM Transactions on Algorithms 4(4): (2008)
48		Joan Boyar, Sandy Irani, Kim S. Larsen: A Comparison of Performance Measures for Online Algorithms CoRR abs/0806.0983: (2008)
47		Joan Boyar, René Peralta: Tight bounds for the multiplicative complexity of symmetric functions. Theor. Comput. Sci. 396(1-3): 223-246 (2008)
	2007
46		Joan Boyar, Lene M. Favrholdt: The relative worst order ratio for online algorithms. ACM Transactions on Algorithms 3(2): (2007)
45		Joan 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
44		Joan Boyar, René Peralta: Concrete Multiplicative Complexity of Symmetric Functions. MFCS 2006: 179-189
43		Joan Boyar, Lene M. Favrholdt: Scheduling Jobs on Grid Processors. SWAT 2006: 17-28
42		Joan 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
41		Joan 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
40		Joan 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
39		Joan Boyar, Lene M. Favrholdt, Kim S. Larsen: The relative worst order ratio applied to paging. SODA 2005: 718-727
38		Joan Boyar, René Peralta: The Exact Multiplicative Complexity of the Hamming Weight Function Electronic Colloquium on Computational Complexity (ECCC)(049): (2005)
	2004
37		Joan Boyar, Paul Medvedev: The Relative Worst Order Ratio Applied to Seat Reservation. SWAT 2004: 90-101
36		Allan Borodin, Joan Boyar, Kim S. Larsen: Priority Algorithms for Graph Optimization Problems. WAOA 2004: 126-139
35		Joan Boyar, Susan Krarup, Morten N. Nielsen: Seat reservation allowing seat changes. J. Algorithms 52(2): 169-192 (2004)
	2003
34		Joan Boyar, Lene M. Favrholdt: The Relative Worst Order Ratio for On-Line Algorithms. CIAC 2003: 58-69
33		Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Extending the accommodating function. Acta Inf. 40(1): 3-35 (2003)
32		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
31		Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Extending the Accommodating Function. COCOON 2002: 87-96
30		Yossi 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
29		Joan Boyar, Susan Krarup, Morten N. Nielsen: Seat Reservation Allowing Seat Changes. Electr. Notes Theor. Comput. Sci. 50(1): 24-38 (2001)
28		Joan 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)
27		Joan 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
26		Eric 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
25		Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Fair versus Unrestricted Bin Packing. SWAT 2000: 200-213
24		Joan Boyar, Ivan Damgård, René Peralta: Short Non-Interactive Cryptographic Proofs. J. Cryptology 13(4): 449-472 (2000)
23		Joan 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
22		Joan Boyar, Kim S. Larsen, Morten N. Nielsen: The Accommodating Function - A Generalization of the Competitive Ratio. WADS 1999: 74-79
21		Joan Boyar, Kim S. Larsen: The Seat Reservation Problem. Algorithmica 25(4): 403-417 (1999)
	1997
20		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
19		Joan Boyar, René Peralta: Short Discrete Proofs. EUROCRYPT 1996: 131-142
	1995
18		Joan Boyar, Rolf Fagerberg, Kim S. Larsen: Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. WADS 1995: 270-281
17		Joan Boyar, Gilles Brassard, René Peralta: Subquadratic Zero-Knowledge. J. ACM 42(6): 1169-1193 (1995)
	1994
16		Joan Boyar, Faith E. Fich, Kim S. Larsen: Bounds on Certain Multiplications of Affine Combinations. Discrete Applied Mathematics 52(2): 155-167 (1994)
15		Joan Boyar, Kim S. Larsen: Efficient Rebalancing of Chromatic Search Trees. J. Comput. Syst. Sci. 49(3): 667-682 (1994)
	1993
14		Joan Boyar, Carsten Lund, René Peralta: On the Communication Complexity of Zero-Knowledge Proofs. J. Cryptology 6(2): 65-85 (1993)
	1992
13		Joan Boyar, Kim S. Larsen: Efficient Rebalancing of Chromatic Search Trees. SWAT 1992: 151-164
12		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
11		Joan Boyar, Gilles Brassard, René Peralta: Subquadratic Zero-Knowledge FOCS 1991: 69-78
10		Joan Boyar, Katalin Friedl, Carsten Lund: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. J. Cryptology 4(3): 185-206 (1991)
	1990
9		Joan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen: Convertible Undeniable Signatures. CRYPTO 1990: 189-205
8		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
7		Joan Boyar, René Peralta: On the Concrete Complexity of Zero-Knowledge Proofs. CRYPTO 1989: 507-525
6		Joan Boyar, Katalin Friedl, Carsten Lund: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. EUROCRYPT 1989: 155-172
5		Joan Boyar: Inferring sequences produced by pseudo-random number generators. J. ACM 36(1): 129-141 (1989)
4		Joan Boyar: Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits. J. Cryptology 1(3): 177-184 (1989)
	1987
3		Joan Boyar, Howard J. Karloff: Coloring Planar Graphs in Parallel. J. Algorithms 8(4): 470-479 (1987)
	1982
2		Joan B. Plumstead: Inferring a Sequence Produced by a Linear Congruence. CRYPTO 1982: 317-319
1		Joan B. Plumstead: Inferring a Sequence Generated by a Linear Congruence FOCS 1982: 153-159

Coauthor Index

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

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page