Joan Boyar

Q: What Schools Are Affiliated With Joan Boyar

Joan Boyar is affiliated with the following schools: Technical University of Denmark, Aarhus University, University of Southern Denmark, University of California, Berkeley, University of Copenhagen

Joan Boyar's AcademicInfluence.com Rankings

Joan Boyar

Computer Science

#11605

World Rank

#12315

Historical Rank

Database

#9052

World Rank

#9516

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Joan Boyar's Degrees

PhD Computer Science University of Copenhagen
Masters Computer Science University of Copenhagen
Bachelors Computer Science University of Copenhagen

Similar Degrees You Can Earn

Why Is Joan Boyar Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Joan Faye Boyar is an American and Danish computer scientist whose research interests include online algorithms, cryptology, and the computational complexity of the Boolean functions used in cryptology. She is a professor in the Department of Mathematics and Computer Science at the University of Southern Denmark.

(See a Problem?)

Joan Boyar's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Convertible Undeniable Signatures (1990) (212)
A New Combinational Logic Minimization Technique with Applications to Cryptology (2010) (161)
Logic Minimization Techniques with Applications to Cryptology (2013) (127)
Inferring sequences produced by pseudo-random number generators (1989) (120)
A Small Depth-16 Circuit for the AES S-Box (2012) (107)
On the multiplicative complexity of Boolean functions over the basis (cap, +, 1) (2000) (96)
Online Algorithms with Advice: A Survey (2016) (81)
The relative worst order ratio for online algorithms (2007) (64)
Online Bin Packing with Advice (2012) (58)
The Seat Reservation Problem (1996) (56)
The relative worst order ratio applied to paging (2005) (56)
A discrete logarithm implementation of perfect zero-knowledge blobs (1990) (52)
The Accommodating Function: A Generalization of the Competitive Ratio (2001) (51)
Efficient Rebalancing of Chromatic Search Trees (1992) (48)
On the Shortest Linear Straight-Line Program for Computing Linear Forms (2008) (48)
Inferring a Sequence Generated by a Linear Congruence (1982) (45)
Inferring sequences produced by a linear congruential generator missing low-order bits (1989) (44)
The Relative Worst Order Ratio for On-Line Algorithms (2003) (44)
A Comparison of Performance Measures for Online Algorithms (2008) (40)
A discrete logarithm implementation of zero-knowledge blobs (1987) (38)
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues (1995) (37)
Coloring Planar Graphs in Parallel (1987) (34)
Priority algorithms for graph optimization problems (2004) (32)
The relative worst order ratio applied to seat reservation (2004) (30)
The maximum resource bin packing problem (2005) (30)
A depth-16 circuit for the AES S-box (2011) (29)
Practical zero-knowledge proofs: Giving hints and using deficiencies (1988) (28)
Advice Complexity for a Class of Online Problems (2015) (27)
Tight bounds for the multiplicative complexity of symmetric functions (2008) (25)
Subquadratic zero-knowledge (1991) (25)
Short Non-Interactive Cryptographic Proofs (2015) (24)
Space-Efficient Data Structures, Streams, and Algorithms (2013) (24)
The Frequent Items Problem in Online Streaming Under Various Performance Measures (2013) (23)
Online Algorithms with Advice (2017) (22)
Four Measures of Nonlinearity (2013) (22)
Concrete Multiplicative Complexity of Symmetric Functions (2006) (22)
On The Multiplicative Complexity of Boolean Functions over the Basis $(\wedge, \oplus, 1)$ (1998) (22)
Fair versus Unrestricted Bin Packing (2002) (21)
On the absolute approximation ratio for First Fit and related results (2012) (21)
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem (2006) (21)
On the list update problem with advice (2013) (20)
Extending the accommodating function (2002) (20)
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem (2003) (19)
The Accommodating Function - A Generalization of the Competitive Ratio (1999) (18)
An Arithmetic Model of Computation Equivalent to Threshold Circuits (1992) (18)
A theoretical comparison of LRU and LRU-K (2010) (16)
The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences (2001) (16)
Tight results for Next Fit and Worst Fit with resource augmentation (2010) (15)
Scheduling Jobs on Grid Processors (2006) (15)
Small low-depth circuits for cryptographic applications (2018) (15)
A comparison of performance measures via online search (2011) (14)
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis (2012) (13)
Fair versus Unrestricted Bin Packing (2000) (13)
New logic minimization techniques with applications to cryptology (2009) (13)
Online-bounded analysis (2016) (13)
Online Dominating Set (2016) (13)
The Exact Multiplicative Complexity of the Hamming Weight Function (2005) (12)
Cancellation-free circuits in unbounded and bounded depth (2013) (11)
Seat Reservation Allowing Seat Changes (2001) (10)
On the communication complexity of zero-knowledge proofs (1993) (10)
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem (1997) (10)
The Advice Complexity of a Class of Hard Online Problems (2014) (10)
Short Discrete Proofs (1996) (10)
A new variable-sized bin packing problem (2012) (9)
Weighted Online Problems with Advice (2016) (9)
Chromatic Priority Queues (1994) (8)
On various nonlinearity measures for boolean functions (2016) (8)
Bounds for Scheduling Jobs on Grid Processors (2013) (8)
On the Concrete Complexity of Zero-Knowledge Proofs (1989) (7)
Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators (2012) (7)
Relative interval analysis of paging algorithms on access graphs (2013) (6)
The Relationship between Multiplicative Complexity and Nonlinearity (2014) (5)
Constructive Relationships Between Algebraic Thickness and Normality (2014) (5)
Relaxing the Irrevocability Requirement for Online Graph Algorithms (2017) (5)
Separating the Accommodating Ratio from the Competitive Ratio (1999) (5)
Online Unit Profit Knapsack with Untrusted Predictions (2022) (4)
Scrutinizing the Tower Field Implementation of the 픽28 Inverter - with Applications to AES, Camellia, and SM4 (2019) (4)
Inferring a Sequence Produced by a Linear Congruence (1982) (4)
Relative Worst-Order Analysis: A Survey (2018) (4)
Batch Coloring of Graphs (2016) (3)
Multiplicative complexity of vector valued Boolean functions (2014) (3)
A Comparison of Performance Measures for Online Algorithms (2014) (3)
The Relative Worst Order Ratio for On-Line Bin Packing Algorithms ∗ (2003) (2)
Bounds on Certain Multiplications of Affine Combinations (1992) (2)
Advice Complexity of Priority Algorithms (2018) (2)
An Improved Lower Bound on First-Fit''s Accommodating Ratio for the Unit Price Bin Packing Problem (1999) (2)
Randomized distributed online algorithms against adaptive offline adversaries (2020) (2)
Faster Parallel Computation of Edit Distances (1994) (2)
A discrete logarithm blob for noninteractive XOR gates (1990) (2)
Relative Worst-order Analysis (2021) (1)
C C ] 2 1 Se p 20 15 Constructive Relationships Between Algebraic Thickness and Normality ⋆ (1)
Adding isolated vertices makes some greedy online algorithms optimal (2015) (1)
An algebraic model for bounding threshold circuit depth (1988) (1)
Online Bin Packing with Advice (2014) (1)
Online-bounded analysis (2017) (1)
Online Dominating Set (2018) (1)
Eecient Non-interactive Zero-knowledge Proofs of Circuit Satissability (1994) (1)
Advice Complexity of Priority Algorithms (2019) (1)
Online Minimum Spanning Trees with Weight Predictions (2023) (1)
Advice Complexity of Adaptive Priority Algorithms (2019) (1)
Fe b 20 18 Multiplicative Complexity of Vector Valued Boolean Functions (2018) (0)
Efficient Non-Interactive Zero-Knowledge Proofs of Circuit Satisfiability (1994) (0)
Fair versus Unrestricted Bin Packing 1 (0)
D S ] 17 D ec 2 01 2 Online Bin Packing with Advice ⋆ (2012) (0)
Tight Bounds for an Online Bin Packing Problem (2014) (0)
University of Southern Denmark Weighted online problems with advice (2018) (0)
Online Bin Covering with Advice (2019) (0)
Onilne Dominating Set (2016) (0)
Adding Isolated Vertices Makes Some Online Algorithms Optimal (2015) (0)
Batch Coloring of Graphs (2017) (0)
Quotable Signatures for Authenticating Shared Quotes (2022) (0)
Paging with Succinct Predictions (2022) (0)
A new variable-sized bin packing problem (2010) (0)
Tight Bounds for Restricted Grid Scheduling (2014) (0)
Online Interval Scheduling with Predictions (2023) (0)
Universitet Weighted online problems with advice (2018) (0)
The Lazy Bin Packing Problem (2004) (0)
The Advice Complexity of a Class of Hard Online Problems (2016) (0)
4 A ug 2 01 7 Weighted Online Problems with Advice ⋆ (2018) (0)
Study of the mathematical routines in the IBM System/360 FORTRAN IV and FORTRAN IV (MOD II) libraries (1978) (0)
2 Fe b 20 16 Online Bounded Analysis (2018) (0)
Trees , w i t h an Appl i ca t ion to Prior i ty Queues (0)
Fair versus Unrestri ted Bin Pa king (2000) (0)
The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing (2018) (0)
Weighted Online Problems with Advice (2017) (0)

This paper list is powered by the following services:

Other Resources About Joan Boyar

What Schools Are Affiliated With Joan Boyar?

Joan Boyar is affiliated with the following schools:

Joan Boyar's Academic­Influence.com Rankings