dblp.uni-trier.dewww.uni-trier.de

Arnold L. Rosenberg Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
173EEArnold L. Rosenberg: Path-robust multi-channel wireless networks. IPDPS 2009: 1-10
172EEGennaro Cordasco, Arnold L. Rosenberg: On scheduling dags to maximize area. IPDPS 2009: 1-12
171EEAnne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien: Static strategies forworksharing with unrecoverable interruptions. IPDPS 2009: 1-12
2008
170EEMark Sims, Gennaro Cordasco, Arnold L. Rosenberg: On Clustering Tasks in IC-Optimal Dags. ICPP 2008: 381-388
169EEArnold L. Rosenberg: Cellular ANTomata: Food-Finding and Maze-Threading. ICPP 2008: 528-535
168EEGennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg: Extending IC-Scheduling via the Sweep Algorithm. PDP 2008: 366-373
167EEMicah Adler, Ying Gong, Arnold L. Rosenberg: On "Exploiting" Node-Heterogeneous Clusters Optimally. Theory Comput. Syst. 42(4): 465-487 (2008)
2007
166EEGennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg: Applying IC-Scheduling Theory to Familiar Classes of Computations. IPDPS 2007: 1-8
165EERobert Hall, Arnold L. Rosenberg, Arun Venkataramani: A Comparison of Dag-Scheduling Strategies for Internet-Based Computing. IPDPS 2007: 1-9
164EEArnold L. Rosenberg: Cellular ANTomata. ISPA 2007: 78-90
163EEGeorge Dean Bissias, Brian Neil Levine, Arnold L. Rosenberg: Bounding damage from link destruction, with application to the internet. SIGMETRICS 2007: 367-368
162EEGennaro 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)
161EEGennaro 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)
160EEBhuvan Urgaonkar, Arnold L. Rosenberg, Prashant J. Shenoy: Application Placement on a Cluster of Servers. Int. J. Found. Comput. Sci. 18(5): 1023-1041 (2007)
159EEGrzegorz 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)
158EEArnold L. Rosenberg: Best Paper Award recipients: 2006 International Parallel and Distributed Processing Symposium. J. Parallel Distrib. Comput. 67(12): 1231 (2007)
2006
157 Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman: Theoretical Computer Science, Essays in Memory of Shimon Even Springer 2006
156EEGrzegorz Malewicz, Arnold L. Rosenberg: A Pebble Game for Internet-Based Computing. Essays in Memory of Shimon Even 2006: 291-312
155EEArnold L. Rosenberg: State. Essays in Memory of Shimon Even 2006: 375-398
154EEGrzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde: A Tool for Prioritizing DAGMan Jobs and Its Evaluation. HPDC 2006: 156-168
153EEGennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg: On Scheduling Expansive and Reductive Dags for Internet-Based Computing. ICDCS 2006: 29
152EEGrzegorz 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
151EEMatthew 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
150EEGrzegorz Malewicz, Arnold L. Rosenberg: Batch-Scheduling Dags for Internet-Based Computing. Euro-Par 2005: 262-271
149EEArnold L. Rosenberg: The Changing Challenges of Collaborative Algorithmics. HiPC 2005: 5
148EEGrzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych: On Scheduling Complex Dags for Internet-Based Computing. IPDPS 2005
147EEArnold L. Rosenberg, Matthew Yurkewych: Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing. IEEE Trans. Computers 54(4): 428-438 (2005)
146EEJacir Luiz Bordim, Koji Nakano, Arnold L. Rosenberg: Foreword. Int. J. Found. Comput. Sci. 16(1): 1-2 (2005)
145EEJacir Luiz Bordim, Koji Nakano, Arnold L. Rosenberg: Foreword. Int. J. Found. Comput. Sci. 16(2): 143-144 (2005)
144EEFranck 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)
143EEPierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg: Efficient trigger-broadcasting in heterogeneous clusters. J. Parallel Distrib. Comput. 65(5): 628-642 (2005)
2004
142EEArnold L. Rosenberg: How to Share a Bag of Tasks Optimally in a Heterogeneous Cluster - Three Models, Three Answers. Annual Simulation Symposium 2004: 3-
141EESharad Jaiswal, Arnold L. Rosenberg, Donald F. Towsley: Comparing the Structure of Power-Law Graphs and the Internet AS Graph. ICNP 2004: 294-303
140EEArnold L. Rosenberg: An Algorithmic Model for Heterogeneous Clusters: Rationale and Experience. IPDPS 2004
139 Arnold L. Rosenberg, Matthew Yurkewych: On Scheduling Computation-Dags for Internet-Based Computing. ISCA PDCS 2004: 58-63
138 Bhuvan Urgaonkar, Arnold L. Rosenberg, Prashant J. Shenoy: Application Placement on a Cluster of Servers. ISCA PDCS 2004: 85-90
137EEArnold L. Rosenberg: On Scheduling Mesh-Structured Computations for Internet-Based Computing. IEEE Trans. Computers 53(9): 1176-1186 (2004)
136EEArnold L. Rosenberg: Obituary: Shimon Even. Theory Comput. Syst. 37(4): 481 (2004)
2003
135EEMicah Adler, Ying Gong, Arnold L. Rosenberg: Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?". Annual Simulation Symposium 2003: 39-46
134EEGennaro 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
133EEMichael K. Bradshaw, Arnold L. Rosenberg, Donald F. Towsley: Planned Object Duplication Strategies in Dynamic PRR Meshes. ICNP 2003: 50-60
132EEArnold L. Rosenberg: To BSP or not to BSP in Heterogeneous NOWs. IPDPS 2003: 165
131EEArnold L. Rosenberg: On Scheduling Collaborative Computations on the Internet, I: Mesh-Dags and Their Close Relatives. IPDPS 2003: 6
130EEMicah Adler, Ying Gong, Arnold L. Rosenberg: Optimal sharing of bags of tasks in heterogeneous clusters. SPAA 2003: 1-10
129EEArnold L. Rosenberg: Accountable Web-Computing. IEEE Trans. Parallel Distrib. Syst. 14(2): 97-106 (2003)
128EEArnold L. Rosenberg: Efficient Pairing Functions - and Why You Should Care. Int. J. Found. Comput. Sci. 14(1): 3-17 (2003)
2002
127EEZhenlin Wang, Kathryn S. McKinley, Arnold L. Rosenberg, Charles C. Weems: Using the Compiler to Improve Cache Replacement Decisions. IEEE PACT 2002: 199-
126EEArnold L. Rosenberg: Accountable Web-Computing. IPDPS 2002
125EEArnold L. Rosenberg: Efficient Pairing Functions - And Why You Should Care. IPDPS 2002
124EEArnold 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)
123EEMicah 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
122EEArnold L. Rosenberg: Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better. CLUSTER 2001: 124-
121 Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg: HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors. IPDPS 2001: 42
120 Dawn Lawrie, W. Bruce Croft, Arnold L. Rosenberg: Finding Topic Words for Hierarchical Summarization. SIGIR 2001: 349-357
119EEWilliam 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
118 Arnold L. Rosenberg: Optimal Sharing of Partitionable Workloads in Heterogeneous Networks of Workstations. PDPTA 2000
117EEArnold L. Rosenberg: Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract). SPAA 2000: 22-29
116 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)
115EEArnold L. Rosenberg: Editorial Message. Theory Comput. Syst. 33(5/6): 333 (2000)
1999
114EEArnold L. Rosenberg: Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output. IPPS/SPDP 1999: 520-524
113 William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman: Augmented Ring Networks. SIROCCO 1999: 1-16
112EEBojana 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)
111EELixin 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)
110 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)
109 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
108EEArnold L. Rosenberg: Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations. IPPS/SPDP 1998: 519-523
107EEMicah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg, Walter Unger: Scheduling Time-Constrained Communication in Linear Networks. SPAA 1998: 269-278
106EEShimon Even, Ami Litman, Arnold L. Rosenberg: Monochromatic Paths and Triangulated Graphs. SIAM J. Discrete Math. 11(4): 546-556 (1998)
105EEAythan 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
104 Arnold L. Rosenberg: Theoretical research on networks: models and methodology. SIROCCO 1997: 282-293
103 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)
102 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)
101EERichard 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
100 Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg: A Tight Layout of the Butterfly Network. SPAA 1996: 170-175
99 Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman: On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors. SPAA 1996: 309-317
98 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)
97EESandeep 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)
96 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)
95 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
94 Arnold L. Rosenberg: Thoughts on Parallelism and Concurrency in Computing Curricula. ACM Comput. Surv. 27(2): 280-283 (1995)
93 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)
92 Marc Picquendar, Arnold L. Rosenberg, Vittorio Scarano: A Cost-Effective Streamlining of the Diogenes Design Methodology. Parallel Processing Letters 5: 513-524 (1995)
91EESandeep 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
90EESandeep 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
89 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
88EESandeep 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
87 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
86EESandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Tolerating Faults in Synchronization Networks. CONPAR 1992: 1-12
85 Arnold L. Rosenberg: Better Parallel Architectures via Emulations. Heinz Nixdorf Symposium 1992: 30-36
84EEArnold L. Rosenberg: Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies. Discrete Applied Mathematics 37/38: 465-488 (1992)
83 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)
82 Lenwood S. Heath, Arnold L. Rosenberg: Laying out Graphs Using Queues. SIAM J. Comput. 21(5): 927-958 (1992)
81 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
80 Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg: Partitioning Circuits for Improved Testability. Algorithmica 6(1): 37-48 (1991)
1990
79 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)
78 Arnold L. Rosenberg: Exposing Graph Uniformities via Algebraic Specification. Mathematical Systems Theory 23(4): 227-244 (1990)
77 Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg: Group Action Graphs and Parallel Architectures. SIAM J. Comput. 19(3): 544-569 (1990)
1989
76 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
75 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)
74 Jonathan F. Buss, Arnold L. Rosenberg, Judson D. Knott: Vertex Types in Book-Embeddings. SIAM J. Discrete Math. 2(2): 156-175 (1989)
1988
73 Arnold L. Rosenberg: GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions. AWOC 1988: 160-169
72 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
71EELenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith: The physical mapping problem for parallel architectures. J. ACM 35(3): 603-634 (1988)
1986
70 Arnold L. Rosenberg: Diogenes, Circa 1986. Aegean Workshop on Computing 1986: 96-107
69 Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Optimal Simulations of Tree Machines (Preliminary Version) FOCS 1986: 274-282
68 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)
67 Frank Thomson Leighton, Arnold L. Rosenberg: Three-Dimensional Circuit Layouts. SIAM J. Comput. 15(3): 793-813 (1986)
1985
66 Arnold L. Rosenberg: A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays. IEEE Trans. Computers 34(6): 578-584 (1985)
1984
65EEArnold L. Rosenberg: The VLSI Revolution in Theoretical Circles. ICALP 1984: 23-40
64 Arnold L. Rosenberg: Editorial: Special FOCS Issue - Twenty-Second Annual IEEE Symposium on Foundations of Computer Science. Mathematical Systems Theory 17(1): 1 (1984)
63 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
62EEArnold L. Rosenberg, Ivan Hal Sudborough: Bandwidth and pebbling. Computing 31(2): 115-139 (1983)
61 Arnold L. Rosenberg: The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors. IEEE Trans. Computers 32(10): 902-910 (1983)
60 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)
59EEArnold L. Rosenberg: Three-Dimensional VLSI: A Case Study J. ACM 30(3): 397-416 (1983)
58EEJia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg: Cost Trade-offs in Graph Embeddings, with Applications J. ACM 30(4): 709-728 (1983)
1982
57 Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood: Stabbing Line Segments. BIT 22(3): 274-281 (1982)
56 Thomas Ottmann, Arnold L. Rosenberg, Larry J. Stockmeyer: A Dictionary Machine (for VLSI). IEEE Trans. Computers 31(9): 892-897 (1982)
55 Romas Aleliunas, Arnold L. Rosenberg: On Embedding Rectangular Grids in Square Grids. IEEE Trans. Computers 31(9): 907-913 (1982)
54 Jia-Wei Hong, Arnold L. Rosenberg: Graphs that are Almost Binary Trees. SIAM J. Comput. 11(2): 227-242 (1982)
1981
53EEJia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg: Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). ICALP 1981: 41-55
52 Jia-Wei Hong, Arnold L. Rosenberg: Graphs that Are Almost Binary Trees (Preliminary Version) STOC 1981: 334-341
51EEArnold L. Rosenberg, Lawrence Snyder: Time- and Space-Optimality in B-Trees. ACM Trans. Database Syst. 6(1): 174-193 (1981)
50 Arnold L. Rosenberg: On Uniformly Inserting One Data Structure into Another. Commun. ACM 24(2): 88-90 (1981)
1980
49EEArnold L. Rosenberg: Issues in the Study of Graph Embeddings. WG 1980: 150-176
48EERichard J. Lipton, Arnold L. Rosenberg, Andrew Chi-Chih Yao: External Hashing Schemes for Collections of Data Structures. J. ACM 27(1): 81-95 (1980)
47 Arnold L. Rosenberg, Larry J. Stockmeyer, Lawrence Snyder: Uniform Data Encodings. Theor. Comput. Sci. 11: 145-165 (1980)
1979
46EEArnold L. Rosenberg, Lawrence Snyder: Compact B-Trees. SIGMOD Conference 1979: 43-51
45 Arnold L. Rosenberg, Derick Wood, Zvi Galil: Storage Representations for Tree-Like Data Structures STOC 1979: 99-107
44 Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood: Node-Visit Optimal 1-2 Brother Trees. Theoretical Computer Science 1979: 213-221
43 Arnold L. Rosenberg: A Note on Paths Embedded in Trees. Inf. Process. Lett. 8(5): 272-273 (1979)
42EEArnold L. Rosenberg: Encoding Data Structures in Trees. J. ACM 26(4): 668-689 (1979)
41 Arnold L. Rosenberg, Derick Wood, Zvi Galil: Storage Representations for Tree-Like Data Structures. Mathematical Systems Theory 13: 105-130 (1979)
40 Raymond E. Miller, Nicholas Pippenger, Arnold L. Rosenberg, Lawrence Snyder: Optimal 2, 3-Trees. SIAM J. Comput. 8(1): 42-59 (1979)
1978
39 Arnold L. Rosenberg: Data Encodings and Their Costs. Acta Inf. 9: 273-292 (1978)
38 Arnold L. Rosenberg, Lawrence Snyder: Bounds on the Costs of Data Encodings. Mathematical Systems Theory 12: 9-39 (1978)
37 Arnold L. Rosenberg, Lawrence Snyder: Minimal-Comparison 2, 3-Trees. SIAM J. Comput. 7(4): 465-480 (1978)
1977
36 Arnold L. Rosenberg, Larry J. Stockmeyer: Storage Schemes for Boundedly Extendible Arrays Acta Inf. 7: 289-303 (1977)
35EEArnold L. Rosenberg, Larry J. Stockmeyer: Hashing Schemes for Extendible Arrays. J. ACM 24(2): 199-221 (1977)
34 Arnold L. Rosenberg: On Storing Concatenable Arrays. J. Comput. Syst. Sci. 14(2): 157-174 (1977)
33 Arnold L. Rosenberg: On Storing Ragged Arrays by Hashing. Mathematical Systems Theory 10: 193-210 (1977)
1975
32 Arnold L. Rosenberg, Larry J. Stockmeyer: Hashing Schemes for Extendible Arrays (Extended Arrays) STOC 1975: 159-166
31 Arnold L. Rosenberg, James W. Thatcher: What Is a Multilevel Array? IBM Journal of Research and Development 19(2): 163-169 (1975)
30EEArnold L. Rosenberg: Corrigendum: ``Allocating Storage for Extendible Arrays''. J. ACM 22(2): 308 (1975)
29 Arnold L. Rosenberg: Generalized Addressing Schemes for Data Graphs. Mathematical Systems Theory 8(4): 353-367 (1975)
28 Arnold L. Rosenberg: Managing Storage for Extendible Arrays. SIAM J. Comput. 4(3): 287-306 (1975)
27 Arnold L. Rosenberg: Preserving Proximity in Arrays. SIAM J. Comput. 4(4): 443-460 (1975)
1974
26 Arnold L. Rosenberg: Computed Access in Ragged Arrays. IFIP Congress 1974: 642-646
25 Arnold L. Rosenberg: Managing Storage for Extendible Arrays STOC 1974: 297-302
24EEArnold L. Rosenberg: Allocating Storage for Extendible Arrays. J. ACM 21(4): 652-670 (1974)
1973
23 Arnold L. Rosenberg: Transitions in Extendible Arrays. POPL 1973: 218-225
22 Arnold L. Rosenberg: Suffixes of Addressable Data Graphs Information and Control 23(2): 107-127 (1973)
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
20EEArnold L. Rosenberg: Addressable Data Graphs. J. ACM 19(2): 309-340 (1972)
19EEPatrick 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
14EEArnold 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 FOCS 1968: 356-367
11EEArnold 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) FOCS 1967: 117-127
6 Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg: Real Time Counter Machines (Preliminary Version) 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)
4EEArnold 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 FOCS 1965: 221-228
1964
1 Arnold L. Rosenberg: On n-tape finite state acceptors FOCS 1964: 76-81

Coauthor Index

1Micah Adler [107] [123] [130] [135] [167]
2William Aiello [113] [119]
3Romas Aleliunas [55]
4Fred S. Annexstein [77]
5Aythan Avior [100] [105]
6M. E. Barrows [109]
7Zeev Barzilai [60]
8Marc Baumslag [77]
9Anne Benoit [171]
10Sandeep N. Bhatt [69] [72] [75] [80] [83] [86] [87] [88] [90] [91] [96] [97] [98] [102] [113] [119]
11Gianfranco Bilardi [88] [98]
12George Dean Bissias [163]
13Jacir Luiz Bordim [145] [146]
14Michael K. Bradshaw [133]
15Jonathan F. Buss [74]
16Tiziana Calamoneri [100] [105]
17Franck Cappello [121] [144]
18Fan R. K. Chung (Fan Chung Graham) [68] [69] [72] [75] [80] [83] [86] [90] [91] [96] [97] [102] [113] [119]
19Paul R. Cohen [109]
20Don Coppersmith [60]
21Gennaro Cordasco [134] [153] [161] [162] [166] [168] [170] [172]
22W. Bruce Croft [120]
23Herbert Edelsbrunner [57]
24Shimon Even [100] [105] [106]
25Michael J. Fischer [9] [12]
26Patrick C. Fischer [6] [7] [8] [10] [13] [19]
27Ian T. Foster [154] [159]
28Pierre Fraigniaud [121] [143] [144]
29Zvi Galil [41] [45]
30Lixin Gao [95] [99] [109] [111]
31Oded Goldreich [157]
32Ying Gong [130] [135] [167]
33David S. Greenberg [79]
34Dawn E. Gregory [109]
35Robert Hall [165]
36Lenwood S. Heath [71] [79] [81] [82]
37Friedhelm Meyer auf der Heide [89]
38Martin C. Herbordt [112]
39Jia-Wei Hong [52] [53] [54] [58] [72] [97]
40Sharad Jaiswal [141]
41Richard M. Karp [21]
42Judson D. Knott [74]
43Richard R. Koch [76] [101]
44Dawn J. Lawrie (Dawn Lawrie) [120]
45Frank Thomson Leighton (Tom Leighton) [67] [69] [72] [75] [76] [81] [83] [86] [90] [91] [96] [97] [101] [102]
46Brian Neil Levine [151] [163]
47Richard J. Lipton [48]
48Ami Litman [100] [105] [106]
49Bruce M. Maggs [76] [101]
50Grzegorz Malewicz [148] [150] [152] [153] [154] [156] [159] [162] [166] [168]
51Bernard Mans [121] [143] [144]
52Hermann A. Maurer [57]
53Kathryn S. McKinley [127]
54Kurt Mehlhorn [53] [58]
55Albert R. Meyer [6] [7] [8] [13] [19]
56Raymond E. Miller [21] [40]
57Burkhard Monien [89]
58Koji Nakano [145] [146]
59Alberto Negro [134]
60Bojana Obrenic [97] [112]
61Thomas Ottmann [44] [56] [63]
62Douglas Stott Parker Jr. [63]
63Marc Picquendar [92]
64Nicholas Pippenger [40]
65Franco P. Preparata [57]
66Geppino Pucci [87] [88] [98]
67Abhiram G. Ranade [87] [88] [98]
68Satish Rao [76] [101]
69Yves Robert [171]
70Vittorio Scarano [92] [93] [103] [134] [161]
71Eric J. Schwabe [88] [97] [98] [101]
72Alan L. Selman [157]
73Prashant J. Shenoy [138] [160]
74Mark Sims [170]
75Ramesh K. Sitaraman [93] [99] [103] [107] [111] [113] [119] [123]
76Hans-Werner Six [44] [63]
77Bruce T. Smith [71]
78Lawrence Snyder (Larry Snyder) [37] [38] [40] [46] [47] [51]
79Larry J. Stockmeyer [32] [35] [36] [47] [56]
80Ivan Hal Sudborough [62]
81James W. Thatcher [31]
82Donald F. Towsley [133] [141]
83Walter Unger [107] [123]
84Bhuvan Urgaonkar [138] [160]
85Arun Venkataramani [165]
86Frédéric Vivien [171]
87Zhenlin Wang [127]
88Charles C. Weems [112] [127]
89Emo Welzl [57]
90Michael Wilde [154] [159]
91Derick Wood [41] [44] [45] [57] [63]
92Andrew Chi-Chih Yao [48]
93Matthew Yurkewych [139] [147] [148] [151] [152]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)