The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Joan Boyar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  45. On the Shortest Linear Straight-Line Program for Computing Linear Forms. [Citation Graph (, )][DBLP]


  46. A Comparison of Performance Measures for Online Algorithms. [Citation Graph (, )][DBLP]


  47. A New Combinational Logic Minimization Technique with Applications to Cryptology. [Citation Graph (, )][DBLP]


  48. A Comparison of Performance Measures for Online Algorithms [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.332secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002