| Publication | Date of Publication | Type |
|---|
On the convergence of upperbBound techniques for the average length of longest common subsequences
2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Improved bounds on the average length of longest common subsequences
Journal of the ACM | 2015-11-11 | Paper |
Maximization problems on graphs with edge weights chosen from a normal distribution (extended abstract)
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Approximation algorithms for extensible bin packing
Journal of Scheduling | 2007-05-15 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
| scientific article; zbMATH DE number 2079331 (Why is no real title available?) | 2004-07-28 | Paper |
| Approximation algorithms for extensible bin packing | 2003-06-19 | Paper |
The minimum expectation selection problem
Random Structures & Algorithms | 2003-03-19 | Paper |
Packing random rectangles
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2002-05-02 | Paper |
| scientific article; zbMATH DE number 1512697 (Why is no real title available?) | 2000-10-03 | Paper |
Average-Case Analysis of Off-Line and On-Line Knapsack Problems
Journal of Algorithms | 1999-01-17 | Paper |
| Exponentially small bounds on the expected optimum of the partition and subset sum problems | 1998-03-31 | Paper |
| scientific article; zbMATH DE number 910873 (Why is no real title available?) | 1996-10-13 | Paper |
More analysis of double hashing
Combinatorica | 1993-08-16 | Paper |
| scientific article; zbMATH DE number 176070 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 52589 (Why is no real title available?) | 1992-09-18 | Paper |
Linear Programming with Two Variables Per Inequality in Poly-Log Time
SIAM Journal on Computing | 1990-01-01 | Paper |
Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
Management Science | 1988-01-01 | Paper |
A note on the average-case behavior of a simple differencing method for partitioning
Operations Research Letters | 1987-01-01 | Paper |
Probabilistic analysis of optimum partitioning
Journal of Applied Probability | 1986-01-01 | Paper |
Adding range restriction capability to dynamic data structures
Journal of the ACM | 1985-01-01 | Paper |
A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors
Mathematics of Operations Research | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3768966 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 4057285 (Why is no real title available?) | 1982-01-01 | Paper |
A data structure for dynamic range queries
Information Processing Letters | 1982-01-01 | Paper |
Bin packing can be solved within 1+epsilon in linear time
Combinatorica | 1981-01-01 | Paper |
Optimization Problems on Graphs with Independent Random Edge Weights
SIAM Journal on Computing | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3731331 (Why is no real title available?) | 1980-01-01 | Paper |
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
Journal of the ACM | 1979-01-01 | Paper |
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Journal of Computer and System Sciences | 1976-01-01 | Paper |
Algorithmic Aspects of Vertex Elimination on Graphs
SIAM Journal on Computing | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3679885 (Why is no real title available?) | 1975-01-01 | Paper |
