The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Arnold L. Rosenberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. Arnold L. Rosenberg, Lawrence Snyder
    Compact B-Trees. [Citation Graph (3, 6)][DBLP]
    SIGMOD Conference, 1979, pp:43-51 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. Arnold L. Rosenberg
    Preserving Proximity in Arrays. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1975, v:4, n:4, pp:443-460 [Journal]
  9. Arnold L. Rosenberg
    Data Encodings and Their Costs. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1978, v:9, n:, pp:273-292 [Journal]
  10. Arnold L. Rosenberg
    Encoding Data Structures in Trees. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1979, v:26, n:4, pp:668-689 [Journal]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Arnold L. Rosenberg
    Diogenes, Circa 1986. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:96-107 [Conf]
  20. Arnold L. Rosenberg
    GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:160-169 [Conf]
  21. 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]
  22. Arnold L. Rosenberg
    State. [Citation Graph (0, 0)][DBLP]
    Essays in Memory of Shimon Even, 2006, pp:375-398 [Conf]
  23. 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]
  24. Arnold L. Rosenberg
    Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better. [Citation Graph (0, 0)][DBLP]
    CLUSTER, 2001, pp:124-0 [Conf]
  25. 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]
  26. 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]
  27. 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]
  28. Grzegorz Malewicz, Arnold L. Rosenberg
    Batch-Scheduling Dags for Internet-Based Computing. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:262-271 [Conf]
  29. 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]
  30. Michael J. Fischer, Arnold L. Rosenberg
    Limited Random Access Turing Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1968, pp:356-367 [Conf]
  31. 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]
  32. 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]
  33. Arnold L. Rosenberg
    On n-tape finite state acceptors [Citation Graph (0, 0)][DBLP]
    FOCS, 1964, pp:76-81 [Conf]
  34. Arnold L. Rosenberg
    On multi-head finite automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1965, pp:221-228 [Conf]
  35. Arnold L. Rosenberg
    The Changing Challenges of Collaborative Algorithmics. [Citation Graph (0, 0)][DBLP]
    HiPC, 2005, pp:5- [Conf]
  36. 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]
  37. Arnold L. Rosenberg
    The VLSI Revolution in Theoretical Circles. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:23-40 [Conf]
  38. 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]
  39. 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]
  40. 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]
  41. Arnold L. Rosenberg
    Computed Access in Ragged Arrays. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1974, pp:642-646 [Conf]
  42. 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]
  43. Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych
    On Scheduling Complex Dags for Internet-Based Computing. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  44. Arnold L. Rosenberg
    Accountable Web-Computing. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  45. Arnold L. Rosenberg
    Efficient Pairing Functions - And Why You Should Care. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  46. 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]
  47. Arnold L. Rosenberg
    To BSP or not to BSP in Heterogeneous NOWs. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:165- [Conf]
  48. Arnold L. Rosenberg
    An Algorithmic Model for Heterogeneous Clusters: Rationale and Experience. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  49. 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]
  50. 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]
  51. Arnold L. Rosenberg
    Better Parallel Architectures via Emulations. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:30-36 [Conf]
  52. Arnold L. Rosenberg
    Optimal Sharing of Partitionable Workloads in Heterogeneous Networks of Workstations. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2000, pp:- [Conf]
  53. Arnold L. Rosenberg
    Transitions in Extendible Arrays. [Citation Graph (0, 0)][DBLP]
    POPL, 1973, pp:218-225 [Conf]
  54. 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]
  55. 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]
  56. Arnold L. Rosenberg
    Theoretical research on networks: models and methodology. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:282-293 [Conf]
  57. 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]
  58. 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]
  59. 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]
  60. 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]
  61. 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]
  62. 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]
  63. 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]
  64. 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]
  65. 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]
  66. Arnold L. Rosenberg
    Data Graphs and Addressing Schemes: Extended Abstract [Citation Graph (0, 0)][DBLP]
    STOC, 1970, pp:48-61 [Conf]
  67. Arnold L. Rosenberg
    Addressable Data Graphs: Extended Abstract [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:138-150 [Conf]
  68. Arnold L. Rosenberg
    Managing Storage for Extendible Arrays [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:297-302 [Conf]
  69. Arnold L. Rosenberg, Larry J. Stockmeyer
    Hashing Schemes for Extendible Arrays (Extended Arrays) [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:159-166 [Conf]
  70. 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]
  71. 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]
  72. Arnold L. Rosenberg
    Issues in the Study of Graph Embeddings. [Citation Graph (0, 0)][DBLP]
    WG, 1980, pp:150-176 [Conf]
  73. 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]
  74. 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]
  75. 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]
  76. 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]
  77. 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]
  78. 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]
  79. 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]
  80. 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]
  81. 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]
  82. 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]
  83. 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]
  84. 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]
  85. 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]
  86. 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]
  87. 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]
  88. 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]
  89. 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]
  90. 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]
  91. 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]
  92. 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]
  93. 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]
  94. Arnold L. Rosenberg
    Real-Time Definable Languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1967, v:14, n:4, pp:645-662 [Journal]
  95. 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]
  96. 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]
  97. Arnold L. Rosenberg
    Addressable Data Graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1972, v:19, n:2, pp:309-340 [Journal]
  98. Arnold L. Rosenberg
    Allocating Storage for Extendible Arrays. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:4, pp:652-670 [Journal]
  99. Arnold L. Rosenberg
    Corrigendum: ``Allocating Storage for Extendible Arrays''. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1975, v:22, n:2, pp:308- [Journal]
  100. 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]
  101. 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]
  102. 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]
  103. 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]
  104. 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]
  105. 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]
  106. 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]
  107. 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]
  108. 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]
  109. 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]
  110. 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]
  111. 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]
  112. 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]
  113. 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]
  114. 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]
  115. 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]
  116. 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]
  117. 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]
  118. Arnold L. Rosenberg
    Editorial Message. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:5/6, pp:333- [Journal]
  119. Arnold L. Rosenberg
    Obituary: Shimon Even. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:4, pp:481- [Journal]
  120. 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]
  121. 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]
  122. 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]
  123. 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]
  124. 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]
  125. 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]
  126. 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]
  127. 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]
  128. 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]
  129. 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]
  130. 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]
  131. Arnold L. Rosenberg
    Symmetries in Data Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1972, v:1, n:1, pp:40-65 [Journal]
  132. 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]
  133. 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]
  134. 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]
  135. 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]
  136. 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]
  137. 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]
  138. 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]
  139. 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]
  140. 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]
  141. 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]
  142. 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]
  143. 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]
  144. 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]
  145. 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]
  146. 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]
  147. 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]
  148. 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]
  149. 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]
  150. 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]
  151. 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]
  152. 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]
  153. 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]
  154. 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]
  155. 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]
  156. 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]
  157. Arnold L. Rosenberg
    Cellular ANTomata. [Citation Graph (0, 0)][DBLP]
    ISPA, 2007, pp:78-90 [Conf]
  158. 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]
  159. 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]
  160. 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]

  161. Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures. [Citation Graph (, )][DBLP]


  162. Ants in Parking Lots. [Citation Graph (, )][DBLP]


  163. Area-Maximizing Schedules for Series-Parallel DAGs. [Citation Graph (, )][DBLP]


  164. A Tool for Prioritizing DAGMan Jobs and Its Evaluation. [Citation Graph (, )][DBLP]


  165. On Clustering Tasks in IC-Optimal Dags. [Citation Graph (, )][DBLP]


  166. Cellular ANTomata: Food-Finding and Maze-Threading. [Citation Graph (, )][DBLP]


  167. Path-robust multi-channel wireless networks. [Citation Graph (, )][DBLP]


  168. Static strategies forworksharing with unrecoverable interruptions. [Citation Graph (, )][DBLP]


  169. On scheduling dags to maximize area. [Citation Graph (, )][DBLP]


  170. Extending IC-Scheduling via the Sweep Algorithm. [Citation Graph (, )][DBLP]


  171. Bandwidth and pebbling. [Citation Graph (, )][DBLP]


Search in 0.148secs, Finished in 0.153secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002