| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Arnold L. Rosenberg 112 Arnold L. Rosenberg: Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload. IEEE Transactions on Parallel and Distributed Systems 13 (2): 179-191 (2002) 111 Dawn Lawrie , W. Bruce Croft , Arnold L. Rosenberg: Finding Topic Words for Hierarchical Summarization. SIGIR 2001 : 349-357 110 William Aiello , Sandeep N. Bhatt , Fan R. K. Chung , Arnold L. Rosenberg, Ramesh K. Sitaraman : Augmented Ring Networks. IEEE Transactions on Parallel and Distributed Systems 12 (6): 598-609 (2001) 109 Arnold L. Rosenberg: Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract). SPAA 2000 : 22-29 108 Arnold L. Rosenberg: Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations II: On Maximizing Guaranteed Output. International Journal of Foundations of Computer Science 11 (1): 183-204 (2000) 107 Arnold L. Rosenberg: Editorial Message. Theory of Computing Systems 33 (5/6): 333 (2000) 106 Bojana Obrenic , Martin C. Herbordt , Arnold L. Rosenberg, Charles C. Weems : Using Emulations to Enhance the Performance of Parallel Architectures. IEEE Transactions on Parallel and Distributed Systems 10 (10): 1067-1081 (1999) 105 Lixin Gao , Arnold L. Rosenberg, Ramesh K. Sitaraman : Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments. IEEE Transactions on Parallel and Distributed Systems 10 (8): 813-824 (1999) 104 Arnold L. Rosenberg: Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations I: On Maximizing Expected Output. Journal of Parallel and Distributed Computing 59 (1): 31-53 (1999) 103 M. E. Barrows , Dawn E. Gregory , Li-Xin Gao , Arnold L. Rosenberg, Paul R. Cohen : An empirical study of dynamic scheduling on rings of processors. Parallel Computing 25 (9): 1063-1079 (1999) 102 Micah Adler , Ramesh K. Sitaraman , Arnold L. Rosenberg, Walter Unger : Scheduling Time-Constrained Communication in Linear Networks. SPAA 1998 : 269-278 101 Shimon Even , Ami Litman , Arnold L. Rosenberg: Monochromatic Paths and Triangulated Graphs. SIAM Journal on Discrete Mathematics 11 (4): 546-556 (1998) 100 Aythan Avior , Tiziana Calamoneri , Shimon Even , Ami Litman , Arnold L. Rosenberg: A Tight Layout of the Butterfly Network. Theory of Computing Systems 31 (4): 475-488 (1998) 99 Arnold L. Rosenberg, Vittorio Scarano , Ramesh K. Sitaraman : The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations. IEEE Transactions on Computers 46 (10): 1119-1131 (1997) 98 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg: An Optimal Strategies for Cycle-Stealing in Networks of Workstations. IEEE Transactions on Computers 46 (5): 545-557 (1997) 97 Richard R. Koch , Frank Thomson Leighton , Bruce M. Maggs , Satish B. Rao , Arnold L. Rosenberg, Eric J. Schwabe : Work-preserving emulations of fixed-connection networks. JACM 44 (1): 104-147 (1997) 96 Aythan Avior , Tiziana Calamoneri , Shimon Even , Ami Litman , Arnold L. Rosenberg: A Tight Layout of the Butterfly Network. SPAA 1996 : 170-175 95 Lixin Gao , Arnold L. Rosenberg, Ramesh K. Sitaraman : On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors. SPAA 1996 : 309-317 94 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 Transactions on Computers 45 (6): 714-729 (1996) 93 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. JACM 43 (2): 293-330 (1996) 92 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg: Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off. Journal of Parallel and Distributed Computing 33 (1): 55-68 (1996) 91 Li-Xin Gao , Arnold L. Rosenberg: Toward Efficient Scheduling of Evolving Computations on Rings of Processors. Journal of Parallel and Distributed Computing 38 (1): 92-100 (1996) 90 Arnold L. Rosenberg: Thoughts on Parallelism and Concurrency in Computing Curricula. ACM Computing Surveys 27 (2): 280-283 (1995) 89 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg: Salvage-Embeddings of Complete Trees. SIAM Journal on Discrete Mathematics 8 (4): 617-637 (1995) 88 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 87 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 86 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 85 Sandeep N. Bhatt , Geppino Pucci , Arnold L. Rosenberg: Scattering and Gathering Messages in Networks of Processors. IEEE Transactions on Computers 42 (8): 938-949 (1993) 84 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg: Tolerating Faults in Synchronization Networks. CONPAR 1992 : 1-12 83 Arnold L. Rosenberg: Better Parallel Architectures via Emulations. Heinz Nixdorf Symposium 1992 : 30-36 82 Arnold L. Rosenberg: Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies. Discrete Applied Mathematics 37/38 : 465-488 (1992) 81 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) 80 Lenwood S. Heath , Arnold L. Rosenberg: Laying out Graphs Using Queues. SIAM J. Comput. 21 (5): 927-958 (1992) 79 Lenwood S. Heath , Frank Thomson Leighton , Arnold L. Rosenberg: Comparing Queues and Stacks as Mechanisms for Laying out Graphs. SIAM Journal on Discrete Mathematics 5 (3): 398-412 (1992) 78 Sandeep N. Bhatt , Fan R. K. Chung , Arnold L. Rosenberg: Partitioning Circuits for Improved Testability. Algorithmica 6 (1): 37-48 (1991) 77 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) 76 Arnold L. Rosenberg: Exposing Graph Uniformities via Algebraic Specification. Mathematical Systems Theory 23 (4): 227-244 (1990) 75 Fred S. Annexstein , Marc Baumslag , Arnold L. Rosenberg: Group Action Graphs and Parallel Architectures. SIAM J. Comput. 19 (3): 544-569 (1990) 74 Richard 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 73 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg: Universal Graphs for Bounded-Degree Trees and Planar Graphs. SIAM Journal on Discrete Mathematics 2 (2): 145-155 (1989) 72 Jonathan F. Buss , Arnold L. Rosenberg, Judson D. Knott : Vertex Types in Book-Embeddings. SIAM Journal on Discrete Mathematics 2 (2): 156-175 (1989) 71 Arnold L. Rosenberg: GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions. AWOC 1988 : 160-169 70 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 69 Lenwood S. Heath , Arnold L. Rosenberg, Bruce T. Smith : The physical mapping problem for parallel architectures. JACM 35 (3): 603-634 (1988) 68 Arnold L. Rosenberg: Diogenes, Circa 1986. Aegean Workshop on Computing 1986 : 96-107 67 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg: Optimal Simulations of Tree Machines (Preliminary Version). FOCS 1986 : 274-282 66 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) 65 Frank Thomson Leighton , Arnold L. Rosenberg: Three-Dimensional Circuit Layouts. SIAM J. Comput. 15 (3): 793-813 (1986) 64 Arnold L. Rosenberg: A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays. IEEE Transactions on Computers 34 (6): 578-584 (1985) 63 Arnold L. Rosenberg: The VLSI Revolution in Theoretical Circles. ICALP 1984 : 23-40 62 Arnold L. Rosenberg: Editorial: Special FOCS Issue - Twenty-Second Annual IEEE Symposium on Foundations of Computer Science. Mathematical Systems Theory 17 (1): 1 (1984) 61 Thomas Ottmann , D. Stott Parker , Arnold L. Rosenberg, Hans-Werner Six , Derick Wood : Minimal-Cost Brother Trees. SIAM J. Comput. 13 (1): 197-217 (1984) 60 Arnold L. Rosenberg: The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors. IEEE Transactions on Computers 32 (10): 902-910 (1983) 59 Zeev Barzilai , Don Coppersmith , Arnold L. Rosenberg: Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing. IEEE Transactions on Computers 32 (2): 190-194 (1983) 58 Arnold L. Rosenberg: Three-Dimensional VLSI: A Case Study. JACM 30 (3): 397-416 (1983) 57 Jia-Wei Hong , Kurt Mehlhorn , Arnold L. Rosenberg: Cost Trade-offs in Graph Embeddings, with Applications. JACM 30 (4): 709-728 (1983) 56 Herbert Edelsbrunner , Hermann A. Maurer , Franco P. Preparata , Arnold L. Rosenberg, Emo Welzl , Derick Wood : Stabbing Line Segments. BIT 22 (3): 274-281 (1982) 55 Thomas Ottmann , Arnold L. Rosenberg, Larry J. Stockmeyer : A Dictionary Machine (for VLSI). IEEE Transactions on Computers 31 (9): 892-897 (1982) 54 Romas Aleliunas , Arnold L. Rosenberg: On Embedding Rectangular Grids in Square Grids. IEEE Transactions on Computers 31 (9): 907-913 (1982) 53 Jia-Wei Hong , Arnold L. Rosenberg: Graphs that are Almost Binary Trees. SIAM J. Comput. 11 (2): 227-242 (1982) 52 Jia-Wei Hong , Kurt Mehlhorn , Arnold L. Rosenberg: Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). ICALP 1981 : 41-55 51 Jia-Wei Hong , Arnold L. Rosenberg: Graphs that Are Almost Binary Trees (Preliminary Version). STOC 1981 : 334-341 50 Arnold L. Rosenberg: On Uniformly Inserting One Data Structure into Another. CACM 24 (2): 88-90 (1981) 49 Arnold L. Rosenberg, Lawrence Snyder : Time- and Space-Optimality in B-Trees. TODS 6 (1): 174-193 (1981) 48 Arnold L. Rosenberg: Issues in the Study of Graph Embeddings. WG 1980 : 150-176 47 Richard J. Lipton , Arnold L. Rosenberg, Andrew Chi-Chih Yao : External Hashing Schemes for Collections of Data Structures. JACM 27 (1): 81-95 (1980) 46 Arnold L. Rosenberg, Larry J. Stockmeyer , Lawrence Snyder : Uniform Data Encodings. TCS 11 : 145-165 (1980) 45 Arnold L. Rosenberg, Lawrence Snyder : Compact B-Trees. SIGMOD Conference 1979 : 43-51 44 Arnold L. Rosenberg, Derick Wood , Zvi Galil : Storage Representations for Tree-Like Data Structures. STOC 1979 : 99-107 43 Arnold L. Rosenberg: A Note on Paths Embedded in Trees. Information Processing Letters 8 (5): 272-273 (1979) 42 Arnold L. Rosenberg: Encoding Data Structures in Trees. JACM 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) 39 Arnold L. Rosenberg: Data Encodings and Their Costs. Acta Informatica 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) 36 Arnold L. Rosenberg, Larry J. Stockmeyer : Storage Schemes for Boundedly Extendible Arrays. Acta Informatica 7 : 289-303 (1977) 35 Arnold L. Rosenberg, Larry J. Stockmeyer : Hashing Schemes for Extendible Arrays. JACM 24 (2): 199-221 (1977) 34 Arnold L. Rosenberg: On Storing Concatenable Arrays. JCSS 14 (2): 157-174 (1977) 33 Arnold L. Rosenberg: On Storing Ragged Arrays by Hashing. Mathematical Systems Theory 10 : 193-210 (1977) 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) 30 Arnold L. Rosenberg: Corrigendum: ``Allocating Storage for Extendible Arrays''. JACM 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) 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 24 Arnold L. Rosenberg: Allocating Storage for Extendible Arrays. JACM 21 (4): 652-670 (1974) 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) 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. JACM 19 (2): 309-340 (1972) 19 Patrick C. Fischer , Albert R. Meyer , Arnold L. Rosenberg: Real-Time Simulation of Multihead Tape Units. JACM 19 (4): 590-607 (1972) 18 Arnold L. Rosenberg: Symmetries in Data Graphs. SIAM J. Comput. 1 (1): 40-65 (1972) 17 Arnold L. Rosenberg: Addressable Data Graphs: Extended Abstract. STOC 1971 : 138-150 16 Arnold L. Rosenberg: Data Graphs and Addressing Schemes. JCSS 5 (3): 193-238 (1971) 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. JACM 17 (1): 44-50 (1970) 13 Patrick C. Fischer , Albert R. Meyer , Arnold L. Rosenberg: Time-Restricted Sequence Generation. JCSS 4 (1): 50-73 (1970) 12 Michael J. Fischer , Arnold L. Rosenberg: Limited Random Access Turing Machines. FOCS 1968 : 356-367 11 Arnold L. Rosenberg: On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages. JACM 15 (4): 672-679 (1968) 10 Patrick C. Fischer , Arnold L. Rosenberg: Multitape One-Way Nonwriting Automata. JCSS 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) 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) 4 Arnold L. Rosenberg: Real-Time Definable Languages. JACM 14 (4): 645-662 (1967) 3 Arnold L. Rosenberg: Multitape Finite Automata with Rewind Instructions. JCSS 1 (3): 299-315 (1967) 2 Arnold L. Rosenberg: On multi-head finite automata. FOCS 1965 : 221-228 1 Arnold L. Rosenberg: On n-tape finite state acceptors. FOCS 1964 : 76-81  DiSC'02 © 2003 Association for Computing Machinery |
