Joan Boyar

153 papers A* 8A 2B 20C 6Misc 4Journal 99Unranked 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Forwarding Packets Greedily.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Kevin Schewior, Rob van Stee
2026 J jnl
On the Online Weighted Non-Crossing Matching Problem.
CoRR
Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Fata Lavasani, Yaqiao Li, Denis Pankratov
2026 J jnl
On the online weighted non-crossing matching problem.
Inf. Comput.
Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov
2026 J jnl
Online interval scheduling with predictions.
J. Comput. Syst. Sci.
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2025 A* conf
Brief Announcement: Distributed Graph Algorithms with Predictions.
PODC
Joan Boyar, Faith Ellen, Kim S. Larsen
2025 — conf
Complexity Classes for Online Problems with and Without Predictions.
IJTCS-FAW
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2025 J jnl
Distributed Graph Algorithms with Predictions.
CoRR
Joan Boyar, Faith Ellen, Kim S. Larsen
2024 J jnl
Advice complexity of adaptive priority algorithms.
Theor. Comput. Sci.
Joan Boyar, Kim S. Larsen, Denis Pankratov
2024 J jnl
Complexity Classes for Online Problems with and without Predictions.
CoRR
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2024 J jnl
Folding Schemes with Privacy Preserving Selective Verification.
IACR Commun. Cryptol.
Joan Boyar, Simon Erfurth
2024 J jnl
Folding Schemes with Privacy Preserving Selective Verification.
IACR Cryptol. ePrint Arch.
Joan Boyar, Simon Erfurth
2024 — conf
On the Online Weighted Non-Crossing Matching Problem.
SWAT
Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov
2024 J jnl
Online Unit Profit Knapsack with Predictions.
Algorithmica
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2023 B conf
Online Algorithms with Predictions (Invited Talk).
MFCS
Joan Boyar
2023 B conf
Online Interval Scheduling with Predictions.
WADS
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2023 J jnl
Online Interval Scheduling with Predictions.
CoRR
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2023 B conf
Online Minimum Spanning Trees with Weight Predictions.
WADS
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2023 J jnl
Online Minimum Spanning Trees with Weight Predictions.
CoRR
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2023 A* conf
Paging with Succinct Predictions.
ICML
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
2023 — conf
Quotable Signatures for Authenticating Shared Quotes.
LATINCRYPT
Joan Boyar, Simon Erfurth, Kim S. Larsen, Ruben Niederhagen
2022 — conf
Online Unit Profit Knapsack with Untrusted Predictions.
SWAT
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2022 J jnl
Online Unit Profit Knapsack with Untrusted Predictions.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2022 J jnl
Paging with Succinct Predictions.
CoRR
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
2022 J jnl
Quotable Signatures for Authenticating Shared Quotes.
CoRR
Joan Boyar, Simon Erfurth, Kim S. Larsen, Ruben Niederhagen
2022 J jnl
Relative Worst-order Analysis: A Survey.
ACM Comput. Surv.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2022 J jnl
Relaxing the Irrevocability Requirement for Online Graph Algorithms.
Algorithmica
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2021 J jnl
Online Bin Covering with Advice.
Algorithmica
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2020 J jnl
Advice Complexity of Priority Algorithms.
Theory Comput. Syst.
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
2020 J jnl
Randomized distributed online algorithms against adaptive offline adversaries.
Inf. Process. Lett.
Joan Boyar, Faith Ellen, Kim S. Larsen
2019 J jnl
Advice Complexity of Adaptive Priority Algorithms.
CoRR
Joan Boyar, Kim S. Larsen, Denis Pankratov
2019 B conf
Online Bin Covering with Advice.
WADS
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2019 J jnl
Online Bin Covering with Advice.
CoRR
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2019 J jnl
Online Dominating Set.
Algorithmica
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2019 J jnl
Small low-depth circuits for cryptographic applications.
Cryptogr. Commun.
Joan Boyar, Magnus Gausdal Find, René Peralta
2019 J jnl
Tight Bounds for Restricted Grid Scheduling.
Int. J. Found. Comput. Sci.
Joan Boyar, Faith Ellen
2018 J jnl
Adding isolated vertices makes some greedy online algorithms optimal.
Discret. Appl. Math.
Joan Boyar, Christian Kudahl
2018 B conf
Advice Complexity of Priority Algorithms.
WAOA
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
2018 J jnl
Advice Complexity of Priority Algorithms.
CoRR
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
2018 J jnl
Batch Coloring of Graphs.
Algorithmica
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2018 J jnl
Multiplicative complexity of vector valued Boolean functions.
Theor. Comput. Sci.
Joan Boyar, Magnus Gausdal Find
2018 J jnl
Online-bounded analysis.
J. Sched.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2018 — conf
Relative Worst-Order Analysis: A Survey.
Adventures Between Lower Bounds and Higher Altitudes
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2018 J jnl
Relative Worst-Order Analysis: A Survey.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2018 J jnl
The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing.
CoRR
Joan Boyar, Faith Ellen, Kim S. Larsen
2018 J jnl
Weighted Online Problems with Advice.
Theory Comput. Syst.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2017 J jnl
On the list update problem with advice.
Inf. Comput.
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2017 J jnl
Online Algorithms with Advice: A Survey.
ACM Comput. Surv.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
2017 B conf
Relaxing the Irrevocability Requirement for Online Graph Algorithms.
WADS
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2017 J jnl
Relaxing the Irrevocability Requirement for Online Graph Algorithms.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Michal Kotrbcík
2017 J jnl
The Advice Complexity of a Class of Hard Online Problems.
Theory Comput. Syst.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2016 B conf
Batch Coloring of Graphs.
WAOA
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 J jnl
Batch Coloring of Graphs.
CoRR
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 J jnl
On various nonlinearity measures for boolean functions.
Cryptogr. Commun.
Joan Boyar, Magnus Gausdal Find, René Peralta
2016 J jnl
Online Algorithms with Advice: A Survey.
SIGACT News
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
2016 J jnl
Online Bin Packing with Advice.
Algorithmica
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2016 Misc conf
Online Bounded Analysis.
CSR
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 J jnl
Online Bounded Analysis.
CoRR
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 — conf
Online Dominating Set.
SWAT
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2016 J jnl
Online Dominating Set.
CoRR
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2016 C conf
Weighted Online Problems with Advice.
IWOCA
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2016 J jnl
Weighted Online Problems with Advice.
CoRR
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2015 J jnl
A Comparison of Performance Measures for Online Algorithms.
Algorithmica
Joan Boyar, Sandy Irani, Kim S. Larsen
2015 C conf
Adding Isolated Vertices Makes Some Online Algorithms Optimal.
IWOCA
Joan Boyar, Christian Kudahl
2015 J jnl
Adding Isolated Vertices Makes some Online Algorithms Optimal.
CoRR
Joan Boyar, Christian Kudahl
2015 A conf
Advice Complexity for a Class of Online Problems.
STACS
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2015 J jnl
Cancellation-free circuits in unbounded and bounded depth.
Theor. Comput. Sci.
Joan Boyar, Magnus Gausdal Find
2015 B conf
Constructive Relationships Between Algebraic Thickness and Normality.
FCT
Joan Boyar, Magnus Gausdal Find
2015 J jnl
Relative interval analysis of paging algorithms on access graphs.
Theor. Comput. Sci.
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2015 J jnl
The Frequent Items Problem in Online Streaming Under Various Performance Measures.
Int. J. Found. Comput. Sci.
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2014 J jnl
A comparison of performance measures via online search.
Theor. Comput. Sci.
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2014 J jnl
Constructive Relationships Between Algebraic Thickness and Normality.
CoRR
Joan Boyar, Magnus Gausdal Find
2014 C conf
On the List Update Problem with Advice.
LATA
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2014 A conf
Online Bin Packing with Advice.
STACS
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2014 J jnl
The Advice Complexity of a Class of Hard Online Problems.
CoRR
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2014 J jnl
The Relationship Between Multiplicative Complexity and Nonlinearity.
CoRR
Joan Boyar, Magnus Gausdal Find
2014 — conf
The Relationship between Multiplicative Complexity and Nonlinearity.
MFCS (2)
Joan Boyar, Magnus Gausdal Find
2014 J jnl
Tight Bounds for an Online Bin Packing Problem.
CoRR
Joan Boyar, Faith Ellen
2013 — conf
Bounds for Scheduling Jobs on Grid Processors.
Space-Efficient Data Structures, Streams, and Algorithms
Joan Boyar, Faith Ellen
2013 J jnl
Cancellation-Free Circuits in Unbounded and Bounded Depth
CoRR
Joan Boyar, Magnus Find
2013 B conf
Cancellation-Free Circuits in Unbounded and Bounded Depth.
FCT
Joan Boyar, Magnus Gausdal Find
2013 C conf
Four Measures of Nonlinearity.
CIAC
Joan Boyar, Magnus Find, René Peralta
2013 J jnl
Four Measures of Nonlinearity.
IACR Cryptol. ePrint Arch.
Joan Boyar, Magnus Find, René Peralta
2013 J jnl
Logic Minimization Techniques with Applications to Cryptology.
J. Cryptol.
Joan Boyar, Philip Matthews, René Peralta
2013 J jnl
On the List Update Problem with Advice.
CoRR
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2013 J jnl
Relative Interval Analysis of Paging Algorithms on Access Graphs
CoRR
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2013 B conf
Relative Interval Analysis of Paging Algorithms on Access Graphs.
WADS
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2013 B conf
The Frequent Items Problem in Online Streaming under Various Performance Measures.
FCT
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2013 J jnl
The Frequent Items Problem in Online Streaming under Various Performance Measures.
CoRR
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2012 — conf
A Comparison of Performance Measures via Online Search.
FAW-AAIM
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2012 Misc conf
A Small Depth-16 Circuit for the AES S-Box.
SEC
Joan Boyar, René Peralta
2012 J jnl
A new variable-sized bin packing problem.
J. Sched.
Joan Boyar, Lene M. Favrholdt
2012 J jnl
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
CoRR
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2012 — conf
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis.
SWAT
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2012 J jnl
Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators
CoRR
Joan Boyar, Magnus Find
2012 J jnl
On the absolute approximation ratio for First Fit and related results.
Discret. Appl. Math.
Joan Boyar, György Dósa, Leah Epstein
2012 J jnl
Online Bin Packing with Advice
CoRR
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2011 J jnl
A Comparison of Performance Measures via Online Search
CoRR
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2011 J jnl
A depth-16 circuit for the AES S-box.
IACR Cryptol. ePrint Arch.
Joan Boyar, René Peralta
2010 B conf
A New Combinational Logic Minimization Technique with Applications to Cryptology.
SEA
Joan Boyar, René Peralta
2010 J jnl
A theoretical comparison of LRU and LRU-K.
Acta Informatica
Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
2010 J jnl
Priority algorithms for graph optimization problems.
Theor. Comput. Sci.
Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi
2010 J jnl
Scheduling Jobs on Grid Processors.
Algorithmica
Joan Boyar, Lene M. Favrholdt
2010 J jnl
Tight results for Next Fit and Worst Fit with resource augmentation.
Theor. Comput. Sci.
Joan Boyar, Leah Epstein, Asaf Levin
2009 B conf
A Comparison of Performance Measures for Online Algorithms.
WADS
Joan Boyar, Sandy Irani, Kim S. Larsen
2009 J jnl
New logic minimization techniques with applications to cryptology.
IACR Cryptol. ePrint Arch.
Joan Boyar, René Peralta
2008 J jnl
A Comparison of Performance Measures for Online Algorithms
CoRR
Joan Boyar, Sandy Irani, Kim S. Larsen
2008 B conf
On the Shortest Linear Straight-Line Program for Computing Linear Forms.
MFCS
Joan Boyar, Philip Matthews, René Peralta
2008 J jnl
The relative worst order ratio applied to seat reservation.
ACM Trans. Algorithms
Joan Boyar, Paul Medvedev
2008 J jnl
Tight bounds for the multiplicative complexity of symmetric functions.
Theor. Comput. Sci.
Joan Boyar, René Peralta
2007 J jnl
The relative worst order ratio for online algorithms.
ACM Trans. Algorithms
Joan Boyar, Lene M. Favrholdt
2007 J jnl
The relative worst-order ratio applied to paging.
J. Comput. Syst. Sci.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2006 B conf
Concrete Multiplicative Complexity of Symmetric Functions.
MFCS
Joan Boyar, René Peralta
2006 — conf
Scheduling Jobs on Grid Processors.
SWAT
Joan Boyar, Lene M. Favrholdt
2006 J jnl
The maximum resource bin packing problem.
Theor. Comput. Sci.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
2006 B conf
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem.
WAOA
Joan Boyar, Martin R. Ehmsen, Kim S. Larsen
2005 J jnl
The Exact Multiplicative Complexity of the Hamming Weight Function
Electron. Colloquium Comput. Complex.
Joan Boyar, René Peralta
2005 B conf
The Maximum Resource Bin Packing Problem.
FCT
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
2005 A* conf
The relative worst order ratio applied to paging.
SODA
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2004 B conf
Priority Algorithms for Graph Optimization Problems.
WAOA
Allan Borodin, Joan Boyar, Kim S. Larsen
2004 J jnl
Seat reservation allowing seat changes.
J. Algorithms
Joan Boyar, Susan Krarup, Morten N. Nielsen
2004 — conf
The Relative Worst Order Ratio Applied to Seat Reservation.
SWAT
Joan Boyar, Paul Medvedev
2003 J jnl
Extending the accommodating function.
Acta Informatica
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
2003 C conf
The Relative Worst Order Ratio for On-Line Algorithms.
CIAC
Joan Boyar, Lene M. Favrholdt
2003 J jnl
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Sched.
Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee
2002 Misc conf
Extending the Accommodating Function.
COCOON
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
2002 J jnl
Fair versus Unrestricted Bin Packing.
Algorithmica
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein
2001 C conf
Seat Reservation Allowing Seat Changes.
ATMOS
Joan Boyar, Susan Krarup, Morten N. Nielsen
2001 J jnl
The Accommodating Function: A Generalization of the Competitive Ratio.
SIAM J. Comput.
Joan Boyar, Kim S. Larsen, Morten N. Nielsen
2001 J jnl
The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences.
Nord. J. Comput.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
2000 Misc conf
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.
COCOON
Eric Bach, Joan Boyar, Tao Jiang, Kim S. Larsen, Guo-Hui Lin
2000 — conf
Fair versus Unrestricted Bin Packing.
SWAT
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
2000 J jnl
On the multiplicative complexity of Boolean functions over the basis (cap, +, 1).
Theor. Comput. Sci.
Joan Boyar, René Peralta, Denis Pochuev
2000 J jnl
Short Non-Interactive Cryptographic Proofs.
J. Cryptol.
Joan Boyar, Ivan Damgård, René Peralta
1999 B conf
The Accommodating Function - A Generalization of the Competitive Ratio.
WADS
Joan Boyar, Kim S. Larsen, Morten N. Nielsen
1999 J jnl
The Seat Reservation Problem.
Algorithmica
Joan Boyar, Kim S. Larsen
1997 J jnl
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
J. Comput. Syst. Sci.
Joan Boyar, Rolf Fagerberg, Kim S. Larsen
1996 A* conf
Short Discrete Proofs.
EUROCRYPT
Joan Boyar, René Peralta
1995 B conf
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
WADS
Joan Boyar, Rolf Fagerberg, Kim S. Larsen
1995 J jnl
Subquadratic Zero-Knowledge.
J. ACM
Joan Boyar, Gilles Brassard, René Peralta
1994 J jnl
Bounds on Certain Multiplications of Affine Combinations.
Discret. Appl. Math.
Joan Boyar, Faith E. Fich, Kim S. Larsen
1994 J jnl
Efficient Rebalancing of Chromatic Search Trees.
J. Comput. Syst. Sci.
Joan Boyar, Kim S. Larsen
1993 J jnl
On the Communication Complexity of Zero-Knowledge Proofs.
J. Cryptol.
Joan Boyar, Carsten Lund, René Peralta
1992 J jnl
An Arithmetic Model of Computation Equivalent to Threshold Circuits.
Theor. Comput. Sci.
Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant
1992 — conf
Efficient Rebalancing of Chromatic Search Trees.
SWAT
Joan Boyar, Kim S. Larsen
1991 J jnl
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.
J. Cryptol.
Joan Boyar, Katalin Friedl, Carsten Lund
1991 A* conf
Subquadratic Zero-Knowledge
FOCS
Joan Boyar, Gilles Brassard, René Peralta
1990 J jnl
A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs.
J. Cryptol.
Joan Boyar, Stuart A. Kurtz, Mark W. Krentel
1990 A* conf
Convertible Undeniable Signatures.
CRYPTO
Joan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen
1989 J jnl
Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits.
J. Cryptol.
Joan Boyar
1989 J jnl
Inferring sequences produced by pseudo-random number generators.
J. ACM
Joan Boyar
1989 A* conf
On the Concrete Complexity of Zero-Knowledge Proofs.
CRYPTO
Joan Boyar, René Peralta
1989 A* conf
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.
EUROCRYPT
Joan Boyar, Katalin Friedl, Carsten Lund
1987 J jnl
Coloring Planar Graphs in Parallel.
J. Algorithms
Joan Boyar, Howard J. Karloff