Arnold L. Rosenberg

233 papers A* 17A 18B 20C 4Misc 3Journal 121Unranked 41
YearRankTypeTitle / Venue / Authors
2020 — conf
EduPar-20 Invited Panel.
IPDPS Workshops
Henry A. Gabb, Andrew Lumsdaine, Margaret Martonosi, Arnold L. Rosenberg, Martina Barnas
2020 — book
Understand Mathematics, Understand Computing - Discrete Mathematics That All Computing Students Should Know
Understand Mathematics, Understand Computing
Arnold L. Rosenberg, Denis Trystram
2018 J jnl
Bio-Inspired Pattern Processing by Cellular ANTomata.
J. Cell. Autom.
Arnold L. Rosenberg
2018 — ch.
Editors' Introduction and Roadmap.
Topics in Parallel and Distributed Computing
Sushil K. Prasad, Anshul Gupta, Arnold L. Rosenberg, Alan Sussman, Charles C. Weems
2018 — book
Topics in Parallel and Distributed Computing, Enhancing the Undergraduate Curriculum: Performance, Concurrency, and Programming on Modern Platforms.
Topics in Parallel and Distributed Computing
Sushil K. Prasad, Anshul Gupta, Arnold L. Rosenberg, Alan Sussman, Charles C. Weems
2017 J jnl
50 Years of TOCS.
Theory Comput. Syst.
Alan L. Selman, Arnold L. Rosenberg
2017 — conf
Cellular ANTomata: A Tool for Early PDC Education.
Euro-Par Workshops
Arnold L. Rosenberg
2017 J jnl
Nano-Technology and the Nanny State.
Int. J. Unconv. Comput.
Arnold L. Rosenberg
2017 J jnl
Scheduling DAG-based workflows on single cloud instances: High-performance and cost effectiveness with a static scheduler.
Int. J. High Perform. Comput. Appl.
Michela Taufer, Arnold L. Rosenberg
2016 — conf
Cellular ANTomata as Engines for Highly Parallel Pattern Processing.
ICA3PP Workshops
Arnold L. Rosenberg
2016 — conf
Scheduling DAGs Opportunistically: The Dream and the Reality Circa 2016.
Euro-Par
Arnold L. Rosenberg
2016 C conf
Scheduling Matters: Area-Oriented Heuristic for Resource Management.
SBAC-PAD
Jeremy Benson, Trilce Estrada, Arnold L. Rosenberg, Michela Taufer
2015 J jnl
An AREA-Oriented Heuristic for Scheduling DAGs on Volatile Computing Platforms.
IEEE Trans. Parallel Distributed Syst.
Gennaro Cordasco, Rosario De Chiara, Arnold L. Rosenberg
2015 J jnl
On constructing DAG-schedules with large areas.
Concurr. Comput. Pract. Exp.
Scott T. Roche, Arnold L. Rosenberg, Rajmohan Rajaraman
2014 A conf
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates (abstract only).
SIGCSE
Sushil K. Prasad, Almadena Yu. Chtchelkanova, Anshul Gupta, Arnold L. Rosenberg, Alan Sussman
2014 — conf
On Constructing DAG-Schedules with Large AREAs.
Euro-Par
Scott T. Roche, Arnold L. Rosenberg, Rajmohan Rajaraman
2014 J jnl
On Scheduling Series-Parallel DAGs to Maximize Area.
Int. J. Found. Comput. Sci.
Gennaro Cordasco, Arnold L. Rosenberg
2014 J jnl
Region Management by Finite-State Robots.
Comput. J.
Arnold L. Rosenberg
2013 B conf
Finite-State Robots in a Warehouse: Achieving Linear Parallel Speedup While Rearranging Objects.
ICPP
Arnold L. Rosenberg
2013 J jnl
Static Strategies for Worksharing with Unrecoverable Interruptions.
Theory Comput. Syst.
Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien
2012 J jnl
Cellular ANTomata.
Adv. Complex Syst.
Arnold L. Rosenberg
2012 — conf
Finite-State Robots in the Land of Rationalia.
ISCIS
Arnold L. Rosenberg
2012 J jnl
On scheduling dag s for volatile computing platforms: Area-maximizing schedules.
J. Parallel Distributed Comput.
Gennaro Cordasco, Rosario De Chiara, Arnold L. Rosenberg
2012 J jnl
The Parking Problem for Finite-State Robots.
J. Graph Algorithms Appl.
Arnold L. Rosenberg
2011 — conf
Assessing the Computational Benefits of AREA-Oriented DAG-Scheduling.
Euro-Par (1)
Gennaro Cordasco, Rosario De Chiara, Arnold L. Rosenberg
2011 — conf
Greedy "Exploitation" Is Close to Optimal on Node-Heterogeneous Clusters.
Euro-Par (1)
Arnold L. Rosenberg
2011 J jnl
Heterogeneity in Computing: Insights from a Worksharing Scheduling Problem.
Int. J. Found. Comput. Sci.
Arnold L. Rosenberg, Ron Chi-Lung Chiang
2011 — conf
Introduction.
Euro-Par (2)
Kunal Agarwal, Panagiota Fatourou, Arnold L. Rosenberg, Frédéric Vivien
2011 A conf
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates.
SIGCSE
Sushil K. Prasad, Almadena Yu. Chtchelkanova, Sajal K. Das, Frank Dehne, Mohamed G. Gouda, Anshul Gupta, Joseph F. JáJá, Krishna Kant, Anita La Salle, Richard LeBlanc, Manish Lumsdaine, David A. Padua, Manish Parashar, Viktor K. Prasanna, Yves Robert, Arnold L. Rosenberg, Sartaj Sahni, Behrooz A. Shirazi, Alan Sussman, Charles C. Weems, Jie Wu
2011 J jnl
On clustering DAGs for task-hungry computing platforms.
Central Eur. J. Comput. Sci.
Gennaro Cordasco, Arnold L. Rosenberg, Mark Sims
2011 J jnl
Static worksharing strategies for heterogeneous computers with unrecoverable interruptions.
Parallel Comput.
Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien
2010 — conf
Ants in Parking Lots.
Euro-Par (2)
Arnold L. Rosenberg
2010 — conf
Area-Maximizing Schedules for Series-Parallel DAGs.
Euro-Par (2)
Gennaro Cordasco, Arnold L. Rosenberg
2010 J jnl
Extending IC-scheduling via the Sweep Algorithm.
J. Parallel Distributed Comput.
Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg
2010 Misc conf
Link-heterogeneity vs. node-heterogeneity in clusters.
HiPC
Olivier Beaumont, Arnold L. Rosenberg
2010 — conf
Statistical predictors of computing power in heterogeneous clusters.
IPDPS Workshops
Ron Chi-Lung Chiang, Anthony A. Maciejewski, Arnold L. Rosenberg, Howard Jay Siegel
2010 — book
The Pillars of Computation Theory - State, Encoding, Nondeterminism.
Arnold L. Rosenberg
2010 A conf
Toward understanding heterogeneity in computing.
IPDPS
Arnold L. Rosenberg, Ron Chi-Lung Chiang
2009 A conf
On scheduling dags to maximize area.
IPDPS
Gennaro Cordasco, Arnold L. Rosenberg
2009 A conf
Path-robust multi-channel wireless networks.
IPDPS
Arnold L. Rosenberg
2009 — conf
Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures.
Euro-Par Workshops
Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien
2009 A conf
Static strategies forworksharing with unrecoverable interruptions.
IPDPS
Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien
2008 J jnl
A "Big-Ideas" Computation Theory Course for the Undergraduate.
Bull. EATCS
Arnold L. Rosenberg
2008 B conf
Cellular ANTomata: Food-Finding and Maze-Threading.
ICPP
Arnold L. Rosenberg
2008 C conf
Extending IC-Scheduling via the Sweep Algorithm.
PDP
Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg
2008 J jnl
On "Exploiting" Node-Heterogeneous Clusters Optimally.
Theory Comput. Syst.
Micah Adler, Ying Gong, Arnold L. Rosenberg
2008 B conf
On Clustering Tasks in IC-Optimal Dags.
ICPP
Mark Sims, Gennaro Cordasco, Arnold L. Rosenberg
2007 A conf
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing.
IPDPS
Robert Hall, Arnold L. Rosenberg, Arun Venkataramani
2007 J jnl
A Tool for Prioritizing DAGMan Jobs and its Evaluation.
J. Grid Comput.
Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde
2007 J jnl
Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality.
IEEE Trans. Parallel Distributed Syst.
Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg
2007 J jnl
Application Placement on a Cluster of Servers.
Int. J. Found. Comput. Sci.
Bhuvan Urgaonkar, Arnold L. Rosenberg, Prashant J. Shenoy
2007 A conf
Applying IC-Scheduling Theory to Familiar Classes of Computations.
IPDPS
Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg
2007 J jnl
Best Paper Award recipients: 2006 International Parallel and Distributed Processing Symposium.
J. Parallel Distributed Comput.
Arnold L. Rosenberg
2007 J jnl
Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories.
IEEE Trans. Parallel Distributed Syst.
Gennaro Cordasco, Vittorio Scarano, Arnold L. Rosenberg
2007 A* conf
Bounding damage from link destruction, with application to the internet.
SIGMETRICS
George Dean Bissias, Brian Neil Levine, Arnold L. Rosenberg
2007 C conf
Cellular ANTomata.
ISPA
Arnold L. Rosenberg
2006 — conf
A Pebble Game for Internet-Based Computing.
Essays in Memory of Shimon Even
Grzegorz Malewicz, Arnold L. Rosenberg
2006 A conf
A Tool for Prioritizing DAGMan Jobs and Its Evaluation.
HPDC
Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde
2006 — ch.
Changing Challenges for Collaborative Algorithmics.
Handbook of Nature-Inspired and Innovative Computing
Arnold L. Rosenberg
2006 A conf
On Scheduling Expansive and Reductive Dags for Internet-Based Computing.
ICDCS
Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg
2006 — conf
State.
Essays in Memory of Shimon Even
Arnold L. Rosenberg
2006 — ed.
Theoretical Computer Science, Essays in Memory of Shimon Even
Essays in Memory of Shimon Even
Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman
2006 J jnl
Toward a Theory for Scheduling Dags in Internet-Based Computing.
IEEE Trans. Computers
Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych
2005 J jnl
An algorithmic model for heterogeneous hyper-clusters: rationale and experience.
Int. J. Found. Comput. Sci.
Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg
2005 — conf
Batch-Scheduling Dags for Internet-Based Computing.
Euro-Par
Grzegorz Malewicz, Arnold L. Rosenberg
2005 J jnl
Efficient trigger-broadcasting in heterogeneous clusters.
J. Parallel Distributed Comput.
Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg
2005 J jnl
Foreword.
Int. J. Found. Comput. Sci.
Jacir Luiz Bordim, Koji Nakano, Arnold L. Rosenberg
2005 J jnl
Foreword.
Int. J. Found. Comput. Sci.
Jacir Luiz Bordim, Koji Nakano, Arnold L. Rosenberg
2005 J jnl
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing.
IEEE Trans. Computers
Arnold L. Rosenberg, Matthew Yurkewych
2005 A conf
On Scheduling Complex Dags for Internet-Based Computing.
IPDPS
Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych
2005 A* conf
On the cost-ineffectiveness of redundancy in commercial P2P computing.
CCS
Matthew Yurkewych, Brian Neil Levine, Arnold L. Rosenberg
2005 Misc conf
The Changing Challenges of Collaborative Algorithmics.
HiPC
Arnold L. Rosenberg
2004 A conf
An Algorithmic Model for Heterogeneous Clusters: Rationale and Experience.
IPDPS
Arnold L. Rosenberg
2004 — conf
Application Placement on a Cluster of Servers.
PDCS
Bhuvan Urgaonkar, Arnold L. Rosenberg, Prashant J. Shenoy
2004 B conf
Comparing the Structure of Power-Law Graphs and the Internet AS Graph.
ICNP
Sharad Jaiswal, Arnold L. Rosenberg, Donald F. Towsley
2004 — conf
How to Share a Bag of Tasks Optimally in a Heterogeneous Cluster - Three Models, Three Answers.
Annual Simulation Symposium
Arnold L. Rosenberg
2004 J jnl
Obituary: Shimon Even.
Theory Comput. Syst.
Arnold L. Rosenberg
2004 — conf
On Scheduling Computation-Dags for Internet-Based Computing.
PDCS
Arnold L. Rosenberg, Matthew Yurkewych
2004 J jnl
On Scheduling Mesh-Structured Computations for Internet-Based Computing.
IEEE Trans. Computers
Arnold L. Rosenberg
2003 J jnl
Accountable Web-Computing.
IEEE Trans. Parallel Distributed Syst.
Arnold L. Rosenberg
2003 — conf
Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?".
Annual Simulation Symposium
Micah Adler, Ying Gong, Arnold L. Rosenberg
2003 J jnl
Efficient Pairing Functions - and Why You Should Care.
Int. J. Found. Comput. Sci.
Arnold L. Rosenberg
2003 A conf
On Scheduling Collaborative Computations on the Internet, I: Mesh-Dags and Their Close Relatives.
IPDPS
Arnold L. Rosenberg
2003 B conf
Optimal sharing of bags of tasks in heterogeneous clusters.
SPAA
Micah Adler, Ying Gong, Arnold L. Rosenberg
2003 B conf
Planned Object Duplication Strategies in Dynamic PRR Meshes.
ICNP
Michael K. Bradshaw, Arnold L. Rosenberg, Donald F. Towsley
2003 B ed.
SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003)
SPAA
Arnold L. Rosenberg, Friedhelm Meyer auf der Heide
2003 A conf
To BSP or not to BSP in Heterogeneous NOWs.
IPDPS
Arnold L. Rosenberg
2003 — conf
c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories.
Euro-Par
Gennaro Cordasco, Alberto Negro, Vittorio Scarano, Arnold L. Rosenberg
2002 A conf
Accountable Web-Computing.
IPDPS
Arnold L. Rosenberg
2002 A conf
Efficient Pairing Functions - And Why You Should Care.
IPDPS
Arnold L. Rosenberg
2002 J jnl
Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload.
IEEE Trans. Parallel Distributed Syst.
Arnold L. Rosenberg
2002 B ed.
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002
SPAA
Arnold L. Rosenberg, Bruce M. Maggs
2002 J jnl
Scheduling Time-Constrained Communication in Linear Networks.
Theory Comput. Syst.
Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, Walter Unger
2002 — conf
Using the Compiler to Improve Cache Replacement Decisions.
IEEE PACT
Zhenlin Wang, Kathryn S. McKinley, Arnold L. Rosenberg, Charles C. Weems
2001 J jnl
Augmented Ring Networks.
IEEE Trans. Parallel Distributed Syst.
William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman
2001 A* conf
Finding Topic Words for Hierarchical Summarization.
SIGIR
Dawn J. Lawrie, W. Bruce Croft, Arnold L. Rosenberg
2001 — book
Graph separators with applications.
Arnold L. Rosenberg, Lenwood S. Heath
2001 A conf
HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors.
IPDPS
Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg
2001 B ed.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001
SPAA
Arnold L. Rosenberg
2001 C conf
Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better.
CLUSTER
Arnold L. Rosenberg
2000 J jnl
Editorial Message.
Theory Comput. Syst.
Arnold L. Rosenberg
2000 J jnl
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations II: On Maximizing Guaranteed Output.
Int. J. Found. Comput. Sci.
Arnold L. Rosenberg
2000 Misc conf
Optimal Sharing of Partitionable Workloads in Heterogeneous Networks of Workstations.
PDPTA
Arnold L. Rosenberg
2000 B conf
Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract).
SPAA
Arnold L. Rosenberg
1999 J jnl
An empirical study of dynamic scheduling on rings of processors.
Parallel Comput.
M. E. Barrows, Dawn E. Gregory, Lixin Gao, Arnold L. Rosenberg, Paul R. Cohen
1999 B conf
Augmented Ring Networks.
SIROCCO
William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman
1999 J jnl
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations I: On Maximizing Expected Output.
J. Parallel Distributed Comput.
Arnold L. Rosenberg
1999 — conf
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output.
IPPS/SPDP
Arnold L. Rosenberg
1999 J jnl
Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments.
IEEE Trans. Parallel Distributed Syst.
Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman
1999 J jnl
Using Emulations to Enhance the Performance of Parallel Architectures.
IEEE Trans. Parallel Distributed Syst.
Bojana Obrenic, Martin C. Herbordt, Arnold L. Rosenberg, Charles C. Weems
1998 J jnl
A Tight Layout of the Butterfly Network.
Theory Comput. Syst.
Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg
1998 — conf
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations.
IPPS/SPDP
Arnold L. Rosenberg
1998 J jnl
Monochromatic Paths and Triangulated Graphs.
SIAM J. Discret. Math.
Shimon Even, Ami Litman, Arnold L. Rosenberg
1998 B conf
Scheduling Time-Constrained Communication in Linear Networks.
SPAA
Micah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg, Walter Unger
1997 J jnl
An Optimal Strategies for Cycle-Stealing in Networks of Workstations.
IEEE Trans. Computers
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1997 J jnl
The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations.
IEEE Trans. Computers
Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman
1997 B conf
Theoretical research on networks: models and methodology.
SIROCCO
Arnold L. Rosenberg
1997 J jnl
Work-preserving emulations of fixed-connection networks.
J. ACM
Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg, Eric J. Schwabe
1996 B conf
A Tight Layout of the Butterfly Network.
SPAA
Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg
1996 — conf
An empirical study of dynamic scheduling on rings of processors.
SPDP
Dawn E. Gregory, Lixin Gao, Arnold L. Rosenberg, Paul R. Cohen
1996 J jnl
On Bufferless Routing of Variable Length Messages in Leveled Networks.
IEEE Trans. Computers
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe
1996 B conf
On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors.
SPAA
Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman
1996 J jnl
Optimal Emulations by Butterfly-Like Networks.
J. ACM
Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Bojana Obrenic, Arnold L. Rosenberg, Eric J. Schwabe
1996 J jnl
Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off.
J. Parallel Distributed Comput.
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1996 J jnl
Toward Efficient Scheduling of Evolving Computations on Rings of Processors.
J. Parallel Distributed Comput.
Lixin Gao, Arnold L. Rosenberg
1995 J jnl
A Cost-Effective Streamlining of the Diogenes Design Methodology.
Parallel Process. Lett.
Marc Picquendar, Arnold L. Rosenberg, Vittorio Scarano
1995 — conf
Optimal architecture-independent scheduling of fine-grain tree-sweep computations.
SPDP
Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman
1995 J jnl
Salvage-Embeddings of Complete Trees.
SIAM J. Discret. Math.
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1995 J jnl
The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation.
Parallel Process. Lett.
Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman
1995 J jnl
Thoughts on Parallelism and Concurrency in Computing Curricula.
ACM Comput. Surv.
Arnold L. Rosenberg
1995 — ed.
Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, February 7-9, 1994
Interconnection Networks and Mapping and Scheduling Parallel Computations
D. Frank Hsu, Arnold L. Rosenberg, Dominique Sotteau
1994 — conf
On balancing computational load on rings of processors.
SPDP
Lixin Gao, Arnold L. Rosenberg
1994 B conf
Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff.
SPAA
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1994 — conf
The reconfigurable ring of processors: fine-grained tree-structured computations.
SPDP
Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman
1993 A conf
On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).
ESA
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe
1993 — ed.
Parallel Architectures and Their Efficient Use, First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992, Proceedings
Heinz Nixdorf Symposium
Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg
1993 J jnl
Scattering and Gathering Messages in Networks of Processors.
IEEE Trans. Computers
Sandeep N. Bhatt, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg
1992 — conf
Better Parallel Architectures via Emulations.
Heinz Nixdorf Symposium
Arnold L. Rosenberg
1992 J jnl
Comparing Queues and Stacks as Mechanisms for Laying out Graphs.
SIAM J. Discret. Math.
Lenwood S. Heath, Frank Thomson Leighton, Arnold L. Rosenberg
1992 J jnl
Efficient Embeddings of Trees in Hypercubes.
SIAM J. Comput.
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1992 J jnl
Laying out Graphs Using Queues.
SIAM J. Comput.
Lenwood S. Heath, Arnold L. Rosenberg
1992 J jnl
Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies.
Discret. Appl. Math.
Arnold L. Rosenberg
1992 — conf
Tolerating Faults in Synchronization Networks.
CONPAR
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1991 — conf
Cayley Graphs and Direct-Product Graphs.
Groups And Computation
Arnold L. Rosenberg
1991 J jnl
Partitioning Circuits for Improved Testability.
Algorithmica
Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg
1990 J jnl
Exposing Graph Uniformities via Algebraic Specification.
Math. Syst. Theory
Arnold L. Rosenberg
1990 J jnl
Group Action Graphs and Parallel Architectures.
SIAM J. Comput.
Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg
1990 J jnl
Optimal Embeddings of Butterfly-Like Graphs in the Hypercube.
Math. Syst. Theory
David S. Greenberg, Lenwood S. Heath, Arnold L. Rosenberg
1989 J jnl
Efficient emulations of interconnection networks.
SIGARCH Comput. Archit. News
Arnold L. Rosenberg
1989 J jnl
Universal Graphs for Bounded-Degree Trees and Planar Graphs.
SIAM J. Discret. Math.
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1989 J jnl
Vertex Types in Book-Embeddings.
SIAM J. Discret. Math.
Jonathan F. Buss, Arnold L. Rosenberg, Judson D. Knott
1989 A* conf
Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract)
STOC
Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg
1988 — conf
GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions.
AWOC
Arnold L. Rosenberg
1988 A* conf
Optimal Simulations by Butterfly Networks (Preliminary Version)
STOC
Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Arnold L. Rosenberg
1988 J jnl
The physical mapping problem for parallel architectures.
J. ACM
Lenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith
1986 — conf
Diogenes, Circa 1986.
Aegean Workshop on Computing
Arnold L. Rosenberg
1986 J jnl
Minced Trees, with Applications to Fault-Tolerant VLSI Processor Arrays.
Math. Syst. Theory
Fan R. K. Chung, Arnold L. Rosenberg
1986 A* conf
Optimal Simulations of Tree Machines (Preliminary Version)
FOCS
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1986 J jnl
Three-Dimensional Circuit Layouts.
SIAM J. Comput.
Frank Thomson Leighton, Arnold L. Rosenberg
1985 J jnl
A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays.
IEEE Trans. Computers
Arnold L. Rosenberg
1984 J jnl
Binary search trees with binary comparison cost.
Int. J. Parallel Program.
Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
1984 J jnl
Editorial: Special FOCS Issue - Twenty-Second Annual IEEE Symposium on Foundations of Computer Science.
Math. Syst. Theory
Arnold L. Rosenberg
1984 J jnl
Minimal-Cost Brother Trees.
SIAM J. Comput.
Thomas Ottmann, Douglas Stott Parker Jr., Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
1984 A* conf
The VLSI Revolution in Theoretical Circles.
ICALP
Arnold L. Rosenberg
1983 J jnl
Bandwidth and pebbling.
Computing
Arnold L. Rosenberg, Ivan Hal Sudborough
1983 J jnl
Cost Trade-offs in Graph Embeddings, with Applications
J. ACM
Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg
1983 J jnl
Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing.
IEEE Trans. Computers
Zeev Barzilai, Don Coppersmith, Arnold L. Rosenberg
1983 B conf
Fault-Tolerant Interconnection Networks: A Graph-Theoretic Approach.
WG
Arnold L. Rosenberg
1983 J jnl
The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors.
IEEE Trans. Computers
Arnold L. Rosenberg
1983 J jnl
Three-Dimensional VLSI: A Case Study
J. ACM
Arnold L. Rosenberg
1982 J jnl
A Dictionary Machine (for VLSI).
IEEE Trans. Computers
Thomas Ottmann, Arnold L. Rosenberg, Larry J. Stockmeyer
1982 J jnl
Graphs that are Almost Binary Trees.
SIAM J. Comput.
Jia-Wei Hong, Arnold L. Rosenberg
1982 J jnl
On Embedding Rectangular Grids in Square Grids.
IEEE Trans. Computers
Romas Aleliunas, Arnold L. Rosenberg
1982 J jnl
Stabbing Line Segments.
BIT
Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood
1981 B conf
A Realistic Cost Measure for Binary Search Trees.
WG
Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
1981 A* conf
Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version).
ICALP
Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg
1981 A* conf
Graphs that Are Almost Binary Trees (Preliminary Version)
STOC
Jia-Wei Hong, Arnold L. Rosenberg
1981 J jnl
On Uniformly Inserting One Data Structure into Another.
Commun. ACM
Arnold L. Rosenberg
1981 B conf
Three-Dimensional VLSI Layouts.
WG
Arnold L. Rosenberg
1981 J jnl
Time- and Space-Optimality in B-Trees.
ACM Trans. Database Syst.
Arnold L. Rosenberg, Lawrence Snyder
1980 J jnl
External Hashing Schemes for Collections of Data Structures.
J. ACM
Richard J. Lipton, Arnold L. Rosenberg, Andrew Chi-Chih Yao
1980 B conf
Issues in the Study of Graph Embeddings.
WG
Arnold L. Rosenberg
1980 J jnl
Uniform Data Encodings.
Theor. Comput. Sci.
Arnold L. Rosenberg, Larry J. Stockmeyer, Lawrence Snyder
1979 J jnl
A Note on Paths Embedded in Trees.
Inf. Process. Lett.
Arnold L. Rosenberg
1979 — conf
Compact B-Trees.
SIGMOD Conference
Arnold L. Rosenberg, Lawrence Snyder
1979 J jnl
Encoding Data Structures in Trees.
J. ACM
Arnold L. Rosenberg
1979 — conf
Node-Visit Optimal 1-2 Brother Trees.
Theoretical Computer Science
Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
1979 J jnl
Optimal 2, 3-Trees.
SIAM J. Comput.
Raymond E. Miller, Nicholas Pippenger, Arnold L. Rosenberg, Lawrence Snyder
1979 A* conf
Storage Representations for Tree-Like Data Structures
STOC
Arnold L. Rosenberg, Derick Wood, Zvi Galil
1979 J jnl
Storage Representations for Tree-Like Data Structures.
Math. Syst. Theory
Arnold L. Rosenberg, Derick Wood, Zvi Galil
1978 J jnl
Bounds on the Costs of Data Encodings.
Math. Syst. Theory
Arnold L. Rosenberg, Lawrence Snyder
1978 J jnl
Data Encodings and Their Costs.
Acta Informatica
Arnold L. Rosenberg
1978 J jnl
Minimal-Comparison 2, 3-Trees.
SIAM J. Comput.
Arnold L. Rosenberg, Lawrence Snyder
1977 J jnl
Hashing Schemes for Extendible Arrays.
J. ACM
Arnold L. Rosenberg, Larry J. Stockmeyer
1977 J jnl
On Storing Concatenable Arrays.
J. Comput. Syst. Sci.
Arnold L. Rosenberg
1977 J jnl
On Storing Ragged Arrays by Hashing.
Math. Syst. Theory
Arnold L. Rosenberg
1977 J jnl
Storage Schemes for Boundedly Extendible Arrays.
Acta Informatica
Arnold L. Rosenberg, Larry J. Stockmeyer
1975 J jnl
Corrigendum: "Allocating Storage for Extendible Arrays".
J. ACM
Arnold L. Rosenberg
1975 J jnl
Generalized Addressing Schemes for Data Graphs.
Math. Syst. Theory
Arnold L. Rosenberg
1975 A* conf
Hashing Schemes for Extendible Arrays (Extended Arrays)
STOC
Arnold L. Rosenberg, Larry J. Stockmeyer
1975 J jnl
Managing Storage for Extendible Arrays.
SIAM J. Comput.
Arnold L. Rosenberg
1975 J jnl
On storing arbitrarily many extendible arrays of arbitrary dimensions.
Int. J. Parallel Program.
Arnold L. Rosenberg
1975 J jnl
Preserving Proximity in Arrays.
SIAM J. Comput.
Arnold L. Rosenberg
1975 J jnl
What Is a Multilevel Array?
IBM J. Res. Dev.
Arnold L. Rosenberg, James W. Thatcher
1974 J jnl
Allocating Storage for Extendible Arrays.
J. ACM
Arnold L. Rosenberg
1974 J jnl
An extrinsic characterization of addressable data graphs.
Discret. Math.
Arnold L. Rosenberg
1974 — conf
Computed Access in Ragged Arrays.
IFIP Congress
Arnold L. Rosenberg
1974 A* conf
Managing Storage for Extendible Arrays
STOC
Arnold L. Rosenberg
1973 J jnl
On the time required to recognize properties of graphs: a problem.
SIGACT News
Arnold L. Rosenberg
1973 J jnl
Suffixes of Addressable Data Graphs
Inf. Control.
Arnold L. Rosenberg
1973 A* conf
Transitions in Extendible Arrays.
POPL
Arnold L. Rosenberg
1972 J jnl
Addressable Data Graphs.
J. ACM
Arnold L. Rosenberg
1972 A* ed.
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, May 1-3, 1972, Denver, Colorado, USA
STOC
Patrick C. Fischer, H. Paul Zeiger, Jeffrey D. Ullman, Arnold L. Rosenberg
1972 A* conf
Rapid Identification of Repeated Patterns in Strings, Trees and Arrays
STOC
Richard M. Karp, Raymond E. Miller, Arnold L. Rosenberg
1972 J jnl
Real-Time Simulation of Multihead Tape Units.
J. ACM
Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg
1972 J jnl
Symmetries in Data Graphs.
SIAM J. Comput.
Arnold L. Rosenberg
1971 A* conf
Addressable Data Graphs: Extended Abstract
STOC
Arnold L. Rosenberg
1971 J jnl
Data Graphs and Addressing Schemes.
J. Comput. Syst. Sci.
Arnold L. Rosenberg
1970 J jnl
A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets.
J. ACM
Arnold L. Rosenberg
1970 A* conf
Data Graphs and Addressing Schemes: Extended Abstract
STOC
Arnold L. Rosenberg
1970 J jnl
Time-Restricted Sequence Generation.
J. Comput. Syst. Sci.
Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg
1968 J jnl
Counter Machines and Counter Languages.
Math. Syst. Theory
Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg
1968 — conf
Limited Random Access Turing Machines
SWAT
Michael J. Fischer, Arnold L. Rosenberg
1968 J jnl
Multitape One-Way Nonwriting Automata.
J. Comput. Syst. Sci.
Patrick C. Fischer, Arnold L. Rosenberg
1968 J jnl
On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages.
J. ACM
Arnold L. Rosenberg
1968 J jnl
Real-Time Solutions of the Origin-Crossing Problem.
Math. Syst. Theory
Michael J. Fischer, Arnold L. Rosenberg
1967 J jnl
A Machine Realization of the Linear Context-Free Languages
Inf. Control.
Arnold L. Rosenberg
1967 J jnl
Multitape Finite Automata with Rewind Instructions.
J. Comput. Syst. Sci.
Arnold L. Rosenberg
1967 — conf
Real Time Counter Machines (Preliminary Version)
SWAT
Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg
1967 J jnl
Real-Time Definable Languages.
J. ACM
Arnold L. Rosenberg
1967 — conf
Turing Machines with Several Read-Write Heads (Preliminary Report)
SWAT
Albert R. Meyer, Arnold L. Rosenberg, Patrick C. Fischer
1965 — conf
On multi-head finite automata
SWCT
Arnold L. Rosenberg
1964 — conf
On n-tape finite state acceptors
SWCT
Arnold L. Rosenberg