Ittai Abraham

According to our database1, Ittai Abraham authored at least 131 papers between 2003 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Distributed Protocols for Leader Election: A Game-Theoretic Perspective.
ACM Trans. Economics and Comput., 2019

Using Petal-Decompositions to Build a Low Stretch Spanning Tree.
SIAM J. Comput., 2019

Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs.
SIAM J. Comput., 2019

Bootstrapping Consensus Without Trusted Setup: Fully Asynchronous Distributed Key Generation.
IACR Cryptology ePrint Archive, 2019

Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness.
IACR Cryptology ePrint Archive, 2019

HotStuff: BFT Consensus with Linearity and Responsiveness.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Asymptotically Optimal Validated Asynchronous Byzantine Agreement.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Implementing Mediators with Asynchronous Cheap Talk.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Communication Complexity of Byzantine Agreement, Revisited.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

SBFT: A Scalable and Decentralized Trust Infrastructure.
Proceedings of the 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2019

2018
Online detection of effectively callback free objects with applications to smart contracts.
PACMPL, 2018

Distributed SSH Key Management with Proactive RSA Threshold Signatures.
IACR Cryptology ePrint Archive, 2018

Dfinity Consensus, Explored.
IACR Cryptology ePrint Archive, 2018

Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience.
IACR Cryptology ePrint Archive, 2018

Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication.
CoRR, 2018

Implementing Mediators with Asynchronous Cheap Talk.
CoRR, 2018

SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains.
CoRR, 2018

Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil.
CoRR, 2018

Revisiting Fast Practical Byzantine Fault Tolerance: Thelma, Velma, and Zelma.
CoRR, 2018

Online Detection of Effectively Callback Free Objects with Applications to Smart Contracts.
CoRR, 2018

Metric embedding via shortest path decompositions.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Ramsey Spanning Trees and their Applications.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

mLSM: Making Authenticated Storage Faster in Ethereum.
Proceedings of the 10th USENIX Workshop on Hot Topics in Storage and File Systems, 2018

Distributed SSH Key Management with Proactive RSA Threshold Signatures.
Proceedings of the Applied Cryptography and Network Security, 2018

2017
Consistent Clustered Applications with Corfu.
Operating Systems Review, 2017

Practical Synchronous Byzantine Consensus.
IACR Cryptology ePrint Archive, 2017

Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus.
IACR Cryptology ePrint Archive, 2017

The Blockchain Consensus Layer and BFT.
Bulletin of the EATCS, 2017

Revisiting Fast Practical Byzantine Fault Tolerance.
CoRR, 2017

Metric Embedding via Shortest Path Decompositions.
CoRR, 2017

Ramsey Spanning Trees and their Applications.
CoRR, 2017

Practical Synchronous Byzantine Consensus.
CoRR, 2017

Brief Announcement: Practical Synchronous Byzantine Consensus.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

PebblesDB: Building Key-Value Stores using Fragmented Log-Structured Merge Trees.
Proceedings of the 26th Symposium on Operating Systems Principles, 2017

Fully dynamic all-pairs shortest paths with worst-case update-time revisited.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Asymptotically Tight Bounds for Composing ORAM with PIR.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

vCorfu: A Cloud-Scale Object Store on a Shared Log.
Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation, 2017

2016
Spanning Trees with Low Average Stretch.
Encyclopedia of Algorithms, 2016

Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension.
ACM Trans. Algorithms, 2016

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

An Oblivious RAM with Sub-logarithmic Bandwidth Blowup.
IACR Cryptology ePrint Archive, 2016

Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus.
CoRR, 2016

On Fully Dynamic Graph Sparsifiers.
CoRR, 2016

Fully dynamic all-pairs shortest paths with worst-case update-time revisited.
CoRR, 2016

Replex: A Scalable, Highly Available Multi-Index Data Store.
Proceedings of the 2016 USENIX Annual Technical Conference, 2016

On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

How Many Workers to Ask?: Adaptive Exploration for Collecting High Quality Labels.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Virtualized Congestion Control.
Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

Silver: A Scalable, Distributed, Multi-versioning, Always Growing (Ag) File System.
Proceedings of the 8th USENIX Workshop on Hot Topics in Storage and File Systems, 2016

On Fully Dynamic Graph Sparsifiers.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Low-Distortion Inference of Latent Similarities from a Multiplex Social Network.
SIAM J. Comput., 2015

Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion.
SIAM J. Comput., 2015

Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity.
CoRR, 2015

Local Embeddings of Metric Spaces.
Algorithmica, 2015

Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Approximate Nearest Neighbor Search in Metrics of Planar Graphs.
Proceedings of the Approximation, 2015

2014
Volume in General Metric Spaces.
Discrete & Computational Geometry, 2014

Using Worker Quality Scores to Improve Stopping Rules.
CoRR, 2014

Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs.
Proceedings of the Symposium on Theory of Computing, 2014

Distance Labels with Optimal Local Stretch.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Using Worker Quality Scores to Improve Stopping Rules.
Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, 2014

Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier.
Proceedings of the Approximation, 2014

2013
Alternative routes in road networks.
ACM Journal of Experimental Algorithmics, 2013

Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem
CoRR, 2013

Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs.
CoRR, 2013

Dynamic Decremental Approximate Distance Oracles with (1+ε, 2) stretch.
CoRR, 2013

Distributed Protocols for Leader Election: A Game-Theoretic Perspective.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Low-distortion Inference of Latent Similarities from a Multiplex Social Network.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Peaches, lemons, and cookies: designing auction markets with dispersed information.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem.
Proceedings of the COLT 2013, 2013

2012
Combinatorial Auctions with Restricted Complements
CoRR, 2012

Low-distortion Inference of Latent Similarities from a Multiplex Social Network
CoRR, 2012

Using petal-decompositions to build a low stretch spanning tree.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Combinatorial auctions with restricted complements.
Proceedings of the 13th 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

Hierarchical Hub Labelings for Shortest Paths.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Distributed computing meets game theory: combining insights from two fields.
SIGACT News, 2011

A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

On Approximate Distance Labels and Routing Schemes with Affine Stretch.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

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

2010
Strong-Diameter Decompositions of Minor Free Graphs.
Theory Comput. Syst., 2010

Alternative Routes in Road Networks.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Fast Asynchronous Consensus with Optimal Resilience.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

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

Forbidden-set distance labels for graphs of bounded doubling dimension.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Volume in General Metric Spaces.
Proceedings of the Algorithms, 2010

2009
Compact Multicast Routing.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

On low dimensional local embeddings.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
Compact name-independent routing with minimum stretch.
ACM Trans. Algorithms, 2008

Nearly Tight Low Stretch Spanning Trees
CoRR, 2008

An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience
CoRR, 2008

Lower Bounds on Implementing Robust and Resilient Mediators.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Embedding metric spaces in their intrinsic dimension.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Nearly Tight Low Stretch Spanning Trees.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Wait-free regular storage from Byzantine components.
Inf. Process. Lett., 2007

Lower Bounds on Implementing Robust and Resilient Mediators
CoRR, 2007

Local embeddings of metric spaces.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Strong-diameter decompositions of minor free graphs.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Reconstructing approximate tree metrics.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Byzantine disk paxos: optimal resilience with byzantine shared memory.
Distributed Computing, 2006

Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion
CoRR, 2006

Asynchronous resource discovery.
Computer Networks, 2006

Advances in metric embedding theory.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

On space-stretch trade-offs: upper bounds.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

On space-stretch trade-offs: lower bounds.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Object location using path separators.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Routing in Networks with Low Doubling Dimension.
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

2005
Probabilistic quorums for dynamic systems.
Distributed Computing, 2005

Papillon: Greedy Routing in Rings
CoRR, 2005

Papillon: Greedy Routing in Rings.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Compact Routing for Graphs Excluding a Fixed Minor.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Name independent routing for growth bounded networks.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Skip B-Trees.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Practical Locality-Awareness for Large Scale Information Sharing.
Proceedings of the Peer-to-Peer Systems IV, 4th International Workshop, 2005

Metric Embeddings with Relaxed Guarantees.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Robust Locality-Aware Lookup Networks.
Proceedings of the Self-star Properties in Complex Information Systems, 2005

2004
Routing with Improved Communication-Space Trade-Off.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Compact name-independent routing with minimum stretch.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

LAND: stretch (1 + epsilon) locality-aware networks for DHTs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Compact routing on euclidian metrics.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Byzantine disk paxos: optimal resilience with byzantine shared memory.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Optimal Resilience Asynchronous Approximate Agreement.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

LLS: a locality aware location service for mobile ad hoc networks.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2004

2003
Probabilistic Quorums for Dynamic Systems.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Asynchronous resource discovery.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

A Generic Scheme for Building Overlay Networks in Adversarial Scenarios.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003


  Loading...