Amos Fiat

According to our database1, Amos Fiat
  • authored at least 157 papers between 1984 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Makespan Minimization via Posted Prices.
CoRR, 2017

(1 + ∊)-Approximate f-Sensitive Distance Oracles.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Makespan Minimization via Posted Prices.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016
Highway Dimension and Provably Efficient Shortest Path Algorithms.
J. ACM, 2016

Packing Small Vectors.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

The FedEx Problem.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

On Voting and Facility Location.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Lottery Pricing Equilibria.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

The Invisible Hand of Dynamic Market Pricing.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

History-Independent Distributed Multi-agent Learning.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Carpooling in Social Networks.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Variations on the Hotelling-Downs Model.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Provable Unlinkability Against Traffic Analysis with Low Message Overhead.
J. Cryptology, 2015

Minimal indices for predecessor search.
Inf. Comput., 2015

The Temp Secretary Problem.
CoRR, 2015

On Voting and Facility Location.
CoRR, 2015

Pricing Online Decisions: Beyond Auctions.
CoRR, 2015

The Invisible Hand of Dynamic Market Pricing.
CoRR, 2015

Pricing Online Decisions: Beyond Auctions.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

The Temp Secretary Problem.
Proceedings of the Algorithms - ESA 2015, 2015

2013
A Labeling Approach to Incremental Cycle Detection.
CoRR, 2013

Minimal Indices for Successor Search.
CoRR, 2013

Minimal Indices for Successor Search - (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Approaching utopia: strong truthfulness and externality-resistant mechanisms.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
Envy-Free Makespan Approximation.
SIAM J. Comput., 2012

Approaching Utopia: Strong Truthfulness and Externality-Resistant Mechanisms
CoRR, 2012

Tight Lower Bounds on Envy-Free Makespan Approximation
CoRR, 2012

Why study the price of anarchy?: technical perspective.
Commun. ACM, 2012

Tight Lower Bounds on Envy-Free Makespan Approximation.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Beyond myopic best response (in Cournot competition).
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Revenue maximizing envy-free multi-unit auctions with budgets.
Proceedings of the ACM Conference on Electronic Commerce, 2012

HLDB: location-based services in databases.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

2011
Derandomization of auctions.
Games and Economic Behavior, 2011

Special Issue: European Symposium on Algorithms, Design and Analysis.
Algorithmica, 2011

Truth, Envy, and Truthful Market Clearing Bundle Pricing.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Single valued combinatorial auctions with budgets.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

VC-Dimension and Shortest Path Algorithms.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
On the Interplay between Incentive Compatibility and Envy Freeness
CoRR, 2010

Truth and Envy in Capacitated Allocation Games
CoRR, 2010

Combinatorial Auctions with Budgets
CoRR, 2010

Highway Dimension, Shortest Paths, and Provably Efficient Algorithms.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Envy-free makespan approximation: extended abstract.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

When the Players Are Not Expectation Maximizers.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009
Envy, Multi Envy, and Revenue Maximization
CoRR, 2009

Envy-Free Makespan Approximation
CoRR, 2009

Envy, Multi Envy, and Revenue Maximization.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Private coresets.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
Caching Content under Digital Rights Management.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Competitive queue management for latency sensitive packets.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Subjective vs.Objective Reality - The Risk of Running Late.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007
Censorship Resistant Peer-to-Peer Networks.
Theory of Computing, 2007

Online Conflict-Free Coloring for Intervals.
SIAM J. Comput., 2007

Associative search in peer to peer networks: Harnessing latent semantics.
Computer Networks, 2007

Efficient contention resolution protocols for selfish agents.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Strong Price of Anarchy for Machine Load Balancing.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Strong Price of Anarchy for Machine Load Balancing.
Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

Bi-criteria linear-time approximations for generalized k-mean/median/center.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
Correlation clustering in general weighted graphs.
Theor. Comput. Sci., 2006

An improved algorithm for online coloring of intervals with bandwidth.
Theor. Comput. Sci., 2006

Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing.
SIAM J. Comput., 2006

Truly Online Paging with Locality of Reference
CoRR, 2006

On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Coresets forWeighted Facilities and Their Applications.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Digital Signatures for Modifiable Collections.
Proceedings of the The First International Conference on Availability, 2006

2005
Derandomization of auctions.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Online conflict-free coloring for intervals.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Making Chord Robust to Byzantine Attacks.
Proceedings of the Algorithms, 2005

Secure Exchange of Modifiable Data and Queries.
Proceedings of the 21èmes Journées Bases de Données Avancées, 2005

2004
Foreword.
Theor. Comput. Sci., 2004

Optimal oblivious routing in polynomial time.
J. Comput. Syst. Sci., 2004

Better algorithms for unfair metrical task systems and applications
CoRR, 2004

Provable Unlinkability against Traffic Analysis.
Proceedings of the Financial Cryptography, 2004

Decision Trees: More Theoretical Justification for Practical Algorithms.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003
Better Algorithms for Unfair Metrical Task Systems and Applications.
SIAM J. Comput., 2003

Making data structures confluently persistent.
J. Algorithms, 2003

Competitive distributed file allocation.
Inf. Comput., 2003

A case for associative peer to peer overlays.
Computer Communication Review, 2003

Optimal oblivious routing in polynomial time.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Efficient sequences of trials.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Associative Search in Peer to Peer Networks: Harnessing Latent Semantics.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

AIM: Another Itemset Miner.
Proceedings of the FIMI '03, 2003

Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs.
Proceedings of the Algorithms, 2003

2002
Competitive Paging Algorithms
CoRR, 2002

Competitive generalized auctions.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Censorship resistant peer-to-peer content addressable networks.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Dynamically Fault-Tolerant Content Addressable Networks.
Proceedings of the Peer-to-Peer Systems, First International Workshop, 2002

Online Companion Caching.
Proceedings of the Algorithms, 2002

2001
Dynamic Traitor Tracing.
J. Cryptology, 2001

Optimal Search and One-Way Trading Online Algorithms.
Algorithmica, 2001

On-Line Competitive Algorithms for Call Admission in Optical Networks.
Algorithmica, 2001

Spectral analysis of data.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Making data structures confluently persistent.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Some Recent Results on Data Mining and Search.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Web Search via Hub Synthesis.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
Tracing traitors.
IEEE Trans. Information Theory, 2000

Better algorithms for unfair metrical task systems and applications.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Rigorous Time/Space Trade-offs for Inverting Functions.
SIAM J. Comput., 1999

On Capital Investment.
Algorithmica, 1999

On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time.
Acta Inf., 1999

Dynamic Traitor Training.
Proceedings of the Advances in Cryptology, 1999

1998
Competitive Algorithms for Layered Graph Traversal.
SIAM J. Comput., 1998

Distributed Paging for General Networks.
J. Algorithms, 1998

1997
Batch RSA.
J. Cryptology, 1997

On-line routing of virtual circuits with applications to load balancing and machine scheduling.
J. ACM, 1997

Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard?
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Truly Online Paging with Locality of Reference.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Randomized Robot Navigation Algorithms.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Distributed Paging for General Networks.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Packet Routing via Min-Cost Circuit Routing.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

On Capital Investment.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

On-line Competive Algorithms for Call Admission in Optical Networks.
Proceedings of the Algorithms, 1996

Competitive Odds and Ends.
Proceedings of the Online Algorithms, 1996

Competitive Analysis of Algorithms.
Proceedings of the Online Algorithms, 1996

1995
Competitive Algorithms for Distributed Data Management.
J. Comput. Syst. Sci., 1995

New Algorithms for an Ancient Scheduling Problem.
J. Comput. Syst. Sci., 1995

Randomized and multipointer paging with locality of reference.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Competitive Algorithms for the Weighted Server Problem.
Theor. Comput. Sci., 1994

Competitive k-Server Algorithms.
J. Comput. Syst. Sci., 1994

Online Navigation in a Room.
J. Algorithms, 1994

A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle.
Algorithmica, 1994

Competitive Non-Preemptive Call Control.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Matching Nuts and Bolts.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Tracing Traitors.
Proceedings of the Advances in Cryptology, 1994

1993
Implicit O(1) Probe Search.
SIAM J. Comput., 1993

Competitive distributed file allocation.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

On-line load balancing with applications to machine scheduling and virtual circuit routing.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Competitive Algorithms for the Weighted Server Problem.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

Heat & Dump: Competitive Distributed Paging
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Broadcast Encryption.
Proceedings of the Advances in Cryptology, 1993

1992
Nonoblivious Hashing.
J. ACM, 1992

Competitive Algorithms for Distributed Data Management (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

New Algorithms for an Ancient Scheduling Problem
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

On-Line Navigation in a Room.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Competitive Analysis of Financial Games
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time.
J. Comput. Syst. Sci., 1991

Competitive Paging Algorithms.
J. Algorithms, 1991

Rigorous Time/Space Tradeoffs for Inverting Functions
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Competitive Algorithms for Layered Graph Traversal
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Competitive k-Server Algorithms (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
How to find a battleship.
Networks, 1989

Implicit O(1) Probe Search
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Planning and Learning in Permutation Groups
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Batch RSA.
Proceedings of the Advances in Cryptology, 1989

1988
Zero-Knowledge Proofs of Identity.
J. Cryptology, 1988

Storing and Searching a Multikey Table (Extended Abstract)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Non-Oblivious Hashing (Extended Abstract)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Untraceable Electronic Cash.
Proceedings of the Advances in Cryptology, 1988

1987
Zero Knowledge Proofs of Identity
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986
Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers.
J. Comput. Syst. Sci., 1986

How to Prove Yourself: Practical Solutions to Identification and Signature Problems.
Proceedings of the Advances in Cryptology, 1986

1985
Polymorphic Arrays: An Architecture for a Programmable Systolic Machine.
Proceedings of the International Conference on Parallel Processing, 1985

1984
Generalized 'write-once' memories.
IEEE Trans. Information Theory, 1984

Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984


  Loading...