Arnold L. Rosenberg

Denis Trystram

Springer, ISBN: 978-3-030-58376-7, 2020

2018

Bio-Inspired Pattern Processing by Cellular ANTomata.

[BibT_eX]

[DOI]

J. Cell. Autom., 2018

Editors' Introduction and Roadmap.

[BibT_eX]

[DOI]

Proceedings of the Topics in Parallel and Distributed Computing, 2018

2017

50 Years of TOCS.

[BibT_eX]

[DOI]

Alan L. Selman

Theory Comput. Syst., 2017

Nano-Technology and the Nanny State.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2017

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

[BibT_eX]

[DOI]

Michela Taufer

Int. J. High Perform. Comput. Appl., 2017

Cellular ANTomata: A Tool for Early PDC Education.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2017: Parallel Processing Workshops, 2017

2016

Scheduling Matters: Area-Oriented Heuristic for Resource Management.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Computer Architecture and High Performance Computing, 2016

Cellular ANTomata as Engines for Highly Parallel Pattern Processing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2016

Scheduling DAGs Opportunistically: The Dream and the Reality Circa 2016.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015

An AREA-Oriented Heuristic for Scheduling DAGs on Volatile Computing Platforms.

[BibT_eX]

[DOI]

Rosario De Chiara

IEEE Trans. Parallel Distributed Syst., 2015

On constructing DAG-schedules with large areas.

[BibT_eX]

[DOI]

Scott T. Roche

Rajmohan Rajaraman

Concurr. Comput. Pract. Exp., 2015

2014

On Scheduling Series-Parallel DAGs to Maximize Area.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Region Management by Finite-State Robots.

[BibT_eX]

[DOI]

Almadena Yu. Chtchelkanova

Comput. J., 2014

NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates (abstract only).

[BibT_eX]

[DOI]

Sushil K. Prasad

Anshul Gupta

Alan Sussman

Proceedings of the 45th ACM Technical Symposium on Computer Science Education, 2014

2013

Static Strategies for Worksharing with Unrecoverable Interruptions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Finite-State Robots in a Warehouse: Achieving Linear Parallel Speedup While Rearranging Objects.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Conference on Parallel Processing, 2013

2012

On scheduling dag s for volatile computing platforms: Area-maximizing schedules.

[BibT_eX]

[DOI]

Rosario De Chiara

J. Parallel Distributed Comput., 2012

The Parking Problem for Finite-State Robots.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Cellular ANTomata.

[BibT_eX]

[DOI]

Adv. Complex Syst., 2012

Finite-State Robots in the Land of Rationalia.

[BibT_eX]

[DOI]

Proceedings of the Computer and Information Sciences III, 2012

2011

Static worksharing strategies for heterogeneous computers with unrecoverable interruptions.

[BibT_eX]

[DOI]

Parallel Comput., 2011

Heterogeneity in Computing: Insights from a Worksharing Scheduling Problem.

[BibT_eX]

[DOI]

Ron Chi-Lung Chiang

Int. J. Found. Comput. Sci., 2011

On clustering DAGs for task-hungry computing platforms.

[BibT_eX]

[DOI]

Mark Sims

Central Eur. J. Comput. Sci., 2011

NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM technical symposium on Computer science education, 2011

Greedy "Exploitation" Is Close to Optimal on Node-Heterogeneous Clusters.

[BibT_eX]

[DOI]

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

Assessing the Computational Benefits of AREA-Oriented DAG-Scheduling.

[BibT_eX]

[DOI]

Rosario De Chiara

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

Introduction.

[BibT_eX]

[DOI]

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

2010

Extending IC-scheduling via the Sweep Algorithm.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2010

Toward understanding heterogeneity in computing.

[BibT_eX]

[DOI]

Ron Chi-Lung Chiang

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Statistical predictors of computing power in heterogeneous clusters.

[BibT_eX]

[DOI]

Ron Chi-Lung Chiang

Anthony A. Maciejewski

Howard Jay Siegel

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Link-heterogeneity vs. node-heterogeneity in clusters.

[BibT_eX]

[DOI]

Olivier Beaumont

Proceedings of the 2010 International Conference on High Performance Computing, 2010

Ants in Parking Lots.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Springer, ISBN: 978-0-387-09638-4, 2010

2009

Path-robust multi-channel wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

On scheduling dags to maximize area.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Static strategies forworksharing with unrecoverable interruptions.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2009, 2009

2008

On "Exploiting" Node-Heterogeneous Clusters Optimally.

[BibT_eX]

[DOI]

Micah Adler

Ying Gong

Theory Comput. Syst., 2008

A "Big-Ideas" Computation Theory Course for the Undergraduate.

[BibT_eX]

Bull. EATCS, 2008

On Clustering Tasks in IC-Optimal Dags.

[BibT_eX]

[DOI]

Mark Sims

Proceedings of the 2008 International Conference on Parallel Processing, 2008

Cellular ANTomata: Food-Finding and Maze-Threading.

[BibT_eX]

[DOI]

Proceedings of the 2008 International Conference on Parallel Processing, 2008

2007

Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2007

Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2007

Best Paper Award recipients: 2006 International Parallel and Distributed Processing Symposium.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2007

Application Placement on a Cluster of Servers.

[BibT_eX]

[DOI]

Bhuvan Urgaonkar

Prashant J. Shenoy

Int. J. Found. Comput. Sci., 2007

A Tool for Prioritizing DAGMan Jobs and its Evaluation.

[BibT_eX]

[DOI]

J. Grid Comput., 2007

Bounding damage from link destruction, with application to the internet.

[BibT_eX]

[DOI]

George Dean Bissias

Brian Neil Levine

Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2007

A Comparison of Dag-Scheduling Strategies for Internet-Based Computing.

[BibT_eX]

[DOI]

Robert Hall

Arun Venkataramani

Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Applying IC-Scheduling Theory to Familiar Classes of Computations.

[BibT_eX]

[DOI]

Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

2006

Toward a Theory for Scheduling Dags in Internet-Based Computing.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2006

On Scheduling Expansive and Reductive Dags for Internet-Based Computing.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

State.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2006

A Pebble Game for Internet-Based Computing.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2006

Changing Challenges for Collaborative Algorithmics.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Nature-Inspired and Innovative Computing, 2006

2005

Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2005

Efficient trigger-broadcasting in heterogeneous clusters.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Bernard Mans

J. Parallel Distributed Comput., 2005

An algorithmic model for heterogeneous hyper-clusters: rationale and experience.

[BibT_eX]

[DOI]

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

Foreword.

[BibT_eX]

[DOI]

Jacir Luiz Bordim

Koji Nakano

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

On Scheduling Complex Dags for Internet-Based Computing.

[BibT_eX]

[DOI]

Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

The Changing Challenges of Collaborative Algorithmics.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing, 2005

Batch-Scheduling Dags for Internet-Based Computing.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Brian Neil Levine

Proceedings of the 12th ACM Conference on Computer and Communications Security, 2005

2004

On Scheduling Mesh-Structured Computations for Internet-Based Computing.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2004

Obituary: Shimon Even.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2004

An Algorithmic Model for Heterogeneous Clusters: Rationale and Experience.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Sharad Jaiswal

Donald F. Towsley

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.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 37th Annual Simulation Symposium (ANSS-37 2004), 2004

On Scheduling Computation-Dags for Internet-Based Computing.

[BibT_eX]

Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2003

Accountable Web-Computing.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2003

Efficient Pairing Functions - and Why You Should Care.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

Optimal sharing of bags of tasks in heterogeneous clusters.

[BibT_eX]

[DOI]

Micah Adler

Ying Gong

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Planned Object Duplication Strategies in Dynamic PRR Meshes.

[BibT_eX]

[DOI]

Michael K. Bradshaw

Donald F. Towsley

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.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2003. Parallel Processing, 2003

Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?".

[BibT_eX]

[DOI]

Micah Adler

Ying Gong

Proceedings of the Proceedings 36th Annual Simulation Symposium (ANSS-36 2003), Orlando, Florida, USA, March 30, 2003

2002

Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2002

Scheduling Time-Constrained Communication in Linear Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2002

Using the Compiler to Improve Cache Replacement Decisions.

[BibT_eX]

[DOI]

Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (PACT 2002), 2002

2001

Augmented Ring Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2001

Finding Topic Words for Hierarchical Summarization.

[BibT_eX]

[DOI]

Dawn J. Lawrie

W. Bruce Croft

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.

[BibT_eX]

[DOI]

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better.

[BibT_eX]

[DOI]

Proceedings of the 2001 IEEE International Conference on Cluster Computing (CLUSTER 2001), 2001

Graph separators with applications.

[BibT_eX]

Frontiers of computer science, Kluwer, ISBN: 978-0-306-46464-5, 2001

2000

Editorial Message.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2000

Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations II: On Maximizing Guaranteed Output.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2000

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

[BibT_eX]

[DOI]

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

Optimal Sharing of Partitionable Workloads in Heterogeneous Networks of Workstations.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1999

Using Emulations to Enhance the Performance of Parallel Architectures.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1999

Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1999

An empirical study of dynamic scheduling on rings of processors.

[BibT_eX]

[DOI]

Parallel Comput., 1999

Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations I: On Maximizing Expected Output.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1999

1998

Monochromatic Paths and Triangulated Graphs.

[BibT_eX]

[DOI]

Shimon Even

Ami Litman

SIAM J. Discret. Math., 1998

A Tight Layout of the Butterfly Network.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1998

Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations.

[BibT_eX]

[DOI]

Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998

1997

The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1997

An Optimal Strategies for Cycle-Stealing in Networks of Workstations.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1997

Work-preserving emulations of fixed-connection networks.

[BibT_eX]

[DOI]

Richard R. Koch

J. ACM, 1997

Theoretical research on networks: models and methodology.

[BibT_eX]

Proceedings of the SIROCCO'97, 1997

1996

On Bufferless Routing of Variable Length Messages in Leveled Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1996

Toward Efficient Scheduling of Evolving Computations on Rings of Processors.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1996

Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1996

Optimal Emulations by Butterfly-Like Networks.

[BibT_eX]

[DOI]

Bojana Obrenic

Eric J. Schwabe

J. ACM, 1996

An empirical study of dynamic scheduling on rings of processors.

[BibT_eX]

[DOI]

Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors.

[BibT_eX]

[DOI]

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

1995

Salvage-Embeddings of Complete Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1995

The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1995

A Cost-Effective Streamlining of the Diogenes Design Methodology.

[BibT_eX]

[DOI]

Marc Picquendar

Parallel Process. Lett., 1995

Thoughts on Parallelism and Concurrency in Computing Curricula.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1995

Optimal architecture-independent scheduling of fine-grain tree-sweep computations.

[BibT_eX]

[DOI]

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

1994

The reconfigurable ring of processors: fine-grained tree-structured computations.

[BibT_eX]

[DOI]

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

On balancing computational load on rings of processors.

[BibT_eX]

[DOI]

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

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

[BibT_eX]

[DOI]

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1993

Scattering and Gathering Messages in Networks of Processors.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1993

On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Laying out Graphs Using Queues.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Efficient Embeddings of Trees in Hypercubes.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Better Parallel Architectures via Emulations.

[BibT_eX]

[DOI]

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

Tolerating Faults in Synchronization Networks.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing: CONPAR 92, 1992

1991

Partitioning Circuits for Improved Testability.

[BibT_eX]

[DOI]

Algorithmica, 1991

Cayley Graphs and Direct-Product Graphs.

[BibT_eX]

[DOI]

Proceedings of the Groups And Computation, 1991

1990

Group Action Graphs and Parallel Architectures.

[BibT_eX]

[DOI]

Fred S. Annexstein

Marc Baumslag

SIAM J. Comput., 1990

Exposing Graph Uniformities via Algebraic Specification.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1990

Optimal Embeddings of Butterfly-Like Graphs in the Hypercube.

[BibT_eX]

[DOI]

David S. Greenberg

Math. Syst. Theory, 1990

1989

Efficient emulations of interconnection networks.

[BibT_eX]

[DOI]

SIGARCH Comput. Archit. News, 1989

Vertex Types in Book-Embeddings.

[BibT_eX]

[DOI]

Jonathan F. Buss

Judson D. Knott

SIAM J. Discret. Math., 1989

Universal Graphs for Bounded-Degree Trees and Planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1989

Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract)

[BibT_eX]

[DOI]

Richard R. Koch

Bruce M. Maggs

Satish Rao

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988

The physical mapping problem for parallel architectures.

[BibT_eX]

[DOI]

Bruce T. Smith

J. ACM, 1988

Optimal Simulations by Butterfly Networks (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1986

Three-Dimensional Circuit Layouts.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

Minced Trees, with Applications to Fault-Tolerant VLSI Processor Arrays.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1986

Optimal Simulations of Tree Machines (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Diogenes, Circa 1986.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1985

1984

Minimal-Cost Brother Trees.

[BibT_eX]

[DOI]

Thomas Ottmann

Douglas Stott Parker Jr.

Hans-Werner Six

Derick Wood

SIAM J. Comput., 1984

Editorial: Special FOCS Issue - Twenty-Second Annual IEEE Symposium on Foundations of Computer Science.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1984

Binary search trees with binary comparison cost.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1984

The VLSI Revolution in Theoretical Circles.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1984

1983

Cost Trade-offs in Graph Embeddings, with Applications

[BibT_eX]

[DOI]

Kurt Mehlhorn

J. ACM, October, 1983

Three-Dimensional VLSI: A Case Study

[BibT_eX]

[DOI]

J. ACM, July, 1983

The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1983

Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing.

[BibT_eX]

[DOI]

Zeev Barzilai

Don Coppersmith

IEEE Trans. Computers, 1983

Bandwidth and pebbling.

[BibT_eX]

[DOI]

Ivan Hal Sudborough

Computing, 1983

Fault-Tolerant Interconnection Networks: A Graph-Theoretic Approach.

[BibT_eX]

Proceedings of the WG '83, 1983

1982

A Dictionary Machine (for VLSI).

[BibT_eX]

[DOI]

Thomas Ottmann

IEEE Trans. Computers, 1982

On Embedding Rectangular Grids in Square Grids.

[BibT_eX]

[DOI]

Romas Aleliunas

IEEE Trans. Computers, 1982

Graphs that are Almost Binary Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1982

Stabbing Line Segments.

[BibT_eX]

[DOI]

BIT, 1982

1981

Time- and Space-Optimality in B-Trees.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1981

On Uniformly Inserting One Data Structure into Another.

[BibT_eX]

Commun. ACM, 1981

Three-Dimensional VLSI Layouts.

[BibT_eX]

Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

A Realistic Cost Measure for Binary Search Trees.

[BibT_eX]

Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

Graphs that Are Almost Binary Trees (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version).

[BibT_eX]

[DOI]

Kurt Mehlhorn

Proceedings of the Automata, 1981

1980

Uniform Data Encodings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1980

External Hashing Schemes for Collections of Data Structures.

[BibT_eX]

[DOI]

Richard J. Lipton

Andrew Chi-Chih Yao

J. ACM, 1980

Issues in the Study of Graph Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

1979

Optimal 2, 3-Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1979

Storage Representations for Tree-Like Data Structures.

[BibT_eX]

[DOI]

Derick Wood

Zvi Galil

Math. Syst. Theory, 1979

Encoding Data Structures in Trees.

[BibT_eX]

[DOI]

J. ACM, 1979

A Note on Paths Embedded in Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1979

Node-Visit Optimal 1-2 Brother Trees.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1979

Compact B-Trees.

[BibT_eX]

[DOI]

Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, Boston, Massachusetts, USA, May 30, 1979

1978

Minimal-Comparison 2, 3-Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1978

Bounds on the Costs of Data Encodings.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1978

Data Encodings and Their Costs.

[BibT_eX]

[DOI]

Acta Informatica, 1978

1977

On Storing Ragged Arrays by Hashing.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1977

On Storing Concatenable Arrays.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1977

Hashing Schemes for Extendible Arrays.

[BibT_eX]

[DOI]

J. ACM, 1977

Storage Schemes for Boundedly Extendible Arrays.

[BibT_eX]

[DOI]

Acta Informatica, 1977

1975

Preserving Proximity in Arrays.

[BibT_eX]

[DOI]

SIAM J. Comput., 1975

Managing Storage for Extendible Arrays.

[BibT_eX]

[DOI]

SIAM J. Comput., 1975

Generalized Addressing Schemes for Data Graphs.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1975

Corrigendum: "Allocating Storage for Extendible Arrays".

[BibT_eX]

[DOI]

J. ACM, 1975

On storing arbitrarily many extendible arrays of arbitrary dimensions.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1975

What Is a Multilevel Array?

[BibT_eX]

[DOI]

James W. Thatcher

IBM J. Res. Dev., 1975

Hashing Schemes for Extendible Arrays (Extended Arrays)

[BibT_eX]

[DOI]

Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974

Allocating Storage for Extendible Arrays.

[BibT_eX]

[DOI]

J. ACM, 1974

An extrinsic characterization of addressable data graphs.

[BibT_eX]

[DOI]

Discret. Math., 1974

Computed Access in Ragged Arrays.

[BibT_eX]

Proceedings of the Information Processing, 1974

1973

Suffixes of Addressable Data Graphs

[BibT_eX]

[DOI]

Inf. Control., September, 1973

On the time required to recognize properties of graphs: a problem.

[BibT_eX]

[DOI]

SIGACT News, 1973

Transitions in Extendible Arrays.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973

1972

Symmetries in Data Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1972

Addressable Data Graphs.

[BibT_eX]

[DOI]

J. ACM, 1972

Real-Time Simulation of Multihead Tape Units.

[BibT_eX]

[DOI]

J. ACM, 1972

Rapid Identification of Repeated Patterns in Strings, Trees and Arrays

[BibT_eX]

[DOI]

Richard M. Karp

Raymond E. Miller

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1971

Data Graphs and Addressing Schemes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1971

Addressable Data Graphs: Extended Abstract

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971

1970

Time-Restricted Sequence Generation.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1970

A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets.

[BibT_eX]

[DOI]

J. ACM, 1970

Data Graphs and Addressing Schemes: Extended Abstract

[BibT_eX]

[DOI]

Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970

1968

Real-Time Solutions of the Origin-Crossing Problem.

[BibT_eX]

[DOI]

Michael J. Fischer

Math. Syst. Theory, 1968

Counter Machines and Counter Languages.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1968

Multitape One-Way Nonwriting Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1968

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

[BibT_eX]

[DOI]

J. ACM, 1968

Limited Random Access Turing Machines

[BibT_eX]

[DOI]

Michael J. Fischer

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967

A Machine Realization of the Linear Context-Free Languages

[BibT_eX]

[DOI]

Inf. Control., February, 1967

Multitape Finite Automata with Rewind Instructions.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1967

Real-Time Definable Languages.

[BibT_eX]

[DOI]

J. ACM, 1967

Turing Machines with Several Read-Write Heads (Preliminary Report)

[BibT_eX]

[DOI]

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

Real Time Counter Machines (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1965

On multi-head finite automata

[BibT_eX]

[DOI]

Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design, 1965

1964

On n-tape finite state acceptors

[BibT_eX]

[DOI]