default search action
Arnold L. Rosenberg
Person information
- affiliation: University of Massachusetts Amherst, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
- [b3]Arnold L. Rosenberg, Denis Trystram:
Understand Mathematics, Understand Computing - Discrete Mathematics That All Computing Students Should Know. Springer 2020, ISBN 978-3-030-58375-0, pp. 1-550 - [c99]Henry A. Gabb, Andrew Lumsdaine, Margaret Martonosi, Arnold L. Rosenberg, Martina Barnas:
EduPar-20 Invited Panel. IPDPS Workshops 2020: 251
2010 – 2019
- 2018
- [j121]Arnold L. Rosenberg:
Bio-Inspired Pattern Processing by Cellular ANTomata. J. Cell. Autom. 13(1-2): 53-80 (2018) - [p2]Sushil K. Prasad, Anshul Gupta, Arnold L. Rosenberg, Alan Sussman, Charles C. Weems:
Editors' Introduction and Roadmap. Topics in Parallel and Distributed Computing 2018: 1-20 - [e8]Sushil K. Prasad, Anshul Gupta, Arnold L. Rosenberg, Alan Sussman, Charles C. Weems:
Topics in Parallel and Distributed Computing, Enhancing the Undergraduate Curriculum: Performance, Concurrency, and Programming on Modern Platforms. Springer 2018, ISBN 978-3-319-93108-1 [contents] - 2017
- [j120]Michela Taufer
, Arnold L. Rosenberg:
Scheduling DAG-based workflows on single cloud instances: High-performance and cost effectiveness with a static scheduler. Int. J. High Perform. Comput. Appl. 31(1): 19-31 (2017) - [j119]Arnold L. Rosenberg:
Nano-Technology and the Nanny State. Int. J. Unconv. Comput. 13(3): 235-244 (2017) - [j118]Alan L. Selman, Arnold L. Rosenberg:
50 Years of TOCS. Theory Comput. Syst. 60(1): 1-2 (2017) - [c98]Arnold L. Rosenberg:
Cellular ANTomata: A Tool for Early PDC Education. Euro-Par Workshops 2017: 252-265 - 2016
- [c97]Arnold L. Rosenberg:
Scheduling DAGs Opportunistically: The Dream and the Reality Circa 2016. Euro-Par 2016: 22-33 - [c96]Arnold L. Rosenberg:
Cellular ANTomata as Engines for Highly Parallel Pattern Processing. ICA3PP Workshops 2016: 261-277 - [c95]Jeremy Benson, Trilce Estrada
Scheduling Matters: Area-Oriented Heuristic for Resource Management. SBAC-PAD 2016: 214-221 - 2015
- [j117]Scott T. Roche, Arnold L. Rosenberg, Rajmohan Rajaraman:
On constructing DAG-schedules with large areas. Concurr. Comput. Pract. Exp. 27(16): 4107-4121 (2015) - [j116]Gennaro Cordasco
An AREA-Oriented Heuristic for Scheduling DAGs on Volatile Computing Platforms. IEEE Trans. Parallel Distributed Syst. 26(8): 2164-2177 (2015) - 2014
- [j115]Arnold L. Rosenberg:
Region Management by Finite-State Robots. Comput. J. 57(1): 59-72 (2014) - [j114]Gennaro Cordasco
On Scheduling Series-Parallel DAGs to Maximize Area. Int. J. Found. Comput. Sci. 25(5): 597-622 (2014) - [c94]Scott T. Roche, Arnold L. Rosenberg, Rajmohan Rajaraman:
On Constructing DAG-Schedules with Large AREAs. Euro-Par 2014: 620-631 - [c93]Sushil K. Prasad, Almadena Yu. Chtchelkanova, Anshul Gupta, Arnold L. Rosenberg, Alan Sussman:
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates (abstract only). SIGCSE 2014: 735 - 2013
- [j113]Anne Benoit
Static Strategies for Worksharing with Unrecoverable Interruptions. Theory Comput. Syst. 53(3): 386-423 (2013) - [c92]Arnold L. Rosenberg:
Finite-State Robots in a Warehouse: Achieving Linear Parallel Speedup While Rearranging Objects. ICPP 2013: 379-388 - 2012
- [j112]Arnold L. Rosenberg:
Cellular ANTomata. Adv. Complex Syst. 15(6) (2012) - [j111]Arnold L. Rosenberg:
The Parking Problem for Finite-State Robots. J. Graph Algorithms Appl. 16(2): 483-506 (2012) - [j110]Gennaro Cordasco
On scheduling dag s for volatile computing platforms: Area-maximizing schedules. J. Parallel Distributed Comput. 72(10): 1347-1360 (2012) - [c91]Arnold L. Rosenberg:
Finite-State Robots in the Land of Rationalia. ISCIS 2012: 3-11 - 2011
- [j109]Gennaro Cordasco
On clustering DAGs for task-hungry computing platforms. Central Eur. J. Comput. Sci. 1(1): 19-35 (2011) - [j108]Arnold L. Rosenberg, Ron Chi-Lung Chiang:
Heterogeneity in Computing: Insights from a Worksharing Scheduling Problem. Int. J. Found. Comput. Sci. 22(6): 1471-1493 (2011) - [j107]Anne Benoit
Static worksharing strategies for heterogeneous computers with unrecoverable interruptions. Parallel Comput. 37(8): 365-378 (2011) - [c90]Arnold L. Rosenberg:
Greedy "Exploitation" Is Close to Optimal on Node-Heterogeneous Clusters. Euro-Par (1) 2011: 155-166 - [c89]Gennaro Cordasco
Assessing the Computational Benefits of AREA-Oriented DAG-Scheduling. Euro-Par (1) 2011: 180-192 - [c88]Kunal Agarwal, Panagiota Fatourou, Arnold L. Rosenberg, Frédéric Vivien
Introduction. Euro-Par (2) 2011: 224-225 - [c87]Sushil K. Prasad
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates. SIGCSE 2011: 617-618 - 2010
- [b2]Arnold L. Rosenberg:
The Pillars of Computation Theory - State, Encoding, Nondeterminism. Springer 2010, ISBN 978-0-387-09638-4, pp. I-XVII, 1-324 - [j106]Gennaro Cordasco
Extending IC-scheduling via the Sweep Algorithm. J. Parallel Distributed Comput. 70(3): 201-211 (2010) - [c86]Gennaro Cordasco
Area-Maximizing Schedules for Series-Parallel DAGs. Euro-Par (2) 2010: 380-392 - [c85]Arnold L. Rosenberg:
Ants in Parking Lots. Euro-Par (2) 2010: 400-411 - [c84]Olivier Beaumont
Link-heterogeneity vs. node-heterogeneity in clusters. HiPC 2010: 1-8 - [c83]Ron Chi-Lung Chiang, Anthony A. Maciejewski
Statistical predictors of computing power in heterogeneous clusters. IPDPS Workshops 2010: 1-9 - [c82]Arnold L. Rosenberg, Ron Chi-Lung Chiang:
Toward understanding heterogeneity in computing. IPDPS 2010: 1-10
2000 – 2009
- 2009
- [c81]Anne Benoit
Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures. Euro-Par Workshops 2009: 71-80 - [c80]Anne Benoit
Static strategies forworksharing with unrecoverable interruptions. IPDPS 2009: 1-12 - [c79]Gennaro Cordasco
On scheduling dags to maximize area. IPDPS 2009: 1-12 - [c78]Arnold L. Rosenberg:
Path-robust multi-channel wireless networks. IPDPS 2009: 1-10 - 2008
- [j105]Arnold L. Rosenberg:
A "Big-Ideas" Computation Theory Course for the Undergraduate. Bull. EATCS 94: 222-232 (2008) - [j104]Micah Adler, Ying Gong, Arnold L. Rosenberg:
On "Exploiting" Node-Heterogeneous Clusters Optimally. Theory Comput. Syst. 42(4): 465-487 (2008) - [c77]Mark Sims, Gennaro Cordasco
On Clustering Tasks in IC-Optimal Dags. ICPP 2008: 381-388 - [c76]Arnold L. Rosenberg:
Cellular ANTomata: Food-Finding and Maze-Threading. ICPP 2008: 528-535 - [c75]Gennaro Cordasco
Extending IC-Scheduling via the Sweep Algorithm. PDP 2008: 366-373 - 2007
- [j103]Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde:
A Tool for Prioritizing DAGMan Jobs and its Evaluation. J. Grid Comput. 5(2): 197-212 (2007) - [j102]Bhuvan Urgaonkar, Arnold L. Rosenberg, Prashant J. Shenoy
Application Placement on a Cluster of Servers. Int. J. Found. Comput. Sci. 18(5): 1023-1041 (2007) - [j101]Arnold L. Rosenberg:
Best Paper Award recipients: 2006 International Parallel and Distributed Processing Symposium. J. Parallel Distributed Comput. 67(12): 1231 (2007) - [j100]Gennaro Cordasco
Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories. IEEE Trans. Parallel Distributed Syst. 18(7): 973-982 (2007) - [j99]Gennaro Cordasco
Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality. IEEE Trans. Parallel Distributed Syst. 18(11): 1607-1617 (2007) - [c74]Gennaro Cordasco
Applying IC-Scheduling Theory to Familiar Classes of Computations. IPDPS 2007: 1-8 - [c73]Robert Hall, Arnold L. Rosenberg, Arun Venkataramani:
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing. IPDPS 2007: 1-9 - [c72]Arnold L. Rosenberg:
Cellular ANTomata. ISPA 2007: 78-90 - [c71]George Dean Bissias, Brian Neil Levine, Arnold L. Rosenberg:
Bounding damage from link destruction, with application to the internet. SIGMETRICS 2007: 367-368 - 2006
- [j98]Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych:
Toward a Theory for Scheduling Dags in Internet-Based Computing. IEEE Trans. Computers 55(6): 757-768 (2006) - [c70]Grzegorz Malewicz, Arnold L. Rosenberg:
A Pebble Game for Internet-Based Computing. Essays in Memory of Shimon Even 2006: 291-312 - [c69]Arnold L. Rosenberg:
State. Essays in Memory of Shimon Even 2006: 375-398 - [c68]Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde:
A Tool for Prioritizing DAGMan Jobs and Its Evaluation. HPDC 2006: 156-168 - [c67]Gennaro Cordasco
On Scheduling Expansive and Reductive Dags for Internet-Based Computing. ICDCS 2006: 29 - [p1]Arnold L. Rosenberg:
Changing Challenges for Collaborative Algorithmics. Handbook of Nature-Inspired and Innovative Computing 2006: 1-44 - [e7]Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman:
Theoretical Computer Science, Essays in Memory of Shimon Even. Lecture Notes in Computer Science 3895, Springer 2006, ISBN 3-540-32880-7 [contents] - 2005
- [j97]Jacir Luiz Bordim, Koji Nakano, Arnold L. Rosenberg:
Foreword. Int. J. Found. Comput. Sci. 16(1): 1-2 (2005) - [j96]Jacir Luiz Bordim, Koji Nakano, Arnold L. Rosenberg:
Foreword. Int. J. Found. Comput. Sci. 16(2): 143-144 (2005) - [j95]Franck Cappello, Pierre Fraigniaud, Bernard Mans
An algorithmic model for heterogeneous hyper-clusters: rationale and experience. Int. J. Found. Comput. Sci. 16(2): 195-215 (2005) - [j94]Pierre Fraigniaud, Bernard Mans
Efficient trigger-broadcasting in heterogeneous clusters. J. Parallel Distributed Comput. 65(5): 628-642 (2005) - [j93]Arnold L. Rosenberg, Matthew Yurkewych:
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing. IEEE Trans. Computers 54(4): 428-438 (2005) - [c66]Matthew Yurkewych, Brian Neil Levine, Arnold L. Rosenberg:
On the cost-ineffectiveness of redundancy in commercial P2P computing. CCS 2005: 280-288 - [c65]Grzegorz Malewicz, Arnold L. Rosenberg:
Batch-Scheduling Dags for Internet-Based Computing. Euro-Par 2005: 262-271 - [c64]Arnold L. Rosenberg:
The Changing Challenges of Collaborative Algorithmics. HiPC 2005: 5 - [c63]Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych:
On Scheduling Complex Dags for Internet-Based Computing. IPDPS 2005 - 2004
- [j92]Arnold L. Rosenberg:
Obituary: Shimon Even. Theory Comput. Syst. 37(4): 481 (2004) - [j91]Arnold L. Rosenberg:
On Scheduling Mesh-Structured Computations for Internet-Based Computing. IEEE Trans. Computers 53(9): 1176-1186 (2004) - [c62]Arnold L. Rosenberg, Matthew Yurkewych:
On Scheduling Computation-Dags for Internet-Based Computing. PDCS 2004: 58-63 - [c61]Bhuvan Urgaonkar, Arnold L. Rosenberg, Prashant J. Shenoy:
Application Placement on a Cluster of Servers. PDCS 2004: 85-90 - [c60]Arnold L. Rosenberg:
How to Share a Bag of Tasks Optimally in a Heterogeneous Cluster - Three Models, Three Answers. Annual Simulation Symposium 2004: 3 - [c59]Sharad Jaiswal, Arnold L. Rosenberg, Donald F. Towsley
Comparing the Structure of Power-Law Graphs and the Internet AS Graph. ICNP 2004: 294-303 - [c58]Arnold L. Rosenberg:
An Algorithmic Model for Heterogeneous Clusters: Rationale and Experience. IPDPS 2004 - 2003
- [j90]Arnold L. Rosenberg:
Efficient Pairing Functions - and Why You Should Care. Int. J. Found. Comput. Sci. 14(1): 3-17 (2003) - [j89]Arnold L. Rosenberg:
Accountable Web-Computing. IEEE Trans. Parallel Distributed Syst. 14(2): 97-106 (2003) - [c57]Micah Adler, Ying Gong, Arnold L. Rosenberg:
Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?". Annual Simulation Symposium 2003: 39-46 - [c56]Gennaro Cordasco
c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories. Euro-Par 2003: 911-916 - [c55]Michael K. Bradshaw, Arnold L. Rosenberg, Donald F. Towsley
Planned Object Duplication Strategies in Dynamic PRR Meshes. ICNP 2003: 50-60 - [c54]Arnold L. Rosenberg:
On Scheduling Collaborative Computations on the Internet, I: Mesh-Dags and Their Close Relatives. IPDPS 2003: 6 - [c53]Arnold L. Rosenberg:
To BSP or not to BSP in Heterogeneous NOWs. IPDPS 2003: 165 - [c52]Micah Adler, Ying Gong, Arnold L. Rosenberg:
Optimal sharing of bags of tasks in heterogeneous clusters. SPAA 2003: 1-10 - [e6]Arnold L. Rosenberg, Friedhelm Meyer auf der Heide:
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). ACM 2003, ISBN 1-58113-661-7 [contents] - 2002
- [j88]Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman
Scheduling Time-Constrained Communication in Linear Networks. Theory Comput. Syst. 35(6): 599-623 (2002) - [j87]Arnold L. Rosenberg:
Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload. IEEE Trans. Parallel Distributed Syst. 13(2): 179-191 (2002) - [c51]Zhenlin Wang, Kathryn S. McKinley, Arnold L. Rosenberg, Charles C. Weems:
Using the Compiler to Improve Cache Replacement Decisions. IEEE PACT 2002: 199-208 - [c50]Arnold L. Rosenberg:
Accountable Web-Computing. IPDPS 2002 - [c49]Arnold L. Rosenberg:
Efficient Pairing Functions - And Why You Should Care. IPDPS 2002 - [e5]Arnold L. Rosenberg, Bruce M. Maggs:
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002. ACM 2002, ISBN 1-58113-529-7 [contents] - 2001
- [b1]Arnold L. Rosenberg, Lenwood S. Heath:
Graph separators with applications. Frontiers of computer science, Kluwer 2001, ISBN 978-0-306-46464-5, pp. I-XII, 1-257 - [j86]William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman
Augmented Ring Networks. IEEE Trans. Parallel Distributed Syst. 12(6): 598-609 (2001) - [c48]Arnold L. Rosenberg:
Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better. CLUSTER 2001: 124- - [c47]Franck Cappello, Pierre Fraigniaud, Bernard Mans
HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors. IPDPS 2001: 42 - [c46]Dawn J. Lawrie, W. Bruce Croft, Arnold L. Rosenberg:
Finding Topic Words for Hierarchical Summarization. SIGIR 2001: 349-357 - [e4]Arnold L. Rosenberg:
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001. ACM 2001, ISBN 1-58113-409-6 [contents] - 2000
- [j85]Arnold L. Rosenberg:
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations II: On Maximizing Guaranteed Output. Int. J. Found. Comput. Sci. 11(1): 183-204 (2000) - [j84]Arnold L. Rosenberg:
Editorial Message. Theory Comput. Syst. 33(5/6): 333 (2000) - [c45]Arnold L. Rosenberg:
Optimal Sharing of Partitionable Workloads in Heterogeneous Networks of Workstations. PDPTA 2000 - [c44]Arnold L. Rosenberg:
Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract). SPAA 2000: 22-29
1990 – 1999
- 1999
- [j83]Arnold L. Rosenberg:
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations I: On Maximizing Expected Output. J. Parallel Distributed Comput. 59(1): 31-53 (1999) - [j82]M. E. Barrows, Dawn E. Gregory, Lixin Gao, Arnold L. Rosenberg, Paul R. Cohen:
An empirical study of dynamic scheduling on rings of processors. Parallel Comput. 25(9): 1063-1079 (1999) - [j81]Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman
Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments. IEEE Trans. Parallel Distributed Syst. 10(8): 813-824 (1999) - [j80]Bojana Obrenic, Martin C. Herbordt, Arnold L. Rosenberg, Charles C. Weems:
Using Emulations to Enhance the Performance of Parallel Architectures. IEEE Trans. Parallel Distributed Syst. 10(10): 1067-1081 (1999) - [c43]Arnold L. Rosenberg:
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output. IPPS/SPDP 1999: 520-524 - [c42]William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman:
Augmented Ring Networks. SIROCCO 1999: 1-16 - 1998
- [j79]Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg:
A Tight Layout of the Butterfly Network. Theory Comput. Syst. 31(4): 475-488 (1998) - [j78]Shimon Even, Ami Litman, Arnold L. Rosenberg:
Monochromatic Paths and Triangulated Graphs. SIAM J. Discret. Math. 11(4): 546-556 (1998) - [c41]Arnold L. Rosenberg:
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations. IPPS/SPDP 1998: 519-523 - [c40]Micah Adler, Ramesh K. Sitaraman
Scheduling Time-Constrained Communication in Linear Networks. SPAA 1998: 269-278 - 1997
- [j77]Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg, Eric J. Schwabe:
Work-preserving emulations of fixed-connection networks. J. ACM 44(1): 104-147 (1997) - [j76]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
An Optimal Strategies for Cycle-Stealing in Networks of Workstations. IEEE Trans. Computers 46(5): 545-557 (1997) - [j75]Arnold L. Rosenberg, Vittorio Scarano
The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations. IEEE Trans. Computers 46(10): 1119-1131 (1997) - [c39]Arnold L. Rosenberg:
Theoretical research on networks: models and methodology. SIROCCO 1997: 282-293 - 1996
- [j74]Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Bojana Obrenic, Arnold L. Rosenberg, Eric J. Schwabe:
Optimal Emulations by Butterfly-Like Networks. J. ACM 43(2): 293-330 (1996) - [j73]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off. J. Parallel Distributed Comput. 33(1): 55-68 (1996) - [j72]Lixin Gao, Arnold L. Rosenberg:
Toward Efficient Scheduling of Evolving Computations on Rings of Processors. J. Parallel Distributed Comput. 38(1): 92-100 (1996) - [j71]Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci
On Bufferless Routing of Variable Length Messages in Leveled Networks. IEEE Trans. Computers 45(6): 714-729 (1996) - [c38]Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg:
A Tight Layout of the Butterfly Network. SPAA 1996: 170-175 - [c37]Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman
On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors. SPAA 1996: 309-317 - [c36]Dawn E. Gregory, Lixin Gao, Arnold L. Rosenberg, Paul R. Cohen:
An empirical study of dynamic scheduling on rings of processors. SPDP 1996: 470-473 - 1995
- [j70]Arnold L. Rosenberg:
Thoughts on Parallelism and Concurrency in Computing Curricula. ACM Comput. Surv. 27(2): 280-283 (1995) - [j69]Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman
The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation. Parallel Process. Lett. 5: 37-48 (1995) - [j68]Marc Picquendar, Arnold L. Rosenberg, Vittorio Scarano:
A Cost-Effective Streamlining of the Diogenes Design Methodology. Parallel Process. Lett. 5: 513-524 (1995) - [j67]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Salvage-Embeddings of Complete Trees. SIAM J. Discret. Math. 8(4): 617-637 (1995) - [c35]Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman
Optimal architecture-independent scheduling of fine-grain tree-sweep computations. SPDP 1995: 620-629 - [e3]D. Frank Hsu, Arnold L. Rosenberg, Dominique Sotteau:
Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, February 7-9, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 21, DIMACS/AMS 1995, ISBN 978-0-8218-0238-0 [contents] - 1994
- [c34]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff. SPAA 1994: 85-93 - [c33]Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman
The reconfigurable ring of processors: fine-grained tree-structured computations. SPDP 1994: 470-477 - [c32]Lixin Gao, Arnold L. Rosenberg:
On balancing computational load on rings of processors. SPDP 1994: 478-483 - 1993
- [j66]Sandeep N. Bhatt, Geppino Pucci
Scattering and Gathering Messages in Networks of Processors. IEEE Trans. Computers 42(8): 938-949 (1993) - [c31]Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci
On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract). ESA 1993: 49-60 - [e2]Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg:
Parallel Architectures and Their Efficient Use, First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992, Proceedings. Lecture Notes in Computer Science 678, Springer 1993, ISBN 3-540-56731-3 [contents] - 1992
- [j65]Arnold L. Rosenberg:
Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies. Discret. Appl. Math. 37/38: 465-488 (1992) - [j64]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Efficient Embeddings of Trees in Hypercubes. SIAM J. Comput. 21(1): 151-162 (1992) - [j63]Lenwood S. Heath, Arnold L. Rosenberg:
Laying out Graphs Using Queues. SIAM J. Comput. 21(5): 927-958 (1992) - [j62]Lenwood S. Heath, Frank Thomson Leighton, Arnold L. Rosenberg:
Comparing Queues and Stacks as Mechanisms for Laying out Graphs. SIAM J. Discret. Math. 5(3): 398-412 (1992) - [c30]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Tolerating Faults in Synchronization Networks. CONPAR 1992: 1-12 - [c29]Arnold L. Rosenberg:
Better Parallel Architectures via Emulations. Heinz Nixdorf Symposium 1992: 30-36 - 1991
- [j61]Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg:
Partitioning Circuits for Improved Testability. Algorithmica 6(1): 37-48 (1991) - [c28]Arnold L. Rosenberg:
Cayley Graphs and Direct-Product Graphs. Groups And Computation 1991: 245-251 - 1990
- [j60]David S. Greenberg, Lenwood S. Heath, Arnold L. Rosenberg:
Optimal Embeddings of Butterfly-Like Graphs in the Hypercube. Math. Syst. Theory 23(1): 61-77 (1990) - [j59]Arnold L. Rosenberg:
Exposing Graph Uniformities via Algebraic Specification. Math. Syst. Theory 23(4): 227-244 (1990) - [j58]Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg:
Group Action Graphs and Parallel Architectures. SIAM J. Comput. 19(3): 544-569 (1990)
1980 – 1989
- 1989
- [j57]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Universal Graphs for Bounded-Degree Trees and Planar Graphs. SIAM J. Discret. Math. 2(2): 145-155 (1989) - [j56]Jonathan F. Buss, Arnold L. Rosenberg, Judson D. Knott:
Vertex Types in Book-Embeddings. SIAM J. Discret. Math. 2(2): 156-175 (1989) - [j55]Arnold L. Rosenberg:
Efficient emulations of interconnection networks. SIGARCH Comput. Archit. News 17(6): 67-79 (1989) - [c27]Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg:
Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract). STOC 1989: 227-240 - 1988
- [j54]Lenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith:
The physical mapping problem for parallel architectures. J. ACM 35(3): 603-634 (1988) - [c26]Arnold L. Rosenberg:
GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions. AWOC 1988: 160-169 - [c25]Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Arnold L. Rosenberg:
Optimal Simulations by Butterfly Networks (Preliminary Version). STOC 1988: 192-204 - 1986
- [j53]Fan R. K. Chung, Arnold L. Rosenberg:
Minced Trees, with Applications to Fault-Tolerant VLSI Processor Arrays. Math. Syst. Theory 19(1): 1-12 (1986) - [j52]Frank Thomson Leighton, Arnold L. Rosenberg:
Three-Dimensional Circuit Layouts. SIAM J. Comput. 15(3): 793-813 (1986) - [c24]Arnold L. Rosenberg:
Diogenes, Circa 1986. Aegean Workshop on Computing 1986: 96-107 - [c23]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Optimal Simulations of Tree Machines (Preliminary Version). FOCS 1986: 274-282 - 1985
- [j51]Arnold L. Rosenberg:
A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays. IEEE Trans. Computers 34(6): 578-584 (1985) - 1984
- [j50]Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Binary search trees with binary comparison cost. Int. J. Parallel Program. 13(2): 77-101 (1984) - [j49]Arnold L. Rosenberg:
Editorial: Special FOCS Issue - Twenty-Second Annual IEEE Symposium on Foundations of Computer Science. Math. Syst. Theory 17(1): 1 (1984) - [j48]Thomas Ottmann, Douglas Stott Parker Jr., Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Minimal-Cost Brother Trees. SIAM J. Comput. 13(1): 197-217 (1984) - [c22]Arnold L. Rosenberg:
The VLSI Revolution in Theoretical Circles. ICALP 1984: 23-40 - 1983
- [j47]Arnold L. Rosenberg, Ivan Hal Sudborough:
Bandwidth and pebbling. Computing 31(2): 115-139 (1983) - [j46]Arnold L. Rosenberg:
Three-Dimensional VLSI: A Case Study. J. ACM 30(3): 397-416 (1983) - [j45]Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg:
Cost Trade-offs in Graph Embeddings, with Applications. J. ACM 30(4): 709-728 (1983) - [j44]Zeev Barzilai, Don Coppersmith, Arnold L. Rosenberg:
Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing. IEEE Trans. Computers 32(2): 190-194 (1983) - [j43]Arnold L. Rosenberg:
The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors. IEEE Trans. Computers 32(10): 902-910 (1983) - [c21]Arnold L. Rosenberg:
Fault-Tolerant Interconnection Networks: A Graph-Theoretic Approach. WG 1983: 286-297 - 1982
- [j42]Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood:
Stabbing Line Segments. BIT 22(3): 274-281 (1982) - [j41]Jia-Wei Hong, Arnold L. Rosenberg:
Graphs that are Almost Binary Trees. SIAM J. Comput. 11(2): 227-242 (1982) - [j40]Thomas Ottmann, Arnold L. Rosenberg, Larry J. Stockmeyer:
A Dictionary Machine (for VLSI). IEEE Trans. Computers 31(9): 892-897 (1982) - [j39]Romas Aleliunas, Arnold L. Rosenberg:
On Embedding Rectangular Grids in Square Grids. IEEE Trans. Computers 31(9): 907-913 (1982) - 1981
- [j38]Arnold L. Rosenberg:
On Uniformly Inserting One Data Structure into Another. Commun. ACM 24(2): 88-90 (1981) - [j37]Arnold L. Rosenberg, Lawrence Snyder:
Time- and Space-Optimality in B-Trees. ACM Trans. Database Syst. 6(1): 174-193 (1981) - [c20]Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg:
Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). ICALP 1981: 41-55 - [c19]Jia-Wei Hong, Arnold L. Rosenberg:
Graphs that Are Almost Binary Trees (Preliminary Version). STOC 1981: 334-341 - [c18]Arnold L. Rosenberg:
Three-Dimensional VLSI Layouts. WG 1981: 55-60 - [c17]Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
A Realistic Cost Measure for Binary Search Trees. WG 1981: 163-172 - 1980
- [j36]Richard J. Lipton, Arnold L. Rosenberg, Andrew Chi-Chih Yao:
External Hashing Schemes for Collections of Data Structures. J. ACM 27(1): 81-95 (1980) - [j35]Arnold L. Rosenberg, Larry J. Stockmeyer, Lawrence Snyder:
Uniform Data Encodings. Theor. Comput. Sci. 11: 145-165 (1980) - [c16]Arnold L. Rosenberg:
Issues in the Study of Graph Embeddings. WG 1980: 150-176
1970 – 1979
- 1979
- [j34]Arnold L. Rosenberg:
A Note on Paths Embedded in Trees. Inf. Process. Lett. 8(5): 272-273 (1979) - [j33]Arnold L. Rosenberg:
Encoding Data Structures in Trees. J. ACM 26(4): 668-689 (1979) - [j32]Arnold L. Rosenberg, Derick Wood, Zvi Galil:
Storage Representations for Tree-Like Data Structures. Math. Syst. Theory 13: 105-130 (1979) - [j31]Raymond E. Miller, Nicholas Pippenger, Arnold L. Rosenberg, Lawrence Snyder:
Optimal 2, 3-Trees. SIAM J. Comput. 8(1): 42-59 (1979) - [c15]Arnold L. Rosenberg, Lawrence Snyder:
Compact B-Trees. SIGMOD Conference 1979: 43-51 - [c14]Arnold L. Rosenberg, Derick Wood, Zvi Galil:
Storage Representations for Tree-Like Data Structures. STOC 1979: 99-107 - [c13]Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Node-Visit Optimal 1-2 Brother Trees. Theoretical Computer Science 1979: 213-221 - 1978
- [j30]Arnold L. Rosenberg:
Data Encodings and Their Costs. Acta Informatica 9: 273-292 (1978) - [j29]Arnold L. Rosenberg, Lawrence Snyder:
Bounds on the Costs of Data Encodings. Math. Syst. Theory 12: 9-39 (1978) - [j28]Arnold L. Rosenberg, Lawrence Snyder:
Minimal-Comparison 2, 3-Trees. SIAM J. Comput. 7(4): 465-480 (1978) - 1977
- [j27]Arnold L. Rosenberg, Larry J. Stockmeyer:
Storage Schemes for Boundedly Extendible Arrays. Acta Informatica 7: 289-303 (1977) - [j26]Arnold L. Rosenberg, Larry J. Stockmeyer:
Hashing Schemes for Extendible Arrays. J. ACM 24(2): 199-221 (1977) - [j25]Arnold L. Rosenberg:
On Storing Concatenable Arrays. J. Comput. Syst. Sci. 14(2): 157-174 (1977) - [j24]Arnold L. Rosenberg:
On Storing Ragged Arrays by Hashing. Math. Syst. Theory 10: 193-210 (1977) - 1975
- [j23]Arnold L. Rosenberg, James W. Thatcher:
What Is a Multilevel Array? IBM J. Res. Dev. 19(2): 163-169 (1975) - [j22]Arnold L. Rosenberg:
On storing arbitrarily many extendible arrays of arbitrary dimensions. Int. J. Parallel Program. 4(2): 189-196 (1975) - [j21]Arnold L. Rosenberg:
Corrigendum: "Allocating Storage for Extendible Arrays". J. ACM 22(2): 308 (1975) - [j20]Arnold L. Rosenberg:
Generalized Addressing Schemes for Data Graphs. Math. Syst. Theory 8(4): 353-367 (1975) - [j19]Arnold L. Rosenberg:
Managing Storage for Extendible Arrays. SIAM J. Comput. 4(3): 287-306 (1975) - [j18]Arnold L. Rosenberg:
Preserving Proximity in Arrays. SIAM J. Comput. 4(4): 443-460 (1975) - [c12]Arnold L. Rosenberg, Larry J. Stockmeyer:
Hashing Schemes for Extendible Arrays (Extended Arrays). STOC 1975: 159-166 - 1974
- [j17]Arnold L. Rosenberg:
An extrinsic characterization of addressable data graphs. Discret. Math. 9(1): 61-70 (1974) - [j16]Arnold L. Rosenberg:
Allocating Storage for Extendible Arrays. J. ACM 21(4): 652-670 (1974) - [c11]Arnold L. Rosenberg:
Computed Access in Ragged Arrays. IFIP Congress 1974: 642-646 - [c10]Arnold L. Rosenberg:
Managing Storage for Extendible Arrays. STOC 1974: 297-302 - 1973
- [j15]Arnold L. Rosenberg:
Suffixes of Addressable Data Graphs. Inf. Control. 23(2): 107-127 (1973) - [j14]Arnold L. Rosenberg:
On the time required to recognize properties of graphs: a problem. SIGACT News 5(4): 15-16 (1973) - [c9]Arnold L. Rosenberg:
Transitions in Extendible Arrays. POPL 1973: 218-225 - 1972
- [j13]Arnold L. Rosenberg:
Addressable Data Graphs. J. ACM 19(2): 309-340 (1972) - [j12]Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg:
Real-Time Simulation of Multihead Tape Units. J. ACM 19(4): 590-607 (1972) - [j11]Arnold L. Rosenberg:
Symmetries in Data Graphs. SIAM J. Comput. 1(1): 40-65 (1972) - [c8]Richard M. Karp, Raymond E. Miller, Arnold L. Rosenberg:
Rapid Identification of Repeated Patterns in Strings, Trees and Arrays. STOC 1972: 125-136 - [e1]Patrick C. Fischer, H. Paul Zeiger, Jeffrey D. Ullman, Arnold L. Rosenberg:
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, May 1-3, 1972, Denver, Colorado, USA. ACM 1972 [contents] - 1971
- [j10]Arnold L. Rosenberg:
Data Graphs and Addressing Schemes. J. Comput. Syst. Sci. 5(3): 193-238 (1971) - [c7]Arnold L. Rosenberg:
Addressable Data Graphs: Extended Abstract. STOC 1971: 138-150 - 1970
- [j9]Arnold L. Rosenberg:
A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets. J. ACM 17(1): 44-50 (1970) - [j8]Patrick C. Fischer, Albert R. Meyer
Time-Restricted Sequence Generation. J. Comput. Syst. Sci. 4(1): 50-73 (1970) - [c6]Arnold L. Rosenberg:
Data Graphs and Addressing Schemes: Extended Abstract. STOC 1970: 48-61
1960 – 1969
- 1968
- [j7]Arnold L. Rosenberg:
On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages. J. ACM 15(4): 672-679 (1968) - [j6]Patrick C. Fischer, Arnold L. Rosenberg:
Multitape One-Way Nonwriting Automata. J. Comput. Syst. Sci. 2(1): 88-101 (1968) - [j5]Michael J. Fischer, Arnold L. Rosenberg:
Real-Time Solutions of the Origin-Crossing Problem. Math. Syst. Theory 2(3): 257-263 (1968) - [j4]Patrick C. Fischer, Albert R. Meyer
Counter Machines and Counter Languages. Math. Syst. Theory 2(3): 265-283 (1968) - [c5]Michael J. Fischer, Arnold L. Rosenberg:
Limited Random Access Turing Machines. SWAT 1968: 356-367 - 1967
- [j3]Arnold L. Rosenberg:
A Machine Realization of the Linear Context-Free Languages. Inf. Control. 10(2): 175-188 (1967) - [j2]Arnold L. Rosenberg:
Real-Time Definable Languages. J. ACM 14(4): 645-662 (1967) - [j1]Arnold L. Rosenberg:
Multitape Finite Automata with Rewind Instructions. J. Comput. Syst. Sci. 1(3): 299-315 (1967) - [c4]Albert R. Meyer, Arnold L. Rosenberg, Patrick C. Fischer:
Turing Machines with Several Read-Write Heads (Preliminary Report). SWAT 1967: 117-127 - [c3]Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg:
Real Time Counter Machines (Preliminary Version). SWAT 1967: 148-154 - 1965
- [c2]Arnold L. Rosenberg:
On multi-head finite automata. SWCT 1965: 221-228 - 1964
- [c1]Arnold L. Rosenberg:
On n-tape finite state acceptors. SWCT 1964: 76-81
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-15 23:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: