Joan Boyar

According to our database1, Joan Boyar
  • authored at least 110 papers between 1982 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
The Advice Complexity of a Class of Hard Online Problems.
Theory Comput. Syst., 2017

On the list update problem with advice.
Inf. Comput., 2017

Online Algorithms with Advice: A Survey.
ACM Comput. Surv., 2017

Relaxing the Irrevocability Requirement for Online Graph Algorithms.
CoRR, 2017

Relaxing the Irrevocability Requirement for Online Graph Algorithms.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016
Online Algorithms with Advice: A Survey.
SIGACT News, 2016

Weighted Online Problems with Advice.
CoRR, 2016

Batch Coloring of Graphs.
CoRR, 2016

Online Bounded Analysis.
CoRR, 2016

Online Dominating Set.
CoRR, 2016

On various nonlinearity measures for boolean functions.
Cryptography and Communications, 2016

Online Bin Packing with Advice.
Algorithmica, 2016

Batch Coloring of Graphs.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Online Dominating Set.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Weighted Online Problems with Advice.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Online Bounded Analysis.
Proceedings of the Computer Science - Theory and Applications, 2016

2015
Relative interval analysis of paging algorithms on access graphs.
Theor. Comput. Sci., 2015

Cancellation-free circuits in unbounded and bounded depth.
Theor. Comput. Sci., 2015

The Frequent Items Problem in Online Streaming Under Various Performance Measures.
Int. J. Found. Comput. Sci., 2015

Adding Isolated Vertices Makes some Online Algorithms Optimal.
CoRR, 2015

A Comparison of Performance Measures for Online Algorithms.
Algorithmica, 2015

Advice Complexity for a Class of Online Problems.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Adding Isolated Vertices Makes Some Online Algorithms Optimal.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

Constructive Relationships Between Algebraic Thickness and Normality.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014
A comparison of performance measures via online search.
Theor. Comput. Sci., 2014

The Advice Complexity of a Class of Hard Online Problems.
CoRR, 2014

Constructive Relationships Between Algebraic Thickness and Normality.
CoRR, 2014

The Relationship Between Multiplicative Complexity and Nonlinearity.
CoRR, 2014

Tight Bounds for an Online Bin Packing Problem.
CoRR, 2014

Online Bin Packing with Advice.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

The Relationship between Multiplicative Complexity and Nonlinearity.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

On the List Update Problem with Advice.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
Logic Minimization Techniques with Applications to Cryptology.
J. Cryptology, 2013

Four Measures of Nonlinearity.
IACR Cryptology ePrint Archive, 2013

Cancellation-Free Circuits in Unbounded and Bounded Depth
CoRR, 2013

Relative Interval Analysis of Paging Algorithms on Access Graphs
CoRR, 2013

The Frequent Items Problem in Online Streaming under Various Performance Measures.
CoRR, 2013

On the List Update Problem with Advice.
CoRR, 2013

Relative Interval Analysis of Paging Algorithms on Access Graphs.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

The Frequent Items Problem in Online Streaming under Various Performance Measures.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Cancellation-Free Circuits in Unbounded and Bounded Depth.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Four Measures of Nonlinearity.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Bounds for Scheduling Jobs on Grid Processors.
Proceedings of the Space-Efficient Data Structures, 2013

2012
A new variable-sized bin packing problem.
J. Scheduling, 2012

On the absolute approximation ratio for First Fit and related results.
Discrete Applied Mathematics, 2012

Online Bin Packing with Advice
CoRR, 2012

Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators
CoRR, 2012

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
CoRR, 2012

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

A Small Depth-16 Circuit for the AES S-Box.
Proceedings of the Information Security and Privacy Research, 2012

A Comparison of Performance Measures via Online Search.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
A depth-16 circuit for the AES S-box.
IACR Cryptology ePrint Archive, 2011

A Comparison of Performance Measures via Online Search
CoRR, 2011

2010
Tight results for Next Fit and Worst Fit with resource augmentation.
Theor. Comput. Sci., 2010

Priority algorithms for graph optimization problems.
Theor. Comput. Sci., 2010

Scheduling Jobs on Grid Processors.
Algorithmica, 2010

A theoretical comparison of LRU and LRU-K.
Acta Inf., 2010

A New Combinational Logic Minimization Technique with Applications to Cryptology.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009
New logic minimization techniques with applications to cryptology.
IACR Cryptology ePrint Archive, 2009

A Comparison of Performance Measures for Online Algorithms.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2008
Tight bounds for the multiplicative complexity of symmetric functions.
Theor. Comput. Sci., 2008

The relative worst order ratio applied to seat reservation.
ACM Trans. Algorithms, 2008

A Comparison of Performance Measures for Online Algorithms
CoRR, 2008

On the Shortest Linear Straight-Line Program for Computing Linear Forms.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007
The relative worst order ratio for online algorithms.
ACM Trans. Algorithms, 2007

The relative worst-order ratio applied to paging.
J. Comput. Syst. Sci., 2007

2006
The maximum resource bin packing problem.
Theor. Comput. Sci., 2006

Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Scheduling Jobs on Grid Processors.
Proceedings of the Algorithm Theory, 2006

Concrete Multiplicative Complexity of Symmetric Functions.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005
The Exact Multiplicative Complexity of the Hamming Weight Function
Electronic Colloquium on Computational Complexity (ECCC), 2005

The relative worst order ratio applied to paging.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

The Maximum Resource Bin Packing Problem.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Seat reservation allowing seat changes.
J. Algorithms, 2004

Priority Algorithms for Graph Optimization Problems.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

The Relative Worst Order Ratio Applied to Seat Reservation.
Proceedings of the Algorithm Theory, 2004

2003
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Scheduling, 2003

Extending the accommodating function.
Acta Inf., 2003

The Relative Worst Order Ratio for On-Line Algorithms.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
Fair versus Unrestricted Bin Packing.
Algorithmica, 2002

Extending the Accommodating Function.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
The Accommodating Function: A Generalization of the Competitive Ratio.
SIAM J. Comput., 2001

The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences.
Nord. J. Comput., 2001

Seat Reservation Allowing Seat Changes.
Electr. Notes Theor. Comput. Sci., 2001

2000
On the multiplicative complexity of Boolean functions over the basis (cap, +, 1).
Theor. Comput. Sci., 2000

Short Non-Interactive Cryptographic Proofs.
J. Cryptology, 2000

Fair versus Unrestricted Bin Packing.
Proceedings of the Algorithm Theory, 2000

Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
The Seat Reservation Problem.
Algorithmica, 1999

The Accommodating Function - A Generalization of the Competitive Ratio.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1997
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
J. Comput. Syst. Sci., 1997

1996
Short Discrete Proofs.
Proceedings of the Advances in Cryptology, 1996

1995
Subquadratic Zero-Knowledge.
J. ACM, 1995

Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994
Efficient Rebalancing of Chromatic Search Trees.
J. Comput. Syst. Sci., 1994

Bounds on Certain Multiplications of Affine Combinations.
Discrete Applied Mathematics, 1994

1993
On the Communication Complexity of Zero-Knowledge Proofs.
J. Cryptology, 1993

1992
An Arithmetic Model of Computation Equivalent to Threshold Circuits.
Theor. Comput. Sci., 1992

Efficient Rebalancing of Chromatic Search Trees.
Proceedings of the Algorithm Theory, 1992

1991
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.
J. Cryptology, 1991

Subquadratic Zero-Knowledge
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs.
J. Cryptology, 1990

Convertible Undeniable Signatures.
Proceedings of the Advances in Cryptology, 1990

1989
Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits.
J. Cryptology, 1989

Inferring sequences produced by pseudo-random number generators.
J. ACM, 1989

Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.
Proceedings of the Advances in Cryptology, 1989

On the Concrete Complexity of Zero-Knowledge Proofs.
Proceedings of the Advances in Cryptology, 1989

1987
Coloring Planar Graphs in Parallel.
J. Algorithms, 1987

1982
Inferring a Sequence Generated by a Linear Congruence
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

Inferring a Sequence Produced by a Linear Congruence.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982


  Loading...