| Publication | Date of Publication | Type |
|---|
Cellular antomata
Advances in Complex Systems | 2024-06-14 | Paper |
Understanding Computation
Texts in Computer Science | 2024-01-05 | Paper |
Bio-inspired pattern processing by cellular ANTomata
| 2021-08-25 | Paper |
Understand mathematics, understand computing. Discrete mathematics that all computing students should know
| 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
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
On scheduling series-parallel DAGs to maximize area
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
Static strategies for worksharing with unrecoverable interruptions
Theory of Computing Systems | 2013-10-21 | Paper |
On clustering \textsc{Dag}s for task-hungry computing platforms
Central European Journal of Computer Science | 2012-12-06 | Paper |
The Parking Problem for Finite-State Robots
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
Journal of Parallel and Distributed Computing | 2012-10-23 | Paper |
Extending IC-scheduling via the sweep algorithm
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
Static worksharing strategies for heterogeneous computers with unrecoverable interruptions
Parallel Computing | 2011-11-10 | Paper |
Heterogeneity in computing: insights from a worksharing scheduling problem
International Journal of Foundations of Computer Science | 2011-10-10 | Paper |
APPLICATION PLACEMENT ON A CLUSTER OF SERVERS
International Journal of Foundations of Computer Science | 2011-01-06 | Paper |
The pillars of computation theory. State, encoding, nondeterminism
Universitext | 2009-11-30 | Paper |
On ``exploiting node-heterogeneous clusters optimally
Theory of Computing Systems | 2008-06-06 | Paper |
EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE
International Journal of Foundations of Computer Science | 2005-09-12 | Paper |
Efficient trigger-broadcasting in heterogeneous clusters
Journal of Parallel and Distributed Computing | 2005-06-01 | Paper |
Obituary: Shimon Even, June 15, 1935 -- May 1, 2004
Theory of Computing Systems | 2004-10-01 | Paper |
On bufferless routing of variable length messages in leveled networks
IEEE Transactions on Computers | 2003-11-02 | Paper |
Scheduling time-constrained communication in linear networks
Theory of Computing Systems | 2003-05-04 | Paper |
Graph separators, with applications
| 2001-10-15 | Paper |
An empirical study of dynamic scheduling on rings of processors
Parallel Computing | 2000-01-12 | Paper |
A tight layout of the butterfly network
Theory of Computing Systems | 1998-09-27 | Paper |
Monochromatic Paths and Triangulated Graphs
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
Work-preserving emulations of fixed-connection networks
Journal of the ACM | 1998-01-22 | Paper |
Optimal emulations by butterfly-like networks
Journal of the ACM | 1998-01-21 | Paper |
Salvage-Embeddings of Complete Trees
SIAM Journal on Discrete Mathematics | 1996-02-20 | Paper |
scientific article; zbMATH DE number 475367 (Why is no real title available?)
| 1994-05-06 | Paper |
Product-shuffle networks: Toward reconciling shuffles and butterflies
Discrete Applied Mathematics | 1993-01-16 | Paper |
Comparing Queues and Stacks As Machines for Laying Out Graphs
SIAM Journal on Discrete Mathematics | 1993-01-16 | Paper |
Laying Out Graphs Using Queues
SIAM Journal on Computing | 1992-12-06 | Paper |
Efficient Embeddings of Trees in Hypercubes
SIAM Journal on Computing | 1992-06-28 | Paper |
Exposing graph uniformities via algebraic specification
Mathematical Systems Theory | 1992-06-25 | Paper |
Partitioning circuits for improved testability
Algorithmica | 1991-01-01 | Paper |
Group Action Graphs and Parallel Architectures
SIAM Journal on Computing | 1990-01-01 | Paper |
Optimal embeddings of butterfly-like graphs in the hypercube
Mathematical Systems Theory | 1990-01-01 | Paper |
Vertex Types in Book-Embeddings
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
Universal Graphs for Bounded-Degree Trees and Planar Graphs
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4117862 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4064519 (Why is no real title available?)
| 1988-01-01 | Paper |
Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
Three-Dimensional Circuit Layouts
SIAM Journal on Computing | 1986-01-01 | Paper |
scientific article; zbMATH DE number 4043769 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3959290 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 4002118 (Why is no real title available?)
| 1986-01-01 | Paper |
Minced trees, with applications to fault-tolerant VLSI processor arrays
Mathematical Systems Theory | 1986-01-01 | Paper |
Binary search trees with binary comparison cost
International Journal of Computer & Information Sciences | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3919826 (Why is no real title available?)
| 1984-01-01 | Paper |
Three-Dimensional VLSI
Journal of the ACM | 1983-01-01 | Paper |
Cost Trade-offs in Graph Embeddings, with Applications
Journal of the ACM | 1983-01-01 | Paper |
Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing
IEEE Transactions on Computers | 1983-01-01 | Paper |
Bandwidth and pebbling
Computing | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3843670 (Why is no real title available?)
| 1983-01-01 | Paper |
Perfect Storage Representations for Families of Data Structures
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
Stabbing line segments
BIT | 1982-01-01 | Paper |
On Embedding Rectangular Grids in Square Grids
IEEE Transactions on Computers | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3868632 (Why is no real title available?)
| 1982-01-01 | Paper |
Graphs That are Almost Binary Trees
SIAM Journal on Computing | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3845502 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3725713 (Why is no real title available?)
| 1981-01-01 | Paper |
Time- and space-optimality in B-trees
ACM Transactions on Database Systems | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3705891 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3772947 (Why is no real title available?)
| 1981-01-01 | Paper |
Uniform data encodings
Theoretical Computer Science | 1980-01-01 | Paper |
External Hashing Schemes for Collections of Data Structures
Journal of the ACM | 1980-01-01 | Paper |
On computing distances between leaves in a complete tree
International Journal of Computer Mathematics | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3631948 (Why is no real title available?)
| 1979-01-01 | Paper |
Encoding Data Structures in Trees
Journal of the ACM | 1979-01-01 | Paper |
Storage representations for tree-like data structures
Mathematical Systems Theory | 1979-01-01 | Paper |
Optimal 2,3-Trees
SIAM Journal on Computing | 1979-01-01 | Paper |
Optimal 2,3-Trees
SIAM Journal on Computing | 1979-01-01 | Paper |
A note on paths embedded in trees
Information Processing Letters | 1979-01-01 | Paper |
scientific article; zbMATH DE number 3654123 (Why is no real title available?)
| 1979-01-01 | Paper |
Bounds on the costs of data encodings
Mathematical Systems Theory | 1978-01-01 | Paper |
Data encodings and their costs
Acta Informatica | 1978-01-01 | Paper |
Minimal-Comparison $2,3$-Trees
SIAM Journal on Computing | 1978-01-01 | Paper |
Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials
Journal of Number Theory | 1978-01-01 | Paper |
Polynomial indexing of integer lattice-points. II. Nonexistence results for higher-degree polynomials
Journal of Number Theory | 1978-01-01 | Paper |
On storing ragged arrays by hashing
Mathematical Systems Theory | 1977-01-01 | Paper |
Storage schemes for boundedly extendible arrays
Acta Informatica | 1977-01-01 | Paper |
On storing concatenable arrays
Journal of Computer and System Sciences | 1977-01-01 | Paper |
Hashing Schemes for Extendible Arrays
Journal of the ACM | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3635514 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3648137 (Why is no real title available?)
| 1977-01-01 | Paper |
On storing arbitrarily many extendible arrays of arbitrary dimensions
International Journal of Computer & Information Sciences | 1975-01-01 | Paper |
Generalized addressing schemes for data graphs
Mathematical Systems Theory | 1975-01-01 | Paper |
Preserving Proximity in Arrays
SIAM Journal on Computing | 1975-01-01 | Paper |
Managing Storage for Extendible Arrays
SIAM Journal on Computing | 1975-01-01 | Paper |
scientific article; zbMATH DE number 3557205 (Why is no real title available?)
| 1975-01-01 | Paper |
What Is a Multilevel Array?
IBM Journal of Research and Development | 1975-01-01 | Paper |
scientific article; zbMATH DE number 3464853 (Why is no real title available?)
| 1974-01-01 | Paper |
scientific article; zbMATH DE number 3562489 (Why is no real title available?)
| 1974-01-01 | Paper |
Allocating Storage for Extendible Arrays
Journal of the ACM | 1974-01-01 | Paper |
An extrinsic characterization of addressable data graphs
Discrete Mathematics | 1974-01-01 | Paper |
scientific article; zbMATH DE number 3454814 (Why is no real title available?)
| 1974-01-01 | Paper |
scientific article; zbMATH DE number 3485191 (Why is no real title available?)
| 1973-01-01 | Paper |
Suffixes of addressable data graphs
Information and Control | 1973-01-01 | Paper |
scientific article; zbMATH DE number 3551946 (Why is no real title available?)
| 1972-01-01 | Paper |
Real-Time Simulation of Multihead Tape Units
Journal of the ACM | 1972-01-01 | Paper |
Symmetries in Data Graphs
SIAM Journal on Computing | 1972-01-01 | Paper |
Addressable Data Graphs
Journal of the ACM | 1972-01-01 | Paper |
scientific article; zbMATH DE number 3423558 (Why is no real title available?)
| 1971-01-01 | Paper |
Data graphs and addressing schemes
Journal of Computer and System Sciences | 1971-01-01 | Paper |
A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets
Journal of the ACM | 1970-01-01 | Paper |
scientific article; zbMATH DE number 3353261 (Why is no real title available?)
| 1970-01-01 | Paper |
scientific article; zbMATH DE number 3358015 (Why is no real title available?)
| 1970-01-01 | Paper |
scientific article; zbMATH DE number 3359798 (Why is no real title available?)
| 1970-01-01 | Paper |
Time-restricted sequence generation
Journal of Computer and System Sciences | 1970-01-01 | Paper |
Counter machines and counter languages
Mathematical Systems Theory | 1968-01-01 | Paper |
Multitape one-way nonwriting automata
Journal of Computer and System Sciences | 1968-01-01 | Paper |
Real-time solutions of the origin-crossing problem
Mathematical Systems Theory | 1968-01-01 | Paper |
On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages
Journal of the ACM | 1968-01-01 | Paper |
Real-Time Definable Languages
Journal of the ACM | 1967-01-01 | Paper |
A machine realization of the linear context-free languages
Information and Control | 1967-01-01 | Paper |
Multitape finite automata with rewind instructions
Journal of Computer and System Sciences | 1967-01-01 | Paper |
On Multi-Head Finite Automata
IBM Journal of Research and Development | 1966-01-01 | Paper |
