| Publication | Date of Publication | Type |
|---|
| Constrained TSP and low-power computing | 2022-08-19 | Paper |
| Fast deflection routing for packets and worms | 2017-09-29 | Paper |
| On targeting Markov segments | 2016-09-29 | Paper |
| Efficient routing in all-optical networks | 2016-09-01 | Paper |
| The minimum latency problem | 2016-09-01 | Paper |
| Adversarial queuing theory | 2015-09-20 | Paper |
| Segmentation problems | 2015-08-01 | Paper |
| How much can hardware help routing? | 2015-05-07 | Paper |
| Some results of Christos Papadimitriou on internet structure, network routing, and web information | 2014-10-07 | Paper |
| Random walks with “back buttons” (extended abstract) | 2014-09-26 | Paper |
| Query strategies for priced information (extended abstract) | 2014-09-26 | Paper |
| Markov Layout | 2014-07-30 | Paper |
| Models for the Compressible Web | 2014-07-25 | Paper |
| Models for the Compressible Web | 2014-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2913803 | 2012-09-27 | Paper |
| Competitive recommendation systems | 2010-08-05 | Paper |
| Introduction to Information Retrieval | 2008-10-29 | Paper |
| Using PageRank to Characterize Web Structure | 2007-04-05 | Paper |
| Multidimensional cube packing | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808653 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470513 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4445609 | 2004-02-02 | Paper |
| Auditing Boolean attributes | 2003-06-25 | Paper |
| A theory of wormhole routing in parallel computers | 2003-06-25 | Paper |
| Random walks with ``back buttons | 2003-05-06 | Paper |
| More on random walks, electrical networks, and the harmonic \(k\)-server algorithm. | 2003-01-21 | Paper |
| A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542527 | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542566 | 2002-09-17 | Paper |
| Query strategies for priced information | 2002-09-12 | Paper |
| Recommendation systems: A probabilistic analysis | 2002-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228428 | 2002-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228430 | 2002-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729063 | 2001-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741480 | 2001-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234069 | 2001-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527029 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525681 | 2001-01-24 | Paper |
| Latent semantic indexing: A probabilistic analysis | 2000-12-19 | Paper |
| Markov Paging | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228491 | 2000-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945538 | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234082 | 1999-11-08 | Paper |
| Randomized query processing in robot path planning | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234081 | 1999-06-29 | Paper |
| Combinatorial and experimental results for randomized point matching algorithms | 1999-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230342 | 1999-06-15 | Paper |
| A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata | 1999-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226450 | 1999-01-27 | Paper |
| The electrical resistance of a graph captures its commute and cover times | 1999-01-19 | Paper |
| Stochastic Contention Resolution With Short Delays | 1998-09-21 | Paper |
| How much can hardware help routing? | 1998-02-17 | Paper |
| The Robot Localization Problem | 1998-02-10 | Paper |
| Time-space tradeoffs for undirected graph traversal by graph automata | 1997-10-13 | Paper |
| Navigating in Unfamiliar Geometric Terrain | 1997-08-07 | 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/Q4848595 | 1996-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845261 | 1996-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4856179 | 1995-11-23 | Paper |
| Competitive paging with locality of reference | 1995-06-08 | Paper |
| Computing with Noisy Information | 1994-11-29 | Paper |
| Trading Space for Time in Undirected s-t Connectivity | 1994-06-16 | Paper |
| Random walks on weighted graphs and applications to on-line algorithms | 1993-12-09 | Paper |
| Randomized algorithms and pseudorandom numbers | 1993-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138977 | 1993-10-20 | Paper |
| Fast geometric approximation techniques and geometric embedding problems | 1993-04-22 | Paper |
| Integer programming in VLSI design | 1993-01-17 | Paper |
| Optimal time bounds for some proximity problems in the plane | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010309 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010315 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010318 | 1992-09-27 | Paper |
| Deferred data structure for the nearest neighbor problem | 1992-06-28 | Paper |
| Multiterminal global routing: A deterministic approximation scheme | 1991-01-01 | Paper |
| Randomized broadcast in networks | 1990-01-01 | Paper |
| Multidimensional on-line bin packing: Algorithms and worst-case analysis | 1989-01-01 | Paper |
| Parallel graph algorithms that are efficients on average | 1989-01-01 | Paper |
| Probabilistic construction of deterministic algorithms: approximating packing integer programs | 1988-01-01 | Paper |
| Deferred Data Structuring | 1988-01-01 | Paper |
| Randomized rounding: A technique for provably good algorithms and algorithmic proofs | 1987-01-01 | Paper |
