Arnold L. Rosenberg

	2011
193		Arnold L. Rosenberg: Greedy "Exploitation" Is Close to Optimal on Node-Heterogeneous Clusters. Euro-Par (1) 2011: 155-166
192		Gennaro Cordasco, Rosario De Chiara, Arnold L. Rosenberg: Assessing the Computational Benefits of AREA-Oriented DAG-Scheduling. Euro-Par (1) 2011: 180-192
191		Kunal Agarwal, Panagiota Fatourou, Arnold L. Rosenberg, Frédéric Vivien: Introduction. Euro-Par (2) 2011: 224-225
190		Sushil K. Prasad, Almadena Yu. Chtchelkanova, Sajal K. Das, Frank Dehne, Mohamed Gouda, Anshul Gupta, Joseph 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 Shirazi, Alan Sussman, Charles C. Weems, Jie Wu: NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates. SIGCSE 2011: 617-618
189		Gennaro Cordasco, Arnold L. Rosenberg, Mark Sims: On clustering DAGs for task-hungry computing platforms. Central Europ. J. Computer Science 1(1): 19-35 (2011)
188		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)
187		Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien: Static worksharing strategies for heterogeneous computers with unrecoverable interruptions. Parallel Computing 37(8): 365-378 (2011)
	2010
186		Arnold L. Rosenberg: The Pillars of Computation Theory - State, Encoding, Nondeterminism. Springer 2010: I-XVII, 1-324
185		Gennaro Cordasco, Arnold L. Rosenberg: Area-Maximizing Schedules for Series-Parallel DAGs. Euro-Par (2) 2010: 380-392
184		Arnold L. Rosenberg: Ants in Parking Lots. Euro-Par (2) 2010: 400-411
183		Olivier Beaumont, Arnold L. Rosenberg: Link-heterogeneity vs. node-heterogeneity in clusters. HiPC 2010: 1-8
182		Arnold L. Rosenberg, Ron Chi-Lung Chiang: Toward understanding heterogeneity in computing. IPDPS 2010: 1-10
181		Ron Chi-Lung Chiang, Anthony A. Maciejewski, Arnold L. Rosenberg, Howard Jay Siegel: Statistical predictors of computing power in heterogeneous clusters. IPDPS Workshops 2010: 1-9
180		Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg: Extending IC-scheduling via the Sweep Algorithm. J. Parallel Distrib. Comput. 70(3): 201-211 (2010)
	2009
179		Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien: Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures. Euro-Par Workshops 2009: 71-80
178		Arnold L. Rosenberg: Path-robust multi-channel wireless networks. IPDPS 2009: 1-10
177		Gennaro Cordasco, Arnold L. Rosenberg: On scheduling dags to maximize area. IPDPS 2009: 1-12
176		Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien: Static strategies forworksharing with unrecoverable interruptions. IPDPS 2009: 1-12
	2008
175		Mark Sims, Gennaro Cordasco, Arnold L. Rosenberg: On Clustering Tasks in IC-Optimal Dags. ICPP 2008: 381-388
174		Arnold L. Rosenberg: Cellular ANTomata: Food-Finding and Maze-Threading. ICPP 2008: 528-535
173		Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg: Extending IC-Scheduling via the Sweep Algorithm. PDP 2008: 366-373
172		Arnold L. Rosenberg: A "Big-Ideas" Computation Theory Course for the Undergraduate. Bulletin of the EATCS 94: 222-232 (2008)
171		Micah Adler, Ying Gong, Arnold L. Rosenberg: On "Exploiting" Node-Heterogeneous Clusters Optimally. Theory Comput. Syst. 42(4): 465-487 (2008)
	2007
170		Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg: Applying IC-Scheduling Theory to Familiar Classes of Computations. IPDPS 2007: 1-8
169		Robert Hall, Arnold L. Rosenberg, Arun Venkataramani: A Comparison of Dag-Scheduling Strategies for Internet-Based Computing. IPDPS 2007: 1-9
168		Arnold L. Rosenberg: Cellular ANTomata. ISPA 2007: 78-90
167		George Dean Bissias, Brian Neil Levine, Arnold L. Rosenberg: Bounding damage from link destruction, with application to the internet. SIGMETRICS 2007: 367-368
166		Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg: Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality. IEEE Trans. Parallel Distrib. Syst. 18(11): 1607-1617 (2007)
165		Gennaro Cordasco, Vittorio Scarano, Arnold L. Rosenberg: Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories. IEEE Trans. Parallel Distrib. Syst. 18(7): 973-982 (2007)
164		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)
163		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)
162		Arnold L. Rosenberg: Best Paper Award recipients: 2006 International Parallel and Distributed Processing Symposium. J. Parallel Distrib. Comput. 67(12): 1231 (2007)
	2006
161		Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman: Theoretical Computer Science, Essays in Memory of Shimon Even Springer 2006
160		Grzegorz Malewicz, Arnold L. Rosenberg: A Pebble Game for Internet-Based Computing. Essays in Memory of Shimon Even 2006: 291-312
159		Arnold L. Rosenberg: State. Essays in Memory of Shimon Even 2006: 375-398
158		Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde: A Tool for Prioritizing DAGMan Jobs and Its Evaluation. HPDC 2006: 156-168
157		Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg: On Scheduling Expansive and Reductive Dags for Internet-Based Computing. ICDCS 2006: 29
156		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)
	2005
155		Matthew Yurkewych, Brian Neil Levine, Arnold L. Rosenberg: On the cost-ineffectiveness of redundancy in commercial P2P computing. ACM Conference on Computer and Communications Security 2005: 280-288
154		Grzegorz Malewicz, Arnold L. Rosenberg: Batch-Scheduling Dags for Internet-Based Computing. Euro-Par 2005: 262-271
153		Arnold L. Rosenberg: The Changing Challenges of Collaborative Algorithmics. HiPC 2005: 5
152		Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych: On Scheduling Complex Dags for Internet-Based Computing. IPDPS 2005
151		Arnold L. Rosenberg, Matthew Yurkewych: Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing. IEEE Trans. Computers 54(4): 428-438 (2005)
150		Jacir Luiz Bordim, Koji Nakano, Arnold L. Rosenberg: Foreword. Int. J. Found. Comput. Sci. 16(1): 1-2 (2005)
149		Jacir Luiz Bordim, Koji Nakano, Arnold L. Rosenberg: Foreword. Int. J. Found. Comput. Sci. 16(2): 143-144 (2005)
148		Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg: An algorithmic model for heterogeneous hyper-clusters: rationale and experience. Int. J. Found. Comput. Sci. 16(2): 195-215 (2005)
147		Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg: Efficient trigger-broadcasting in heterogeneous clusters. J. Parallel Distrib. Comput. 65(5): 628-642 (2005)
	2004
146		Arnold L. Rosenberg: How to Share a Bag of Tasks Optimally in a Heterogeneous Cluster - Three Models, Three Answers. Annual Simulation Symposium 2004: 3
145		Sharad Jaiswal, Arnold L. Rosenberg, Donald F. Towsley: Comparing the Structure of Power-Law Graphs and the Internet AS Graph. ICNP 2004: 294-303
144		Arnold L. Rosenberg: An Algorithmic Model for Heterogeneous Clusters: Rationale and Experience. IPDPS 2004
143		Arnold L. Rosenberg, Matthew Yurkewych: On Scheduling Computation-Dags for Internet-Based Computing. ISCA PDCS 2004: 58-63
142		Bhuvan Urgaonkar, Arnold L. Rosenberg, Prashant J. Shenoy: Application Placement on a Cluster of Servers. ISCA PDCS 2004: 85-90
141		Arnold L. Rosenberg: On Scheduling Mesh-Structured Computations for Internet-Based Computing. IEEE Trans. Computers 53(9): 1176-1186 (2004)
140		Arnold L. Rosenberg: Obituary: Shimon Even. Theory Comput. Syst. 37(4): 481 (2004)
	2003
139		Micah Adler, Ying Gong, Arnold L. Rosenberg: Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?". Annual Simulation Symposium 2003: 39-46
138		Gennaro Cordasco, Alberto Negro, Vittorio Scarano, Arnold L. Rosenberg: c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories. Euro-Par 2003: 911-916
137		Michael K. Bradshaw, Arnold L. Rosenberg, Donald F. Towsley: Planned Object Duplication Strategies in Dynamic PRR Meshes. ICNP 2003: 50-60
136		Arnold L. Rosenberg: To BSP or not to BSP in Heterogeneous NOWs. IPDPS 2003: 165
135		Arnold L. Rosenberg: On Scheduling Collaborative Computations on the Internet, I: Mesh-Dags and Their Close Relatives. IPDPS 2003: 6
134		Micah Adler, Ying Gong, Arnold L. Rosenberg: Optimal sharing of bags of tasks in heterogeneous clusters. SPAA 2003: 1-10
133		Arnold L. Rosenberg: Accountable Web-Computing. IEEE Trans. Parallel Distrib. Syst. 14(2): 97-106 (2003)
132		Arnold L. Rosenberg: Efficient Pairing Functions - and Why You Should Care. Int. J. Found. Comput. Sci. 14(1): 3-17 (2003)
	2002
131		Zhenlin Wang, Kathryn S. McKinley, Arnold L. Rosenberg, Charles C. Weems: Using the Compiler to Improve Cache Replacement Decisions. IEEE PACT 2002: 199-208
130		Arnold L. Rosenberg: Accountable Web-Computing. IPDPS 2002
129		Arnold L. Rosenberg: Efficient Pairing Functions - And Why You Should Care. IPDPS 2002
128		Arnold L. Rosenberg: Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload. IEEE Trans. Parallel Distrib. Syst. 13(2): 179-191 (2002)
127		Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, Walter Unger: Scheduling Time-Constrained Communication in Linear Networks. Theory Comput. Syst. 35(6): 599-623 (2002)
	2001
126		Arnold L. Rosenberg, Lenwood S. Heath: Graph separators with applications. Kluwer 2001: I-XII, 1-257
125		Arnold L. Rosenberg: Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better. CLUSTER 2001: 124-
124		Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg: HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors. IPDPS 2001: 42
123		Dawn Lawrie, W. Bruce Croft, Arnold L. Rosenberg: Finding Topic Words for Hierarchical Summarization. SIGIR 2001: 349-357
122		William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman: Augmented Ring Networks. IEEE Trans. Parallel Distrib. Syst. 12(6): 598-609 (2001)
	2000
121		Arnold L. Rosenberg: Optimal Sharing of Partitionable Workloads in Heterogeneous Networks of Workstations. PDPTA 2000
120		Arnold L. Rosenberg: Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract). SPAA 2000: 22-29
119		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)
118		Arnold L. Rosenberg: Editorial Message. Theory Comput. Syst. 33(5/6): 333 (2000)
	1999
117		Arnold L. Rosenberg: Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output. IPPS/SPDP 1999: 520-524
116		William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman: Augmented Ring Networks. SIROCCO 1999: 1-16
115		Bojana Obrenic, Martin C. Herbordt, Arnold L. Rosenberg, Charles C. Weems: Using Emulations to Enhance the Performance of Parallel Architectures. IEEE Trans. Parallel Distrib. Syst. 10(10): 1067-1081 (1999)
114		Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman: Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments. IEEE Trans. Parallel Distrib. Syst. 10(8): 813-824 (1999)
113		Arnold L. Rosenberg: Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations I: On Maximizing Expected Output. J. Parallel Distrib. Comput. 59(1): 31-53 (1999)
112		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 Computing 25(9): 1063-1079 (1999)
	1998
111		Arnold L. Rosenberg: Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations. IPPS/SPDP 1998: 519-523
110		Micah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg, Walter Unger: Scheduling Time-Constrained Communication in Linear Networks. SPAA 1998: 269-278
109		Shimon Even, Ami Litman, Arnold L. Rosenberg: Monochromatic Paths and Triangulated Graphs. SIAM J. Discrete Math. 11(4): 546-556 (1998)
108		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)
	1997
107		Arnold L. Rosenberg: Theoretical research on networks: models and methodology. SIROCCO 1997: 282-293
106		Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman: The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations. IEEE Trans. Computers 46(10): 1119-1131 (1997)
105		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)
104		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)
	1996
103		Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg: A Tight Layout of the Butterfly Network. SPAA 1996: 170-175
102		Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman: On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors. SPAA 1996: 309-317
101		Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe: On Bufferless Routing of Variable Length Messages in Leveled Networks. IEEE Trans. Computers 45(6): 714-729 (1996)
100		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)
99		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 Distrib. Comput. 33(1): 55-68 (1996)
98		Lixin Gao, Arnold L. Rosenberg: Toward Efficient Scheduling of Evolving Computations on Rings of Processors. J. Parallel Distrib. Comput. 38(1): 92-100 (1996)
	1995
97		Arnold L. Rosenberg: Thoughts on Parallelism and Concurrency in Computing Curricula. ACM Comput. Surv. 27(2): 280-283 (1995)
96		Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman: The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation. Parallel Processing Letters 5: 37-48 (1995)
95		Marc Picquendar, Arnold L. Rosenberg, Vittorio Scarano: A Cost-Effective Streamlining of the Diogenes Design Methodology. Parallel Processing Letters 5: 513-524 (1995)
94		Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Salvage-Embeddings of Complete Trees. SIAM J. Discrete Math. 8(4): 617-637 (1995)
	1994
93		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
	1993
92		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 Springer 1993
91		Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe: On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract). ESA 1993: 49-60
90		Sandeep N. Bhatt, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg: Scattering and Gathering Messages in Networks of Processors. IEEE Trans. Computers 42(8): 938-949 (1993)
	1992
89		Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Tolerating Faults in Synchronization Networks. CONPAR 1992: 1-12
88		Arnold L. Rosenberg: Better Parallel Architectures via Emulations. Heinz Nixdorf Symposium 1992: 30-36
87		Arnold L. Rosenberg: Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies. Discrete Applied Mathematics 37/38: 465-488 (1992)
86		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)
85		Lenwood S. Heath, Arnold L. Rosenberg: Laying out Graphs Using Queues. SIAM J. Comput. 21(5): 927-958 (1992)
84		Lenwood S. Heath, Frank Thomson Leighton, Arnold L. Rosenberg: Comparing Queues and Stacks as Mechanisms for Laying out Graphs. SIAM J. Discrete Math. 5(3): 398-412 (1992)
	1991
83		Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg: Partitioning Circuits for Improved Testability. Algorithmica 6(1): 37-48 (1991)
	1990
82		David S. Greenberg, Lenwood S. Heath, Arnold L. Rosenberg: Optimal Embeddings of Butterfly-Like Graphs in the Hypercube. Mathematical Systems Theory 23(1): 61-77 (1990)
81		Arnold L. Rosenberg: Exposing Graph Uniformities via Algebraic Specification. Mathematical Systems Theory 23(4): 227-244 (1990)
80		Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg: Group Action Graphs and Parallel Architectures. SIAM J. Comput. 19(3): 544-569 (1990)
	1989
79		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
78		Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Universal Graphs for Bounded-Degree Trees and Planar Graphs. SIAM J. Discrete Math. 2(2): 145-155 (1989)
77		Jonathan F. Buss, Arnold L. Rosenberg, Judson D. Knott: Vertex Types in Book-Embeddings. SIAM J. Discrete Math. 2(2): 156-175 (1989)
	1988
76		Arnold L. Rosenberg: GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions. AWOC 1988: 160-169
75		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
74		Lenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith: The physical mapping problem for parallel architectures. J. ACM 35(3): 603-634 (1988)
	1986
73		Arnold L. Rosenberg: Diogenes, Circa 1986. Aegean Workshop on Computing 1986: 96-107
72		Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Optimal Simulations of Tree Machines (Preliminary Version) FOCS 1986: 274-282
71		Fan R. K. Chung, Arnold L. Rosenberg: Minced Trees, with Applications to Fault-Tolerant VLSI Processor Arrays. Mathematical Systems Theory 19(1): 1-12 (1986)
70		Frank Thomson Leighton, Arnold L. Rosenberg: Three-Dimensional Circuit Layouts. SIAM J. Comput. 15(3): 793-813 (1986)
	1985
69		Arnold L. Rosenberg: A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays. IEEE Trans. Computers 34(6): 578-584 (1985)
	1984
68		Arnold L. Rosenberg: The VLSI Revolution in Theoretical Circles. ICALP 1984: 23-40
67		Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood: Binary search trees with binary comparison cost. International Journal of Parallel Programming 13(2): 77-101 (1984)
66		Arnold L. Rosenberg: Editorial: Special FOCS Issue - Twenty-Second Annual IEEE Symposium on Foundations of Computer Science. Mathematical Systems Theory 17(1): 1 (1984)
65		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)
	1983
64		Arnold L. Rosenberg, Ivan Hal Sudborough: Bandwidth and pebbling. Computing 31(2): 115-139 (1983)
63		Arnold L. Rosenberg: The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors. IEEE Trans. Computers 32(10): 902-910 (1983)
62		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)
61		Arnold L. Rosenberg: Three-Dimensional VLSI: A Case Study J. ACM 30(3): 397-416 (1983)
60		Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg: Cost Trade-offs in Graph Embeddings, with Applications J. ACM 30(4): 709-728 (1983)
	1982
59		Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood: Stabbing Line Segments. BIT 22(3): 274-281 (1982)
58		Thomas Ottmann, Arnold L. Rosenberg, Larry J. Stockmeyer: A Dictionary Machine (for VLSI). IEEE Trans. Computers 31(9): 892-897 (1982)
57		Romas Aleliunas, Arnold L. Rosenberg: On Embedding Rectangular Grids in Square Grids. IEEE Trans. Computers 31(9): 907-913 (1982)
56		Jia-Wei Hong, Arnold L. Rosenberg: Graphs that are Almost Binary Trees. SIAM J. Comput. 11(2): 227-242 (1982)
	1981
55		Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg: Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). ICALP 1981: 41-55
54		Jia-Wei Hong, Arnold L. Rosenberg: Graphs that Are Almost Binary Trees (Preliminary Version) STOC 1981: 334-341
53		Arnold L. Rosenberg, Lawrence Snyder: Time- and Space-Optimality in B-Trees. ACM Trans. Database Syst. 6(1): 174-193 (1981)
52		Arnold L. Rosenberg: On Uniformly Inserting One Data Structure into Another. Commun. ACM 24(2): 88-90 (1981)
	1980
51		Arnold L. Rosenberg: Issues in the Study of Graph Embeddings. WG 1980: 150-176
50		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)
49		Arnold L. Rosenberg, Larry J. Stockmeyer, Lawrence Snyder: Uniform Data Encodings. Theor. Comput. Sci. 11: 145-165 (1980)
	1979
48		Arnold L. Rosenberg, Lawrence Snyder: Compact B-Trees. SIGMOD Conference 1979: 43-51
47		Arnold L. Rosenberg, Derick Wood, Zvi Galil: Storage Representations for Tree-Like Data Structures STOC 1979: 99-107
46		Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood: Node-Visit Optimal 1-2 Brother Trees. Theoretical Computer Science 1979: 213-221
45		Arnold L. Rosenberg: A Note on Paths Embedded in Trees. Inf. Process. Lett. 8(5): 272-273 (1979)
44		Arnold L. Rosenberg: Encoding Data Structures in Trees. J. ACM 26(4): 668-689 (1979)
43		Arnold L. Rosenberg, Derick Wood, Zvi Galil: Storage Representations for Tree-Like Data Structures. Mathematical Systems Theory 13: 105-130 (1979)
42		Raymond E. Miller, Nicholas Pippenger, Arnold L. Rosenberg, Lawrence Snyder: Optimal 2, 3-Trees. SIAM J. Comput. 8(1): 42-59 (1979)
	1978
41		Arnold L. Rosenberg: Data Encodings and Their Costs. Acta Inf. 9: 273-292 (1978)
40		Arnold L. Rosenberg, Lawrence Snyder: Bounds on the Costs of Data Encodings. Mathematical Systems Theory 12: 9-39 (1978)
39		Arnold L. Rosenberg, Lawrence Snyder: Minimal-Comparison 2, 3-Trees. SIAM J. Comput. 7(4): 465-480 (1978)
	1977
38		Arnold L. Rosenberg, Larry J. Stockmeyer: Storage Schemes for Boundedly Extendible Arrays. Acta Inf. 7: 289-303 (1977)
37		Arnold L. Rosenberg, Larry J. Stockmeyer: Hashing Schemes for Extendible Arrays. J. ACM 24(2): 199-221 (1977)
36		Arnold L. Rosenberg: On Storing Concatenable Arrays. J. Comput. Syst. Sci. 14(2): 157-174 (1977)
35		Arnold L. Rosenberg: On Storing Ragged Arrays by Hashing. Mathematical Systems Theory 10: 193-210 (1977)
	1975
34		Arnold L. Rosenberg, Larry J. Stockmeyer: Hashing Schemes for Extendible Arrays (Extended Arrays) STOC 1975: 159-166
33		Arnold L. Rosenberg, James W. Thatcher: What Is a Multilevel Array? IBM Journal of Research and Development 19(2): 163-169 (1975)
32		Arnold L. Rosenberg: On storing arbitrarily many extendible arrays of arbitrary dimensions. International Journal of Parallel Programming 4(2): 189-196 (1975)
31		Arnold L. Rosenberg: Corrigendum: ``Allocating Storage for Extendible Arrays''. J. ACM 22(2): 308 (1975)
30		Arnold L. Rosenberg: Generalized Addressing Schemes for Data Graphs. Mathematical Systems Theory 8(4): 353-367 (1975)
29		Arnold L. Rosenberg: Managing Storage for Extendible Arrays. SIAM J. Comput. 4(3): 287-306 (1975)
28		Arnold L. Rosenberg: Preserving Proximity in Arrays. SIAM J. Comput. 4(4): 443-460 (1975)
	1974
27		Arnold L. Rosenberg: Computed Access in Ragged Arrays. IFIP Congress 1974: 642-646
26		Arnold L. Rosenberg: Managing Storage for Extendible Arrays STOC 1974: 297-302
25		Arnold L. Rosenberg: Allocating Storage for Extendible Arrays. J. ACM 21(4): 652-670 (1974)
	1973
24		Arnold L. Rosenberg: Transitions in Extendible Arrays. POPL 1973: 218-225
23		Arnold L. Rosenberg: Suffixes of Addressable Data Graphs Information and Control 23(2): 107-127 (1973)
	1972
22		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
21		Richard M. Karp, Raymond E. Miller, Arnold L. Rosenberg: Rapid Identification of Repeated Patterns in Strings, Trees and Arrays STOC 1972: 125-136
20		Arnold L. Rosenberg: Addressable Data Graphs. J. ACM 19(2): 309-340 (1972)
19		Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg: Real-Time Simulation of Multihead Tape Units. J. ACM 19(4): 590-607 (1972)
18		Arnold L. Rosenberg: Symmetries in Data Graphs. SIAM J. Comput. 1(1): 40-65 (1972)
	1971
17		Arnold L. Rosenberg: Addressable Data Graphs: Extended Abstract STOC 1971: 138-150
16		Arnold L. Rosenberg: Data Graphs and Addressing Schemes. J. Comput. Syst. Sci. 5(3): 193-238 (1971)
	1970
15		Arnold L. Rosenberg: Data Graphs and Addressing Schemes: Extended Abstract STOC 1970: 48-61
14		Arnold L. Rosenberg: A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets. J. ACM 17(1): 44-50 (1970)
13		Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg: Time-Restricted Sequence Generation. J. Comput. Syst. Sci. 4(1): 50-73 (1970)
	1968
12		Michael J. Fischer, Arnold L. Rosenberg: Limited Random Access Turing Machines SWAT (FOCS) 1968: 356-367
11		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)
10		Patrick C. Fischer, Arnold L. Rosenberg: Multitape One-Way Nonwriting Automata. J. Comput. Syst. Sci. 2(1): 88-101 (1968)
9		Michael J. Fischer, Arnold L. Rosenberg: Real-Time Solutions of the Origin-Crossing Problem. Mathematical Systems Theory 2(3): 257-263 (1968)
8		Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg: Counter Machines and Counter Languages. Mathematical Systems Theory 2(3): 265-283 (1968)
	1967
7		Albert R. Meyer, Arnold L. Rosenberg, Patrick C. Fischer: Turing Machines with Several Read-Write Heads (Preliminary Report) SWAT (FOCS) 1967: 117-127
6		Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg: Real Time Counter Machines (Preliminary Version) SWAT (FOCS) 1967: 148-154
5		Arnold L. Rosenberg: A Machine Realization of the Linear Context-Free Languages Information and Control 10(2): 175-188 (1967)
4		Arnold L. Rosenberg: Real-Time Definable Languages. J. ACM 14(4): 645-662 (1967)
3		Arnold L. Rosenberg: Multitape Finite Automata with Rewind Instructions. J. Comput. Syst. Sci. 1(3): 299-315 (1967)
	1965
2		Arnold L. Rosenberg: On multi-head finite automata SWCT (FOCS) 1965: 221-228
	1964
1		Arnold L. Rosenberg: On n-tape finite state acceptors SWCT (FOCS) 1964: 76-81

Coauthor Index

1	Micah Adler	[110] [127] [134] [139] [171]
2	Kunal Agarwal	[191]
3	William Aiello	[116] [122]
4	Romas Aleliunas	[57]
5	Fred S. Annexstein	[80]
6	Aythan Avior	[103] [108]
7	M. E. Barrows	[112]
8	Zeev Barzilai	[62]
9	Marc Baumslag	[80]
10	Olivier Beaumont	[183]
11	Anne Benoit	[176] [179] [187]
12	Sandeep N. Bhatt	[72] [75] [78] [83] [86] [89] [90] [91] [93] [94] [99] [100] [101] [105] [116] [122]
13	Gianfranco Bilardi	[91] [101]
14	George Dean Bissias	[167]
15	Jacir Luiz Bordim	[149] [150]
16	Michael K. Bradshaw	[137]
17	Jonathan F. Buss	[77]
18	Tiziana Calamoneri	[103] [108]
19	Franck Cappello	[124] [148]
20	Ron Chi-Lung Chiang	[181] [182] [188]
21	Rosario De Chiara	[192]
22	Almadena Yu. Chtchelkanova	[190]
23	Fan R. K. Chung (Fan Chung Graham)	[71] [72] [75] [78] [83] [86] [89] [93] [94] [99] [100] [105] [116] [122]
24	Paul R. Cohen	[112]
25	Don Coppersmith	[62]
26	Gennaro Cordasco	[138] [157] [165] [166] [170] [173] [175] [177] [180] [185] [189] [192]
27	W. Bruce Croft	[123]
28	Sajal K. Das	[190]
29	Frank K. H. A. Dehne (Frank Dehne)	[190]
30	Herbert Edelsbrunner	[59]
31	Shimon Even	[103] [108] [109]
32	Panagiota Fatourou	[191]
33	Michael J. Fischer	[9] [12]
34	Patrick C. Fischer	[6] [7] [8] [10] [13] [19] [22]
35	Ian T. Foster	[158] [163]
36	Pierre Fraigniaud	[124] [147] [148]
37	Zvi Galil	[43] [47]
38	Lixin Gao	[98] [102] [112] [114]
39	Oded Goldreich	[161]
40	Ying Gong	[134] [139] [171]
41	Mohamed Gouda	[190]
42	David S. Greenberg	[82]
43	Dawn E. Gregory	[112]
44	Anshul Gupta	[190]
45	Robert Hall	[169]
46	Lenwood S. Heath	[74] [82] [84] [85] [126]
47	Friedhelm Meyer auf der Heide	[92]
48	Martin C. Herbordt	[115]
49	Jia-Wei Hong	[54] [55] [56] [60] [75] [100]
50	Joseph JáJá	[190]
51	Sharad Jaiswal	[145]
52	Krishna Kant	[190]
53	Richard M. Karp	[21]
54	Judson D. Knott	[77]
55	Richard R. Koch	[79] [104]
56	Dawn J. Lawrie (Dawn Lawrie)	[123]
57	Richard LeBlanc	[190]
58	Frank Thomson Leighton (Tom Leighton)	[70] [72] [75] [78] [79] [84] [86] [89] [93] [94] [99] [100] [104] [105]
59	Brian Neil Levine	[155] [167]
60	Richard J. Lipton	[50]
61	Ami Litman	[103] [108] [109]
62	Manish Lumsdaine	[190]
63	Anthony A. Maciejewski	[181]
64	Bruce M. Maggs	[79] [104]
65	Grzegorz Malewicz	[152] [154] [156] [157] [158] [160] [163] [166] [170] [173] [180]
66	Bernard Mans	[124] [147] [148]
67	Hermann A. Maurer	[59]
68	Kathryn S. McKinley	[131]
69	Kurt Mehlhorn	[55] [60]
70	Albert R. Meyer	[6] [7] [8] [13] [19]
71	Raymond E. Miller	[21] [42]
72	Burkhard Monien	[92]
73	Koji Nakano	[149] [150]
74	Alberto Negro	[138]
75	Bojana Obrenic	[100] [115]
76	Thomas Ottmann	[46] [58] [65] [67]
77	David A. Padua	[190]
78	Manish Parashar	[190]
79	Douglas Stott Parker Jr.	[65]
80	Marc Picquendar	[95]
81	Nicholas Pippenger	[42]
82	Sushil K. Prasad	[190]
83	Viktor K. Prasanna (V. K. Prasanna Kumar)	[190]
84	Franco P. Preparata	[59]
85	Geppino Pucci	[90] [91] [101]
86	Abhiram G. Ranade	[90] [91] [101]
87	Satish Rao	[79] [104]
88	Yves Robert	[176] [179] [187] [190]
89	Sartaj Sahni (Sartaj K. Sahni)	[190]
90	Anita La Salle	[190]
91	Vittorio Scarano	[95] [96] [106] [138] [165]
92	Eric J. Schwabe	[91] [100] [101] [104]
93	Alan L. Selman	[161]
94	Prashant J. Shenoy	[142] [164]
95	Behrooz Shirazi	[190]
96	Howard Jay Siegel	[181]
97	Mark Sims	[175] [189]
98	Ramesh K. Sitaraman	[96] [102] [106] [110] [114] [116] [122] [127]
99	Hans-Werner Six	[46] [65] [67]
100	Bruce T. Smith	[74]
101	Lawrence Snyder (Larry Snyder)	[39] [40] [42] [48] [49] [53]
102	Larry J. Stockmeyer	[34] [37] [38] [49] [58]
103	Ivan Hal Sudborough	[64]
104	Alan Sussman	[190]
105	James W. Thatcher	[33]
106	Donald F. Towsley (Don Towsley)	[137] [145]
107	Jeffrey D. Ullman	[22]
108	Walter Unger	[110] [127]
109	Bhuvan Urgaonkar	[142] [164]
110	Arun Venkataramani	[169]
111	Frédéric Vivien	[176] [179] [187] [191]
112	Zhenlin Wang	[131]
113	Charles C. Weems	[115] [131] [190]
114	Emo Welzl	[59]
115	Michael Wilde	[158] [163]
116	Derick Wood	[43] [46] [47] [59] [65] [67]
117	Jie Wu	[190]
118	Andrew Chi-Chih Yao (Andrew C. Yao)	[50]
119	Matthew Yurkewych	[143] [151] [152] [155] [156]
120	H. Paul Zeiger	[22]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page