Searching for authors named "Joan Boyar" – sorted by Relevance.
-
On the Concrete Complexity of Zero-Knowledge Proofs
- On the concrete complexity of zero-knowledge proofs Joan Boyar Computer Science Department
- Cited by 13 (4 self) – Add To MetaCart
-
Short Discreet Proofs
- Short Discreet Proofs Joan Boyar 1 Ren'e Peralta ?2 1 Department of Mathematics and Computer
- Cited by 8 (3 self) – Add To MetaCart
-
Efficient Non-Interactive Zero-Knowledge Proofs of Circuit Satisfiability
- Efficient Non-Interactive Zero-Knowledge Proofs of Circuit Satisfiability Joan Boyar Department
- Cited by 2 (1 self) – Add To MetaCart
-
The relative worst order ratio applied to seat reservation
- The Relative Worst Order Ratio Applied to Seat Reservation Joan Boyar ⋆ and Paul Medvedev
- Cited by 3 (1 self) – Add To MetaCart
-
On The Multiplicative Complexity of Boolean Functions over the Basis...
- On The Multiplicative Complexity of Boolean Functions over the Basis (; \Phi; 1) Joan Boyar
- Add To MetaCart
-
On The Multiplicative Complexity of Boolean Functions over the Basis
- On The Multiplicative Complexity of Boolean Functions over the Basis (; \Phi; 1) Joan Boyar
- Add To MetaCart
-
Short Non-interactive Cryptographic Proofs
- Short Non-interactive Cryptographic Proofs Joan Boyar ?1 Ivan Damgard 2 Rene Peralta ??3 1
- Cited by 8 (2 self) – Add To MetaCart
-
On The Multiplicative Complexity of Boolean Functions over the Basis ...
- SI-Blum On The Multiplicative Complexity of Boolean Functions over the Basis (; \Phi; 1) Joan Boyar
- Cited by 5 (3 self) – Add To MetaCart
-
The relative worst order ratio for on-line bin packing algorithms
- The Relative Worst Order Ratio for On-Line Bin Packing Algorithms ∗ Joan Boyar † Lene M. Favrholdt
- Cited by 2 (2 self) – Add To MetaCart
-
The relative worst order ratio for on-line algorithms
- The Relative Worst Order Ratio for On-Line Algorithms JOAN BOYAR and LENE M. FAVRHOLDT We define a
- Cited by 9 (6 self) – Add To MetaCart

