| Publication | Date of Publication | Type |
|---|
| Understanding Computation | 2024-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5010291 | 2021-08-25 | Paper |
| Understand Mathematics, Understand Computing | 2020-12-07 | Paper |
| Scheduling DAGs opportunistically: the dream and the reality circa 2016 | 2018-01-11 | Paper |
| GUIDELINES FOR DATA-PARALLEL CYCLE-STEALING IN NETWORKS OF WORKSTATIONS II: ON MAXIMIZING GUARANTEED OUTPUT | 2015-04-29 | Paper |
| ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA | 2014-11-14 | Paper |
| Static strategies for worksharing with unrecoverable interruptions | 2013-10-21 | Paper |
| On clustering \textsc{Dag}s for task-hungry computing platforms | 2012-12-06 | Paper |
| The Parking Problem for Finite-State Robots | 2012-12-04 | Paper |
| On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules | 2012-10-23 | Paper |
| Extending IC-scheduling via the sweep algorithm | 2012-03-07 | Paper |
| Static worksharing strategies for heterogeneous computers with unrecoverable interruptions | 2011-11-10 | Paper |
| HETEROGENEITY IN COMPUTING: INSIGHTS FROM A WORKSHARING SCHEDULING PROBLEM | 2011-10-10 | Paper |
| APPLICATION PLACEMENT ON A CLUSTER OF SERVERS | 2011-01-06 | Paper |
| The pillars of computation theory. State, encoding, nondeterminism | 2009-11-30 | Paper |
| On ``exploiting node-heterogeneous clusters optimally | 2008-06-06 | Paper |
| EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE | 2005-10-19 | Paper |
| AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE | 2005-09-12 | Paper |
| Efficient trigger-broadcasting in heterogeneous clusters | 2005-06-01 | Paper |
| Obituary: Shimon Even, June 15, 1935 -- May 1, 2004 | 2004-10-01 | Paper |
| On bufferless routing of variable length messages in leveled networks | 2003-11-02 | Paper |
| Scheduling time-constrained communication in linear networks | 2003-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2748499 | 2001-10-15 | Paper |
| An empirical study of dynamic scheduling on rings of processors | 2000-01-12 | Paper |
| A tight layout of the butterfly network | 1998-09-27 | Paper |
| Monochromatic Paths and Triangulated Graphs | 1998-09-21 | Paper |
| Work-preserving emulations of fixed-connection networks | 1998-01-22 | Paper |
| Optimal emulations by butterfly-like networks | 1998-01-21 | Paper |
| Salvage-Embeddings of Complete Trees | 1996-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273613 | 1994-05-06 | Paper |
| Product-shuffle networks: Toward reconciling shuffles and butterflies | 1993-01-16 | Paper |
| Comparing Queues and Stacks As Machines for Laying Out Graphs | 1993-01-16 | Paper |
| Laying Out Graphs Using Queues | 1992-12-06 | Paper |
| Efficient Embeddings of Trees in Hypercubes | 1992-06-28 | Paper |
| Exposing graph uniformities via algebraic specification | 1992-06-25 | Paper |
| Partitioning circuits for improved testability | 1991-01-01 | Paper |
| Optimal embeddings of butterfly-like graphs in the hypercube | 1990-01-01 | Paper |
| Group Action Graphs and Parallel Architectures | 1990-01-01 | Paper |
| Universal Graphs for Bounded-Degree Trees and Planar Graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732117 | 1989-01-01 | Paper |
| Vertex Types in Book-Embeddings | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798268 | 1988-01-01 | Paper |
| Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727875 | 1986-01-01 | Paper |
| Minced trees, with applications to fault-tolerant VLSI processor arrays | 1986-01-01 | Paper |
| Three-Dimensional Circuit Layouts | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3754632 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3780900 | 1986-01-01 | Paper |
| Binary search trees with binary comparison cost | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3694700 | 1984-01-01 | Paper |
| Bandwidth and pebbling | 1983-01-01 | Paper |
| Three-Dimensional VLSI | 1983-01-01 | Paper |
| Perfect Storage Representations for Families of Data Structures | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313788 | 1983-01-01 | Paper |
| Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing | 1983-01-01 | Paper |
| Cost Trade-offs in Graph Embeddings, with Applications | 1983-01-01 | Paper |
| Stabbing line segments | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3315440 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3335001 | 1982-01-01 | Paper |
| Graphs That are Almost Binary Trees | 1982-01-01 | Paper |
| On Embedding Rectangular Grids in Square Grids | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3898013 | 1981-01-01 | Paper |
| Time- and space-optimality in B-trees | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3914447 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3953170 | 1981-01-01 | Paper |
| Uniform data encodings | 1980-01-01 | Paper |
| External Hashing Schemes for Collections of Data Structures | 1980-01-01 | Paper |
| On computing distances between leaves in a complete tree | 1980-01-01 | Paper |
| Optimal 2,3-Trees | 1979-01-01 | Paper |
| Optimal 2,3-Trees | 1979-01-01 | Paper |
| A note on paths embedded in trees | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3853630 | 1979-01-01 | Paper |
| Encoding Data Structures in Trees | 1979-01-01 | Paper |
| Storage representations for tree-like data structures | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4192988 | 1979-01-01 | Paper |
| Data encodings and their costs | 1978-01-01 | Paper |
| Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials | 1978-01-01 | Paper |
| Polynomial indexing of integer lattice-points. II. Nonexistence results for higher-degree polynomials | 1978-01-01 | Paper |
| Minimal-Comparison $2,3$-Trees | 1978-01-01 | Paper |
| Bounds on the costs of data encodings | 1978-01-01 | Paper |
| Storage schemes for boundedly extendible arrays | 1977-01-01 | Paper |
| On storing concatenable arrays | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206327 | 1977-01-01 | Paper |
| On storing ragged arrays by hashing | 1977-01-01 | Paper |
| Hashing Schemes for Extendible Arrays | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195962 | 1977-01-01 | Paper |
| On storing arbitrarily many extendible arrays of arbitrary dimensions | 1975-01-01 | Paper |
| What Is a Multilevel Array? | 1975-01-01 | Paper |
| Generalized addressing schemes for data graphs | 1975-01-01 | Paper |
| Preserving Proximity in Arrays | 1975-01-01 | Paper |
| Managing Storage for Extendible Arrays | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133106 | 1975-01-01 | Paper |
| An extrinsic characterization of addressable data graphs | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4041107 | 1974-01-01 | Paper |
| Allocating Storage for Extendible Arrays | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4050161 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134934 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068076 | 1973-01-01 | Paper |
| Suffixes of addressable data graphs | 1973-01-01 | Paper |
| Symmetries in Data Graphs | 1972-01-01 | Paper |
| Addressable Data Graphs | 1972-01-01 | Paper |
| Real-Time Simulation of Multihead Tape Units | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125823 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5685636 | 1971-01-01 | Paper |
| Data graphs and addressing schemes | 1971-01-01 | Paper |
| A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5628110 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5632134 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5633662 | 1970-01-01 | Paper |
| Time-restricted sequence generation | 1970-01-01 | Paper |
| Counter machines and counter languages | 1968-01-01 | Paper |
| On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages | 1968-01-01 | Paper |
| Real-time solutions of the origin-crossing problem | 1968-01-01 | Paper |
| Multitape one-way nonwriting automata | 1968-01-01 | Paper |
| A machine realization of the linear context-free languages | 1967-01-01 | Paper |
| Real-Time Definable Languages | 1967-01-01 | Paper |
| Multitape finite automata with rewind instructions | 1967-01-01 | Paper |
| On Multi-Head Finite Automata | 1966-01-01 | Paper |
