David Peleg

Aishwarya Thiruvengadam

Proceedings of the 38th International Symposium on Distributed Computing, 2024

Sparse Graphic Degree Sequences Have Planar Realizations.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

The power of small coalitions under two-tier majority on regular graphs.

[BibT_eX]

[DOI]

Pavel Chebotarev

Discret. Appl. Math., December, 2023

Graph realizations: Maximum degree in vertex neighborhoods.

[BibT_eX]

[DOI]

Discret. Math., September, 2023

Forcibly bipartite and acyclic (uni-)graphic sequences.

[BibT_eX]

[DOI]

Discret. Math., July, 2023

Composed Degree-Distance Realizations of Graphs.

[BibT_eX]

[DOI]

Algorithmica, March, 2023

The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, January, 2023

Byzantine Resilient Computing with the Cloud.

[BibT_eX]

[DOI]

Aishwarya Thiruvengadam

CoRR, 2023

Degree Realization by Bipartite Multigraphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2023

Brief Announcement: Local Problems in the SUPPORTED Model.

[BibT_eX]

[DOI]

Akanksha Agrawal

John Augustine

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

Local Recurrent Problems in the SUPPORTED Model.

[BibT_eX]

[DOI]

Akanksha Agrawal

John Augustine

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

2022

Distributed Graph Realizations.

[BibT_eX]

[DOI]

Sumathi Sivasubramaniam

Suman Sourav

IEEE Trans. Parallel Distributed Syst., 2022

On vertex-weighted realizations of acyclic and general graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Hotelling games in fault-prone settings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

The generalized microscopic image reconstruction problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Recurrent Problems in the LOCAL model.

[BibT_eX]

[DOI]

Akanksha Agrawal

John Augustine

CoRR, 2022

An Almost Singularly Optimal Asynchronous Distributed MST Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Vertex-Weighted Graphs: Realizable and Unrealizable Domains.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Nonuniform SINR+Voronoi diagrams are effectively uniform.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

EATCS Distinguished Dissertation Award 2021 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2021

EATCS Distinguished Dissertation Award for 2020.

[BibT_eX]

[DOI]

Bull. EATCS, 2021

Singularly Near Optimal Leader Election in Asynchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

2021 Edsger W. Dijkstra Prize in Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Budgeted Dominating Sets in Uncertain Graphs.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Relaxed and Approximate Graph Realizations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Selected Neighbor Degree Forest Realization.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

On Vertex-Weighted Graph Realizations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Message lower bounds via efficient network synchronization.

[BibT_eX]

[DOI]

Gopal Pandurangan

Michele Scquizzato

Theor. Comput. Sci., 2020

Mixed fault tolerance in server assignment: Combining reinforcement and backup.

[BibT_eX]

[DOI]

Tal Navon

Theor. Comput. Sci., 2020

Vertex-weighted realizations of graphs.

[BibT_eX]

[DOI]

Amotz Bar-Noy

Dror Rawitz

Theor. Comput. Sci., 2020

Efficiently Realizing Interval Sequences.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

EATCS Distinguished Dissertation Award 2020 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2020

Fault Tolerant Approximate BFS Structures with Additive Stretch.

[BibT_eX]

[DOI]

Algorithmica, 2020

Singularly Optimal Randomized Leader Election.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Minimum Neighboring Degree Realization in Graphs and Trees.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

EATCS Distinguished Dissertation Award 2019 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2019

Distributed distance computation and routing with small messages.

[BibT_eX]

[DOI]

Christoph Lenzen

Boaz Patt-Shamir

Distributed Comput., 2019

Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods.

[BibT_eX]

[DOI]

CoRR, 2019

Hotelling Games with Multiple Line Faults.

[BibT_eX]

[DOI]

Avi Cohen

CoRR, 2019

Hotelling Games with Random Tolerance Intervals.

[BibT_eX]

[DOI]

Avi Cohen

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Graph Profile Realizations and Applications to Social Networks.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Majority vote and monopolies in social networks.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

Random preferential attachment hypergraph.

[BibT_eX]

[DOI]

Proceedings of the ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining, 2019

2018

The topology of wireless communication on a line.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Fault-Tolerant Approximate BFS Structures.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

EATCS Distinguished Dissertation Award 2018 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2018

Improved approximation algorithms for weighted 2-path partitions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Fault-Tolerant Hotelling Games.

[BibT_eX]

[DOI]

CoRR, 2018

Preferential Attachment as a Unique Equilibrium.

[BibT_eX]

[DOI]

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Wireless Expanders.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Realizability of Graph Specifications: Characterizations and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2018

2017

Distributed computing on core-periphery networks: Axiom-based design.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2017

Secluded Connectivity Problems.

[BibT_eX]

[DOI]

Algorithmica, 2017

SINR diagram with interference cancellation.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2017

Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Maintaining Communication in Multi-Robot Tree Coverage.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Assortative Mixing Equilibria in Social Network Games.

[BibT_eX]

[DOI]

Proceedings of the Game Theory for Networks - 7th International EAI Conference, 2017

The Effect of Population Control Policies on Societal Fragmentation.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016

Sparse Fault-Tolerant BFS Structures.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

On social networks of program committees - Structure and effect on paper acceptance fairness.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2016

Discovery Through Gossip.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

On the effect of the deployment setting on broadcasting in Euclidean radio networks.

[BibT_eX]

[DOI]

Distributed Comput., 2016

Efficient k-shot broadcasting in radio networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

The Domination Game: Proving the 3/5 Conjecture on Isolate-Free Forests.

[BibT_eX]

[DOI]

Neta Marcus

CoRR, 2016

Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach.

[BibT_eX]

[DOI]

Shay Solomon

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Local-on-Average Distributed Tasks.

[BibT_eX]

[DOI]

Shay Solomon

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Sublinear bounds for randomized leader election.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The fault-tolerant capacitated K-center problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Fault tolerant additive and (μ, α)-spanners.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On the Complexity of Universal Leader Election.

[BibT_eX]

[DOI]

J. ACM, 2015

The Topology of Wireless Communication.

[BibT_eX]

[DOI]

J. ACM, 2015

40th international colloquium on automata, languages and programming.

[BibT_eX]

[DOI]

Fedor V. Fomin

Marta Z. Kwiatkowska

Inf. Comput., 2015

Truth tellers and liars with fewer questions.

[BibT_eX]

[DOI]

Discret. Math., 2015

Random Preferential Attachment Hypergraphs.

[BibT_eX]

[DOI]

Chen Avin

CoRR, 2015

Nonuniform SINR+Voroni Diagrams Are Effectively Uniform.

[BibT_eX]

[DOI]

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

Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Nearly Optimal Local Broadcasting in the SINR Model with Feedback.

[BibT_eX]

[DOI]

Leonid Barenboim

Proceedings of the Structural Information and Communication Complexity, 2015

Homophily and the Glass Ceiling Effect in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Core Size and Densification in Preferential Attachment Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Social Network Analysis of Program Committees and Paper Acceptance Fairness.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

On the Relations Between SINR Diagrams and Voronoi Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 14th International Conference, 2015

2014

Robust fault tolerant uncapacitated facility location.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Gathering Despite Mischief.

[BibT_eX]

[DOI]

Yoann Dieudonné

ACM Trans. Algorithms, 2014

Testing the irreducibility of nonsquare Perron-Frobenius systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Randomized distributed decision.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Core-Periphery in Networks: An Axiomatic Approach.

[BibT_eX]

[DOI]

CoRR, 2014

Distributed 3/2-Approximation of the Diameter.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

How Even Tiny Influence Can Have a Big Impact!

[BibT_eX]

[DOI]

Barbara Keller

Roger Wattenhofer

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Immunity against Local Influence.

[BibT_eX]

[DOI]

Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

2013

Prize for innovation in distributed computing: awarded to Roger Wattenhofer.

[BibT_eX]

[DOI]

SIGACT News, 2013

Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification.

[BibT_eX]

[DOI]

Liah Kor

Theory Comput. Syst., 2013

Towards a complexity theory for local distributed computing.

[BibT_eX]

[DOI]

Pierre Fraigniaud

J. ACM, 2013

Special issue on DISC 2011.

[BibT_eX]

[DOI]

Distributed Comput., 2013

On approximating the d-girth of a graph.

[BibT_eX]

[DOI]

Ignasi Sau

Mordechai Shalom

Discret. Appl. Math., 2013

Generalized Perron-Frobenius Theorem for Nonsquare Matrices.

[BibT_eX]

[DOI]

CoRR, 2013

Relaxed Spanners for Directed Disk Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2013

Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Efficient distributed source detection with limited bandwidth.

[BibT_eX]

[DOI]

Christoph Lenzen

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

Randomized Distributed Decision (Invited Lecture Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Sparse Fault-Tolerant BFS Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

Distributed Verification and Hardness of Distributed Approximation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

SINR Diagrams: Convexity and Its Applications in Wireless Networks.

[BibT_eX]

[DOI]

J. ACM, 2012

Sparse reliable graph backbones.

[BibT_eX]

[DOI]

Inf. Comput., 2012

On the approximability of some degree-constrained subgraph problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

f-Sensitivity Distance Oracles and Routing Schemes.

[BibT_eX]

[DOI]

Algorithmica, 2012

Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Fault Tolerant Additive Spanners.

[BibT_eX]

[DOI]

Gilad Braunschvig

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Randomized Distributed Decision.

[BibT_eX]

[DOI]

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

Notions of Connectivity in Overlay Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

Multipath Spanners via Fault-Tolerant Spanners.

[BibT_eX]

[DOI]

Quentin Godfroy

Proceedings of the Design and Analysis of Algorithms, 2012

Distributed Algorithms for Network Diameter and Girth.

[BibT_eX]

[DOI]

Elad Tal

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

A note on exact distance labeling.

[BibT_eX]

[DOI]

Oren Weimann

Inf. Process. Lett., 2011

Tight Bounds For Distributed MST Verification.

[BibT_eX]

[DOI]

Liah Kor

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

SINR Maps: Properties and Applications.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Distributed power control in the SINR model.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Local Distributed Decision.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Localized spanner construction for ad hoc networks with variable transmission range.

[BibT_eX]

[DOI]

ACM Trans. Sens. Networks, 2010

Equal-area locus-based convex polygon decomposition.

[BibT_eX]

[DOI]

David Adjiashvili

Theor. Comput. Sci., 2010

A near-linear-time algorithm for computing replacement paths in planar directed graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Structure and algorithms in the SINR wireless model.

[BibT_eX]

[DOI]

SIGACT News, 2010

Fault Tolerant Spanners for General Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Proof labeling schemes.

[BibT_eX]

[DOI]

Distributed Comput., 2010

Constructing Labeling Schemes through Universal Matrices.

[BibT_eX]

[DOI]

Yoav Rodeh

Algorithmica, 2010

Realtime Classification for Encrypted Traffic.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

f-Sensitivity Distance Oracles and Routing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

Time-Efficient Broadcast in Radio Networks.

[BibT_eX]

[DOI]

Tomasz Radzik

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009

Distributed algorithms for partitioning a swarm of autonomous mobile robots.

[BibT_eX]

[DOI]

Asaf Efrima

Theor. Comput. Sci., 2009

A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

Broadcasting in UDG radio networks with unknown topology.

[BibT_eX]

[DOI]

Distributed Comput., 2009

Conflict-free coloring of unit disks.

[BibT_eX]

[DOI]

Nissan Lev-Tov

Discret. Appl. Math., 2009

Labeling Schemes for Tree Representation.

[BibT_eX]

[DOI]

Algorithmica, 2009

Computing the fault tolerance of multi-agent deployment.

[BibT_eX]

[DOI]

Artif. Intell., 2009

Low-Port Tree Representations.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Local Computation of Nearly Additive Spanners.

[BibT_eX]

[DOI]

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

As Good as It Gets: Competitive Fault Tolerance in Network Structures.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2009

SINR diagrams: towards algorithmically usable SINR models of wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Local spreading algorithms for autonomous robot systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Dynamic routing schemes for graphs with low local density.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Label-guided graph exploration by a finite automaton.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Compact separator decompositions in dynamic trees and applications to labeling schemes.

[BibT_eX]

[DOI]

Distributed Comput., 2008

Time efficient k-shot broadcasting in known topology radio networks.

[BibT_eX]

[DOI]

Distributed Comput., 2008

Degree-Constrained Subgraph Problems: Hardness and Approximation Results.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

On the locality of distributed sparse spanner construction.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Towards Networked Computers: What Can Be Learned from Distributed Computing?.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing, 2008

2007

Reducing human interactions in Web directory searches.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., 2007

Preface.

[BibT_eX]

[DOI]

Michel Raynal

Theor. Comput. Sci., 2007

Feasibility and complexity of broadcasting with random transmission failures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Approximation algorithm for hotlink assignment in the greedy model.

[BibT_eX]

[DOI]

Rachel Matichin

Theor. Comput. Sci., 2007

The Hardness of Approximating Spanner Problems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Labeling schemes for weighted dynamic trees.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Faster communication in known topology radio networks.

[BibT_eX]

[DOI]

Leszek Gasieniec

Qin Xin

Distributed Comput., 2007

Average stretch analysis of compact routing schemes.

[BibT_eX]

[DOI]

Tamar Eilam

Discret. Appl. Math., 2007

Asynchronous resource discovery in peer-to-peer networks.

[BibT_eX]

[DOI]

Comput. Networks, 2007

Time-Efficient Broadcasting in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Energy and Time Efficient Broadcasting in Known Topology Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time.

[BibT_eX]

[DOI]

Bilel Derbel

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Distributed Models and Algorithms for Mobile Robot Systems.

[BibT_eX]

[DOI]

Asaf Efrima

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Time-Efficient Broadcasting in Radio Networks: A Review.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Internet Technology, 2007

2006

Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots.

[BibT_eX]

[DOI]

Noa Agmon

SIAM J. Comput., 2006

Average probe complexity in quorum systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Distributed MST for constant diameter graphs.

[BibT_eX]

[DOI]

Boaz Patt-Shamir

Distributed Comput., 2006

Local Algorithms for Autonomous Robot Systems.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2006

Dynamic Routing Schemes for General Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005

Preface: Structural Information and Communication Complexity.

[BibT_eX]

[DOI]

Jop F. Sibeyn

Theor. Comput. Sci., 2005

Informative labeling schemes for graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Graph exploration by a finite automaton.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Approximating k-spanner problems for kge2.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Virtual path layouts optimizing total hop count on ATM tree networks.

[BibT_eX]

[DOI]

Uri Pincas

J. Discrete Algorithms, 2005

Broadcasting with locally bounded Byzantine faults.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Distance labeling schemes for well-separated graph classes.

[BibT_eX]

[DOI]

Michal Katz

Nir A. Katz

Discret. Appl. Math., 2005

Polynomial time approximation schemes for base station coverage with minimum total radii.

[BibT_eX]

[DOI]

Nissan Lev-Tov

Comput. Networks, 2005

Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference on Wireless on Demand Network Systems and Service (WONS 2005), 2005

Improved recommendation systems.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Distributed Algorithms for Systems of Autonomous Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 2005

Adaptive Collaboration in Peer-to-Peer Systems.

[BibT_eX]

[DOI]

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

2004

Labeling Schemes for Flow and Connectivity.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

(1+epsilon, beta)-Spanner Constructions for General Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Labeling Schemes for Dynamic Tree Networks.

[BibT_eX]

[DOI]

Yoav Rodeh

Theory Comput. Syst., 2004

Distance labeling in graphs.

[BibT_eX]

[DOI]

J. Algorithms, 2004

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.

[BibT_eX]

[DOI]

Christoph Ambühl

Andrea E. F. Clementi

Proceedings of the STACS 2004, 2004

Robot Convergence via Center-of-Gravity Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

Collaboration of untrusting peers with changing interests.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

2003

Directed virtual path layouts in ATM networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Deterministic Resource Discovery in Distributed Networks.

[BibT_eX]

[DOI]

Uzi Vishkin

Theory Comput. Syst., 2003

Compact routing schemes with low stretch factor.

[BibT_eX]

[DOI]

Tamar Eilam

J. Algorithms, 2003

Compact and localized distributed data structures.

[BibT_eX]

[DOI]

Distributed Comput., 2003

The Power of Small Coalitions in Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Approximation Algorithm for Hotlink Assignments in Web Directories.

[BibT_eX]

[DOI]

Rachel Matichin

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

MST construction in O(log log n) communication rounds.

[BibT_eX]

[DOI]

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

Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Spanning Trees with Low Maximum/Average Stretch.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

Localized Network Representations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Local majorities, coalitions and monopolies in graphs: a review.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Faster exact solutions for some NP-hard problems.

[BibT_eX]

[DOI]

Limor Drori

Theor. Comput. Sci., 2002

How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

Station Layouts in the Presence of Location Constraints.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2002

Exact Algorithms and Approximation Schemes for Base Station Placement Problems.

[BibT_eX]

[DOI]

Nissan Lev-Tov

Proceedings of the Algorithm Theory, 2002

Low Stretch Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

Generalized submodular cover problems and applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

The Wakeup Problem in Synchronous Broadcast Systems.

[BibT_eX]

[DOI]

Leszek Gasieniec

SIAM J. Discret. Math., 2001

The Compactness of Interval Routing for Almost All Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

Low Complexity Variants of the Arrow Distributed Directory.

[BibT_eX]

[DOI]

Eilon Reshef

J. Comput. Syst. Sci., 2001

Distributed Probabilistic Polling and Applications to Proportionate Agreement.

[BibT_eX]

[DOI]

Inf. Comput., 2001

Sparse communication networks and efficient routing in the plane.

[BibT_eX]

[DOI]

Distributed Comput., 2001

Assigning labels in an unknown anonymous network with a leader.

[BibT_eX]

[DOI]

Distributed Comput., 2001

The Dense k-Subgraph Problem.

[BibT_eX]

[DOI]

Uriel Feige

Algorithmica, 2001

Small k-Dominating Sets in Planar Graphs with Applications.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

The Average Hop Count Measure for Virtual Path Layouts.

[BibT_eX]

[DOI]

Uri Pincas

Proceedings of the Distributed Computing, 15th International Conference, 2001

The Client-Server 2-Spanner Problem with Applications to Network Design.

[BibT_eX]

Proceedings of the SIROCCO 8, 2001

Approximating k-Spanner Problems for k>2.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

Approximate Distance Labeling Schemes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction.

[BibT_eX]

[DOI]

Vitaly Rubinovich

SIAM J. Comput., 2000

Tight Fault Locality.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Proximity-preserving labeling schemes.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Feedback vertex set in hypercubes.

[BibT_eX]

[DOI]

Riccardo Focardi

Flaminia L. Luccio

Inf. Process. Lett., 2000

Distributed Algorithms for English Auctions.

[BibT_eX]

[DOI]

Yedidia Atzmony

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

Extremal bounds for probabilistic polling in graphs.

[BibT_eX]

Proceedings of the SIROCCO 7, 2000

Deterministic distributed resource discovery (brief announcement).

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Sparse communication networks and efficient routing in the plane (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

The wakeup problem in synchronous broadcast systems (extended abstract).

[BibT_eX]

[DOI]

Leszek Gasieniec

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Assigning labels in unknown anonymous networks (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Strong Inapproximability of the Basic k-Spanner Problem.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

The Compactness of Interval Routing.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Fault-Local Distributed Mending.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Edge-disjoint spanners of complete graphs and complete digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

Approximating the Weight of Shallow Steiner Trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

Proximity-Preserving Labeling Schemes and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

A Variant of the Arrow Distributed Directory with Low Average Complexity.

[BibT_eX]

[DOI]

Eilon Reshef

Proceedings of the Automata, 1999

A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction.

[BibT_eX]

[DOI]

Vitaly Rubinovich

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

Approximate Maxima Finding of Continuous Functions under Restricted Budget.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Generating Low-Degree 2-Spanners.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees.

[BibT_eX]

[DOI]

Juan A. Garay

SIAM J. Comput., 1998

Optimal Broadcast with Partial Knowledge.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Near-Linear Time Construction of Sparse Neighborhood Covers.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Fast Distributed Construction of Small k-Dominating Sets and Applications.

[BibT_eX]

[DOI]

J. Algorithms, 1998

Size Bounds for Dynamic Monopolies.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper).

[BibT_eX]

Pilar de la Torre

Lata Narayanan

Proceedings of the SIROCCO'98, 1998

Compact Routing Schemes with Low Stretch Factor (Extended Abstract).

[BibT_eX]

[DOI]

Tamar Eilam

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

Deterministic Polylog Approximation for Minimum Communication Spanning Trees.

[BibT_eX]

[DOI]

Eilon Reshef

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

An approximation algorithm for minimum-cost network design.

[BibT_eX]

[DOI]

Yishay Mansour

Proceedings of the Robust Communication Networks: Interconnection and Survivability, 1998

1997

Load Balancing in Quorum Systems.

[BibT_eX]

[DOI]

Ron Holzman

Yosi Marcus

SIAM J. Discret. Math., 1997

Crumbling Walls: A Class of Practical and Efficient Quorum Systems.

[BibT_eX]

[DOI]

Distributed Comput., 1997

The Availability of Crumbling Wall Quorum Systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Randomized Approximation of Bounded Multicovering Problems.

[BibT_eX]

[DOI]

Gideon Schechtman

Algorithmica, 1997

Approximating Shallow-Light Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Approximating Minimum Communication Spanning Trees.

[BibT_eX]

Proceedings of the SIROCCO'97, 1997

1996

Fast Distributed Network Decompositions and Covers.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1996

Scheduling Jobs Using Common Resources.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Majority Voting, Coalitions and Monopolies in Graphs.

[BibT_eX]

Proceedings of the SIROCCO'96, 1996

Tight Bounds on the Size of 2-Monopolies.

[BibT_eX]

Proceedings of the SIROCCO'96, 1996

How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems (Extended Abstract).

[BibT_eX]

[DOI]

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

The Complexity of Data Mining on the Web (Abstract).

[BibT_eX]

[DOI]

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

1995

The Complexity of Reconfiguring Network Models

[BibT_eX]

[DOI]

Inf. Comput., August, 1995

Approximation Algorithms for Minimum-Time Broadcast.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1995

Greedy Packet Scheduling.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

A Graph-Theoretic Game and Its Application to the k-Server Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

A Note on Optimal Time Broadcast in Faulty Hypercubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1995

Online Tracking of Mobile Users.

[BibT_eX]

[DOI]

J. ACM, 1995

The Availability of Quorum Systems.

[BibT_eX]

[DOI]

Inf. Comput., 1995

On the maximum density of 0-1 matrices with no forbidden rectangles.

[BibT_eX]

[DOI]

Discret. Math., 1995

Optimal Broadcast with Partial Knowledge (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Load Balancing in Quorum Systems (Extended Abstract).

[BibT_eX]

[DOI]

Ron Holzman

Yosi Marcus

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

The Power of Small Coalitions in Graphs.

[BibT_eX]

Jean-Claude Bermond

Proceedings of the Structure, Information and Communication Complexity, 1995

Crumbling Walls: A Class of Practical and Efficient Quorum Systems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Fast Distributed Construction of k-Dominating Sets and Applications.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Fault-Local Distributed Mending (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Tight Fault Locality (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

On buffer-economical store-and-forward deadlock prevention.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1994

Computing with Noisy Information.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Low-Diameter Graph Decomposition Is in NC.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1994

Generating Sparse 2-Spanners.

[BibT_eX]

[DOI]

J. Algorithms, 1994

Traffic-light scheduling on the grid.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

Distance-Dependent Distributed Directories

[BibT_eX]

[DOI]

Inf. Comput., April, 1993

Time-Space Tradeoffs for Set Operations.

[BibT_eX]

[DOI]

Boaz Patt-Shamir

Theor. Comput. Sci., 1993

How to Allocate Network Centers.

[BibT_eX]

[DOI]

J. Algorithms, 1993

Approximating Bounded 0-1 Integer Linear Programs.

[BibT_eX]

[DOI]

Gideon Schechtman

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

Sphere Packing and Local Majorities in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

On Choosing a Dense Subgraph (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract)

[BibT_eX]

[DOI]

Juan A. Garay

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Routing with Polynomial Communication-Space Trade-Off.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Single Round Simulation on Radio Networks.

[BibT_eX]

[DOI]

J. Algorithms, 1992

Traffic-Light Scheduling on the Grid (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Distributed Resource Allocation Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Adapting to Asynchronous Dynamic Networks (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Competitive Distributed Job Scheduling (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Fast Network Decomposition (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

The Complexity of Reconfiguring Network Models.

[BibT_eX]

[DOI]

Yosi Ben-Asher

Assaf Schuster

Proceedings of the Theory of Computing and Systems, 1992

1991

Fault-Tolerant Critical Section Management in Asynchronous Environments

[BibT_eX]

[DOI]

Inf. Comput., November, 1991

Square Meshes are not always Optimal.

[BibT_eX]

[DOI]

Amotz Bar-Noy

IEEE Trans. Computers, 1991

Tight Bounds on Minimum Broadcast Networks.

[BibT_eX]

[DOI]

Michelangelo Grigni

SIAM J. Discret. Math., 1991

The Power of Reconfiguration.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1991

A Lower Bound for Radio Broadcast.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1991

Approximation Algorithms for Selecting Network Centers (Preliminary Vesion).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1991

Concurrent Online Tracking of Mobile Users.

[BibT_eX]

[DOI]

Proceedings of the Conference on Communications Architecture & Protocols, 1991

Compact Deterministic Distributed Dictionaries (Extended Abstract).

[BibT_eX]

[DOI]

Karni Gilon

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Efficient Deadlock-Free Routing.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Broadcast with Partial Knowledge (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the On-Line Algorithms, 1991

1990

Renaming in an Asynchronous Environment

[BibT_eX]

[DOI]

J. ACM, July, 1990

A Trade-Off between Information and Communication in Broadcast Protocols

[BibT_eX]

[DOI]

J. ACM, April, 1990

A Time-Randomness Trade-Off for Oblivious Routing.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

Randomized Broadcast in Networks.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

Time-Optimal Leader Election in General Networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1990

Improved Routing Strategies with Succinct Tables.

[BibT_eX]

[DOI]

J. Algorithms, 1990

Distributed Data Structures: A Complexity-Oriented View.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Computing with Unreliable Information (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Cost-Sensitive Analysis of Communication Protocols.

[BibT_eX]

[DOI]

Alan E. Baratz

Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

Network Synchronization with Polylogarithmic Overhead

[BibT_eX]

[DOI]

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

Sparse Partitions (Extended Abstract)

[BibT_eX]

[DOI]

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

1989

An Optimal Synchronizer for the Hypercube.

[BibT_eX]

[DOI]

Jeffrey D. Ullman

SIAM J. Comput., 1989

The Token Distribution Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Time bounds on fault-tolerant broadcasting.

[BibT_eX]

[DOI]

Alejandro A. Schäffer

Networks, 1989

Packet Distribution on a Ring.

[BibT_eX]

[DOI]

Allen Van Gelder

J. Parallel Distributed Comput., 1989

Graph spanners.

[BibT_eX]

[DOI]

Alejandro A. Schäffer

J. Graph Theory, 1989

A trade-off between space and efficiency for routing tables.

[BibT_eX]

[DOI]

J. ACM, 1989

Constructng disjoint paths on expander graphs.

[BibT_eX]

[DOI]

Comb., 1989

Fault-Tolerant Critical Section Management in Asynchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 1989

Compact Distributed Data Structures for Adaptive Routing (Extended Abstract)

[BibT_eX]

[DOI]

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

On the Complexity of Radio Communication (Extended Abstract)

[BibT_eX]

[DOI]

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

1988

Fault Tolerance in Networks of Bounded Degree.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract)

[BibT_eX]

[DOI]

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

A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract)

[BibT_eX]

[DOI]

Danny Krizanc

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

A Tradeoff between Information and Communication in Broadcast Protocols.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

On Fault Tolerant Routings in General Networks

[BibT_eX]

[DOI]

Barbara Simons

Inf. Comput., July, 1987

The Generalized Packet Routing Problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Concurrent Program Schemes and Their Logics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Communication in Concurrent Dynamic Logic.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1987

Concurrent dynamic logic.

[BibT_eX]

[DOI]

J. ACM, 1987

Constructing Disjoint Paths on Expander Graphs (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Achievable Cases in an Asynchronous Environment (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Fault Tolerance in Networks of Bounded Degree (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

The Token Distribution Problem (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Process Logic with Regular Formulas.

[BibT_eX]

[DOI]

David Harel

Theor. Comput. Sci., 1985

More on Looping vs. Repeating in Dynamic Logic.

[BibT_eX]

[DOI]

David Harel

Inf. Process. Lett., 1985

Concurrent Dynamic Logic (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984

On Static Logics, Dynamic Logics, and Complexity Classes

[BibT_eX]

[DOI]

David Harel

Inf. Control., 1984

A generalized closure and complement phenomenon.

[BibT_eX]

[DOI]

Discret. Math., 1984

1983

A note of omega-regular languages.

[BibT_eX]

Yaacov Choueka