Search the dblp DataBase
Arnold L. Rosenberg :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Arnold L. Rosenberg , Lawrence Snyder Time- and Space-Optimality in B-Trees. [Citation Graph (8, 6)][DBLP ] ACM Trans. Database Syst., 1981, v:6, n:1, pp:174-193 [Journal ] Arnold L. Rosenberg , Lawrence Snyder Minimal-Comparison 2, 3-Trees. [Citation Graph (6, 0)][DBLP ] SIAM J. Comput., 1978, v:7, n:4, pp:465-480 [Journal ] Raymond E. Miller , Nicholas Pippenger , Arnold L. Rosenberg , Lawrence Snyder Optimal 2, 3-Trees. [Citation Graph (5, 0)][DBLP ] SIAM J. Comput., 1979, v:8, n:1, pp:42-59 [Journal ] Arnold L. Rosenberg , Lawrence Snyder Compact B-Trees. [Citation Graph (3, 6)][DBLP ] SIGMOD Conference, 1979, pp:43-51 [Conf ] Arnold L. Rosenberg Managing Storage for Extendible Arrays. [Citation Graph (3, 0)][DBLP ] SIAM J. Comput., 1975, v:4, n:3, pp:287-306 [Journal ] Richard M. Karp , Raymond E. Miller , Arnold L. Rosenberg Rapid Identification of Repeated Patterns in Strings, Trees and Arrays [Citation Graph (2, 0)][DBLP ] STOC, 1972, pp:125-136 [Conf ] Arnold L. Rosenberg , Larry J. Stockmeyer Hashing Schemes for Extendible Arrays. [Citation Graph (2, 0)][DBLP ] J. ACM, 1977, v:24, n:2, pp:199-221 [Journal ] Arnold L. Rosenberg Preserving Proximity in Arrays. [Citation Graph (2, 0)][DBLP ] SIAM J. Comput., 1975, v:4, n:4, pp:443-460 [Journal ] Arnold L. Rosenberg Data Encodings and Their Costs. [Citation Graph (1, 0)][DBLP ] Acta Inf., 1978, v:9, n:, pp:273-292 [Journal ] Arnold L. Rosenberg Encoding Data Structures in Trees. [Citation Graph (1, 0)][DBLP ] J. ACM, 1979, v:26, n:4, pp:668-689 [Journal ] Arnold L. Rosenberg , Lawrence Snyder Bounds on the Costs of Data Encodings. [Citation Graph (1, 0)][DBLP ] Mathematical Systems Theory, 1978, v:12, n:, pp:9-39 [Journal ] Thomas Ottmann , Douglas Stott Parker Jr. , Arnold L. Rosenberg , Hans-Werner Six , Derick Wood Minimal-Cost Brother Trees. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1984, v:13, n:1, pp:197-217 [Journal ] Thomas Ottmann , Arnold L. Rosenberg , Larry J. Stockmeyer A Dictionary Machine (for VLSI). [Citation Graph (1, 0)][DBLP ] IEEE Trans. Computers, 1982, v:31, n:9, pp:892-897 [Journal ] Zhenlin Wang , Kathryn S. McKinley , Arnold L. Rosenberg , Charles C. Weems Using the Compiler to Improve Cache Replacement Decisions. [Citation Graph (0, 0)][DBLP ] IEEE PACT, 2002, pp:199-0 [Conf ] Arnold L. Rosenberg , Matthew Yurkewych On Scheduling Computation-Dags for Internet-Based Computing. [Citation Graph (0, 0)][DBLP ] ISCA PDCS, 2004, pp:58-63 [Conf ] Bhuvan Urgaonkar , Arnold L. Rosenberg , Prashant J. Shenoy Application Placement on a Cluster of Servers. [Citation Graph (0, 0)][DBLP ] ISCA PDCS, 2004, pp:85-90 [Conf ] Micah Adler , Ying Gong , Arnold L. Rosenberg Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?". [Citation Graph (0, 0)][DBLP ] Annual Simulation Symposium, 2003, pp:39-46 [Conf ] Arnold L. Rosenberg How to Share a Bag of Tasks Optimally in a Heterogeneous Cluster - Three Models, Three Answers. [Citation Graph (0, 0)][DBLP ] Annual Simulation Symposium, 2004, pp:3-0 [Conf ] Arnold L. Rosenberg Diogenes, Circa 1986. [Citation Graph (0, 0)][DBLP ] Aegean Workshop on Computing, 1986, pp:96-107 [Conf ] Arnold L. Rosenberg GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions. [Citation Graph (0, 0)][DBLP ] AWOC, 1988, pp:160-169 [Conf ] Grzegorz Malewicz , Arnold L. Rosenberg A Pebble Game for Internet-Based Computing. [Citation Graph (0, 0)][DBLP ] Essays in Memory of Shimon Even, 2006, pp:291-312 [Conf ] Arnold L. Rosenberg State. [Citation Graph (0, 0)][DBLP ] Essays in Memory of Shimon Even, 2006, pp:375-398 [Conf ] Matthew Yurkewych , Brian Neil Levine , Arnold L. Rosenberg On the cost-ineffectiveness of redundancy in commercial P2P computing. [Citation Graph (0, 0)][DBLP ] ACM Conference on Computer and Communications Security, 2005, pp:280-288 [Conf ] Arnold L. Rosenberg Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better. [Citation Graph (0, 0)][DBLP ] CLUSTER, 2001, pp:124-0 [Conf ] Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg Tolerating Faults in Synchronization Networks. [Citation Graph (0, 0)][DBLP ] CONPAR, 1992, pp:1-12 [Conf ] 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). [Citation Graph (0, 0)][DBLP ] ESA, 1993, pp:49-60 [Conf ] Gennaro Cordasco , Alberto Negro , Vittorio Scarano , Arnold L. Rosenberg c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories. [Citation Graph (0, 0)][DBLP ] Euro-Par, 2003, pp:911-916 [Conf ] Grzegorz Malewicz , Arnold L. Rosenberg Batch-Scheduling Dags for Internet-Based Computing. [Citation Graph (0, 0)][DBLP ] Euro-Par, 2005, pp:262-271 [Conf ] Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg Optimal Simulations of Tree Machines (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1986, pp:274-282 [Conf ] Michael J. Fischer , Arnold L. Rosenberg Limited Random Access Turing Machines [Citation Graph (0, 0)][DBLP ] FOCS, 1968, pp:356-367 [Conf ] Patrick C. Fischer , Albert R. Meyer , Arnold L. Rosenberg Real Time Counter Machines (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1967, pp:148-154 [Conf ] Albert R. Meyer , Arnold L. Rosenberg , Patrick C. Fischer Turing Machines with Several Read-Write Heads (Preliminary Report) [Citation Graph (0, 0)][DBLP ] FOCS, 1967, pp:117-127 [Conf ] Arnold L. Rosenberg On n-tape finite state acceptors [Citation Graph (0, 0)][DBLP ] FOCS, 1964, pp:76-81 [Conf ] Arnold L. Rosenberg On multi-head finite automata [Citation Graph (0, 0)][DBLP ] FOCS, 1965, pp:221-228 [Conf ] Arnold L. Rosenberg The Changing Challenges of Collaborative Algorithmics. [Citation Graph (0, 0)][DBLP ] HiPC, 2005, pp:5- [Conf ] Jia-Wei Hong , Kurt Mehlhorn , Arnold L. Rosenberg Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:41-55 [Conf ] Arnold L. Rosenberg The VLSI Revolution in Theoretical Circles. [Citation Graph (0, 0)][DBLP ] ICALP, 1984, pp:23-40 [Conf ] Gennaro Cordasco , Grzegorz Malewicz , Arnold L. Rosenberg On Scheduling Expansive and Reductive Dags for Internet-Based Computing. [Citation Graph (0, 0)][DBLP ] ICDCS, 2006, pp:29- [Conf ] Michael K. Bradshaw , Arnold L. Rosenberg , Donald F. Towsley Planned Object Duplication Strategies in Dynamic PRR Meshes. [Citation Graph (0, 0)][DBLP ] ICNP, 2003, pp:50-60 [Conf ] Sharad Jaiswal , Arnold L. Rosenberg , Donald F. Towsley Comparing the Structure of Power-Law Graphs and the Internet AS Graph. [Citation Graph (0, 0)][DBLP ] ICNP, 2004, pp:294-303 [Conf ] Arnold L. Rosenberg Computed Access in Ragged Arrays. [Citation Graph (0, 0)][DBLP ] IFIP Congress, 1974, pp:642-646 [Conf ] Franck Cappello , Pierre Fraigniaud , Bernard Mans , Arnold L. Rosenberg HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors. [Citation Graph (0, 0)][DBLP ] IPDPS, 2001, pp:42- [Conf ] Grzegorz Malewicz , Arnold L. Rosenberg , Matthew Yurkewych On Scheduling Complex Dags for Internet-Based Computing. [Citation Graph (0, 0)][DBLP ] IPDPS, 2005, pp:- [Conf ] Arnold L. Rosenberg Accountable Web-Computing. [Citation Graph (0, 0)][DBLP ] IPDPS, 2002, pp:- [Conf ] Arnold L. Rosenberg Efficient Pairing Functions - And Why You Should Care. [Citation Graph (0, 0)][DBLP ] IPDPS, 2002, pp:- [Conf ] Arnold L. Rosenberg On Scheduling Collaborative Computations on the Internet, I: Mesh-Dags and Their Close Relatives. [Citation Graph (0, 0)][DBLP ] IPDPS, 2003, pp:6- [Conf ] Arnold L. Rosenberg To BSP or not to BSP in Heterogeneous NOWs. [Citation Graph (0, 0)][DBLP ] IPDPS, 2003, pp:165- [Conf ] Arnold L. Rosenberg An Algorithmic Model for Heterogeneous Clusters: Rationale and Experience. [Citation Graph (0, 0)][DBLP ] IPDPS, 2004, pp:- [Conf ] Arnold L. Rosenberg Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations. [Citation Graph (0, 0)][DBLP ] IPPS/SPDP, 1998, pp:519-523 [Conf ] Arnold L. Rosenberg Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output. [Citation Graph (0, 0)][DBLP ] IPPS/SPDP, 1999, pp:520-524 [Conf ] Arnold L. Rosenberg Better Parallel Architectures via Emulations. [Citation Graph (0, 0)][DBLP ] Heinz Nixdorf Symposium, 1992, pp:30-36 [Conf ] Arnold L. Rosenberg Optimal Sharing of Partitionable Workloads in Heterogeneous Networks of Workstations. [Citation Graph (0, 0)][DBLP ] PDPTA, 2000, pp:- [Conf ] Arnold L. Rosenberg Transitions in Extendible Arrays. [Citation Graph (0, 0)][DBLP ] POPL, 1973, pp:218-225 [Conf ] Dawn Lawrie , W. Bruce Croft , Arnold L. Rosenberg Finding Topic Words for Hierarchical Summarization. [Citation Graph (0, 0)][DBLP ] SIGIR, 2001, pp:349-357 [Conf ] William Aiello , Sandeep N. Bhatt , Fan R. K. Chung , Arnold L. Rosenberg , Ramesh K. Sitaraman Augmented Ring Networks. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1999, pp:1-16 [Conf ] Arnold L. Rosenberg Theoretical research on networks: models and methodology. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1997, pp:282-293 [Conf ] Aythan Avior , Tiziana Calamoneri , Shimon Even , Ami Litman , Arnold L. Rosenberg A Tight Layout of the Butterfly Network. [Citation Graph (0, 0)][DBLP ] SPAA, 1996, pp:170-175 [Conf ] Micah Adler , Ying Gong , Arnold L. Rosenberg Optimal sharing of bags of tasks in heterogeneous clusters. [Citation Graph (0, 0)][DBLP ] SPAA, 2003, pp:1-10 [Conf ] Micah Adler , Ramesh K. Sitaraman , Arnold L. Rosenberg , Walter Unger Scheduling Time-Constrained Communication in Linear Networks. [Citation Graph (0, 0)][DBLP ] SPAA, 1998, pp:269-278 [Conf ] Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff. [Citation Graph (0, 0)][DBLP ] SPAA, 1994, pp:85-93 [Conf ] Lixin Gao , Arnold L. Rosenberg , Ramesh K. Sitaraman On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors. [Citation Graph (0, 0)][DBLP ] SPAA, 1996, pp:309-317 [Conf ] Arnold L. Rosenberg Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract). [Citation Graph (0, 0)][DBLP ] SPAA, 2000, pp:22-29 [Conf ] Sandeep N. Bhatt , Fan R. K. Chung , Jia-Wei Hong , Frank Thomson Leighton , Arnold L. Rosenberg Optimal Simulations by Butterfly Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1988, pp:192-204 [Conf ] Jia-Wei Hong , Arnold L. Rosenberg Graphs that Are Almost Binary Trees (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1981, pp:334-341 [Conf ] Richard R. Koch , Frank Thomson Leighton , Bruce M. Maggs , Satish Rao , Arnold L. Rosenberg Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1989, pp:227-240 [Conf ] Arnold L. Rosenberg Data Graphs and Addressing Schemes: Extended Abstract [Citation Graph (0, 0)][DBLP ] STOC, 1970, pp:48-61 [Conf ] Arnold L. Rosenberg Addressable Data Graphs: Extended Abstract [Citation Graph (0, 0)][DBLP ] STOC, 1971, pp:138-150 [Conf ] Arnold L. Rosenberg Managing Storage for Extendible Arrays [Citation Graph (0, 0)][DBLP ] STOC, 1974, pp:297-302 [Conf ] Arnold L. Rosenberg , Larry J. Stockmeyer Hashing Schemes for Extendible Arrays (Extended Arrays) [Citation Graph (0, 0)][DBLP ] STOC, 1975, pp:159-166 [Conf ] Arnold L. Rosenberg , Derick Wood , Zvi Galil Storage Representations for Tree-Like Data Structures [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:99-107 [Conf ] Thomas Ottmann , Arnold L. Rosenberg , Hans-Werner Six , Derick Wood Node-Visit Optimal 1-2 Brother Trees. [Citation Graph (0, 0)][DBLP ] Theoretical Computer Science, 1979, pp:213-221 [Conf ] Arnold L. Rosenberg Issues in the Study of Graph Embeddings. [Citation Graph (0, 0)][DBLP ] WG, 1980, pp:150-176 [Conf ] Arnold L. Rosenberg , Larry J. Stockmeyer Storage Schemes for Boundedly Extendible Arrays [Citation Graph (0, 0)][DBLP ] Acta Inf., 1977, v:7, n:, pp:289-303 [Journal ] Sandeep N. Bhatt , Fan R. K. Chung , Arnold L. Rosenberg Partitioning Circuits for Improved Testability. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1991, v:6, n:1, pp:37-48 [Journal ] Herbert Edelsbrunner , Hermann A. Maurer , Franco P. Preparata , Arnold L. Rosenberg , Emo Welzl , Derick Wood Stabbing Line Segments. [Citation Graph (0, 0)][DBLP ] BIT, 1982, v:22, n:3, pp:274-281 [Journal ] Arnold L. Rosenberg On Uniformly Inserting One Data Structure into Another. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1981, v:24, n:2, pp:88-90 [Journal ] Arnold L. Rosenberg Thoughts on Parallelism and Concurrency in Computing Curricula. [Citation Graph (0, 0)][DBLP ] ACM Comput. Surv., 1995, v:27, n:2, pp:280-283 [Journal ] Arnold L. Rosenberg Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1992, v:37, n:, pp:465-488 [Journal ] Arnold L. Rosenberg A Machine Realization of the Linear Context-Free Languages [Citation Graph (0, 0)][DBLP ] Information and Control, 1967, v:10, n:2, pp:175-188 [Journal ] Arnold L. Rosenberg Suffixes of Addressable Data Graphs [Citation Graph (0, 0)][DBLP ] Information and Control, 1973, v:23, n:2, pp:107-127 [Journal ] Arnold L. Rosenberg , James W. Thatcher What Is a Multilevel Array? [Citation Graph (0, 0)][DBLP ] IBM Journal of Research and Development, 1975, v:19, n:2, pp:163-169 [Journal ] Franck Cappello , Pierre Fraigniaud , Bernard Mans , Arnold L. Rosenberg An algorithmic model for heterogeneous hyper-clusters: rationale and experience. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:2, pp:195-215 [Journal ] Jacir Luiz Bordim , Koji Nakano , Arnold L. Rosenberg Foreword. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:1, pp:1-2 [Journal ] Jacir Luiz Bordim , Koji Nakano , Arnold L. Rosenberg Foreword. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:2, pp:143-144 [Journal ] Arnold L. Rosenberg Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations II: On Maximizing Guaranteed Output. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2000, v:11, n:1, pp:183-204 [Journal ] Arnold L. Rosenberg Efficient Pairing Functions - and Why You Should Care. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2003, v:14, n:1, pp:3-17 [Journal ] Arnold L. Rosenberg A Note on Paths Embedded in Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1979, v:8, n:5, pp:272-273 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] J. ACM, 1996, v:43, n:2, pp:293-330 [Journal ] Patrick C. Fischer , Albert R. Meyer , Arnold L. Rosenberg Real-Time Simulation of Multihead Tape Units. [Citation Graph (0, 0)][DBLP ] J. ACM, 1972, v:19, n:4, pp:590-607 [Journal ] Lenwood S. Heath , Arnold L. Rosenberg , Bruce T. Smith The physical mapping problem for parallel architectures. [Citation Graph (0, 0)][DBLP ] J. ACM, 1988, v:35, n:3, pp:603-634 [Journal ] Jia-Wei Hong , Kurt Mehlhorn , Arnold L. Rosenberg Cost Trade-offs in Graph Embeddings, with Applications [Citation Graph (0, 0)][DBLP ] J. ACM, 1983, v:30, n:4, pp:709-728 [Journal ] Richard R. Koch , Frank Thomson Leighton , Bruce M. Maggs , Satish Rao , Arnold L. Rosenberg , Eric J. Schwabe Work-preserving emulations of fixed-connection networks. [Citation Graph (0, 0)][DBLP ] J. ACM, 1997, v:44, n:1, pp:104-147 [Journal ] Richard J. Lipton , Arnold L. Rosenberg , Andrew Chi-Chih Yao External Hashing Schemes for Collections of Data Structures. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:1, pp:81-95 [Journal ] Arnold L. Rosenberg Real-Time Definable Languages. [Citation Graph (0, 0)][DBLP ] J. ACM, 1967, v:14, n:4, pp:645-662 [Journal ] Arnold L. Rosenberg On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages. [Citation Graph (0, 0)][DBLP ] J. ACM, 1968, v:15, n:4, pp:672-679 [Journal ] Arnold L. Rosenberg A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets. [Citation Graph (0, 0)][DBLP ] J. ACM, 1970, v:17, n:1, pp:44-50 [Journal ] Arnold L. Rosenberg Addressable Data Graphs. [Citation Graph (0, 0)][DBLP ] J. ACM, 1972, v:19, n:2, pp:309-340 [Journal ] Arnold L. Rosenberg Allocating Storage for Extendible Arrays. [Citation Graph (0, 0)][DBLP ] J. ACM, 1974, v:21, n:4, pp:652-670 [Journal ] Arnold L. Rosenberg Corrigendum: ``Allocating Storage for Extendible Arrays''. [Citation Graph (0, 0)][DBLP ] J. ACM, 1975, v:22, n:2, pp:308- [Journal ] Arnold L. Rosenberg Three-Dimensional VLSI: A Case Study [Citation Graph (0, 0)][DBLP ] J. ACM, 1983, v:30, n:3, pp:397-416 [Journal ] Patrick C. Fischer , Albert R. Meyer , Arnold L. Rosenberg Time-Restricted Sequence Generation. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1970, v:4, n:1, pp:50-73 [Journal ] Patrick C. Fischer , Arnold L. Rosenberg Multitape One-Way Nonwriting Automata. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1968, v:2, n:1, pp:88-101 [Journal ] Arnold L. Rosenberg Multitape Finite Automata with Rewind Instructions. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1967, v:1, n:3, pp:299-315 [Journal ] Arnold L. Rosenberg Data Graphs and Addressing Schemes. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1971, v:5, n:3, pp:193-238 [Journal ] Arnold L. Rosenberg On Storing Concatenable Arrays. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1977, v:14, n:2, pp:157-174 [Journal ] Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1996, v:33, n:1, pp:55-68 [Journal ] Pierre Fraigniaud , Bernard Mans , Arnold L. Rosenberg Efficient trigger-broadcasting in heterogeneous clusters. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 2005, v:65, n:5, pp:628-642 [Journal ] Lixin Gao , Arnold L. Rosenberg Toward Efficient Scheduling of Evolving Computations on Rings of Processors. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1996, v:38, n:1, pp:92-100 [Journal ] Arnold L. Rosenberg Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations I: On Maximizing Expected Output. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1999, v:59, n:1, pp:31-53 [Journal ] Micah Adler , Arnold L. Rosenberg , Ramesh K. Sitaraman , Walter Unger Scheduling Time-Constrained Communication in Linear Networks. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2002, v:35, n:6, pp:599-623 [Journal ] Aythan Avior , Tiziana Calamoneri , Shimon Even , Ami Litman , Arnold L. Rosenberg A Tight Layout of the Butterfly Network. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 1998, v:31, n:4, pp:475-488 [Journal ] Fan R. K. Chung , Arnold L. Rosenberg Minced Trees, with Applications to Fault-Tolerant VLSI Processor Arrays. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1986, v:19, n:1, pp:1-12 [Journal ] Patrick C. Fischer , Albert R. Meyer , Arnold L. Rosenberg Counter Machines and Counter Languages. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1968, v:2, n:3, pp:265-283 [Journal ] Michael J. Fischer , Arnold L. Rosenberg Real-Time Solutions of the Origin-Crossing Problem. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1968, v:2, n:3, pp:257-263 [Journal ] David S. Greenberg , Lenwood S. Heath , Arnold L. Rosenberg Optimal Embeddings of Butterfly-Like Graphs in the Hypercube. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1990, v:23, n:1, pp:61-77 [Journal ] Arnold L. Rosenberg Exposing Graph Uniformities via Algebraic Specification. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1990, v:23, n:4, pp:227-244 [Journal ] Arnold L. Rosenberg , Derick Wood , Zvi Galil Storage Representations for Tree-Like Data Structures. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1979, v:13, n:, pp:105-130 [Journal ] Arnold L. Rosenberg Editorial Message. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2000, v:33, n:5/6, pp:333- [Journal ] Arnold L. Rosenberg Obituary: Shimon Even. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2004, v:37, n:4, pp:481- [Journal ] Arnold L. Rosenberg Generalized Addressing Schemes for Data Graphs. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1975, v:8, n:4, pp:353-367 [Journal ] Arnold L. Rosenberg On Storing Ragged Arrays by Hashing. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1977, v:10, n:, pp:193-210 [Journal ] Arnold L. Rosenberg Editorial: Special FOCS Issue - Twenty-Second Annual IEEE Symposium on Foundations of Computer Science. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1984, v:17, n:1, pp:1- [Journal ] M. E. Barrows , Dawn E. Gregory , Lixin Gao , Arnold L. Rosenberg , Paul R. Cohen An empirical study of dynamic scheduling on rings of processors. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 1999, v:25, n:9, pp:1063-1079 [Journal ] Marc Picquendar , Arnold L. Rosenberg , Vittorio Scarano A Cost-Effective Streamlining of the Diogenes Design Methodology. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1995, v:5, n:, pp:513-524 [Journal ] Arnold L. Rosenberg , Vittorio Scarano , Ramesh K. Sitaraman The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1995, v:5, n:, pp:37-48 [Journal ] Fred S. Annexstein , Marc Baumslag , Arnold L. Rosenberg Group Action Graphs and Parallel Architectures. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:3, pp:544-569 [Journal ] Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg Efficient Embeddings of Trees in Hypercubes. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1992, v:21, n:1, pp:151-162 [Journal ] Lenwood S. Heath , Arnold L. Rosenberg Laying out Graphs Using Queues. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1992, v:21, n:5, pp:927-958 [Journal ] Jia-Wei Hong , Arnold L. Rosenberg Graphs that are Almost Binary Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1982, v:11, n:2, pp:227-242 [Journal ] Frank Thomson Leighton , Arnold L. Rosenberg Three-Dimensional Circuit Layouts. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:3, pp:793-813 [Journal ] Arnold L. Rosenberg Symmetries in Data Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1972, v:1, n:1, pp:40-65 [Journal ] Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg Universal Graphs for Bounded-Degree Trees and Planar Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1989, v:2, n:2, pp:145-155 [Journal ] Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg Salvage-Embeddings of Complete Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1995, v:8, n:4, pp:617-637 [Journal ] Jonathan F. Buss , Arnold L. Rosenberg , Judson D. Knott Vertex Types in Book-Embeddings. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1989, v:2, n:2, pp:156-175 [Journal ] Shimon Even , Ami Litman , Arnold L. Rosenberg Monochromatic Paths and Triangulated Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1998, v:11, n:4, pp:546-556 [Journal ] Lenwood S. Heath , Frank Thomson Leighton , Arnold L. Rosenberg Comparing Queues and Stacks as Mechanisms for Laying out Graphs [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1992, v:5, n:3, pp:398-412 [Journal ] Romas Aleliunas , Arnold L. Rosenberg On Embedding Rectangular Grids in Square Grids. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1982, v:31, n:9, pp:907-913 [Journal ] Zeev Barzilai , Don Coppersmith , Arnold L. Rosenberg Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1983, v:32, n:2, pp:190-194 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1996, v:45, n:6, pp:714-729 [Journal ] Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton , Arnold L. Rosenberg An Optimal Strategies for Cycle-Stealing in Networks of Workstations. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1997, v:46, n:5, pp:545-557 [Journal ] Sandeep N. Bhatt , Geppino Pucci , Abhiram G. Ranade , Arnold L. Rosenberg Scattering and Gathering Messages in Networks of Processors. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1993, v:42, n:8, pp:938-949 [Journal ] Grzegorz Malewicz , Arnold L. Rosenberg , Matthew Yurkewych Toward a Theory for Scheduling Dags in Internet-Based Computing. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 2006, v:55, n:6, pp:757-768 [Journal ] Arnold L. Rosenberg On Scheduling Mesh-Structured Computations for Internet-Based Computing. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 2004, v:53, n:9, pp:1176-1186 [Journal ] Arnold L. Rosenberg The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1983, v:32, n:10, pp:902-910 [Journal ] Arnold L. Rosenberg A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1985, v:34, n:6, pp:578-584 [Journal ] Arnold L. Rosenberg , Vittorio Scarano , Ramesh K. Sitaraman The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1997, v:46, n:10, pp:1119-1131 [Journal ] Arnold L. Rosenberg , Matthew Yurkewych Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 2005, v:54, n:4, pp:428-438 [Journal ] Arnold L. Rosenberg , Larry J. Stockmeyer , Lawrence Snyder Uniform Data Encodings. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1980, v:11, n:, pp:145-165 [Journal ] William Aiello , Sandeep N. Bhatt , Fan R. K. Chung , Arnold L. Rosenberg , Ramesh K. Sitaraman Augmented Ring Networks. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:6, pp:598-609 [Journal ] Lixin Gao , Arnold L. Rosenberg , Ramesh K. Sitaraman Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:8, pp:813-824 [Journal ] Bojana Obrenic , Martin C. Herbordt , Arnold L. Rosenberg , Charles C. Weems Using Emulations to Enhance the Performance of Parallel Architectures. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:10, pp:1067-1081 [Journal ] Arnold L. Rosenberg Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 2002, v:13, n:2, pp:179-191 [Journal ] Arnold L. Rosenberg Accountable Web-Computing. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 2003, v:14, n:2, pp:97-106 [Journal ] Gennaro Cordasco , Vittorio Scarano , Arnold L. Rosenberg Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 2007, v:18, n:7, pp:973-982 [Journal ] Gennaro Cordasco , Grzegorz Malewicz , Arnold L. Rosenberg Applying IC-Scheduling Theory to Familiar Classes of Computations. [Citation Graph (0, 0)][DBLP ] IPDPS, 2007, pp:1-8 [Conf ] Robert Hall , Arnold L. Rosenberg , Arun Venkataramani A Comparison of Dag-Scheduling Strategies for Internet-Based Computing. [Citation Graph (0, 0)][DBLP ] IPDPS, 2007, pp:1-9 [Conf ] Arnold L. Rosenberg Cellular ANTomata. [Citation Graph (0, 0)][DBLP ] ISPA, 2007, pp:78-90 [Conf ] George Dean Bissias , Brian Neil Levine , Arnold L. Rosenberg Bounding damage from link destruction, with application to the internet. [Citation Graph (0, 0)][DBLP ] SIGMETRICS, 2007, pp:367-368 [Conf ] Grzegorz Malewicz , Ian T. Foster , Arnold L. Rosenberg , Michael Wilde A Tool for Prioritizing DAGMan Jobs and its Evaluation. [Citation Graph (0, 0)][DBLP ] J. Grid Comput., 2007, v:5, n:2, pp:197-212 [Journal ] Gennaro Cordasco , Grzegorz Malewicz , Arnold L. Rosenberg Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 2007, v:18, n:11, pp:1607-1617 [Journal ] Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures. [Citation Graph (, )][DBLP ] Ants in Parking Lots. [Citation Graph (, )][DBLP ] Area-Maximizing Schedules for Series-Parallel DAGs. [Citation Graph (, )][DBLP ] A Tool for Prioritizing DAGMan Jobs and Its Evaluation. [Citation Graph (, )][DBLP ] On Clustering Tasks in IC-Optimal Dags. [Citation Graph (, )][DBLP ] Cellular ANTomata: Food-Finding and Maze-Threading. [Citation Graph (, )][DBLP ] Path-robust multi-channel wireless networks. [Citation Graph (, )][DBLP ] Static strategies forworksharing with unrecoverable interruptions. [Citation Graph (, )][DBLP ] On scheduling dags to maximize area. [Citation Graph (, )][DBLP ] Extending IC-Scheduling via the Sweep Algorithm. [Citation Graph (, )][DBLP ] Bandwidth and pebbling. [Citation Graph (, )][DBLP ] Search in 0.051secs, Finished in 0.804secs