Arnold L. Rosenberg

According to our database1, Arnold L. Rosenberg
  • authored at least 217 papers between 1964 and 2018.
  • has a "Dijkstra number"2 of three.

Awards

ACM Fellow

ACM Fellow 1996, "For contributions to the study of graph-theoretic models of computation, emphasizing theoretical studies of parallel algorithms and architectures, VLSI design and layout, and data structures.".

IEEE Fellow

IEEE Fellow 1997, "For fundamental contributions to theoretical aspects of computer science and engineering.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Bio-Inspired Pattern Processing by Cellular ANTomata.
J. Cellular Automata, 2018

2017
50 Years of TOCS.
Theory Comput. Syst., 2017

Scheduling DAG-based workflows on single cloud instances: High-performance and cost effectiveness with a static scheduler.
IJHPCA, 2017

2016
Scheduling Matters: Area-Oriented Heuristic for Resource Management.
Proceedings of the 28th International Symposium on Computer Architecture and High Performance Computing, 2016

Cellular ANTomata as Engines for Highly Parallel Pattern Processing.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2016

Scheduling DAGs Opportunistically: The Dream and the Reality Circa 2016.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015
An AREA-Oriented Heuristic for Scheduling DAGs on Volatile Computing Platforms.
IEEE Trans. Parallel Distrib. Syst., 2015

On constructing DAG-schedules with large areas.
Concurrency and Computation: Practice and Experience, 2015

2014
On Scheduling Series-Parallel DAGs to Maximize Area.
Int. J. Found. Comput. Sci., 2014

Region Management by Finite-State Robots.
Comput. J., 2014

NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates (abstract only).
Proceedings of the 45th ACM Technical Symposium on Computer Science Education, 2014

On Constructing DAG-Schedules with Large AREAs.
Proceedings of the Euro-Par 2014 Parallel Processing, 2014

2013
Static Strategies for Worksharing with Unrecoverable Interruptions.
Theory Comput. Syst., 2013

Finite-State Robots in a Warehouse: Achieving Linear Parallel Speedup While Rearranging Objects.
Proceedings of the 42nd International Conference on Parallel Processing, 2013

2012
On scheduling dag s for volatile computing platforms: Area-maximizing schedules.
J. Parallel Distrib. Comput., 2012

The Parking Problem for Finite-State Robots.
J. Graph Algorithms Appl., 2012

Cellular ANTomata.
Advances in Complex Systems, 2012

Finite-State Robots in the Land of Rationalia.
Proceedings of the Computer and Information Sciences III, 2012

2011
Static worksharing strategies for heterogeneous computers with unrecoverable interruptions.
Parallel Computing, 2011

Heterogeneity in Computing: Insights from a Worksharing Scheduling Problem.
Int. J. Found. Comput. Sci., 2011

On clustering DAGs for task-hungry computing platforms.
Central Europ. J. Computer Science, 2011

NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates.
Proceedings of the 42nd ACM technical symposium on Computer science education, 2011

Greedy "Exploitation" Is Close to Optimal on Node-Heterogeneous Clusters.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

Assessing the Computational Benefits of AREA-Oriented DAG-Scheduling.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

Introduction.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

2010
Extending IC-scheduling via the Sweep Algorithm.
J. Parallel Distrib. Comput., 2010

Toward understanding heterogeneity in computing.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Statistical predictors of computing power in heterogeneous clusters.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Link-heterogeneity vs. node-heterogeneity in clusters.
Proceedings of the 2010 International Conference on High Performance Computing, 2010

Ants in Parking Lots.
Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

Area-Maximizing Schedules for Series-Parallel DAGs.
Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

The Pillars of Computation Theory - State, Encoding, Nondeterminism.
Springer, ISBN: 978-0-387-09638-4, 2010

2009
Path-robust multi-channel wireless networks.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

On scheduling dags to maximize area.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Static strategies forworksharing with unrecoverable interruptions.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures.
Proceedings of the Euro-Par 2009, 2009

2008
On "Exploiting" Node-Heterogeneous Clusters Optimally.
Theory Comput. Syst., 2008

A "Big-Ideas" Computation Theory Course for the Undergraduate.
Bulletin of the EATCS, 2008

Extending IC-Scheduling via the Sweep Algorithm.
Proceedings of the 16th Euromicro International Conference on Parallel, 2008

On Clustering Tasks in IC-Optimal Dags.
Proceedings of the 2008 International Conference on Parallel Processing, 2008

Cellular ANTomata: Food-Finding and Maze-Threading.
Proceedings of the 2008 International Conference on Parallel Processing, 2008

2007
Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories.
IEEE Trans. Parallel Distrib. Syst., 2007

Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality.
IEEE Trans. Parallel Distrib. Syst., 2007

Best Paper Award recipients: 2006 International Parallel and Distributed Processing Symposium.
J. Parallel Distrib. Comput., 2007

Application Placement on a Cluster of Servers.
Int. J. Found. Comput. Sci., 2007

A Tool for Prioritizing DAGMan Jobs and its Evaluation.
J. Grid Comput., 2007

Bounding damage from link destruction, with application to the internet.
Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2007

Cellular ANTomata.
Proceedings of the Parallel and Distributed Processing and Applications, 2007

A Comparison of Dag-Scheduling Strategies for Internet-Based Computing.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Applying IC-Scheduling Theory to Familiar Classes of Computations.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

2006
Toward a Theory for Scheduling Dags in Internet-Based Computing.
IEEE Trans. Computers, 2006

On Scheduling Expansive and Reductive Dags for Internet-Based Computing.
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

A Tool for Prioritizing DAGMan Jobs and Its Evaluation.
Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, 2006

State.
Proceedings of the Theoretical Computer Science, 2006

A Pebble Game for Internet-Based Computing.
Proceedings of the Theoretical Computer Science, 2006

Changing Challenges for Collaborative Algorithmics.
Proceedings of the Handbook of Nature-Inspired and Innovative Computing, 2006

2005
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing.
IEEE Trans. Computers, 2005

Efficient trigger-broadcasting in heterogeneous clusters.
J. Parallel Distrib. Comput., 2005

An algorithmic model for heterogeneous hyper-clusters: rationale and experience.
Int. J. Found. Comput. Sci., 2005

Foreword.
Int. J. Found. Comput. Sci., 2005

Foreword.
Int. J. Found. Comput. Sci., 2005

On Scheduling Complex Dags for Internet-Based Computing.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

The Changing Challenges of Collaborative Algorithmics.
Proceedings of the High Performance Computing, 2005

Batch-Scheduling Dags for Internet-Based Computing.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

On the cost-ineffectiveness of redundancy in commercial P2P computing.
Proceedings of the 12th ACM Conference on Computer and Communications Security, 2005

2004
On Scheduling Mesh-Structured Computations for Internet-Based Computing.
IEEE Trans. Computers, 2004

Obituary: Shimon Even.
Theory Comput. Syst., 2004

An Algorithmic Model for Heterogeneous Clusters: Rationale and Experience.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Comparing the Structure of Power-Law Graphs and the Internet AS Graph.
Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP 2004), 2004

How to Share a Bag of Tasks Optimally in a Heterogeneous Cluster - Three Models, Three Answers.
Proceedings of the Proceedings 37th Annual Simulation Symposium (ANSS-37 2004), 2004

Application Placement on a Cluster of Servers.
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

On Scheduling Computation-Dags for Internet-Based Computing.
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2003
Accountable Web-Computing.
IEEE Trans. Parallel Distrib. Syst., 2003

Efficient Pairing Functions - and Why You Should Care.
Int. J. Found. Comput. Sci., 2003

Optimal sharing of bags of tasks in heterogeneous clusters.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

To BSP or not to BSP in Heterogeneous NOWs.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

On Scheduling Collaborative Computations on the Internet, I: Mesh-Dags and Their Close Relatives.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Planned Object Duplication Strategies in Dynamic PRR Meshes.
Proceedings of the 11th IEEE International Conference on Network Protocols (ICNP 2003), 2003

c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?".
Proceedings of the Proceedings 36th Annual Simulation Symposium (ANSS-36 2003), Orlando, Florida, March 30, 2003

2002
Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload.
IEEE Trans. Parallel Distrib. Syst., 2002

Scheduling Time-Constrained Communication in Linear Networks.
Theory Comput. Syst., 2002

Efficient Pairing Functions - And Why You Should Care.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

Accountable Web-Computing.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

Using the Compiler to Improve Cache Replacement Decisions.
Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (PACT 2002), 2002

2001
Augmented Ring Networks.
IEEE Trans. Parallel Distrib. Syst., 2001

Finding Topic Words for Hierarchical Summarization.
Proceedings of the SIGIR 2001: Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2001

HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better.
Proceedings of the 2001 IEEE International Conference on Cluster Computing (CLUSTER 2001), 2001

Graph separators with applications.
Frontiers of computer science, Kluwer, ISBN: 978-0-306-46464-5, 2001

2000
Editorial Message.
Theory Comput. Syst., 2000

Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations II: On Maximizing Guaranteed Output.
Int. J. Found. Comput. Sci., 2000

Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract).
SPAA, 2000

Optimal Sharing of Partitionable Workloads in Heterogeneous Networks of Workstations.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1999
Using Emulations to Enhance the Performance of Parallel Architectures.
IEEE Trans. Parallel Distrib. Syst., 1999

Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments.
IEEE Trans. Parallel Distrib. Syst., 1999

An empirical study of dynamic scheduling on rings of processors.
Parallel Computing, 1999

Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations I: On Maximizing Expected Output.
J. Parallel Distrib. Comput., 1999

Augmented Ring Networks.
Proceedings of the SIROCCO'99, 1999

Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

1998
Monochromatic Paths and Triangulated Graphs.
SIAM J. Discrete Math., 1998

A Tight Layout of the Butterfly Network.
Theory Comput. Syst., 1998

Scheduling Time-Constrained Communication in Linear Networks.
SPAA, 1998

Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations.
IPPS/SPDP, 1998

1997
The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations.
IEEE Trans. Computers, 1997

An Optimal Strategies for Cycle-Stealing in Networks of Workstations.
IEEE Trans. Computers, 1997

Work-preserving emulations of fixed-connection networks.
J. ACM, 1997

Theoretical research on networks: models and methodology.
Proceedings of the SIROCCO'97, 1997

1996
On Bufferless Routing of Variable Length Messages in Leveled Networks.
IEEE Trans. Computers, 1996

Toward Efficient Scheduling of Evolving Computations on Rings of Processors.
J. Parallel Distrib. Comput., 1996

Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off.
J. Parallel Distrib. Comput., 1996

Optimal Emulations by Butterfly-Like Networks.
J. ACM, 1996

An empirical study of dynamic scheduling on rings of processors.
Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors.
SPAA, 1996

A Tight Layout of the Butterfly Network.
SPAA, 1996

1995
Salvage-Embeddings of Complete Trees.
SIAM J. Discrete Math., 1995

The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation.
Parallel Processing Letters, 1995

A Cost-Effective Streamlining of the Diogenes Design Methodology.
Parallel Processing Letters, 1995

Thoughts on Parallelism and Concurrency in Computing Curricula.
ACM Comput. Surv., 1995

Optimal architecture-independent scheduling of fine-grain tree-sweep computations.
Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

1994
The reconfigurable ring of processors: fine-grained tree-structured computations.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

On balancing computational load on rings of processors.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff.
SPAA, 1994

1993
Scattering and Gathering Messages in Networks of Processors.
IEEE Trans. Computers, 1993

On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
Comparing Queues and Stacks as Mechanisms for Laying out Graphs.
SIAM J. Discrete Math., 1992

Laying out Graphs Using Queues.
SIAM J. Comput., 1992

Efficient Embeddings of Trees in Hypercubes.
SIAM J. Comput., 1992

Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies.
Discrete Applied Mathematics, 1992

Better Parallel Architectures via Emulations.
Proceedings of the Parallel Architectures and Their Efficient Use, 1992

Tolerating Faults in Synchronization Networks.
Proceedings of the Parallel Processing: CONPAR 92, 1992

1991
Partitioning Circuits for Improved Testability.
Algorithmica, 1991

Cayley Graphs and Direct-Product Graphs.
Proceedings of the Groups And Computation, 1991

1990
Group Action Graphs and Parallel Architectures.
SIAM J. Comput., 1990

Exposing Graph Uniformities via Algebraic Specification.
Mathematical Systems Theory, 1990

Optimal Embeddings of Butterfly-Like Graphs in the Hypercube.
Mathematical Systems Theory, 1990

1989
Vertex Types in Book-Embeddings.
SIAM J. Discrete Math., 1989

Universal Graphs for Bounded-Degree Trees and Planar Graphs.
SIAM J. Discrete Math., 1989

Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988
The physical mapping problem for parallel architectures.
J. ACM, 1988

Optimal Simulations by Butterfly Networks (Preliminary Version)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1986
Three-Dimensional Circuit Layouts.
SIAM J. Comput., 1986

Minced Trees, with Applications to Fault-Tolerant VLSI Processor Arrays.
Mathematical Systems Theory, 1986

Optimal Simulations of Tree Machines (Preliminary Version)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Diogenes, Circa 1986.
Proceedings of the VLSI Algorithms and Architectures, 1986

1985
A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays.
IEEE Trans. Computers, 1985

1984
Minimal-Cost Brother Trees.
SIAM J. Comput., 1984

Editorial: Special FOCS Issue - Twenty-Second Annual IEEE Symposium on Foundations of Computer Science.
Mathematical Systems Theory, 1984

Binary search trees with binary comparison cost.
International Journal of Parallel Programming, 1984

The VLSI Revolution in Theoretical Circles.
Proceedings of the Automata, 1984

1983
Cost Trade-offs in Graph Embeddings, with Applications
J. ACM, October, 1983

Three-Dimensional VLSI: A Case Study
J. ACM, July, 1983

The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors.
IEEE Trans. Computers, 1983

Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing.
IEEE Trans. Computers, 1983

Bandwidth and pebbling.
Computing, 1983

1982
A Dictionary Machine (for VLSI).
IEEE Trans. Computers, 1982

On Embedding Rectangular Grids in Square Grids.
IEEE Trans. Computers, 1982

Graphs that are Almost Binary Trees.
SIAM J. Comput., 1982

Stabbing Line Segments.
BIT, 1982

1981
Time- and Space-Optimality in B-Trees.
ACM Trans. Database Syst., 1981

On Uniformly Inserting One Data Structure into Another.
Commun. ACM, 1981

Three-Dimensional VLSI Layouts.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

A Realistic Cost Measure for Binary Search Trees.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

Graphs that Are Almost Binary Trees (Preliminary Version)
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version).
Proceedings of the Automata, 1981

1980
Uniform Data Encodings.
Theor. Comput. Sci., 1980

External Hashing Schemes for Collections of Data Structures.
J. ACM, 1980

Issues in the Study of Graph Embeddings.
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

1979
Optimal 2, 3-Trees.
SIAM J. Comput., 1979

Storage Representations for Tree-Like Data Structures.
Mathematical Systems Theory, 1979

Encoding Data Structures in Trees.
J. ACM, 1979

A Note on Paths Embedded in Trees.
Inf. Process. Lett., 1979

Node-Visit Optimal 1-2 Brother Trees.
Proceedings of the Theoretical Computer Science, 1979

Storage Representations for Tree-Like Data Structures
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Compact B-Trees.
Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, Boston, Massachusetts, May 30, 1979

1978
Minimal-Comparison 2, 3-Trees.
SIAM J. Comput., 1978

Bounds on the Costs of Data Encodings.
Mathematical Systems Theory, 1978

Data Encodings and Their Costs.
Acta Inf., 1978

1977
On Storing Ragged Arrays by Hashing.
Mathematical Systems Theory, 1977

On Storing Concatenable Arrays.
J. Comput. Syst. Sci., 1977

Hashing Schemes for Extendible Arrays.
J. ACM, 1977

Storage Schemes for Boundedly Extendible Arrays.
Acta Inf., 1977

1975
Preserving Proximity in Arrays.
SIAM J. Comput., 1975

Managing Storage for Extendible Arrays.
SIAM J. Comput., 1975

Generalized Addressing Schemes for Data Graphs.
Mathematical Systems Theory, 1975

Corrigendum: "Allocating Storage for Extendible Arrays".
J. ACM, 1975

On storing arbitrarily many extendible arrays of arbitrary dimensions.
International Journal of Parallel Programming, 1975

What Is a Multilevel Array?
IBM Journal of Research and Development, 1975

Hashing Schemes for Extendible Arrays (Extended Arrays)
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974
Allocating Storage for Extendible Arrays.
J. ACM, 1974

An extrinsic characterization of addressable data graphs.
Discrete Mathematics, 1974

Managing Storage for Extendible Arrays
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

Computed Access in Ragged Arrays.
IFIP Congress, 1974

1973
Suffixes of Addressable Data Graphs
Information and Control, September, 1973

Transitions in Extendible Arrays.
Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973

1972
Symmetries in Data Graphs.
SIAM J. Comput., 1972

Addressable Data Graphs.
J. ACM, 1972

Real-Time Simulation of Multihead Tape Units.
J. ACM, 1972

Rapid Identification of Repeated Patterns in Strings, Trees and Arrays
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1971
Data Graphs and Addressing Schemes.
J. Comput. Syst. Sci., 1971

Addressable Data Graphs: Extended Abstract
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971

1970
Time-Restricted Sequence Generation.
J. Comput. Syst. Sci., 1970

A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets.
J. ACM, 1970

Data Graphs and Addressing Schemes: Extended Abstract
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970

1968
Real-Time Solutions of the Origin-Crossing Problem.
Mathematical Systems Theory, 1968

Counter Machines and Counter Languages.
Mathematical Systems Theory, 1968

Multitape One-Way Nonwriting Automata.
J. Comput. Syst. Sci., 1968

On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages.
J. ACM, 1968

Limited Random Access Turing Machines
Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967
A Machine Realization of the Linear Context-Free Languages
Information and Control, February, 1967

Multitape Finite Automata with Rewind Instructions.
J. Comput. Syst. Sci., 1967

Real-Time Definable Languages.
J. ACM, 1967

Turing Machines with Several Read-Write Heads (Preliminary Report)
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

Real Time Counter Machines (Preliminary Version)
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1965
On multi-head finite automata
Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design, 1965

1964
On n-tape finite state acceptors
Proceedings of the 5th Annual Symposium on Switching Circuit Theory and Logical Design, 1964


  Loading...