Yehuda Afek

According to our database1, Yehuda Afek authored at least 153 papers between 1984 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Selecting a Leader in a Network of Finite State Machines.
CoRR, 2018

Detecting heavy flows in the SDN match and action model.
Computer Networks, 2018

A Wealth of Sub-Consensus Deterministic Objects.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

The Role of A-priori Information in Networks of Rational Agents.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Selecting a Leader in a Network of Finite State Machines.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

2018 Edsger W. Dijkstra Prize in Distributed Computing.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Cheating by Duplication: Equilibrium Requires Global Knowledge.
CoRR, 2017

The Life in 1-Consensus.
CoRR, 2017

Detecting Heavy Flows in the SDN Match and Action Model.
CoRR, 2017

Brief Announcement: The Synergy of Finite State Machines.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Brief Announcement: Object Oriented Consensus.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Network anti-spoofing with SDN data plane.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Mitigating DNS random subdomain DDoS attacks by distinct heavy hitters sketches.
Proceedings of the fifth ACM/IEEE Workshop on Hot Topics in Web Systems and Technologies, 2017

2016
Making DPI Engines Resilient to Algorithmic Complexity Attacks.
IEEE/ACM Trans. Netw., 2016

Efficient Distinct Heavy Hitters for DNS DDoS Attack Detection.
CoRR, 2016

Deterministic Objects: Life Beyond Consensus.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015
A simple characterization of asynchronous computations.
Theor. Comput. Sci., 2015

Optimal and Resilient Pheromone Utilization in Ant Foraging.
CoRR, 2015

Faster task allocation by idle ants.
CoRR, 2015

Sampling and Large Flow Detection in SDN.
Computer Communication Review, 2015

Amalgamated Lock-Elision.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Sampling and Large Flow Detection in SDN.
Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, 2015

A Dynamic Convolutional Layer for short rangeweather prediction.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2015

Temporally Bounding TSO for Fence-Free Asymmetric Synchronization.
Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015

ORange: Multi Field OpenFlow based Range Classifier.
Proceedings of the Eleventh ACM/IEEE Symposium on Architectures for networking and communications systems, 2015

2014
Musical Chairs.
SIAM J. Discrete Math., 2014

The CB tree: a practical concurrent self-adjusting search tree.
Distributed Computing, 2014

Recursive design of hardware priority queues.
Computer Networks, 2014

Ranges and cross-entrance consistency with OpenFlow.
Proceedings of the third workshop on Hot topics in software defined networking, 2014

Software-improved hardware lock elision.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Distributed computing building blocks for rational agents.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Cross-Entrance Consistent Range Classifier with OpenFlow.
Proceedings of the Open Networking Summit 2014 - Research Track, 2014

Fence-free work stealing on bounded TSO processors.
Proceedings of the Architectural Support for Programming Languages and Operating Systems, 2014

2013
Fast and scalable rendezvousing.
Distributed Computing, 2013

Beeping a maximal independent set.
Distributed Computing, 2013

Recursive design of hardware priority queues.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Fast concurrent queues for x86 processors.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

Programming with hardware lock elision.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

Asynchrony from Synchrony.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

Automated signature extraction for high volume attacks.
Proceedings of the Symposium on Architecture for Networking and Communications Systems, 2013

2012
Interrupting snapshots and the Java size method.
J. Parallel Distrib. Comput., 2012

Renaming and the weakest family of failure detectors.
Distributed Computing, 2012

Musical chairs
CoRR, 2012

Beeping a Maximal Independent Set
CoRR, 2012

Asynchrony from Synchrony
CoRR, 2012

Space efficient deep packet inspection of compressed web traffic.
Computer Communications, 2012

Pessimistic Software Lock-Elision.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

CBTree: A Practical Concurrent Self-Adjusting Search Tree.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

MCA2: multi-core architecture for mitigating complexity attacks.
Proceedings of the Symposium on Architecture for Networking and Communications Systems, 2012

2011
MIS on the fly
CoRR, 2011

Oblivious Collaboration
CoRR, 2011

Fast and Scalable Rendezvousing.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Oblivious Collaboration.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Beeping a Maximal Independent Set.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Coping with context switches in lock-based software transactional memory.
Proceedings of of SYSTOR 2011: The 4th Annual Haifa Experimental Systems Conference, Haifa, Israel, May 30, 2011

From bounded to unbounded concurrency objects and back.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Towards Consistency Oblivious Programming.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Efficient Processing of Multi-connection Compressed Web Traffic.
Proceedings of the NETWORKING 2011, 2011

Cache index-aware memory allocation.
Proceedings of the 10th International Symposium on Memory Management, 2011

2010
The Velox Transactional Memory Stack.
IEEE Micro, 2010

The k-simultaneous consensus problem.
Distributed Computing, 2010

Brief Announcement: Quasi-Linearizability: Relaxed Consistency for Improved Concurrency.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Brief announcement: view transactions: transactional model with relaxed consistency checks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Quasi-Linearizability: Relaxed Consistency for Improved Concurrency.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Efficient Lock Free Privatization.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Lowering STM Overhead with Static Analysis.
Proceedings of the Languages and Compilers for Parallel Computing, 2010

Scalable Producer-Consumer Pools Based on Elimination-Diffraction Trees.
Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009
Interrupting Snapshots and the JavaTM^{\mbox{\tiny TM}} Size() Method.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

2008
Failure detectors in loosely named systems.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Group Renaming.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

2007
Efficient adaptive collect algorithms.
Distributed Computing, 2007

Common2 extended to stacks and unbounded concurrency.
Distributed Computing, 2007

2006
Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Common2 extended to stacks and unbounded concurrency.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005
Space and Step Complexity Efficient Adaptive Collect.
Proceedings of the Distributed Computing, 19th International Conference, 2005

2004
Improved BGP convergence via ghost flushing.
IEEE Journal on Selected Areas in Communications, 2004

2003
Improved BGP Convergence via Ghost Flushing.
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

2002
Local Stabilizer.
J. Parallel Distrib. Comput., 2002

Long lived adaptive splitter and applications.
Distributed Computing, 2002

Restoration by path concatenation: fast recovery of MPLS paths.
Distributed Computing, 2002

On the structure and application of BGP policy atoms.
Proceedings of the 2nd ACM SIGCOMM Internet Measurement Workshop, 2002

2001
Routing with a clue.
IEEE/ACM Trans. Netw., 2001

Restoration path concatenation: fast recovery of MPLS paths.
Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001

Restoration by path concatenation: fast recovery of MPLS paths.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000
Phantom: a simple and effective flow control scheme.
Computer Networks, 2000

Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Bounds on the shared memory requirements for long-lived adaptive objects (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Trainet: A New Label Switching Scheme.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999
The Instancy of Snapshots and Commuting Objects.
J. Algorithms, 1999

Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms.
J. Algorithms, 1999

The Power of Multiobjects.
Inf. Comput., 1999

Routing with a Clue.
SIGCOMM, 1999

Fast, Wait-Free (2k)-Renaming.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Long-Lived Renaming Made Adaptive.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

ong-lived Adaptive Collect with Applications.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998
Self-Stabilizing Unidirectional Network Algorithms by Power Supply.
Chicago J. Theor. Comput. Sci., 1998

1997
The Local Detection Paradigm and Its Application to Self-Stabilization.
Theor. Comput. Sci., 1997

Optimal Time-Space Tradeoff for Shared Memory Leader Election.
J. Algorithms, 1997

Slide-The Key to Polynomial End-to-End Communication.
J. Algorithms, 1997

The Bit Complexity of the Predecessor Problem.
Inf. Process. Lett., 1997

Self-Stabilizing Unidirectional Network Algorithms by Power-Supply (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Disentangling Multi-Object Operations (Extended Abstract).
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Local Stabilizer (Brief Announcement).
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Local Stabilizer.
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

Virtual-credit: Efficient end-to-end credit based flow control.
Proceedings of the Networks in Distributed Computing, 1997

1996
Local Management of a Global Resource in a Communication Network.
J. ACM, 1996

Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Phantom: A Simple and Effective Flow Control Scheme.
Proceedings of the ACM SIGCOMM 1996 Conference on Applications, 1996

The Power of Multi-objects (Extended Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

On the Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Brief Announcement).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Dynamic Bandwidth Allocation Policies.
Proceedings of the Proceedings IEEE INFOCOM '96, 1996

1995
Computing With Faulty Shared Objects.
J. ACM, 1995

On the Comnplexity of Global Computation in the Presence of Link Failures: The General Case.
Distributed Computing, 1995

Wait-free made fast (Extended Abstract).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
Elections in Anonymous Networks
Inf. Comput., September, 1994

A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem.
ACM Trans. Program. Lang. Syst., 1994

Distributed Algorithms for Unidirectional Networks.
SIAM J. Comput., 1994

Reliable Communication Over Unreliable Channels.
J. ACM, 1994

Consensus Power Makes (Some) Sense! (Extended Abstract).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Delimiting the Power of Bounded Size Synchronization Objects (Extended Abstract).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993
Lazy Caching.
ACM Trans. Program. Lang. Syst., 1993

Sparser: A Paradigm for Running Distributed Algorithms.
J. Algorithms, 1993

Atomic Snapshots of Shared Memory.
J. ACM, 1993

Self-Stabilization Over Unreliable Communication Media.
Distributed Computing, 1993

Benign Failure Models for Shared Memory (Preliminary Version).
Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

A Completeness Theorem for a Class of Synchronization Objects (Extended Abstract).
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

On the Complexity of Global Computation in the Presence of Link Failures: The General Case.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

Synchronization power depends on the register size (Preliminary Version)
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Sparser: A Paradigm for Running Distributed Algorithms.
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Wait-free Test-and-Set (Extended Abstract).
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract).
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

Computing with Faulty Shared Memory (Extended Abstract).
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991
Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks.
SIAM J. Comput., 1991

Bootstrap Network Resynchronization (Extended Abstract).
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

1990
The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks
Inf. Comput., January, 1990

Memory-Efficient Self Stabilizing Protocols for General Networks.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Atomic Snapshots of Shared Memory.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

1989
Simple and Efficient Election Algorithms for Anonymous Networks.
Proceedings of the Distributed Algorithms, 1989

Self-Stabilization of the Alternating-Bit Protocol.
Proceedings of the Eigthth Symposium on Reliable Distributed Systems, 1989

A Lazy Cache Algorithm.
SPAA, 1989

Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
End-to-End Communication in Unreliable Networks.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

The Power of Multimedia: Combining Point-to Point and Multi-Access Networks.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

1987
Local Fail-safe Network Reset Procedure.
Proceedings of the Distributed Algorithms, 1987

Detecting Global Termination Conditions in the Face of Uncertainty.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

Local Management of a Global Resource in a Communication Network
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

Applying Static Network Protocols to Dynamic Networks
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1985
Time and Message Bounds of Election in Synchronous and Asynchronous Complete Networks.
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985


1984
Election and Traversal in Unidirectional Networks.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984


  Loading...