| Publication | Date of Publication | Type |
|---|
| An approximate model of processor communication rings under heavy load | 2016-05-26 | Paper |
| Gated, Exhaustive, Parallel Service | 2007-01-19 | Paper |
| Tandem Conveyor Queues | 2007-01-19 | Paper |
| REDIALING POLICIES: OPTIMALITY AND SUCCESS PROBABILITIES | 2001-05-07 | Paper |
| Constrained arrangements of objects in a cycle | 1998-10-01 | Paper |
| Queues served by a rotating ring | 1996-01-15 | Paper |
| Coding with digits of unequal cost | 1995-12-04 | Paper |
| Increased information rate by oversampling | 1994-09-27 | Paper |
| A selection-replacement process on the circle | 1994-01-30 | Paper |
| The Gated Infinite-Server Queue: Uniform Service Times | 1993-05-16 | Paper |
| The Lempel-Ziv algorithm and message complexity | 1993-02-04 | Paper |
| Service by a Queue and a Cart | 1993-01-16 | Paper |
| Paths through a maze of rectangles | 1993-01-16 | Paper |
| Scheduling Checks and Saves | 1992-08-13 | Paper |
| A distributed clustering process | 1992-06-28 | Paper |
| How Things Float | 1992-06-27 | Paper |
| Optimal strategies for scheduling checkpoints and preventive maintenance | 1990-01-01 | Paper |
| A solvable routing problem | 1989-01-01 | Paper |
| Analysis of conveyor queue in a flexible manufacturing system | 1988-01-01 | Paper |
| Polling and greedy servers on a line | 1987-01-01 | Paper |
| On the Expected Relative Performance of List Scheduling | 1985-01-01 | Paper |
| Dynamic, first-fit packings in two or more dimensions | 1984-01-01 | Paper |
| Tiling Rectangles with Rectangles | 1982-01-01 | Paper |
| Reverberation between concentric spheres | 1982-01-01 | Paper |
| Multigram codes (Corresp.) | 1982-01-01 | Paper |
| Random Colorings of a Lattice of Squares in the Plane | 1980-01-01 | Paper |
| The Packing Problem for Twisted Pairs | 1979-01-01 | Paper |
| Doubly Orthogonal Concentrated Polynomials | 1977-01-01 | Paper |
| Estimators for distances | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4120590 | 1976-01-01 | Paper |
| Codes Which Detect Deception | 1974-01-01 | Paper |
| Distortion in Maps | 1974-01-01 | Paper |
| Codes based on inaccurate source probabilities | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5638894 | 1971-01-01 | Paper |
| How good is morse code? | 1969-01-01 | Paper |
| Steiner Minimal Trees | 1968-01-01 | Paper |
| Latin Squares which Contain No Repeated Digrams | 1965-01-01 | Paper |
| A Polygon Problem | 1965-01-01 | Paper |
| The probability of covering a sphere with N circular caps | 1965-01-01 | Paper |
| Random Minimal Trees | 1965-01-01 | Paper |
| Randomly Packed and Solidly Packed Spheres | 1964-01-01 | Paper |
| Cyclically permutable error-correcting codes | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5543202 | 1963-01-01 | Paper |
| Functions which Represent All Integers | 1963-01-01 | Paper |
| Random Subdivisions of Space into Crystals | 1962-01-01 | Paper |
| Random Plane Networks | 1961-01-01 | Paper |
| Symmetry types of periodic sequences | 1961-01-01 | Paper |
| Design of Mixed Doubles Tournaments | 1961-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3274428 | 1960-01-01 | Paper |
| Random Graphs | 1959-01-01 | Paper |
| Optimal Search Strategies | 1959-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3247626 | 1957-01-01 | Paper |
| Enumeration Of Labelled Graphs | 1956-01-01 | Paper |
| Lattice Theoretic Properties of Frontal Switching Functions | 1954-01-01 | Paper |
