| Publication | Date of Publication | Type |
|---|
| A generalization of binary search | 2023-01-18 | Paper |
| Reducibility among Combinatorial Problems | 2021-07-06 | Paper |
| Massively Parallel Computation of Matching and MIS in Sparse Graphs | 2021-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633848 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365067 | 2017-09-29 | Paper |
| Coding techniques for handling failures in large disk arrays | 2016-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501818 | 2015-08-14 | Paper |
| Mapping the genome | 2015-05-07 | Paper |
| Probabilistic Analysis of Linear Programming Decoding | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934677 | 2014-12-18 | Paper |
| Understanding science through the computational lens | 2014-02-06 | Paper |
| The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment | 2013-07-02 | Paper |
| Sorting and Selection in Posets | 2011-10-18 | Paper |
| Heuristic algorithms in computational molecular biology | 2011-01-18 | Paper |
| A stochastic process on the hypercube with applications to peer-to-peer networks | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579456 | 2010-08-06 | Paper |
| Scheduling parallel communication: The h-relation problem | 2010-06-17 | Paper |
| Reducibility Among Combinatorial Problems | 2010-06-03 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Prediction of phenotype information from genotype data | 2010-04-23 | Paper |
| On the price of heterogeneity in parallel systems | 2009-10-19 | Paper |
| My memories of David Gale | 2009-07-15 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Probabilistic Analysis of Linear Programming Decoding | 2009-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3598105 | 2009-01-30 | Paper |
| George Dantzig's impact on the theory of computation | 2008-10-29 | Paper |
| Streaming Algorithms for Selection and Approximate Sorting | 2008-04-24 | Paper |
| Reconstructing Chain Functions in Genetic Networks | 2007-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439687 | 2007-05-29 | Paper |
| A probabilistic model for the survivability of cells | 2006-06-29 | Paper |
| Optimization Problems Related to Internet Congestion Control | 2006-03-09 | Paper |
| The minimum-entropy set cover problem | 2006-01-09 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| On parallel evaluation of game trees | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4826649 | 2004-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473321 | 2004-08-04 | Paper |
| Coalescing times for IID random variables with applications to population biology | 2003-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414634 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542576 | 2002-08-01 | Paper |
| Optimal search and one-way trading online algorithms | 2002-05-14 | Paper |
| The Efficiency of Resolution and Davis--Putnam Procedures | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230356 | 2002-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712576 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790416 | 2001-01-01 | Paper |
| Parallel Sorting with Limited Bandwidth | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941836 | 2000-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231919 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252747 | 2000-04-26 | Paper |
| An Optimal Algorithm for Monte Carlo Estimation | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4704801 | 2000-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263945 | 1999-09-22 | Paper |
| Graph traversals, genes and matroids: An efficient case of the travelling salesman problem | 1999-03-22 | Paper |
| Mapping clones with a given ordering or interleaving | 1998-11-01 | Paper |
| Nearly Optimal Competitive Online Replacement Policies | 1998-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385522 | 1998-05-04 | Paper |
| The rank of sparse random matrices over finite fields | 1997-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128911 | 1997-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128919 | 1997-04-23 | Paper |
| A method for obtaining randomized algorithms with small tail probabilities | 1997-03-03 | Paper |
| Efficient PRAM simulation on a distributed memory machine | 1997-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875219 | 1996-09-22 | Paper |
| When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? | 1996-03-18 | Paper |
| Bounded branching process and and/or tree evaluation | 1995-12-18 | Paper |
| Physical mapping of chromosomes: A combinatorial problem in molecular biology | 1995-11-22 | Paper |
| A Graph-Theoretic Game and Its Application to the k-Server Problem | 1995-07-03 | Paper |
| Probabilistic recurrence relations | 1995-04-10 | Paper |
| Average Case Analysis of a Heuristic for the Assignment Problem | 1994-12-11 | Paper |
| Randomized parallel algorithms for backtrack search and branch-and-bound computation | 1994-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140441 | 1994-01-02 | Paper |
| Probabilistic Analysis of Network Flow Algorithms | 1993-06-29 | Paper |
| A Monte-Carlo Algorithm for Estimating the Permanent | 1993-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010305 | 1992-09-27 | Paper |
| Three-Stage Generalized Connectors | 1992-09-27 | Paper |
| An introduction to randomized algorithms | 1992-06-28 | Paper |
| Transitive compaction in parallel via branchings | 1991-01-01 | Paper |
| FFD bin packing for item sizes with uniform distributions on \([0,\frac12\).] | 1991-01-01 | Paper |
| Subtree isomorphism is in random NC | 1990-01-01 | Paper |
| The transitive closure of a random digraph | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3479517 | 1989-01-01 | Paper |
| Monte-Carlo approximation algorithms for enumeration problems | 1989-01-01 | Paper |
| The complexity of parallel search | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798258 | 1988-01-01 | Paper |
| Deferred Data Structuring | 1988-01-01 | Paper |
| Global wire routing in two-dimensional arrays | 1987-01-01 | Paper |
| A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3780760 | 1987-01-01 | Paper |
| Efficient randomized pattern-matching algorithms | 1987-01-01 | Paper |
| Constructing a perfect matching is in random NC | 1986-01-01 | Paper |
| Probabilistic analysis of optimum partitioning | 1986-01-01 | Paper |
| A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only | 1986-01-01 | Paper |
| Combinatorics, complexity, and randomness | 1986-01-01 | Paper |
| Monte-Carlo algorithms for the planar multiterminal network reliability problem | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3707785 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716814 | 1985-01-01 | Paper |
| A fast parallel algorithm for the maximal independent set problem | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3707402 | 1984-01-01 | Paper |
| Searching for an optimal path in a tree with random costs | 1983-01-01 | Paper |
| On the Security of Ping-Pong Protocols | 1983-01-01 | Paper |
| On Linear Characterizations of Combinatorial Optimization Problems | 1982-01-01 | Paper |
| Turing machines that take advice | 1982-01-01 | Paper |
| Dynamic programming meets the principle of inclusion and exclusion | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318111 | 1982-01-01 | Paper |
| On the security of ping-pong protocols | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3957950 | 1982-01-01 | Paper |
| Parametric shortest path algorithms with an application to cyclic staffing | 1981-01-01 | Paper |
| The complexity of testing whether a graph is a superconcentrator | 1981-01-01 | Paper |
| An algorithm to solve them ×n assignment problem in expected timeO(mn logn) | 1980-01-01 | Paper |
| Linear expected-time algorithms for connectivity problems | 1980-01-01 | Paper |
| A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3865476 | 1979-01-01 | Paper |
| A characterization of the minimum cycle mean in a digraph | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4173215 | 1978-01-01 | Paper |
| Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane | 1977-01-01 | Paper |
| On the Optimality of Huffman Trees | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4144785 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4146242 | 1976-01-01 | Paper |
| Two special cases of the assignment problem | 1975-01-01 | Paper |
| On the Computational Complexity of Combinatorial Problems | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4142699 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4148017 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5666587 | 1973-01-01 | Paper |
| An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs | 1973-01-01 | Paper |
| A simple derivation of edmonds' algorithm for optimum branchings | 1972-01-01 | Paper |
| A phenomenon in the theory of sorting | 1972-01-01 | Paper |
| Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125823 | 1972-01-01 | Paper |
| The traveling-salesman problem and minimum spanning trees: Part II | 1971-01-01 | Paper |
| The Traveling-Salesman Problem and Minimum Spanning Trees | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5661340 | 1970-01-01 | Paper |
| Parallel program schemata | 1969-01-01 | Paper |
| Parallel minimax search for a maximum | 1967-01-01 | Paper |
| A criterion for planarity of the square of a graph | 1967-01-01 | Paper |
| Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines | 1967-01-01 | Paper |
| Finite-State Processes and Dynamic Programming | 1967-01-01 | Paper |
| The Organization of Computations for Uniform Recurrence Equations | 1967-01-01 | Paper |
| On Nonterminating Stochastic Games | 1966-01-01 | Paper |
| Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing | 1966-01-01 | Paper |
| Index Register Allocation | 1966-01-01 | Paper |
| Some Techniques of State Assignment for Synchronous Sequential Machines | 1965-01-01 | Paper |
| Assembly-Line Balancing—Dynamic Programming with Precedence Constraints | 1963-01-01 | Paper |
| Functional Decomposition and Switching Circuit Design | 1963-01-01 | Paper |
| A Dynamic Programming Approach to Sequencing Problems | 1962-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3280457 | 1961-01-01 | Paper |
