The following pages link to Joan Boyar (Q699763):
Displaying 50 items.
- (Q261385) (redirect page) (← links)
- Online bin packing with advice (Q261387) (← links)
- On various nonlinearity measures for Boolean functions (Q276554) (← links)
- On the absolute approximation ratio for first fit and related results (Q442205) (← links)
- A comparison of performance measures for online algorithms (Q494791) (← links)
- On the list update problem with advice (Q515679) (← links)
- A theoretical comparison of LRU and LRU-K (Q611043) (← links)
- Fair versus unrestricted bin packing (Q699764) (← links)
- Weighted online problems with advice (Q726104) (← links)
- Randomized distributed online algorithms against adaptive offline adversaries (Q783703) (← links)
- The relative worst-order ratio applied to paging (Q881599) (← links)
- A discrete logarithm implementation of perfect zero-knowledge blobs (Q913490) (← links)
- Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← links)
- Scheduling jobs on grid processors (Q973018) (← links)
- Tight results for next fit and worst fit with resource augmentation (Q974751) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Inferring sequences produced by a linear congruential generator missing low-order bits (Q1121239) (← links)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- An arithmetic model of computation equivalent to threshold circuits (Q1186610) (← links)
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- Bounds on certain multiplications of affine combinations (Q1331901) (← links)
- Efficient rebalancing of chromatic search trees (Q1342864) (← links)
- Amortization results for chromatic search trees, with an application to priority queues (Q1384535) (← links)
- Short non-interactive cryptographic proofs (Q1590362) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Adding isolated vertices makes some greedy online algorithms optimal (Q1647831) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- Online dominating set (Q1741855) (← links)
- Small low-depth circuits for cryptographic applications (Q1755189) (← links)
- Batch coloring of graphs (Q1755745) (← links)
- Extending the accommodating function (Q1879376) (← links)
- The seat reservation problem (Q1961043) (← links)
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). (Q1978699) (← links)
- Cancellation-free circuits in unbounded and bounded depth (Q2348031) (← links)
- Logic minimization techniques with applications to cryptology (Q2377070) (← links)
- A new variable-sized bin packing problem (Q2434283) (← links)
- A comparison of performance measures via online search (Q2445866) (← links)
- Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem (Q2464382) (← links)
- The maximum resource bin packing problem (Q2508970) (← links)
- Relative interval analysis of paging algorithms on access graphs (Q2513607) (← links)
- (Q2721979) (← links)
- (Q2766831) (← links)
- The accommodating function: A generalization of the competitive ratio (Q2784450) (← links)
- Weighted Online Problems with Advice (Q2819501) (← links)
- Relative Interval Analysis of Paging Algorithms on Access Graphs (Q2842157) (← links)
- The Frequent Items Problem in Online Streaming under Various Performance Measures (Q2842773) (← links)
- Cancellation-Free Circuits in Unbounded and Bounded Depth (Q2842782) (← links)
- Bounds for Scheduling Jobs on Grid Processors (Q2848963) (← links)
- Short Discreet Proofs (Q2876893) (← links)
