| Publication | Date of Publication | Type |
|---|
| Near-perfect token distribution | 2019-12-04 | Paper |
| Balanced allocations (extended abstract) | 2016-09-01 | Paper |
| Multidimensional balanced allocations | 2014-10-13 | Paper |
| Optimal plans for aggregation | 2014-07-25 | Paper |
| The Hiring Problem and Lake Wobegon Strategies | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579460 | 2010-08-06 | Paper |
| Algorithmic Challenge in Online Advertising | 2009-07-02 | Paper |
| Workshop on Algorithms and Models for the Web Graph | 2008-08-19 | Paper |
| Modelling and Mining of Networked Information Spaces | 2008-08-19 | Paper |
| Margin Based Active Learning | 2008-01-03 | Paper |
| A derandomization using min-wise independent permutations | 2007-04-26 | Paper |
| Network Applications of Bloom Filters: A Survey | 2005-05-03 | Paper |
| Concurrent threads and optimal parallel minimum spanning trees algorithm | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552037 | 2002-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542551 | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230343 | 2002-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723935 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761355 | 2001-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527020 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941821 | 2000-12-03 | Paper |
| Min-wise independent permutations | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952611 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952672 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705352 | 1999-12-19 | Paper |
| Balanced Allocations | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252384 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228488 | 1999-05-18 | Paper |
| Optimal Construction of Edge-Disjoint Paths in Random Graphs | 1998-09-21 | Paper |
| Counting Minimum Weight Spanning Trees | 1997-08-25 | 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 |
| Biased random walks | 1996-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858436 | 1995-12-13 | Paper |
| On-line load balancing | 1995-04-04 | Paper |
| Finding hidden hamiltonian cycles | 1995-03-20 | 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 |
| Near‐perfect token distribution | 1994-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138877 | 1994-09-19 | Paper |
| Trading Space for Time in Undirected s-t Connectivity | 1994-06-16 | Paper |
| On the problem of approximating the number of bases of a matroid | 1994-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140447 | 1993-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138977 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972530 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3977586 | 1992-06-25 | Paper |
| The cost distribution of clustering in random probing | 1990-01-01 | Paper |
| Bounds on the cover time | 1989-01-01 | Paper |
| Efficient fault-tolerant routings in networks | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3702189 | 1985-01-01 | Paper |
| On the performance of edited nearest neighbor rules in high dimensions | 1985-01-01 | Paper |
| The \(r\)-Stirling numbers | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5184920 | 1983-01-01 | Paper |
