The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Friedhelm Meyer auf der Heide: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
    Dynamic Perfect Hashing: Upper and Lower Bounds [Citation Graph (4, 0)][DBLP]
    FOCS, 1988, pp:524-531 [Conf]
  2. Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner
    05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmic Aspects of Large and Complex Networks, 2005, pp:- [Conf]
  3. Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
    High Performance Universal Hashing, with Applications to Shared Memory Simulations. [Citation Graph (0, 0)][DBLP]
    Data Structures and Efficient Algorithms, 1992, pp:250-269 [Conf]
  4. Vikas Bansal, Friedhelm Meyer auf der Heide, Christian Sohler
    Labeling Smart Dust. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:77-88 [Conf]
  5. Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide
    Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP Model (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:17-30 [Conf]
  6. Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
    Shared Memory Simulations with Triple-Logarithmic Delay. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:46-59 [Conf]
  7. Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler
    Smoothed Motion Complexity. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:161-171 [Conf]
  8. Matthias Fischer, Friedhelm Meyer auf der Heide, Willy-Bernhard Strothmann
    Dynamic Data Structures for Realtime Management of Large Geormetric Scences (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:157-170 [Conf]
  9. Friedhelm Meyer auf der Heide, Christian Scheideler
    Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:341-354 [Conf]
  10. Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann
    Provably Good and Practical Strategies for Non-Uniform Data Management in Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:89-100 [Conf]
  11. Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, Ingo Rieping
    Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. II, 1996, pp:369-376 [Conf]
  12. Friedhelm Meyer auf der Heide, Mohan Kumar, Sotiris E. Nikoletseas, Paul G. Spirakis
    Mobile Computing, Mobile Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:933-934 [Conf]
  13. Friedhelm Meyer auf der Heide, Miroslaw Kutylowski, Prabhakar Ragde
    Complexity Theory and Algorithms. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:455- [Conf]
  14. Friedhelm Meyer auf der Heide, Klaus Schröder, Frank Schwarze
    Routing on Networks of Optical Crossbars (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:299-306 [Conf]
  15. Friedhelm Meyer auf der Heide, Berthold Vöcking
    Static and Dynamic Data Management in Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:46-56 [Conf]
  16. Efstratios Karaivazoglou, Friedhelm Meyer auf der Heide
    Routing on Asyncronous Processor Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:250-257 [Conf]
  17. Friedhelm Meyer auf der Heide, Hans-Anton Rollik
    Random Access Machines and Straight-Line Programs. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:259-264 [Conf]
  18. Friedhelm Meyer auf der Heide
    Nondeterministic versus Probabilistic Linear Search Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:65-73 [Conf]
  19. Friedhelm Meyer auf der Heide, Rüdiger Reischuk
    On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:56-64 [Conf]
  20. Friedhelm Meyer auf der Heide, Christian Scheideler
    Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:370-379 [Conf]
  21. Friedhelm Meyer auf der Heide, Avi Wigderson
    The Complexity of Parallel Sorting [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:532-540 [Conf]
  22. Bruce M. Maggs, Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann
    Exploiting Locality for Data Management in Systems of Limited Bandwidth. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:284-293 [Conf]
  23. Friedhelm Meyer auf der Heide, Thomas Decker
    Parallel Computing in Paderborn: The SFB 376 "Massive Parallelism - Algorithms, Design Methods, Applications". [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1997, pp:164-171 [Conf]
  24. Ernst W. Mayr, Friedhelm Meyer auf der Heide, Rolf Wanka
    International Workshop on Communication and Data Management in Large Networks. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1999, pp:334- [Conf]
  25. Peter Klein, Friedhelm Meyer auf der Heide
    Untere Zeitschranken für das Rucksack-Problem. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1980, pp:365-374 [Conf]
  26. Friedemann Mattern, Friedhelm Meyer auf der Heide
    Vorwort: Junge Informatik. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1999, pp:137- [Conf]
  27. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:50-59 [Conf]
  28. Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
    A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:6-19 [Conf]
  29. Friedhelm Meyer auf der Heide
    A Comparison Between Two Variations of a Pebble Game on Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:411-421 [Conf]
  30. Friedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka
    Strongly Adaptive Token Distribution. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:398-409 [Conf]
  31. Friedhelm Meyer auf der Heide, Rolf Wanka
    Parallel Bridging Models and Their Impact on Algorithm Design. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2001, pp:628-637 [Conf]
  32. Stefan Bock, Friedhelm Meyer auf der Heide, Christian Scheideler
    Optimal Wormhole Routing in the (n, d)-Torus. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:326-332 [Conf]
  33. Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide
    Dynamic Load Balancing in Distributed Hash Tables. [Citation Graph (0, 0)][DBLP]
    IPTPS, 2005, pp:217-225 [Conf]
  34. Armin Bäumker, Friedhelm Meyer auf der Heide
    Communication Efficient Parallel Searching. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1997, pp:233-254 [Conf]
  35. Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
    Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:11-19 [Conf]
  36. Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu
    De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space). [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:349-361 [Conf]
  37. Friedhelm Meyer auf der Heide, Gabriel Terán Martinez
    Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:316-330 [Conf]
  38. Olaf Bonorden, Nikolaus Brüls, Uwe Kastens, Dinh Khoi Le, Friedhelm Meyer auf der Heide, Jörg-Christian Niemann, Mario Porrmann, Ulrich Rückert, Adrian Slowik, Michael Thies
    A holistic methodology for network processor design. [Citation Graph (0, 0)][DBLP]
    LCN, 2003, pp:583-0 [Conf]
  39. Marcin Bienkowski, Friedhelm Meyer auf der Heide
    Page Migration in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:1-14 [Conf]
  40. Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Christian Schindelhauer
    Smart Robot Teams Exploring Sparse Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:327-338 [Conf]
  41. Friedhelm Meyer auf der Heide
    Time-Processor Trade-offs for Universal Parallel Computers. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:433-441 [Conf]
  42. Friedhelm Meyer auf der Heide
    Dynamic Hashing Strategies. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:76-87 [Conf]
  43. Marek Karpinski, Friedhelm Meyer auf der Heide
    On the Complexity of Genuinely Polynomial Computation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:362-368 [Conf]
  44. Friedhelm Meyer auf der Heide
    Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:20-29 [Conf]
  45. Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer auf der Heide
    A Web Computing Environment for Parallel Algorithms in Java. [Citation Graph (0, 0)][DBLP]
    PPAM, 2005, pp:801-808 [Conf]
  46. Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer auf der Heide
    Load Balancing Strategies in a Web Computing Environment. [Citation Graph (0, 0)][DBLP]
    PPAM, 2005, pp:839-846 [Conf]
  47. Michael Wand, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der Heide, Wolfgang Straßer
    The randomized z-buffer algorithm: interactive rendering of highly complex scenes. [Citation Graph (0, 0)][DBLP]
    SIGGRAPH, 2001, pp:361-370 [Conf]
  48. Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping
    Optimal broadcast on parallel locality models. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:221-225 [Conf]
  49. Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann
    Caching in networks (extended abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:430-439 [Conf]
  50. Friedhelm Meyer auf der Heide, Christian Scheideler
    Communication in Parallel Systems. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1996, pp:16-33 [Conf]
  51. Petra Berenbrink, Friedhelm Meyer auf der Heide, Klaus Schröder
    Allocating Weighted Jobs in Parallel. [Citation Graph (0, 0)][DBLP]
    SPAA, 1997, pp:302-310 [Conf]
  52. Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide
    Fighting against two adversaries: page migration in dynamic networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:64-73 [Conf]
  53. Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
    An Optimal Parallel Dictionary. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:360-368 [Conf]
  54. Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
    Simple, Efficient Shared Memory Simulations. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:110-119 [Conf]
  55. Friedhelm Meyer auf der Heide, Harald Räcke, Matthias Westermann
    Data management in hierarchical bus networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:109-118 [Conf]
  56. Friedhelm Meyer auf der Heide, Christian Scheideler
    Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:137-146 [Conf]
  57. Friedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald
    Energy, congestion and dilation in radio networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:230-237 [Conf]
  58. Friedhelm Meyer auf der Heide, Martin Storch, Rolf Wanka
    Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:119-128 [Conf]
  59. Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann
    Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. [Citation Graph (0, 0)][DBLP]
    SPAA, 1999, pp:165-174 [Conf]
  60. Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide
    Scheduling against an adversarial network. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:151-159 [Conf]
  61. Petra Berenbrink, Friedhelm Meyer auf der Heide, Volker Stemann
    Fault-Tolerant Shared Memory Simulations. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:181-192 [Conf]
  62. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    A Time-Space Tradeoff for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:353-358 [Conf]
  63. Friedhelm Meyer auf der Heide
    Efficient Simulations among Several Models of Parallel Computers. [Citation Graph (0, 0)][DBLP]
    STACS, 1984, pp:218-229 [Conf]
  64. Friedhelm Meyer auf der Heide
    Speeding up Random Access Machines by Few Processors. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:142-152 [Conf]
  65. Friedhelm Meyer auf der Heide
    On Genuinely Time Bounded Compuations. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:1-16 [Conf]
  66. Friedhelm Meyer auf der Heide
    Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:181-192 [Conf]
  67. Friedhelm Meyer auf der Heide, Hieu Thien Pham
    On the Performance of Networks with Multiple Busses. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:97-108 [Conf]
  68. Friedhelm Meyer auf der Heide, Christian Scheideler, Volker Stemann
    Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:267-278 [Conf]
  69. Friedhelm Meyer auf der Heide, Berthold Vöcking
    A Packet Routing Protocol for Arbitrary Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:291-302 [Conf]
  70. Friedhelm Meyer auf der Heide, Rolf Wanka
    Time-Optimal Simulations of Networks by Universal Parallel Computers. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:120-131 [Conf]
  71. Bettina Just, Friedhelm Meyer auf der Heide, Avi Wigderson
    On Computations with Integer Division. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:29-37 [Conf]
  72. Katharina Lürwer-Brüggemeier, Friedhelm Meyer auf der Heide
    Capabilities and Complexity of Computations with Integer Division. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:463-472 [Conf]
  73. Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, Berthold Vöcking
    Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:378-388 [Conf]
  74. Robert Cypher, Friedhelm Meyer auf der Heide, Christian Scheideler, Berthold Vöcking
    Universal Algorithms for Store-and-Forward and Wormhole Routing. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:356-365 [Conf]
  75. Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
    How to Distribute a Dictionary in a Complete Network [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:117-127 [Conf]
  76. Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson
    One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:48-58 [Conf]
  77. Joseph Gil, Friedhelm Meyer auf der Heide, Avi Wigderson
    Not All Keys Can Be Hashed in Constant Time (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:244-253 [Conf]
  78. Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky
    A Lower Bound for Randomized Algebraic Decision Trees. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:612-619 [Conf]
  79. Friedhelm Meyer auf der Heide
    A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:70-79 [Conf]
  80. Friedhelm Meyer auf der Heide
    Fast Algorithms for N-Dimensional Restrictions of Hard Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:413-420 [Conf]
  81. Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide
    Efficient PRAM Simulation on a Distributed Memory Machine [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:318-326 [Conf]
  82. Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert
    Upper and Lower Bounds for the Dictionary Problem (Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:214-215 [Conf]
  83. Friedhelm Meyer auf der Heide
    Efficiency of universal parallel computers. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:221-241 [Conf]
  84. Jan Klein, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka, Friedhelm Meyer auf der Heide
    The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. [Citation Graph (0, 0)][DBLP]
    VRST, 2002, pp:137-146 [Conf]
  85. Friedhelm Meyer auf der Heide
    Invited Presentation: Data Management in Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:8- [Conf]
  86. Friedhelm Meyer auf der Heide, Matthias Westermann
    Hot-Potato Routing on Multi-Dimensional Tori. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:209-221 [Conf]
  87. Foued Ameur, Paul Fischer, Klaus-Uwe Höffgen, Friedhelm Meyer auf der Heide
    Trial and Error. A New Approach to Space-Bounded Learning. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:7, pp:621-630 [Journal]
  88. Friedhelm Meyer auf der Heide
    Efficiency of Universal Parallel Computers. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:269-296 [Journal]
  89. Peter Klein, Friedhelm Meyer auf der Heide
    A Lower Time Bound for the Knapsack Problem on Random Access Machines. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:385-395 [Journal]
  90. Friedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka
    Strongly Adaptive Token Distribution. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:5, pp:413-427 [Journal]
  91. Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide
    Efficient PRAM Simulation on a Distributed Memory Machine. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:4/5, pp:517-542 [Journal]
  92. Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky
    A Lower Bound for Randomized Algebraic Decision Trees. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:4, pp:357-375 [Journal]
  93. Friedhelm Meyer auf der Heide, Christian Scheideler
    Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:1, pp:95-138 [Journal]
  94. Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky
    A Lower Bound for Randomized Algebraic Decision Trees [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:63, pp:- [Journal]
  95. László Babai, Bettina Just, Friedhelm Meyer auf der Heide
    On the Limits of Computations with the Floor Function [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:78, n:2, pp:99-107 [Journal]
  96. Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
    Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:137, n:2, pp:103-120 [Journal]
  97. Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
    An Optimal Parallel Dictionary [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:102, n:2, pp:196-217 [Journal]
  98. Friedhelm Meyer auf der Heide
    Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:67, n:1-3, pp:195-211 [Journal]
  99. Friedhelm Meyer auf der Heide
    Das Heinz Nixdorf-Institut der Universität-GH Paderborn. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1990, v:13, n:4, pp:231-232 [Journal]
  100. Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide
    Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:2, pp:103-110 [Journal]
  101. Friedhelm Meyer auf der Heide
    Infinite Cube-Connected Cycles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:1-2 [Journal]
  102. Clemens Lautemann, Friedhelm Meyer auf der Heide
    Lower Time Bounds for Integer Programming with Two Variables. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:2, pp:101-105 [Journal]
  103. Bettina Just, Friedhelm Meyer auf der Heide, Avi Wigderson
    On Computations with Integer Division. [Citation Graph (0, 0)][DBLP]
    ITA, 1989, v:23, n:1, pp:101-111 [Journal]
  104. Friedhelm Meyer auf der Heide
    A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:3, pp:668-676 [Journal]
  105. Friedhelm Meyer auf der Heide
    Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:4, pp:929-937 [Journal]
  106. Friedhelm Meyer auf der Heide
    Fast algorithms for N-dimensional restrictions of hard problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:3, pp:740-747 [Journal]
  107. Friedhelm Meyer auf der Heide, Berthold Vöcking
    Shortest-Path Routing in Arbitrary Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:31, n:1, pp:105-131 [Journal]
  108. Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping
    Optimal broadcast on parallel locality models. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:2, pp:151-166 [Journal]
  109. Petra Berenbrink, Friedhelm Meyer auf der Heide, Klaus Schröder
    Allocating Weighted Jobs in Parallel. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:3, pp:281-300 [Journal]
  110. Friedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald
    Congestion, Dilation, and Energy in Radio Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:3, pp:343-370 [Journal]
  111. Friedhelm Meyer auf der Heide, Martin Storch, Rolf Wanka
    Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:6, pp:627-644 [Journal]
  112. Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann
    Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:2, pp:217-245 [Journal]
  113. Jan Klein, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka, Friedhelm Meyer auf der Heide
    The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments. [Citation Graph (0, 0)][DBLP]
    Presence, 2004, v:13, n:6, pp:617-637 [Journal]
  114. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    A Time-Space Tradeoff for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:97-99 [Journal]
  115. Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
    Contention Resolution in Hashing Based Shared Memory Simulations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1703-1739 [Journal]
  116. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
    Dynamic Perfect Hashing: Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:738-761 [Journal]
  117. Joseph Gil, Friedhelm Meyer auf der Heide, Avi Wigderson
    The Tree Model for Hashing: Lower and Upper Bounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:5, pp:936-955 [Journal]
  118. Friedhelm Meyer auf der Heide
    Efficient Simulations Among Several Models of Parallel Computers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:106-119 [Journal]
  119. Friedhelm Meyer auf der Heide, Avi Wigderson
    The Complexity of Parallel Sorting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:100-107 [Journal]
  120. Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide
    Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:2, pp:175-203 [Journal]
  121. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:58, n:, pp:57-68 [Journal]
  122. Friedhelm Meyer auf der Heide
    A Comparison of two Variations of a Pebble Game on Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:13, n:, pp:315-322 [Journal]
  123. Friedhelm Meyer auf der Heide
    Simulating Probabilistic by Deterministic Algebraic Computation Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:325-330 [Journal]
  124. Friedhelm Meyer auf der Heide, Christian Scheideler, Volker Stemann
    Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:162, n:2, pp:245-281 [Journal]
  125. Friedhelm Meyer auf der Heide, Klaus Schröder, Frank Schwarze
    Routing on Networks of Optical Crossbars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:196, n:1-2, pp:181-200 [Journal]
  126. André Brinkmann, Sascha Effert, Friedhelm Meyer auf der Heide
    Dynamic and Redundant Data Placement. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2007, pp:29- [Conf]
  127. Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Jonas Schrieb
    Local strategies for maintaining a chain of relay stations between an explorer and a base station. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:260-269 [Conf]

  128. Average case complexity of Voronoi diagrams of n sites from the unit cube. [Citation Graph (, )][DBLP]


  129. V: Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. [Citation Graph (, )][DBLP]


  130. A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. [Citation Graph (, )][DBLP]


  131. Power-aware online file allocation in mobile ad hoc networks: [extended abstract]. [Citation Graph (, )][DBLP]


  132. A local O(n2) gathering algorithm. [Citation Graph (, )][DBLP]


  133. Maintaining Communication Between an Explorer and a Base Station. [Citation Graph (, )][DBLP]


  134. De Dictionariis Dynamicis Pauco Spatio Utentibus [Citation Graph (, )][DBLP]


  135. Planar Visibility Counting [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.691secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002