The following pages link to Amos Fiat (Q536067):
Displaying 50 items.
- (Q203747) (redirect page) (← links)
- An improved algorithm for online coloring of intervals with bandwidth (Q860808) (← links)
- Associative search in peer to peer networks: Harnessing latent semantics (Q878694) (← links)
- Competitive algorithms for distributed data management. (Q960500) (← links)
- New algorithms for an ancient scheduling problem. (Q960514) (← links)
- Polymorphic arrays: A novel VLSI layout for systolic computers (Q1088396) (← links)
- Zero-knowledge proofs of identity (Q1112785) (← links)
- An implicit data structure for searching a multikey table in logarithmic time (Q1186547) (← links)
- On-line scheduling on a single machine: Minimizing the total completion time (Q1306569) (← links)
- A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle (Q1329148) (← links)
- Competitive \(k\)-server algorithms (Q1329151) (← links)
- Competitive algorithms for the weighted server problem (Q1331957) (← links)
- Batch RSA (Q1363068) (← links)
- Competitive distributed file allocation. (Q1427858) (← links)
- Beyond myopic best response (in Cournot competition) (Q1735732) (← links)
- On capital investment. (Q1818269) (← links)
- Correlation clustering in general weighted graphs (Q2503347) (← links)
- Minimal indices for predecessor search (Q2514143) (← links)
- Provable unlinkability against traffic analysis with low message overhead (Q2516530) (← links)
- (Q2768346) (← links)
- History-Independent Distributed Multi-agent Learning (Q2819449) (← links)
- Minimal Indices for Successor Search (Q2849917) (← links)
- Envy-Free Makespan Approximation (Q2884571) (← links)
- (Q2921711) (← links)
- (Q2934596) (← links)
- Approaching utopia (Q2986872) (← links)
- (Q3002776) (← links)
- VC-Dimension and Shortest Path Algorithms (Q3012843) (← links)
- (Q3128890) (← links)
- (Q3128932) (← links)
- When the Players Are Not Expectation Maximizers (Q3162502) (← links)
- Highway Dimension and Provably Efficient Shortest Path Algorithms (Q3177817) (← links)
- Better algorithms for unfair metrical task systems and applications (Q3192047) (← links)
- Generalized 'write-once' memories (Q3332264) (← links)
- (Q3360795) (← links)
- Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing (Q3434990) (← links)
- The Temp Secretary Problem (Q3452826) (← links)
- Competitive generalized auctions (Q3579178) (← links)
- (Q3579445) (← links)
- Caching Content under Digital Rights Management (Q3602839) (← links)
- Bi-criteria linear-time approximations for generalized k-mean/median/center (Q3602852) (← links)
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (Q3613794) (← links)
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems (Q3777940) (← links)
- How to find a battleship (Q3827792) (← links)
- Implicit $O(1)$ Probe Search (Q4037679) (← links)
- Competitive Algorithms for Layered Graph Traversal (Q4210157) (← links)
- Distributed Paging for General Networks (Q4216146) (← links)
- (Q4228507) (← links)
- (Q4228508) (← links)
- (Q4230356) (← links)
