Nir Shavit

Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

2023

Forbidden Facts: An Investigation of Competing Objectives in Llama-2.

[BibT_eX]

[DOI]

CoRR, 2023

Cliff-Learning.

[BibT_eX]

[DOI]

Tony T. Wang

Igor Zablotchi

Jonathan S. Rosenfeld

CoRR, 2023

The XPRESS Challenge: Xray Projectomic Reconstruction - Extracting Segmentation with Skeletons.

[BibT_eX]

[DOI]

CoRR, 2023

X-Ray2EM: Uncertainty-Aware Cross-Modality Image Reconstruction from X-Ray to Electron Microscopy in Connectomics.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Symposium on Biomedical Imaging, 2023

Learning to Correct Sloppy Annotations in Electron Microscopy Volumes.

[BibT_eX]

[DOI]

Minghao Chen

Mukesh Bangalore Renuka

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

2022

Connectome-constrained Latent Variable Model of Whole-Brain Neural Activity.

[BibT_eX]

[DOI]

Aravinthan D. T. Samuel

Srinivas C. Turaga

Proceedings of the Tenth International Conference on Learning Representations, 2022

Training-Free Uncertainty Estimation for Dense Regression: Sensitivity as a Surrogate.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Revisiting Latent-Space Interpolation via a Quantitative Evaluation Framework.

[BibT_eX]

[DOI]

CoRR, 2021

On the Predictability of Pruning Across Scales.

[BibT_eX]

[DOI]

Jonathan S. Rosenfeld

Jonathan Frankle

Michael Carbin

Proceedings of the 38th International Conference on Machine Learning, 2021

HDMapGen: A Hierarchical Graph Generative Model of High Definition Maps.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2021

2020

A complexity-based classification for multiprocessor synchronization.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Learning Guided Electron Microscopy with Active Acquisition.

[BibT_eX]

[DOI]

Aravinthan D. T. Samuel

Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2020, 2020

Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

A Constructive Prediction of the Generalization Error Across Scales.

[BibT_eX]

[DOI]

Jonathan S. Rosenfeld

Amir Rosenfeld

Yonatan Belinkov

Proceedings of the 8th International Conference on Learning Representations, 2020

2019

L3 Fusion: Fast Transformed Convolutions on CPUs.

[BibT_eX]

[DOI]

Rati Gelashvili

Aleksandar Zlateski

CoRR, 2019

Training-Free Uncertainty Estimation for Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2019

Cross-Classification Clustering: An Efficient Multi-Object Tracking Technique for 3-D Instance Segmentation in Connectomics.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019

2018

ThreadScan: Automatic and Scalable Memory Reclamation.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2018

Inherent limitations of hybrid transactional memory.

[BibT_eX]

[DOI]

Distributed Comput., 2018

High Throughput Connectomics (Dagstuhl Seminar 18481).

[BibT_eX]

[DOI]

Moritz Helmstaedter

Jeff Lichtman

Dagstuhl Reports, 2018

Cross-Classification Clustering: An Efficient Multi-Object Tracking Technique for 3-D Instance Segmentation in Connectomics.

[BibT_eX]

[DOI]

CoRR, 2018

Generative Compression.

[BibT_eX]

[DOI]

Shibani Santurkar

David M. Budden

Proceedings of the 2018 Picture Coding Symposium, 2018

2017

Toward Streaming Synapse Detection with Compositional ConvNets.

[BibT_eX]

[DOI]

CoRR, 2017

Deep Learning is Robust to Massive Label Noise.

[BibT_eX]

[DOI]

CoRR, 2017

Morphological Error Detection in 3D Segmentations.

[BibT_eX]

[DOI]

CoRR, 2017

A Multicore Path to Connectomics-on-Demand.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

Deep Tensor Convolution on Multicores.

[BibT_eX]

[DOI]

David M. Budden

Shibani Santurkar

Shraman Ray Chaudhuri

Proceedings of the 34th International Conference on Machine Learning, 2017

Forkscan: Conservative Memory Reclamation for Modern Operating Systems.

[BibT_eX]

[DOI]

Proceedings of the Twelfth European Conference on Computer Systems, 2017

2016

Transactional Memory.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

[BibT_eX]

[DOI]

Dan Alistarh

Keren Censor-Hillel

J. ACM, 2016

The computability of relaxed data structures: queues and stacks as examples.

[BibT_eX]

[DOI]

Gadi Taubenfeld

Distributed Comput., 2016

A Multi-Pass Approach to Large-Scale Connectomics.

[BibT_eX]

[DOI]

Seymour Knowles-Barley

Thouis Raymond Jones

Hanspeter Pfister

Jeff William Lichtman

CoRR, 2016

A Complexity-Based Hierarchy for Multiprocessor Synchronization.

[BibT_eX]

[DOI]

CoRR, 2016

A Multicore Path to Connectomics-on-Demand.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

High Throughput Connectomics (Keynote Abstract).

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015

Lock Cohorting: A General Technique for Designing NUMA Locks.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2015

Amalgamated Lock-Elision.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Read-log-update: a lightweight synchronization mechanism for concurrent programming.

[BibT_eX]

[DOI]

Proceedings of the 25th Symposium on Operating Systems Principles, 2015

The SprayList: a scalable relaxed priority queue.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015

Reduced Hardware NOrec: A Safe and Scalable Hybrid Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015

2014

Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints.

[BibT_eX]

[DOI]

CoRR, 2014

Brief announcement: persistent unfairness arising from cache residency imbalance.

[BibT_eX]

[DOI]

Dave Dice

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Brief announcement: are lock-free concurrent algorithms practically wait-free?

[BibT_eX]

[DOI]

Dan Alistarh

Keren Censor-Hillel

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

On the Importance of Registers for Computability.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm.

[BibT_eX]

[DOI]

Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, 2014

StackTrack: an automated transactional approach to concurrent memory reclamation.

[BibT_eX]

[DOI]

Proceedings of the Ninth Eurosys Conference 2014, 2014

2013

Reduced hardware transactions: a new approach to hybrid transactional memory.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

NUMA-aware reader-writer locks.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

The SkipTrie: low-depth concurrent search without rebalancing.

[BibT_eX]

[DOI]

Rotem Oshman

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Leaplist: lessons learned in designing tm-supported range queries.

[BibT_eX]

[DOI]

Hillel Avni

Adi Suissa

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

Transactional memory: beyond the first two decades.

[BibT_eX]

[DOI]

SIGACT News, 2012

On the Inherent Sequentiality of Concurrent Objects.

[BibT_eX]

[DOI]

Faith Ellen

SIAM J. Comput., 2012

Interrupting snapshots and the Java size method.

[BibT_eX]

[DOI]

Moran Tzafrir

J. Parallel Distributed Comput., 2012

Pessimistic Software Lock-Elision.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

2011

Data structures in the multicore age.

[BibT_eX]

[DOI]

Commun. ACM, 2011

Flat-combining NUMA locks.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

On the Nature of Progress.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Towards Consistency Oblivious Programming.

[BibT_eX]

[DOI]

Hillel Avni

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

2010

The Velox Transactional Memory Stack.

[BibT_eX]

[DOI]

IEEE Micro, 2010

A scalable lock-free stack algorithm.

[BibT_eX]

[DOI]

Lena Yerushalmi

J. Parallel Distributed Comput., 2010

Scalable Flat-Combining Based Synchronous Queues.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Flat combining and the synchronization-parallelism tradeoff.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

TLRW: return of the read-write lock.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Efficient Lock Free Privatization.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Transactional Mutex Locks.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

Scalable Producer-Consumer Pools Based on Elimination-Diffraction Trees.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009

Nonblocking <i>k</i> -Compare-Single-Swap.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Interrupting Snapshots and the Java<sup>TM</sup>^{\mbox{\tiny TM}} Size() Method.

[BibT_eX]

[DOI]

Moran Tzafrir

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Software transactional memory: Where do we come from? What are we? Where are we going?

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008

An optimistic approach to lock-free FIFO queues.

[BibT_eX]

[DOI]

Edya Ladan-Mozes

Distributed Comput., 2008

Solo-valency and the cost of coordination.

[BibT_eX]

[DOI]

Distributed Comput., 2008

Hopscotch Hashing.

[BibT_eX]

[DOI]

Moran Tzafrir

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Maintaining Consistent Transactional States without a Global Clock.

[BibT_eX]

[DOI]

Hillel Avni

Proceedings of the Structural Information and Communication Complexity, 2008

08241 Summary - Transactional Memory : From Implementation to Application.

[BibT_eX]

[DOI]

Proceedings of the Transactional Memory: From Implementation to Application, 08.06., 2008

08241 Abstracts Collection - Transactional Memory : From Implementation to Application.

[BibT_eX]

[DOI]

Proceedings of the Transactional Memory: From Implementation to Application, 08.06., 2008

The art of multiprocessor programming.

[BibT_eX]

Morgan Kaufmann, ISBN: 978-0-12-370591-4, 2008

2007

A Lazy Concurrent List-Based Set Algorithm.

[BibT_eX]

[DOI]

William N. Scherer III

Parallel Process. Lett., 2007

A Simple Optimistic Skiplist Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2007

Potential show-stoppers for transactional synchronization.

[BibT_eX]

[DOI]

Ali-Reza Adl-Tabatabai

Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2007

The Baskets Queue.

[BibT_eX]

[DOI]

Moshe Hoffman

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Topic 12 Theory and Algorithms for Parallel Computation.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2007, 2007

Understanding Tradeoffs in Software Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Symposium on Code Generation and Optimization (CGO 2007), 2007

2006

Toward a Topological Characterization of Asynchronous Complexity.

[BibT_eX]

[DOI]

Gunnar Hoest

SIAM J. Comput., 2006

Virtual Leashing: Creating a computational foundation for software protection.

[BibT_eX]

[DOI]

Ori Dvir

J. Parallel Distributed Comput., 2006

Split-ordered lists: Lock-free extensible hash tables.

[BibT_eX]

[DOI]

J. ACM, 2006

A dynamic-sized nonblocking work stealing deque.

[BibT_eX]

[DOI]

Distributed Comput., 2006

On the inherent weakness of conditional primitives.

[BibT_eX]

[DOI]

Faith Ellen Fich

Distributed Comput., 2006

Transactional Locking II.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Composite Abortable Locks.

[BibT_eX]

[DOI]

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Predictive log-synchronization.

[BibT_eX]

[DOI]

Proceedings of the 2006 EuroSys Conference, Leuven, Belgium, April 18-21, 2006, 2006

A Hierarchical CLH Queue Lock.

[BibT_eX]

[DOI]

Daniel Nussbaum

Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005

Concurrency and synchronization in Java programs.

[BibT_eX]

[DOI]

Jan Vitek

Sci. Comput. Program., 2005

Obstruction-Free Step Complexity: Lock-Free DCAS as an Example.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 19th International Conference, 2005

Obstruction-Free Algorithms Can Be Practically Wait-Free.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 19th International Conference, 2005

Using elimination to implement scalable and lock-free FIFO queues.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Virtual Leashing: Internet-Based Software Piracy Protection.

[BibT_eX]

[DOI]

Ori Dvir

Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

Linear Lower Bounds on Real-World Implementations of Concurrent Objects.

[BibT_eX]

[DOI]

Faith Ellen Fich

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

Concurrent Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

Dynamic Memory ABP Work-Stealing.

[BibT_eX]

[DOI]

Yossi Lev

Proceedings of the Distributed Computing, 18th International Conference, 2004

DCAS is not a silver bullet for nonblocking algorithm design.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

On the inherent weakness of conditional synchronization primitives.

[BibT_eX]

[DOI]

Faith E. Fich

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003

On the Uncontended Complexity of Consensus.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 17th International Conference, 2003

Nonblocking k-compare-single-swap.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Operation-valency and the cost of coordination.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

2002

DCAS-Based Concurrent Deques.

[BibT_eX]

[DOI]

Ole Agesen

David Detlefs

Christine H. Flood

Alexander T. Garthwaite

Theory Comput. Syst., 2002

Introduction.

[BibT_eX]

[DOI]

Distributed Comput., 2002

Work dealing.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Non-blocking steal-half work queues.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001

Towards a practical snapshot algorithm.

[BibT_eX]

[DOI]

Yaron Riany

Theor. Comput. Sci., 2001

Parallel Garbage Collection for Shared Memory Multiprocessors.

[BibT_eX]

[DOI]

Proceedings of the 1st Java Virtual Machine Research and Technology Symposium, 2001

2000

Combining Funnels: A Dynamic Approach to Software Combining.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2000

Reactive Diffracting Trees.

[BibT_eX]

[DOI]

Giovanni Della-Libera

J. Parallel Distributed Comput., 2000

Supporting Increment and Decrement Operations in Balancing Networks.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2000

Even Better DCAS-Based Concurrent Deques.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 14th International Conference, 2000

DCAS-based concurrent deques.

[BibT_eX]

[DOI]

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

Skiplist-Based Concurrent Priority Queues.

[BibT_eX]

[DOI]

Itay Lotan

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999

Timing Conditions for Linearizability in Uniform Counting Networks.

[BibT_eX]

[DOI]

Alexander A. Shvartsman

Theor. Comput. Sci., 1999

The topological structure of asynchronous computability.

[BibT_eX]

[DOI]

J. ACM, 1999

Concurrent Priority Queue Algorithms.

[BibT_eX]

Proceedings of the Distributed Data & Structures 2, 1999

Scalable Concurrent Priority Queue Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998

A Steady State Analysis of Diffracting Trees.

[BibT_eX]

[DOI]

Eli Upfal

Theory Comput. Syst., 1998

On the Space Complexity of Randomized Synchronization.

[BibT_eX]

[DOI]

Faith E. Fich

J. ACM, 1998

Combining Funnels: A New Twist on an Old Tale...

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997

Bounded Concurrent Time-Stamping.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

Elimination Trees and the Construction of Pools and Stacks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1997

Slide-The Key to Polynomial End-to-End Communication.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Software Transactional Memory.

[BibT_eX]

[DOI]

Distributed Comput., 1997

A Wait-Free Sorting Algorithm.

[BibT_eX]

[DOI]

Eli Upfal

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Towards a Topological Characterization of Asynchronous Complexity (Preliminary Version).

[BibT_eX]

[DOI]

Gunnar Hoest

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996

Diffracting Trees.

[BibT_eX]

[DOI]

ACM Trans. Comput. Syst., 1996

Linearizable Counting Networks.

[BibT_eX]

[DOI]

Orli Waarts

Distributed Comput., 1996

A Steady State Analysis of Diffracting Trees (Extended Abstract).

[BibT_eX]

[DOI]

Eli Upfal

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Counting Networks are Practically Linearizable.

[BibT_eX]

[DOI]

Alexander A. Shvartsman

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Applications of Algebraic Topology to Concurrent Computation.

[BibT_eX]

[DOI]

Proceedings of the Applications on Advanced Architecture Computers, 1996

1995

Scalable Concurrent Counting.

[BibT_eX]

[DOI]

Beng-Hong Lim

ACM Trans. Comput. Syst., 1995

Elimination Trees and the Construction of Pools and Stacks (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

1994

A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1994

Are Wait-Free Algorithms Fast?

[BibT_eX]

[DOI]

Hagit Attiya

J. ACM, 1994

Counting Networks.

[BibT_eX]

[DOI]

James Aspnes

J. ACM, 1994

A simple constructive computability theorem for wait-free computation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Diffracting Trees (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1993

Atomic Snapshots of Shared Memory.

[BibT_eX]

[DOI]

J. ACM, 1993

The asynchronous computability theorem for t-resilient tasks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

Low Contention Load Balancing on Large-Scale Multiprocessors.

[BibT_eX]

[DOI]

Beng-Hong Lim

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Timing-Based Mutual Exclusion.

[BibT_eX]

[DOI]

Proceedings of the Real-Time Systems Symposium, 1992

Concurrent Timestamping Made Simple.

[BibT_eX]

[DOI]

Rainer Gawlick

Proceedings of the Theory of Computing and Systems, 1992

1991

Counting Networks and Multi-Processor Coordination

[BibT_eX]

[DOI]

James Aspnes

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice.

[BibT_eX]

[DOI]

Michael E. Saks

Heather Woll

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Low Contention Linearizable Counting

[BibT_eX]

[DOI]

Orli Waarts

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Are Wait-Free Algorithms Fast? (Extended Abstract)

[BibT_eX]

[DOI]

Hagit Attiya

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Concurrent time stamping (חתימות זמן מקביליות.).

[BibT_eX]

[DOI]

PhD thesis, 1989

Bounded Concurrent Time-Stamp Systems Are Constructible

[BibT_eX]

[DOI]

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Bounded Polynomial Randomized Consensus.

[BibT_eX]

[DOI]

Hagit Attiya

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

Polynomial End-To-End Communication (Extended Abstract)

[BibT_eX]

[DOI]

Baruch Awerbuch

Yishay Mansour

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Toward a Non-Atomic Era: \ell-Exclusion as a Test Case

[BibT_eX]

[DOI]

Eli Gafni

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1986

A New Approach to Detection of Locally Indicative Stability.

[BibT_eX]

[DOI]