Christian Scheideler

Ardalan Khazraei

CoRR, 2020

Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.

[BibT_eX]

[DOI]

Ardalan Khazraei

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Shortest Paths in a Hybrid Network Model.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Convex Hull Formation for Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.

[BibT_eX]

[DOI]

Jannik Castenow

Christina Kolb

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2019

Computing by Programmable Particles.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing by Mobile Entities, 2019

Self-Stabilizing Metric Graphs.

[BibT_eX]

[DOI]

Robert Gmyr

Jonas Lefèvre

Theory Comput. Syst., 2019

Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension.

[BibT_eX]

[DOI]

Martijn Struijs

CoRR, 2019

Fast Distributed Algorithms for LP-Type Problems of Low Dimension.

[BibT_eX]

[DOI]

Martijn Struijs

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension (Brief Announcement).

[BibT_eX]

[DOI]

Martijn Struijs

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Distributed Computation in Node-Capacitated Networks.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Faster Construction of Overlay Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

MULTISKIPGRAPH: A Self-Stabilizing Overlay Network that Maintains Monotonic Searchability.

[BibT_eX]

[DOI]

Linghui Luo

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

Always be Two Steps Ahead of Your Enemy.

[BibT_eX]

[DOI]

Vipin Ravindran Vijayalakshmi

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

On the Complexity of Local Graph Transformations.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

On the runtime of universal coating for programmable matter.

[BibT_eX]

[DOI]

Nat. Comput., 2018

Sade: competitive MAC under adversarial SINR.

[BibT_eX]

[DOI]

Distributed Comput., 2018

Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 18331).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2018

Distributed Computation in the Node-Congested Clique.

[BibT_eX]

[DOI]

CoRR, 2018

Skeap & Leap: Scalable Distributed Priority Queues for constant and arbitrary Priorities.

[BibT_eX]

[DOI]

CoRR, 2018

Breaking the Ω̃(√n) Barrier: Fast Consensus under a Late Adversary.

[BibT_eX]

[DOI]

Peter Robinson

CoRR, 2018

Relays: A New Approach for the Finite Departure Problem in Overlay Networks.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

On Underlay-Aware Self-Stabilizing Overlay Networks.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Self-stabilizing Overlays for High-Dimensional Monotonic Searchability.

[BibT_eX]

[DOI]

Christina Kolb

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Breaking the $ilde$Omega($sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.

[BibT_eX]

[DOI]

Peter Robinson

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

Brief Announcement: Competitive Routing in Hybrid Communication Networks.

[BibT_eX]

[DOI]

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

Relays: Towards a Link Layer for Robust and Secure Fog Computing.

[BibT_eX]

[DOI]

Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, 2018

Shape Recognition by a Finite Automaton Robot.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Skueue: A Scalable and Sequentially Consistent Distributed Queue.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Self-Stabilizing Supervised Publish-Subscribe Systems.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Competitive Routing in Hybrid Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2018

Overlay Networks for Peer-to-Peer Networks.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Universal coating for programmable matter.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.

[BibT_eX]

[DOI]

SIGACT News, 2017

Towards a universal approach for the finite departure problem in overlay networks.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Leader Election with High Probability for Self-Organizing Programmable Matter.

[BibT_eX]

[DOI]

CoRR, 2017

A Self-stabilizing General De Bruijn Graph.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Distributed Monitoring of Network Properties: The Power of Hybrid Networks.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Improved Leader Election for Self-organizing Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2017

2016

Jamming-Resistant MAC Protocols for Wireless Networks.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

SplayNet: Towards Locally Self-Adjusting Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2016

Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration.

[BibT_eX]

[DOI]

Maximilian Drees

Robert Gmyr

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

Universal Shape Formation for Programmable Matter.

[BibT_eX]

[DOI]

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

On the Runtime of Universal Coating for Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 22nd International Conference, 2016

2015

IRIS: A Robust Information System Against Insider DoS Attacks.

[BibT_eX]

[DOI]

Martina Eikel

ACM Trans. Parallel Comput., 2015

A deterministic worst-case message complexity optimal solution for resource discovery.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures (full version).

[BibT_eX]

[DOI]

CoRR, 2015

Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.

[BibT_eX]

[DOI]

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

Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.

[BibT_eX]

[DOI]

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

Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.

[BibT_eX]

[DOI]

Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, 2015

Leader Election and Shape Formation with Self-organizing Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 21st International Conference, 2015

2014

Principles of Robust Medium Access and an Application to Leader Election.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

Re-Chord: A Self-stabilizing Chord Overlay Network.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

SKIP<sup>+</sup>: A Self-Stabilizing Skip Graph.

[BibT_eX]

[DOI]

J. ACM, 2014

Infinite Object Coating in the Amoebot Model.

[BibT_eX]

[DOI]

CoRR, 2014

Minimum Linear Arrangement of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Martina Eikel

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

On Stabilizing Departures in Overlay Networks.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

Brief announcement: amoebot - a new model for programmable matter.

[BibT_eX]

[DOI]

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

Algorithmic Aspects of Resource Management in the Cloud.

[BibT_eX]

[DOI]

Christine Markarian

Proceedings of the Structural Information and Communication Complexity, 2014

HSkip+: A self-stabilizing overlay network for nodes with heterogeneous bandwidths.

[BibT_eX]

[DOI]

Matthias Feldotto

Kalman Graffi

Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing, 2014

RoBuSt: A Crash-Failure-Resistant Distributed Storage System.

[BibT_eX]

[DOI]

Martina Eikel

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

Competitive MAC under adversarial SINR.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013

An Efficient and Fair MAC Protocol Robust to Reactive Interference.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2013

Corona: A stabilizing deterministic message-passing skip list.

[BibT_eX]

[DOI]

Rizal Mohd Nor

Mikhail Nesterenko

Theor. Comput. Sci., 2013

Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Competitive throughput in multi-hop wireless networks despite adaptive jamming.

[BibT_eX]

[DOI]

Distributed Comput., 2013

A DeterministicWorst-Case Message Complexity Optimal Solution for Resource Discovery.

[BibT_eX]

[DOI]

CoRR, 2013

Ameba-inspired Self-organizing Particle Systems.

[BibT_eX]

[DOI]

CoRR, 2013

CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Locally Self-Adjusting Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

2012

Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Editorial for Algorithmic Aspects of Wireless Sensor Networks.

[BibT_eX]

[DOI]

Shlomi Dolev

Theor. Comput. Sci., 2012

Tiara: A self-stabilizing deterministic skip list and skip graph.

[BibT_eX]

[DOI]

Thomas Clouser

Mikhail Nesterenko

Theor. Comput. Sci., 2012

Smoothed analysis of left-to-right maxima with applications.

[BibT_eX]

[DOI]

Valentina Damerow

Bodo Manthey

ACM Trans. Algorithms, 2012

Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.

[BibT_eX]

[DOI]

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

Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.

[BibT_eX]

[DOI]

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

Approximate duality of multicommodity multiroute flows and cuts: single source case.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Competitive and fair throughput for co-existing networks under adversarial interference.

[BibT_eX]

[DOI]

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

A Self-Stabilization Process for Small-World Networks.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

Self-organizing Particle Systems.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

Selfish Distributed Optimization.

[BibT_eX]

[DOI]

Burkhard Monien

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

2011

Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Self-Stabilizing De Bruijn Networks.

[BibT_eX]

[DOI]

Phillip Stevens

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Stabilizing consensus with the power of two choices.

[BibT_eX]

[DOI]

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

Self-stabilizing leader election for single-hop wireless networks despite jamming.

[BibT_eX]

[DOI]

Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2011

Towards jamming-resistant and competitive medium access in the SINR model.

[BibT_eX]

[DOI]

Proceedings of the 3rd ACM workshop on Wireless of the students, 2011

Competitive and Fair Medium Access Despite Reactive Jamming.

[BibT_eX]

[DOI]

Proceedings of the 2011 International Conference on Distributed Computing Systems, 2011

Broadcasting - How Can I Quickly Disseminate Information?

[BibT_eX]

[DOI]

Proceedings of the Algorithms Unplugged, 2011

Programming for Distributed Computing: From Physical to Logical Networks.

[BibT_eX]

[DOI]

Kalman Graffi

Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

2010

Foreword.

[BibT_eX]

[DOI]

Cyril Gavoille

Boaz Patt-Shamir

Theory Comput. Syst., 2010

Algorithmische Grundlagen verteilter Speichersysteme.

[BibT_eX]

[DOI]

Inform. Spektrum, 2010

AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming

[BibT_eX]

[DOI]

CoRR, 2010

A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.

[BibT_eX]

[DOI]

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

Brief Announcement: Stabilizing Consensus with the Power of Two Choices.

[BibT_eX]

[DOI]

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

Brief announcement: towards robust medium access in multi-hop networks.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Robust random number generation for peer-to-peer systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Foreword.

[BibT_eX]

[DOI]

Robert D. Kleinberg

Theory Comput. Syst., 2009

Towards a Scalable and Robust DHT.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2009

A DoS-resilient information system for dynamic data management.

[BibT_eX]

[DOI]

Matthias Baumgart

Stefan Schmid

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.

[BibT_eX]

[DOI]

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

A Self-stabilizing and Local Delaunay Graph Construction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

A Distributed and Oblivious Heap.

[BibT_eX]

[DOI]

Stefan Schmid

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008

Broadcasting: Wie verbreite ich schnell Informationen?.

[BibT_eX]

[DOI]

Proceedings of the Taschenbuch der Algorithmen, 2008

Algorithms for Overlay Networks.

[BibT_eX]

Bull. EATCS, 2008

Tiara: A Self-stabilizing Deterministic Skip List.

[BibT_eX]

[DOI]

Thomas Clouser

Mikhail Nesterenko

Proceedings of the Stabilization, 2008

SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems.

[BibT_eX]

[DOI]

Mario Mense

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

A jamming-resistant MAC protocol for single-hop wireless networks.

[BibT_eX]

[DOI]

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

An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model.

[BibT_eX]

[DOI]

Paolo Santi

Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2008

2007

Overlay Networks for Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

A denial-of-service resistant DHT.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Towards Scalable and Robust Overlay Networks.

[BibT_eX]

[DOI]

Proceedings of the 6th International workshop on Peer-To-Peer Systems, 2007

Linearization: Locally Self-Stabilizing Sorting in Graphs.

[BibT_eX]

[DOI]

Melih Onus

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

Peer-to-Peer-Netzwerke - Algorithmen und Methoden.

[BibT_eX]

Peter Mahlmann

eXamen.press, Springer, ISBN: 978-3-540-33991-5, 2007

2006

Survivable Monitoring in Dynamic Networks.

[BibT_eX]

[DOI]

Giuseppe Ateniese

Chris Riley

IEEE Trans. Mob. Comput., 2006

The Effect of Faults on Network Expansion.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Improved bounds for the unsplittable flow problem.

[BibT_eX]

[DOI]

J. Algorithms, 2006

Distributed coloring in O~(⎷(log n)) bit rounds.

[BibT_eX]

[DOI]

Kishore Kothapalli

Melih Onus

Christian Schindelhauer

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

2005

How to spread adversarial nodes?: rotate!

[BibT_eX]

[DOI]

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

Constant density spanners for wireless ad-hoc networks.

[BibT_eX]

[DOI]

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

Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Supervised Peer-to-Peer Systems.

[BibT_eX]

[DOI]

Kishore Kothapalli

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environmen.

[BibT_eX]

[DOI]

Miroslaw Korzeniowski

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

2004

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.

[BibT_eX]

[DOI]

Algorithmica, 2004

Pagoda: a dynamic overlay network for routing, data management, and multicasting.

[BibT_eX]

[DOI]

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

Consistent and compact data management in distributed storage systems.

[BibT_eX]

[DOI]

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

The hyperring: a low-congestion deterministic data structure for distributed environments.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Robust Distributed Name Service.

[BibT_eX]

[DOI]

Proceedings of the Peer-to-Peer Systems III, Third International Workshop, 2004

A Distributed Hash Table for Computational Grids.

[BibT_eX]

[DOI]

Chris Riley

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Group Spreading: A Protocol for Provably Secure Distributed Name Service.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Information gathering in adversarial systems: lines and cycles.

[BibT_eX]

[DOI]

Kishore Kothapalli

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

On local algorithms for topology control and routing in ad hoc networks.

[BibT_eX]

[DOI]

Lujun Jia

Rajmohan Rajaraman

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

Perfectly Balanced Allocation.

[BibT_eX]

[DOI]

Chris Riley

Proceedings of the Approximation, 2003

Peer-to-peer systems for prefix search.

[BibT_eX]

[DOI]

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

Anycasting in Adversarial Systems: Routing and Admission Control.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Smoothed Motion Complexity.

[BibT_eX]

[DOI]

Valentina Damerow

Harald Räcke

Christian Sohler

Proceedings of the Algorithms, 2003

2002

Improved Bounds for Acyclic Job Shop Scheduling.

[BibT_eX]

[DOI]

Uriel Feige

Comb., 2002

Models and Techniques for Communication in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Compact, adaptive placement schemes for non-uniform requirements.

[BibT_eX]

[DOI]

Kay Salzwedel

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

2001

Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.

[BibT_eX]

[DOI]

Comb., 2001

SIMLAB-A Simulation Environment for Storage Area Networks.

[BibT_eX]

[DOI]

Proceedings of the Ninth Euromicro Workshop on Parallel and Distributed Processing, 2001

Simple Routing Strategies for Adversarial Systems.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.

[BibT_eX]

[DOI]

Berthold Vöcking

SIAM J. Comput., 2000

Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

Efficient Communication Strategies for Ad Hoc Wireless Networks.

[BibT_eX]

[DOI]

Micah Adler

Theory Comput. Syst., 2000

A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Efficient, distributed data placement strategies for storage area networks (extended abstract).

[BibT_eX]

[DOI]

Kay Salzwedel

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

Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Distributed Path Selection for Storage Networks.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1999

Simple, Efficient Routing Schemes for All-Optical Networks.

[BibT_eX]

[DOI]

Michele Flammini

Theory Comput. Syst., 1999

Simple Competitive Request Scheduling Strategies.

[BibT_eX]

[DOI]

Marco Riedel

Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Universal Continuous Routing Strategies.

[BibT_eX]

[DOI]

Berthold Vöcking

Theory Comput. Syst., 1998

Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).

[BibT_eX]

[DOI]

Uriel Feige

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).

[BibT_eX]

[DOI]

Micah Adler

Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

Universal Routing Strategies for Interconnection Networks

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 1390, Springer, ISBN: 3-540-64505-5, 1998

1997

Optimal Wormhole Routing in the (n, d)-Torus.

[BibT_eX]

[DOI]

Stefan Bock

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996

Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.

[BibT_eX]

[DOI]

Volker Stemann

Theor. Comput. Sci., 1996

Universal Algorithms for Store-and-Forward and Wormhole Routing.

[BibT_eX]

[DOI]

Robert Cypher

Berthold Vöcking

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Communication in Parallel Systems.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

Universal routing strategies.

[BibT_eX]

[DOI]

PhD thesis, 1996

1995

Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).

[BibT_eX]

[DOI]

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

Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.

[BibT_eX]

[DOI]