| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6107258 | 2023-07-03 | Paper |
| Balanced Allocation: Patience Is Not a Virtue | 2023-04-04 | Paper |
| Safe and efficient traffic laws for mobile robots | 2022-12-09 | Paper |
| Stochastic analysis of dynamic processes | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090352 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002833 | 2021-07-28 | Paper |
| Bandits and Experts in Metric Spaces | 2020-02-11 | Paper |
| Near-perfect token distribution | 2019-12-04 | Paper |
| Efficient approximation for restricted biclique cover problems | 2019-10-30 | Paper |
| Optimizing static and adaptive probing schedules for rapid event detection | 2019-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743420 | 2019-05-10 | Paper |
| On the theory of interconnection networks for parallel computers | 2019-04-29 | Paper |
| Balanced Allocation: Patience is not a Virtue | 2018-07-16 | Paper |
| A wait-free sorting algorithm | 2017-09-29 | Paper |
| Tolerating linear number of faults in networks of bounded degree | 2017-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2959893 | 2017-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2833177 | 2016-11-17 | Paper |
| Algorithms on evolving graphs | 2016-10-07 | Paper |
| Static and dynamic evaluation of QoS properties | 2016-09-29 | Paper |
| Efficient routing in all-optical networks | 2016-09-01 | Paper |
| Balanced allocations (extended abstract) | 2016-09-01 | Paper |
| On the Sample Complexity of Cancer Pathways Identification | 2016-06-22 | Paper |
| Optimizing static and adaptive probing schedules for rapid event detection | 2016-02-05 | Paper |
| Tight bounds on information dissemination in sparse mobile networks | 2015-09-11 | Paper |
| Entropy-based bounds for online algorithms | 2015-09-02 | Paper |
| Distributed agreement in dynamic peer-to-peer networks | 2015-07-13 | Paper |
| How much can hardware help routing? | 2015-05-07 | Paper |
| Fast distributed PageRank computation | 2014-12-02 | Paper |
| The Melbourne Shuffle: Improving Oblivious Storage in the Cloud | 2014-07-01 | Paper |
| An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets | 2014-02-17 | Paper |
| Sorting and selection on dynamic data | 2011-06-07 | Paper |
| Online stochastic optimization under time constraints | 2010-10-04 | Paper |
| The Hiring Problem and Lake Wobegon Strategies | 2010-09-06 | Paper |
| Sort Me If You Can: How to Sort Dynamic Data | 2009-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302093 | 2009-01-05 | Paper |
| Commitment under uncertainty: Two-stage stochastic matching problems | 2008-12-12 | Paper |
| Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems | 2007-11-28 | Paper |
| Using PageRank to Characterize Web Structure | 2007-04-05 | Paper |
| Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input | 2005-09-16 | Paper |
| Steady state analysis of balanced‐allocation routing | 2005-08-29 | Paper |
| Probability and Computing | 2005-08-05 | Paper |
| A simple and deterministic competitive algorithm for online facility location | 2005-01-11 | Paper |
| Efficient communication in an ad-hoc network | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808653 | 2004-08-12 | Paper |
| On-line routing of random calls in networks | 2003-07-08 | Paper |
| Concurrent threads and optimal parallel minimum spanning trees algorithm | 2003-06-25 | Paper |
| A theory of wormhole routing in parallel computers | 2003-06-25 | Paper |
| A wait-free sorting algorithm | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768373 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228430 | 2002-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234069 | 2001-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527020 | 2001-02-28 | Paper |
| Tolerating a linear number of faults in networks of bounded degree | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705352 | 1999-12-19 | Paper |
| Balanced Allocations | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228488 | 1999-05-18 | Paper |
| Reliable Fault Diagnosis with Few Tests | 1999-02-02 | Paper |
| A steady state analysis of diffracting trees | 1999-01-11 | Paper |
| Optimal Construction of Edge-Disjoint Paths in Random Graphs | 1998-09-21 | Paper |
| Stochastic Contention Resolution With Short Delays | 1998-09-21 | Paper |
| How much can hardware help routing? | 1998-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128923 | 1997-08-03 | Paper |
| The worst-case running time of the random simplex algorithm is exponential in the height | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875193 | 1996-12-11 | Paper |
| Existence and Construction of Edge-Disjoint Paths on Expander Graphs | 1995-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140436 | 1994-11-29 | Paper |
| Computing with Noisy Information | 1994-11-29 | Paper |
| An O (log N ) deterministic packet-routing scheme | 1994-11-13 | Paper |
| Near‐perfect token distribution | 1994-11-08 | Paper |
| Trading Space for Time in Undirected s-t Connectivity | 1994-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138977 | 1993-10-20 | Paper |
| Fault Tolerant Sorting Networks | 1992-06-27 | Paper |
| A trade-off between space and efficiency for routing tables | 1992-06-25 | Paper |
| Randomized broadcast in networks | 1990-01-01 | Paper |
| A Time-Randomness Trade-Off for Oblivious Routing | 1990-01-01 | Paper |
| Constructing disjoint paths on expander graphs | 1989-01-01 | Paper |
| The Token Distribution Problem | 1989-01-01 | Paper |
| The complexity of parallel search | 1988-01-01 | Paper |
| A tradeoff between search and update time for the implicit dictionary problem | 1988-01-01 | Paper |
| Parallel hashing | 1988-01-01 | Paper |
| Fault Tolerance in Networks of Bounded Degree | 1988-01-01 | Paper |
| The generalized packet routing problem | 1987-01-01 | Paper |
| How to share memory in a distributed system | 1987-01-01 | Paper |
| A Time-Space Tradeoff for Element Distinctness | 1987-01-01 | Paper |
| Constructing a perfect matching is in random NC | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725558 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745272 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217612 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3678667 | 1985-01-01 | Paper |
| Random hypergraph coloring algorithms and the weak chromatic number | 1985-01-01 | Paper |
| Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces | 1984-01-01 | Paper |
| Efficient Schemes for Parallel Communication | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3670591 | 1983-01-01 | Paper |
