232 Publications

Mark all

[232]
2020 | Conference Paper | LibreCat-ID: 13868
Pukrop, Simon, et al. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.
LibreCat
 
[231]
2020 | Preprint | LibreCat-ID: 16968
Braun, Michael, et al. “Local Gathering of Mobile Robots in Three Dimensions.” ArXiv:2005.07495, 2020.
LibreCat
 
[230]
2020 | Journal Article | LibreCat-ID: 16299
Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science, vol. 815, 2020, pp. 289–309, doi:10.1016/j.tcs.2020.02.018.
LibreCat | DOI
 
[229]
2019 | Conference Paper | LibreCat-ID: 12870
Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–37, doi:10.1007/978-3-030-39479-0_9.
LibreCat | DOI | arXiv
 
[228]
2019 | Journal Article | LibreCat-ID: 13873
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 14, 2019, doi:10.1145/3364204.
LibreCat | Files available | DOI
 
[227]
2019 | Preprint | LibreCat-ID: 16341
Brandt, Sascha, et al. “Rendering of Complex Heterogenous Scenes Using Progressive Blue Surfels.” ArXiv:1904.08225, 2019.
LibreCat | Download (ext.) | arXiv
 
[226]
2019 | Journal Article | LibreCat-ID: 13937
Meyer auf der Heide, Friedhelm. “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln.” Mathematische Semesterberichte, vol. 66, no. 2, 2019, pp. 259–60, doi:10.1007/s00591-019-00249-0.
LibreCat | DOI
 
[225]
2019 | Preprint | LibreCat-ID: 16462
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” ArXiv:1904.05220, 2019.
LibreCat | arXiv
 
[224]
2019 | Book Chapter | LibreCat-ID: 13939
Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for Swarm Robotics.” Distributed Computing by Mobile Entities, Current Research in Moving and Computing, vol. 11340, Springer, 2019, pp. 317–34, doi:10.1007/978-3-030-11072-7\_13.
LibreCat | DOI
 
[223]
2019 | Journal Article | LibreCat-ID: 13946
Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized Problems.” Theoretical Computer Science, vol. 786, 2019, pp. 2–12, doi:10.1016/j.tcs.2018.11.006.
LibreCat | DOI
 
[222]
2019 | Journal Article | LibreCat-ID: 13770
Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business & Information Systems Engineering, Springer, doi:10.1007/s12599-019-00627-x.
LibreCat | Files available | DOI
 
[221]
2019 | Journal Article | LibreCat-ID: 16337
Brandt, Sascha, et al. “Visibility‐Aware Progressive Farthest Point Sampling on the GPU.” Computer Graphics Forum, vol. 38, no. 7, 2019, pp. 413–24, doi:10.1111/cgf.13848.
LibreCat | DOI | Download (ext.)
 
[220]
2019 | Conference Paper | LibreCat-ID: 13942
Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–21, doi:10.5220/0007369503150321.
LibreCat | DOI
 
[219]
2018 | Conference Paper | LibreCat-ID: 7570
Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, doi:10.1145/3210377.3210662.
LibreCat | Files available | DOI
 
[218]
2018 | Book Chapter | LibreCat-ID: 16392
Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2018, doi:10.1007/978-3-319-98355-4_18.
LibreCat | DOI
 
[217]
2018 | Journal Article | LibreCat-ID: 2848
Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .” Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.
LibreCat | Files available | DOI
 
[216]
2018 | Conference Paper | LibreCat-ID: 2850
Hamann, Heiko, et al. “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” Ninth International Conference on Fun with Algorithms (FUN), 2018, doi:10.4230/LIPIcs.FUN.2018.22.
LibreCat | Files available | DOI
 
[215]
2018 | Conference Paper | LibreCat-ID: 4375
Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4.
LibreCat | Files available | DOI
 
[214]
2018 | Journal Article | LibreCat-ID: 2849
Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, Springer, 2018, doi:10.1007/s00224-017-9836-z.
LibreCat | Files available | DOI
 
[213]
2018 | Journal Article | LibreCat-ID: 3551
König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79, doi:10.1007/s10878-018-0325-3.
LibreCat | Files available | DOI
 
[212]
2018 | Conference Paper | LibreCat-ID: 2485
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi:10.1145/3210377.3210389.
LibreCat | Files available | DOI
 
[211]
2017 | Book Chapter | LibreCat-ID: 16461
Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” Structural Information and Communication Complexity, 2017, doi:10.1007/978-3-319-72050-0_13.
LibreCat | DOI
 
[210]
2017 | Journal Article | LibreCat-ID: 706
Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” Journal of Combinatorial Optimization, vol. 36, no. 4, Springer, 2017, pp. 1168–94, doi:10.1007/s10878-017-0198-x.
LibreCat | Files available | DOI
 
[209]
2017 | Conference Paper | LibreCat-ID: 16347
Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta et al., vol. 10718, Springer, 2017, pp. 168–81, doi:10.1007/978-3-319-72751-6_13.
LibreCat | DOI
 
[208]
2017 | Conference Paper | LibreCat-ID: 55
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–19, doi:10.1145/3087556.3087575.
LibreCat | Files available | DOI
 
[207]
2017 | Conference Paper | LibreCat-ID: 79
Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.” Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), vol. 10787, Springer, 2017, pp. 207–22, doi:10.1007/978-3-319-89441-6.
LibreCat | Files available | DOI
 
[206]
2017 | Conference Paper | LibreCat-ID: 16348
Biermeier, Felix, et al. “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.” Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 285–300, doi:10.1007/978-3-319-89441-6_21.
LibreCat | DOI
 
[205]
2017 | Journal Article | LibreCat-ID: 63
Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.” Journal of Scheduling, Springer, 2017, doi:10.1007/s10951-017-0518-0.
LibreCat | Files available | DOI
 
[204]
2017 | Conference Paper | LibreCat-ID: 70
Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31, doi:10.1007/978-3-319-71147-8_2.
LibreCat | Files available | DOI
 
[203]
2017 | Conference Paper | LibreCat-ID: 82
Abu-Khzam, Faisal N., et al. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.” Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–50, doi:10.1007/978-3-319-59605-1_13.
LibreCat | Files available | DOI
 
[202]
2017 | Conference Paper | LibreCat-ID: 16349
Podlipyan, Pavel, et al. “A Continuous Strategy for Collisionless Gathering.” Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–97, doi:10.1007/978-3-319-72751-6_14 .
LibreCat | DOI
 
[201]
2016 | Conference Paper | LibreCat-ID: 143
Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8.
LibreCat | Files available | DOI
 
[200]
2016 | Conference Paper | LibreCat-ID: 16358
Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016, doi:10.1007/978-3-319-53058-1_5 .
LibreCat | DOI
 
[199]
2016 | Conference Paper | LibreCat-ID: 16360
Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51.
LibreCat | DOI
 
[198]
2016 | Preprint | LibreCat-ID: 16396
Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184, 2016.
LibreCat | arXiv
 
[197]
2016 | Conference (Editor) | LibreCat-ID: 163
Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016, doi:10.1145/2942358.
LibreCat | DOI
 
[196]
2016 | Conference Paper | LibreCat-ID: 16359
Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789.
LibreCat | DOI
 
[195]
2016 | Preprint | LibreCat-ID: 16450
Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016.
LibreCat | arXiv
 
[194]
2016 | Conference Paper | LibreCat-ID: 207
Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592, doi:10.1007/978-3-319-48749-6_42.
LibreCat | Files available | DOI
 
[193]
2016 | Special Issue | LibreCat-ID: 187
Meyer auf der Heide, Friedhelm, editor. “Introduction to the Special Issue on SPAA 2014.” Transactions on Parallel Computing (TOPC), no. 1, 2016, doi:10.1145/2936716.
LibreCat | Files available | DOI
 
[192]
2016 | Conference Paper | LibreCat-ID: 157
König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577, doi:10.1007/978-3-319-48749-6_41.
LibreCat | Files available | DOI
 
[191]
2016 | Journal Article | LibreCat-ID: 139
Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” Journal of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.
LibreCat | Files available | DOI
 
[190]
2016 | Conference Paper | LibreCat-ID: 16351
Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:10.1007/978-3-319-49487-6_7 .
LibreCat | DOI
 
[189]
2016 | Conference Paper | LibreCat-ID: 177
Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–88, doi:10.1007/978-3-319-48749-6_35.
LibreCat | Files available | DOI
 
[188]
2016 | Conference Paper | LibreCat-ID: 16364
Macker, Alexander, et al. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016, doi:10.1109/ipdps.2016.91.
LibreCat | DOI
 
[187]
2015 | Journal Article | LibreCat-ID: 16391
Degener, Bastian, et al. “Linear and Competitive Strategies for Continuous Robot Formation Problems.” ACM Transactions on Parallel Computing, 2015, pp. 1–18, doi:10.1145/2742341.
LibreCat | DOI
 
[186]
2015 | Preprint | LibreCat-ID: 16397
Abshoff, Sebastian, et al. “Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case.” ArXiv: 1501.04877, 2015.
LibreCat | arXiv
 
[185]
2015 | Conference Paper | LibreCat-ID: 240
Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.” Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288, doi:10.1007/978-3-319-21398-9_22.
LibreCat | Files available | DOI
 
[184]
2015 | Preprint | LibreCat-ID: 16449
Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” ArXiv:1510.05454, 2015.
LibreCat | arXiv
 
[183]
2015 | Preprint | LibreCat-ID: 16452
Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks.” ArXiv:1510.01866, 2015.
LibreCat | arXiv
 
[182]
2015 | Conference Paper | LibreCat-ID: 266
Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454.
LibreCat | Files available | DOI
 
[181]
2015 | Conference Paper | LibreCat-ID: 274
Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup Times.” Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, edited by Frank Dehne et al., 2015, pp. 542--553, doi:10.1007/978-3-319-21840-3_45.
LibreCat | Files available | DOI
 
[180]
2014 | Conference Paper | LibreCat-ID: 459
Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.
LibreCat | Files available | DOI
 
[179]
2014 | Conference Paper | LibreCat-ID: 380
Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–28, doi:10.1007/978-3-319-13129-0_34.
LibreCat | Files available | DOI
 
[178]
2014 | Book Chapter | LibreCat-ID: 16394
Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots.” Lecture Notes in Computer Science, 2014, doi:10.1007/978-3-319-14472-6_17.
LibreCat | DOI
 
[177]
2014 | Book (Editor) | LibreCat-ID: 16870
Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013. Vol. 8243, Springer, 2014, doi:10.1007/978-3-642-45346-5.
LibreCat | DOI
 
[176]
2014 | Conference Paper | LibreCat-ID: 379
Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing Problems.” Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34, doi:10.1007/978-3-319-12691-3_3.
LibreCat | Files available | DOI
 
[175]
2014 | Book Chapter | LibreCat-ID: 16395
Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation in Dynamic Ad-Hoc Networks.” Structural Information and Communication Complexity, 2014, doi:10.1007/978-3-319-09620-9_16.
LibreCat | DOI
 
[174]
2014 | Preprint | LibreCat-ID: 16460
Mäcker, Alexander, et al. “Online Top-k-Position Monitoring of Distributed Data Streams.” ArXiv:1410.7912, 2014.
LibreCat | arXiv
 
[173]
2014 | Conference Paper | LibreCat-ID: 368
Brinkmann, Andre, et al. “Scheduling Shared Continuous Resources on Many-Cores.” Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014, pp. 128–37, doi:10.1145/2612669.2612698.
LibreCat | Files available | DOI
 
[172]
2013 | Conference Paper | LibreCat-ID: 477
Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.” Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013, pp. 22–34, doi:10.1007/978-3-642-45346-5_3.
LibreCat | Files available | DOI
 
[171]
2013 | Conference Paper | LibreCat-ID: 505
Happe, Markus, et al. “On-The-Fly Computing: A Novel Paradigm for Individualized IT Services.” Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous Systems (SEUS), IEEE, 2013, doi:10.1109/ISORC.2013.6913232.
LibreCat | Files available | DOI
 
[170]
2013 | Preprint | LibreCat-ID: 524
Meyer auf der Heide, Friedhelm, and Kamil Swirkot. Hierarchies in Local Distributed Decision. arXiv, 2013.
LibreCat | Files available | arXiv
 
[169]
2013 | Journal Article | LibreCat-ID: 16393
Eikel, Benjamin, et al. “Spherical Visibility Sampling.” Computer Graphics Forum, 2013, pp. 49–58, doi:10.1111/cgf.12150.
LibreCat | DOI
 
[168]
2013 | Book Chapter | LibreCat-ID: 16406
Jähn, Claudius, et al. “Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.” Advances in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_12.
LibreCat | DOI
 
[167]
2013 | Conference Paper | LibreCat-ID: 563
Markarian, Christine, et al. “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–27, doi:10.1007/978-3-642-45346-5_16.
LibreCat | Files available | DOI
 
[166]
2013 | Book Chapter | LibreCat-ID: 16407
Petring, Ralf, et al. “Real-Time 3D Rendering of Heterogeneous Scenes.” Advances in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_44.
LibreCat | DOI
 
[165]
2013 | Conference Paper | LibreCat-ID: 507
Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.” Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22, doi:10.1007/978-3-319-03850-6_2.
LibreCat | Files available | DOI
 
[164]
2013 | Conference (Editor) | LibreCat-ID: 558
Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics. Vol. 8243, Springer, 2013, doi:10.1007/978-3-642-45346-5.
LibreCat | Files available | DOI
 
[163]
2012 | Conference Paper | LibreCat-ID: 636
Meyer auf der Heide, Friedhelm, et al. “An Algorithm for Facility Leasing.” Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2012, pp. 61–72, doi:10.1007/978-3-642-31104-8_6.
LibreCat | Files available | DOI
 
[162]
2012 | Book Chapter | LibreCat-ID: 16448
Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Local, Self-Organizing Strategies for Robotic Formation Problems.” Algorithms for Sensor Systems, 2012, doi:10.1007/978-3-642-28209-6_2.
LibreCat | DOI
 
[161]
2012 | Journal Article | LibreCat-ID: 579
Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.
LibreCat | Files available | DOI
 
[160]
2012 | Conference Paper | LibreCat-ID: 619
Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14, doi:10.1145/2414815.2414818.
LibreCat | Files available | DOI
 
[159]
2012 | Book Chapter | LibreCat-ID: 16445
Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Continuous Local Strategies for Robotic Formation Problems.” Experimental Algorithms, 2012, doi:10.1007/978-3-642-30850-5_2.
LibreCat | DOI
 
[158]
2012 | Book Chapter | LibreCat-ID: 16408
Süß, Tim, et al. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes.” Advances in Visual Computing, 2012, doi:10.1007/978-3-642-33179-4_48.
LibreCat | DOI
 
[157]
2012 | Conference Paper | LibreCat-ID: 16446
Kempkes, Barbara, et al. “Optimal and Competitive Runtime Bounds for Continuous, Local Gathering of Mobile Robots.” Proceedinbgs of the 24th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’12, 2012, doi:10.1145/2312005.2312009.
LibreCat | DOI
 
[156]
2011 | Book Chapter | LibreCat-ID: 16409
Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.
LibreCat | DOI
 
[155]
2011 | Conference Paper | LibreCat-ID: 16428
Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. 2011, doi:10.1145/1989493.
LibreCat | DOI
 
[154]
2011 | Conference Paper | LibreCat-ID: 16454
Kling, Peter, and Friedhelm Meyer auf der Heide. “Convergence of Local Communication Chain Strategies via Linear Transformations.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989517.
LibreCat | DOI
 
[153]
2011 | Book Chapter | LibreCat-ID: 16459
Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” Structural Information and Communication Complexity, 2011, doi:10.1007/978-3-642-22212-2_13.
LibreCat | DOI
 
[152]
2011 | Conference (Editor) | LibreCat-ID: 667
Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011, doi:10.1145/1989493.
LibreCat | DOI
 
[151]
2011 | Book Chapter | LibreCat-ID: 16412
Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How Do I Get My Stuff into the Boxes.” Algorithms Unplugged, 2011, pp. 367–74, doi:10.1007/978-3-642-15328-0_38.
LibreCat | DOI
 
[150]
2011 | Journal Article | LibreCat-ID: 16455
Degener, Bastian, et al. “Building Simple Formations in Large Societies of Tiny Mobile Robots.” Procedia Computer Science, 2011, pp. 153–55, doi:10.1016/j.procs.2011.09.049.
LibreCat | DOI
 
[149]
2011 | Journal Article | LibreCat-ID: 17009
Hsu, D. Frank, et al. “EDITORIAL.” Journal of Interconnection Networks, 2011, pp. vii–viii, doi:10.1142/s0219265911002885.
LibreCat | DOI
 
[148]
2011 | Book Chapter | LibreCat-ID: 16456
Degener, Bastian, et al. “Energy-Awareness in Self-Organising Robotic Exploration Teams.” Organic Computing — A Paradigm Shift for Complex Systems, 2011, doi:10.1007/978-3-0348-0130-0_35.
LibreCat | DOI
 
[147]
2011 | Conference Paper | LibreCat-ID: 664
Gehweiler, Joachim, et al. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40, doi:10.1007/978-3-642-31500-8_4.
LibreCat | Files available | DOI
 
[146]
2011 | Book Chapter | LibreCat-ID: 16410
Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” SOFSEM 2011: Theory and Practice of Computer Science, 2011, doi:10.1007/978-3-642-18381-2_15.
LibreCat | DOI
 
[145]
2011 | Conference Paper | LibreCat-ID: 16453
Degener, Bastian, et al. “A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989515.
LibreCat | DOI
 
[144]
2010 | Book Chapter | LibreCat-ID: 16365
Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” Structural Information and Communication Complexity, 2010, pp. 168–82, doi:10.1007/978-3-642-13284-1_14.
LibreCat | DOI
 
[143]
2010 | Book (Editor) | LibreCat-ID: 16404
Abramsky, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. 2010, doi:10.1007/978-3-642-14165-2.
LibreCat | DOI
 
[142]
2010 | Journal Article | LibreCat-ID: 16447
Degener, Bastian, et al. “A Survey on Relay Placement with Runtime and Approximation Guarantees.” Computer Science Review, 2010, pp. 57–68, doi:10.1016/j.cosrev.2010.09.005.
LibreCat | DOI
 
[141]
2010 | Book Chapter | LibreCat-ID: 16474
Bansal, Vikas, et al. “Labeling Smart Dust.” Algorithms – ESA 2004, 2010, doi:10.1007/978-3-540-30140-0_9.
LibreCat | DOI
 
[140]
2010 | Journal Article | LibreCat-ID: 1903
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5, 2010, pp. 468--474, doi:10.1007/s00287-010-0470-2.
LibreCat | DOI
 
[139]
2010 | Conference Paper | LibreCat-ID: 16401
Degener, Bastian, et al. “A Local O(N2) Gathering Algorithm.” Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10, 2010, doi:10.1145/1810479.1810523.
LibreCat | DOI
 
[138]
2010 | Conference Paper | LibreCat-ID: 16414
Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10. 2010, doi:10.1145/1810479.
LibreCat | DOI
 
[137]
2010 | Book (Editor) | LibreCat-ID: 16403
Abramsky, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. 2010, doi:10.1007/978-3-642-14162-1.
LibreCat | DOI
 
[136]
2009 | Conference Paper | LibreCat-ID: 16430
Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File Allocation in Mobile Ad Hoc Networks.” Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009, doi:10.1145/1583991.1584072.
LibreCat | DOI
 
[135]
2009 | Conference (Editor) | LibreCat-ID: 16431
Meyer auf der Heide, Friedhelm, and Michael A. Bender, editors. Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09. 2009, doi:10.1145/1583991.
LibreCat | DOI
 
[134]
2009 | Journal Article | LibreCat-ID: 16398
Bienkowski, Marcin, et al. “Optimal Algorithms for Page Migration in Dynamic Networks.” Journal of Discrete Algorithms, 2009, pp. 545–69, doi:10.1016/j.jda.2008.07.006.
LibreCat | DOI
 
[133]
2008 | Conference (Editor) | LibreCat-ID: 16466
Meyer auf der Heide, Friedhelm, and Nir Shavit, editors. Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08. ACM, 2008, doi:10.1145/1378533.
LibreCat | DOI
 
[132]
2008 | Journal Article | LibreCat-ID: 16429
Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies for Maintaining a Chain of Relays between an Explorer and a Base Camp.” Theoretical Computer Science, 2008, pp. 3391–405, doi:10.1016/j.tcs.2008.04.010.
LibreCat | DOI
 
[131]
2008 | Book Chapter | LibreCat-ID: 16463
Meyer auf der Heide, Friedhelm, and Barbara Schneider. “Local Strategies for Connecting Stations by Small Robotic Networks.” Biologically-Inspired Collaborative Computing, 2008, doi:10.1007/978-0-387-09655-1_9.
LibreCat | DOI
 
[130]
2008 | Book Chapter | LibreCat-ID: 16464
Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing Oder „Wie Bekomme Ich Die Klamotten in Die Kisten?“.” Taschenbuch Der Algorithmen, 2008, doi:10.1007/978-3-540-76394-9_40.
LibreCat | DOI
 
[129]
2008 | Preprint | LibreCat-ID: 16465
Fischer, Matthias, et al. “Planar Visibility Counting.” ArXiv:0810.0052, 2008.
LibreCat | arXiv
 
[128]
2007 | Conference Paper | LibreCat-ID: 16467
Dynia, Miroslaw, et al. “Local Strategies for Maintaining a Chain of Relay Stations between an Explorer and a Base Station.” Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’07, 2007, doi:10.1145/1248377.1248420.
LibreCat | DOI
 
[127]
2007 | Conference Paper | LibreCat-ID: 7970
Arens, Stephan, et al. “Smart Teams: Simulating Large Robotic Swarms in Vast Environments.” Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, Heinz Nixdorf Institut, University of Paderborn, 2007, pp. 215–22.
LibreCat | Download (ext.)
 
[126]
2007 | Conference Paper | LibreCat-ID: 2214
Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.
LibreCat | Files available
 
[125]
2006 | Book Chapter | LibreCat-ID: 16473
Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.” Lecture Notes in Computer Science, 2006, doi:10.1007/11821069_29.
LibreCat | DOI
 
[124]
2006 | Book Chapter | LibreCat-ID: 16470
Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.” Parallel Processing and Applied Mathematics, 2006, doi:10.1007/11752578_96.
LibreCat | DOI
 
[123]
2006 | Book Chapter | LibreCat-ID: 16471
Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.” Parallel Processing and Applied Mathematics, 2006, doi:10.1007/11752578_101.
LibreCat | DOI
 
[122]
2006 | Book Chapter | LibreCat-ID: 16476
Dynia, Miroslaw, et al. “Maintaining Communication Between an Explorer and a Base Station.” IFIP International Federation for Information Processing, 2006, doi:10.1007/978-0-387-34733-2_14.
LibreCat | DOI
 
[121]
2006 | Book Chapter | LibreCat-ID: 16472
Demaine, Erik D., et al. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” LATIN 2006: Theoretical Informatics, 2006, doi:10.1007/11682462_34.
LibreCat | DOI
 
[120]
2005 | Conference Paper | LibreCat-ID: 17112
Bienkowski, Marcin, et al. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, Technische Universiteit Eindhoven, 2005.
LibreCat | Files available
 
[119]
2005 | Book Chapter | LibreCat-ID: 16468
Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.” Peer-to-Peer Systems IV, 2005, doi:10.1007/11558989_20.
LibreCat | DOI
 
[118]
2005 | Conference (Editor) | LibreCat-ID: 17113
Leonardi, Stefano, et al., editors. Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks. Vol. 05361, 2005.
LibreCat | Files available
 
[117]
2005 | Journal Article | LibreCat-ID: 16399
Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments.” Presence: Teleoperators and Virtual Environments, 2005, pp. 617–37, doi:10.1162/1054746043280619.
LibreCat | DOI
 
[116]
2005 | Book Chapter | LibreCat-ID: 16469
Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” Mathematical Foundations of Computer Science 2005, 2005, doi:10.1007/11549345_1.
LibreCat | DOI
 
[115]
2004 | Conference Paper | LibreCat-ID: 16480
Leonardi, S., et al. “Scheduling against an Adversarial Network.” SPAA ’04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004, doi:10.1145/1007912.1007936.
LibreCat | DOI
 
[114]
2004 | Conference Paper | LibreCat-ID: 16475
Bienkowski, Marcin, et al. “Fighting against Two Adversaries.” Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’04, 2004, doi:10.1145/1007912.1007923.
LibreCat | DOI
 
[113]
2004 | Conference Paper | LibreCat-ID: 17346
Brinkmann, André, et al. “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.” 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, edited by Ben Kobler and P. C. Hariharan, IEEE, 2004, pp. 153--157.
LibreCat
 
[112]
2004 | Journal Article | LibreCat-ID: 16477
Meyer auf der Heide, Friedhelm, et al. “Congestion, Dilation, and Energy in Radio Networks.” Theory of Computing Systems, 2004, pp. 343–70, doi:10.1007/s00224-004-1124-z.
LibreCat | DOI
 
[111]
2003 | Journal Article | LibreCat-ID: 16481
Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications).” It - Information Technology, 2003, doi:10.1524/itit.45.2.108.19606.
LibreCat | DOI
 
[110]
2003 | Journal Article | LibreCat-ID: 16482
Juurlink, Ben, et al. “Optimal Broadcast on Parallel Locality Models.” Journal of Discrete Algorithms, 2003, pp. 151–66, doi:10.1016/s1570-8667(03)00023-6.
LibreCat | DOI
 
[109]
2003 | Conference Paper | LibreCat-ID: 2128
Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.
LibreCat | DOI
 
[108]
2003 | Conference (Editor) | LibreCat-ID: 16484
Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, editors. Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03. 2003, doi:10.1145/777412.
LibreCat | DOI
 
[107]
2003 | Conference Paper | LibreCat-ID: 16720
Bonorden, Olaf, et al. “A Holistic Methodology for Network Processor Design.” 28th Annual IEEE International Conference on Local Computer Networks, 2003, doi:10.1109/LCN.2003.1243185.
LibreCat | DOI
 
[106]
2002 | Book Chapter | LibreCat-ID: 16723
Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.” Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, 2002, doi:10.1007/3-540-45706-2_133.
LibreCat | DOI
 
[105]
2002 | Conference Paper | LibreCat-ID: 16490
Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.” Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02, 2002, doi:10.1145/585740.585764.
LibreCat | DOI
 
[104]
2002 | Journal Article | LibreCat-ID: 16489
Krick, C., et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” Theory of Computing Systems, 2002, pp. 217–45, doi:10.1007/s00224-001-1045-z.
LibreCat | DOI
 
[103]
2002 | Conference Paper | LibreCat-ID: 16491
Meyer auf der Heide, Friedhelm, et al. “Energy, Congestion and Dilation in Radio Networks.” Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02, 2002, doi:10.1145/564870.564910.
LibreCat | DOI
 
[102]
2001 | Conference Paper | LibreCat-ID: 16492
Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.” Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01, 2001, doi:10.1145/383259.383299.
LibreCat | DOI
 
[101]
2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide, Friedhelm. “Data Management in Networks.” Graph-Theoretic Concepts in Computer Science, 2001, doi:10.1007/3-540-45477-2_2.
LibreCat | DOI
 
[100]
2001 | Book (Editor) | LibreCat-ID: 16722
Meyer auf der Heide, Friedhelm, editor. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, Volume 2161), Springer , 2001, doi:10.1007/3-540-44676-1.
LibreCat | DOI
 
[99]
2001 | Journal Article | LibreCat-ID: 2139
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.
LibreCat | DOI
 
[98]
2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” Computational Science - ICCS 2001, 2001, doi:10.1007/3-540-45718-6_68.
LibreCat | DOI
 
[97]
2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.” Euro-Par 2000 Parallel Processing, 2000, doi:10.1007/3-540-44520-x_59.
LibreCat | DOI
 
[96]
2000 | Journal Article | LibreCat-ID: 17010
Czumaj, Artur, et al. “Contention Resolution in Hashing Based Shared Memory Simulations.” SIAM Journal on Computing, 2000, pp. 1703–39, doi:10.1137/s009753979529564x.
LibreCat | DOI
 
[95]
2000 | Conference Paper | LibreCat-ID: 16495
Meyer auf der Heide, Friedhelm, et al. “Data Management in Hierarchical Bus Networks.” Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000, doi:10.1145/341800.341814.
LibreCat | DOI
 
[94]
2000 | Conference Paper | LibreCat-ID: 16496
Meyer auf der Heide, Friedhelm, et al. “Caching in Networks (Extended Abstract).” SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.
LibreCat
 
[93]
1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” Algorithms - ESA’ 99, 1999, doi:10.1007/3-540-48481-7_9.
LibreCat | DOI
 
[92]
1999 | Journal Article | LibreCat-ID: 16501
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” Journal of Algorithms, 1999, pp. 105–31, doi:10.1006/jagm.1998.0980.
LibreCat | DOI
 
[91]
1999 | Journal Article | LibreCat-ID: 16502
Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.” Theory of Computing Systems, 1999, pp. 281–300, doi:10.1007/s002240000119.
LibreCat | DOI
 
[90]
1999 | Book Chapter | LibreCat-ID: 17052
Mayr, E. W., et al. “International Workshop on Communication and Data Management in Large Networks.” Informatik Aktuell, 1999, doi:10.1007/978-3-662-01069-3_47.
LibreCat | DOI
 
[89]
1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” LATIN’98: Theoretical Informatics, 1998, doi:10.1007/bfb0054332.
LibreCat | DOI
 
[88]
1998 | Conference Paper | LibreCat-ID: 16563
Cole, Richard, et al. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.” Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98, 1998, doi:10.1145/276698.276790.
LibreCat | DOI
 
[87]
1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.” Theoretical Computer Science, 1998, pp. 181–200, doi:10.1016/s0304-3975(97)86791-6.
LibreCat | DOI
 
[86]
1998 | Journal Article | LibreCat-ID: 16504
Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, pp. 175–203, doi:10.1016/s0304-3975(98)00020-6.
LibreCat | DOI
 
[85]
1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.
LibreCat | DOI
 
[84]
1997 | Journal Article | LibreCat-ID: 16567
Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing Systems, 1997, pp. 627–44, doi:10.1007/s002240000071.
LibreCat | DOI
 
[83]
1997 | Book Chapter | LibreCat-ID: 16568
Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” Algorithms — ESA ’97, 1997, doi:10.1007/3-540-63397-9_13.
LibreCat | DOI
 
[82]
1997 | Conference Paper | LibreCat-ID: 16689
Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, doi:10.1109/sfcs.1997.646117.
LibreCat | DOI
 
[81]
1997 | Journal Article | LibreCat-ID: 16564
Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387.
LibreCat | DOI
 
[80]
1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.
LibreCat | DOI
 
[79]
1997 | Journal Article | LibreCat-ID: 16565
Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” Information and Computation, 1997, pp. 103–20, doi:10.1006/inco.1997.2642.
LibreCat | DOI
 
[78]
1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.” Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997, doi:10.1145/258492.258522.
LibreCat | DOI
 
[77]
1997 | Journal Article | LibreCat-ID: 16566
Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” Information Processing Letters, 1997, pp. 103–10, doi:10.1016/s0020-0190(97)00032-x.
LibreCat | DOI
 
[76]
1997 | Book Chapter | LibreCat-ID: 16605
Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” Solving Irregularly Structured Problems in Parallel, 1997, doi:10.1007/3-540-63138-0_21.
LibreCat | DOI
 
[75]
1997 | Book Chapter | LibreCat-ID: 16693
Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’” Informatik ’97 Informatik Als Innovationsmotor, 1997, doi:10.1007/978-3-642-60831-5_22.
LibreCat | DOI
 
[74]
1997 | Conference Paper | LibreCat-ID: 2175
Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat | Files available
 
[73]
1996 | Journal Article | LibreCat-ID: 16699
Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” Algorithmica, 1996, pp. 413–27, doi:10.1007/bf01955042.
LibreCat | DOI
 
[72]
1996 | Book (Editor) | LibreCat-ID: 16702
Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. Automata, Languages and Programming, 23rd International Colloquium, ICALP96. 1996, doi:10.1007/3-540-61440-0.
LibreCat | DOI
 
[71]
1996 | Conference Paper | LibreCat-ID: 2183
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.
LibreCat | Files available
 
[70]
1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.” STACS 96, 1996, doi:10.1007/3-540-60922-9_16.
LibreCat | DOI
 
[69]
1996 | Conference Paper | LibreCat-ID: 2184
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33.
LibreCat | Files available
 
[68]
1996 | Conference Paper | LibreCat-ID: 2186
Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” STOC, ACM, 1996, pp. 356--365.
LibreCat | Files available
 
[67]
1996 | Journal Article | LibreCat-ID: 16700
Karp, R. M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” Algorithmica, 1996, pp. 517–42, doi:10.1007/bf01940878.
LibreCat | DOI
 
[66]
1996 | Journal Article | LibreCat-ID: 16698
Ameur, Foued, et al. “Trial and Error. A New Approach to Space-Bounded Learning.” Acta Informatica, 1996, pp. 621–30, doi:10.1007/bf03036467.
LibreCat | DOI
 
[65]
1996 | Journal Article | LibreCat-ID: 16701
Gil, Joseph, et al. “The Tree Model for Hashing: Lower and Upper Bounds.” SIAM Journal on Computing, 1996, pp. 936–55, doi:10.1137/s0097539793255722.
LibreCat | DOI
 
[64]
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2, 1996, pp. 245--281, doi:10.1016/0304-3975(96)00032-1.
LibreCat | DOI
 
[63]
1995 | Conference Paper | LibreCat-ID: 16707
Czumaj, A., et al. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995, doi:10.1109/istcs.1995.377051.
LibreCat | DOI
 
[62]
1995 | Conference Paper | LibreCat-ID: 2208
Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278.
LibreCat | Files available
 
[61]
1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” STACS 95, 1995, doi:10.1007/3-540-59042-0_81.
LibreCat | DOI
 
[60]
1995 | Book Chapter | LibreCat-ID: 16874
Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_131.
LibreCat | DOI
 
[59]
1995 | Book Chapter | LibreCat-ID: 16705
Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_133.
LibreCat | DOI
 
[58]
1995 | Book Chapter | LibreCat-ID: 16717
Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” Graph-Theoretic Concepts in Computer Science, 1995, doi:10.1007/3-540-60618-1_77.
LibreCat | DOI
 
[57]
1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995, doi:10.1145/215399.215430.
LibreCat | DOI
 
[56]
1995 | Conference Paper | LibreCat-ID: 2187
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” ESA, 1995, pp. 341--354, doi:10.1007/3-540-60313-1_154.
LibreCat | Files available | DOI
 
[55]
1995 | Conference Paper | LibreCat-ID: 2207
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995, pp. 137--146.
LibreCat | Files available
 
[54]
1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger, Martin, et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” SIAM Journal on Computing, 1994, pp. 738–61, doi:10.1137/s0097539791194094.
LibreCat | DOI
 
[53]
1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” Automata, Languages and Programming, 1993, doi:10.1007/3-540-56939-1_89.
LibreCat | DOI
 
[52]
1993 | Conference Paper | LibreCat-ID: 16731
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient Shared Memory Simulations.” Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93, 1993, doi:10.1145/165231.165246.
LibreCat | DOI
 
[51]
1993 | Journal Article | LibreCat-ID: 16729
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” Information and Computation, 1993, pp. 196–217, doi:10.1006/inco.1993.1007.
LibreCat | DOI
 
[50]
1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” Lecture Notes in Computer Science, 1993, doi:10.1007/3-540-56503-5_46.
LibreCat | DOI
 
[49]
1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” Data Structures and Efficient Algorithms, 1992, doi:10.1007/3-540-55488-2_31.
LibreCat | DOI
 
[48]
1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” Lecture Notes in Computer Science, 1992, doi:10.1007/3-540-56731-3_3.
LibreCat | DOI
 
[47]
1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” STACS 92, 1992, doi:10.1007/3-540-55210-3_176.
LibreCat | DOI
 
[46]
1992 | Conference Paper | LibreCat-ID: 16736
Karp, Richard M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992, doi:10.1145/129712.129743.
LibreCat | DOI
 
[45]
1992 | Book Chapter | LibreCat-ID: 16737
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” TEUBNER-TEXTE Zur Informatik, 1992, doi:10.1007/978-3-322-95233-2_7.
LibreCat | DOI
 
[44]
1990 | Book Chapter | LibreCat-ID: 16738
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” Automata, Languages and Programming, 1990, doi:10.1007/bfb0032018.
LibreCat | DOI
 
[43]
1990 | Book Chapter | LibreCat-ID: 16740
Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029630.
LibreCat | DOI
 
[42]
1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029597.
LibreCat | DOI
 
[41]
1990 | Conference Paper | LibreCat-ID: 16741
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a Dictionary in a Complete Network.” Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990, doi:10.1145/100216.100229.
LibreCat | DOI
 
[40]
1990 | Conference Paper | LibreCat-ID: 16742
Gil, J., et al. “Not All Keys Can Be Hashed in Constant Time.” Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990, doi:10.1145/100216.100247.
LibreCat | DOI
 
[39]
1990 | Journal Article | LibreCat-ID: 16824
Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” Informatik Spektrum, vol. 13, no. 4, 1990, pp. 231–32.
LibreCat
 
[38]
1989 | Book Chapter | LibreCat-ID: 16745
Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” STACS 89, 1989, doi:10.1007/bfb0028969.
LibreCat | DOI
 
[37]
1989 | Book Chapter | LibreCat-ID: 16746
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of Networks by Universal Parallel Computers.” STACS 89, 1989, doi:10.1007/bfb0028978.
LibreCat | DOI
 
[36]
1989 | Book Chapter | LibreCat-ID: 16789
Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” STACS 89, 1989, doi:10.1007/bfb0028983.
LibreCat | DOI
 
[35]
1989 | Journal Article | LibreCat-ID: 16743
Just, Bettina, et al. “On Computations with Integer Division.” RAIRO - Theoretical Informatics and Applications, 1989, pp. 101–11, doi:10.1051/ita/1989230101011.
LibreCat | DOI
 
[34]
1989 | Conference Paper | LibreCat-ID: 16744
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989, doi:10.1145/72935.72974.
LibreCat | DOI
 
[33]
1988 | Journal Article | LibreCat-ID: 16764
Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Journal of the ACM (JACM), 1988, pp. 740–47, doi:10.1145/44483.44490.
LibreCat | DOI
 
[32]
1988 | Journal Article | LibreCat-ID: 16765
Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” Theoretical Computer Science, 1988, pp. 57–68, doi:10.1016/0304-3975(88)90018-7.
LibreCat | DOI
 
[31]
1988 | Conference Paper | LibreCat-ID: 16766
Dietzfelbinger, M., et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988, doi:10.1109/sfcs.1988.21968.
LibreCat | DOI
 
[30]
1988 | Book Chapter | LibreCat-ID: 16767
Just, Bettina, et al. “On Computations with Integer Division.” STACS 88, 1988, doi:10.1007/bfb0035829.
LibreCat | DOI
 
[29]
1988 | Journal Article | LibreCat-ID: 16763
Babai, László, et al. “On the Limits of Computations with the Floor Function.” Information and Computation, 1988, pp. 99–107, doi:10.1016/0890-5401(88)90031-4.
LibreCat | DOI
 
[28]
1988 | Book Chapter | LibreCat-ID: 16768
Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.” SWAT 88, 1988, doi:10.1007/3-540-19487-8_24.
LibreCat | DOI
 
[27]
1987 | Journal Article | LibreCat-ID: 16772
Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” SIAM Journal on Computing, 1987, pp. 97–99, doi:10.1137/0216007.
LibreCat | DOI
 
[26]
1987 | Journal Article | LibreCat-ID: 16773
Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” SIAM Journal on Computing, 1987, pp. 100–07, doi:10.1137/0216008.
LibreCat | DOI
 
[25]
1986 | Journal Article | LibreCat-ID: 16771
Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers.” SIAM Journal on Computing, 1986, pp. 106–19, doi:10.1137/0215008.
LibreCat | DOI
 
[24]
1986 | Book Chapter | LibreCat-ID: 16776
Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” STACS 86, 1986, doi:10.1007/3-540-16078-7_89.
LibreCat | DOI
 
[23]
1986 | Book Chapter | LibreCat-ID: 16774
Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” Automata, Languages and Programming, 1986, doi:10.1007/3-540-16761-7_54.
LibreCat | DOI
 
[22]
1986 | Book Chapter | LibreCat-ID: 16775
Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” STACS 86, 1986, doi:10.1007/3-540-16078-7_72.
LibreCat | DOI
 
[21]
1985 | Conference Paper | LibreCat-ID: 16783
Fich, F. E., et al. “One, Two, Three . . . Infinity: Lower Bounds for Parallel Computation.” Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985, doi:10.1145/22145.22151.
LibreCat | DOI
 
[20]
1985 | Conference Paper | LibreCat-ID: 16788
Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear Search Algorithms.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.38.
LibreCat | DOI
 
[19]
1985 | Conference Paper | LibreCat-ID: 16784
Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985, doi:10.1145/22145.22191.
LibreCat | DOI
 
[18]
1985 | Journal Article | LibreCat-ID: 16823
Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models.” Information and Control, vol. 67, no. 1–3, 1985, pp. 195–211, doi:10.1016/S0019-9958(85)80035-8.
LibreCat | DOI
 
[17]
1985 | Journal Article | LibreCat-ID: 16780
Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” Journal of the ACM (JACM), 1985, pp. 929–37, doi:10.1145/4221.4250.
LibreCat | DOI
 
[16]
1985 | Journal Article | LibreCat-ID: 16779
Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.” Information Processing Letters, 1985, pp. 101–05, doi:10.1016/0020-0190(85)90042-0.
LibreCat | DOI
 
[15]
1985 | Journal Article | LibreCat-ID: 16781
Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” Theoretical Computer Science, 1985, pp. 325–30, doi:10.1016/0304-3975(85)90079-9.
LibreCat | DOI
 
[14]
1985 | Conference Paper | LibreCat-ID: 16782
Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.58.
LibreCat | DOI
 
[13]
1984 | Journal Article | LibreCat-ID: 16785
Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.” Journal of the ACM (JACM), 1984, pp. 668–76, doi:10.1145/828.322450.
LibreCat | DOI
 
[12]
1984 | Conference Paper | LibreCat-ID: 16786
Meyer auf der Heide, Friedhelm, and R. Reischuk. “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication.” 25th Annual Symposium OnFoundations of Computer Science, 1984., 1984, doi:10.1109/sfcs.1984.715901.
LibreCat | DOI
 
[11]
1984 | Book Chapter | LibreCat-ID: 16787
Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” STACS 84, 1984, doi:10.1007/3-540-12920-0_20.
LibreCat | DOI
 
[10]
1983 | Journal Article | LibreCat-ID: 16808
Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” Information Processing Letters, 1983, pp. 1–2, doi:10.1016/0020-0190(83)90001-7.
LibreCat | DOI
 
[9]
1983 | Book Chapter | LibreCat-ID: 16810
Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” Lecture Notes in Computer Science, 1983, doi:10.1007/bfb0036483.
LibreCat | DOI
 
[8]
1983 | Conference Paper | LibreCat-ID: 16809
Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983, doi:10.1145/800061.808734.
LibreCat | DOI
 
[7]
1983 | Journal Article | LibreCat-ID: 16806
Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” Acta Informatica, 1983, pp. 269–96, doi:10.1007/bf00265559.
LibreCat | DOI
 
[6]
1983 | Journal Article | LibreCat-ID: 16807
Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.” Acta Informatica, 1983, pp. 385–95, doi:10.1007/bf00290735.
LibreCat | DOI
 
[5]
1981 | Book Chapter | LibreCat-ID: 16813
Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” Fundamentals of Computation Theory, 1981, doi:10.1007/3-540-10854-8_29.
LibreCat | DOI
 
[4]
1981 | Journal Article | LibreCat-ID: 16820
Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Theoretical Computer Science, 1981, pp. 315–22, doi:10.1016/s0304-3975(81)80004-7.
LibreCat | DOI
 
[3]
1981 | Book Chapter | LibreCat-ID: 16814
Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” Lecture Notes in Computer Science, 1981, doi:10.1007/3-540-10856-4_111.
LibreCat | DOI
 
[2]
1980 | Book Chapter | LibreCat-ID: 16815
Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.” GI - 10. Jahrestagung, 1980, doi:10.1007/978-3-642-67838-7_34.
LibreCat | DOI
 
[1]
1979 | Journal Article | LibreCat-ID: 16812
Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Automata, Languages and Programming. ICALP 1979, 1979, pp. 411–21, doi:10.1007/3-540-09510-1_32 .
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

232 Publications

Mark all

[232]
2020 | Conference Paper | LibreCat-ID: 13868
Pukrop, Simon, et al. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.
LibreCat
 
[231]
2020 | Preprint | LibreCat-ID: 16968
Braun, Michael, et al. “Local Gathering of Mobile Robots in Three Dimensions.” ArXiv:2005.07495, 2020.
LibreCat
 
[230]
2020 | Journal Article | LibreCat-ID: 16299
Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science, vol. 815, 2020, pp. 289–309, doi:10.1016/j.tcs.2020.02.018.
LibreCat | DOI
 
[229]
2019 | Conference Paper | LibreCat-ID: 12870
Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–37, doi:10.1007/978-3-030-39479-0_9.
LibreCat | DOI | arXiv
 
[228]
2019 | Journal Article | LibreCat-ID: 13873
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 14, 2019, doi:10.1145/3364204.
LibreCat | Files available | DOI
 
[227]
2019 | Preprint | LibreCat-ID: 16341
Brandt, Sascha, et al. “Rendering of Complex Heterogenous Scenes Using Progressive Blue Surfels.” ArXiv:1904.08225, 2019.
LibreCat | Download (ext.) | arXiv
 
[226]
2019 | Journal Article | LibreCat-ID: 13937
Meyer auf der Heide, Friedhelm. “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln.” Mathematische Semesterberichte, vol. 66, no. 2, 2019, pp. 259–60, doi:10.1007/s00591-019-00249-0.
LibreCat | DOI
 
[225]
2019 | Preprint | LibreCat-ID: 16462
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” ArXiv:1904.05220, 2019.
LibreCat | arXiv
 
[224]
2019 | Book Chapter | LibreCat-ID: 13939
Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for Swarm Robotics.” Distributed Computing by Mobile Entities, Current Research in Moving and Computing, vol. 11340, Springer, 2019, pp. 317–34, doi:10.1007/978-3-030-11072-7\_13.
LibreCat | DOI
 
[223]
2019 | Journal Article | LibreCat-ID: 13946
Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized Problems.” Theoretical Computer Science, vol. 786, 2019, pp. 2–12, doi:10.1016/j.tcs.2018.11.006.
LibreCat | DOI
 
[222]
2019 | Journal Article | LibreCat-ID: 13770
Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business & Information Systems Engineering, Springer, doi:10.1007/s12599-019-00627-x.
LibreCat | Files available | DOI
 
[221]
2019 | Journal Article | LibreCat-ID: 16337
Brandt, Sascha, et al. “Visibility‐Aware Progressive Farthest Point Sampling on the GPU.” Computer Graphics Forum, vol. 38, no. 7, 2019, pp. 413–24, doi:10.1111/cgf.13848.
LibreCat | DOI | Download (ext.)
 
[220]
2019 | Conference Paper | LibreCat-ID: 13942
Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–21, doi:10.5220/0007369503150321.
LibreCat | DOI
 
[219]
2018 | Conference Paper | LibreCat-ID: 7570
Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, doi:10.1145/3210377.3210662.
LibreCat | Files available | DOI
 
[218]
2018 | Book Chapter | LibreCat-ID: 16392
Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2018, doi:10.1007/978-3-319-98355-4_18.
LibreCat | DOI
 
[217]
2018 | Journal Article | LibreCat-ID: 2848
Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .” Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.
LibreCat | Files available | DOI
 
[216]
2018 | Conference Paper | LibreCat-ID: 2850
Hamann, Heiko, et al. “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” Ninth International Conference on Fun with Algorithms (FUN), 2018, doi:10.4230/LIPIcs.FUN.2018.22.
LibreCat | Files available | DOI
 
[215]
2018 | Conference Paper | LibreCat-ID: 4375
Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4.
LibreCat | Files available | DOI
 
[214]
2018 | Journal Article | LibreCat-ID: 2849
Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, Springer, 2018, doi:10.1007/s00224-017-9836-z.
LibreCat | Files available | DOI
 
[213]
2018 | Journal Article | LibreCat-ID: 3551
König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79, doi:10.1007/s10878-018-0325-3.
LibreCat | Files available | DOI
 
[212]
2018 | Conference Paper | LibreCat-ID: 2485
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi:10.1145/3210377.3210389.
LibreCat | Files available | DOI
 
[211]
2017 | Book Chapter | LibreCat-ID: 16461
Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” Structural Information and Communication Complexity, 2017, doi:10.1007/978-3-319-72050-0_13.
LibreCat | DOI
 
[210]
2017 | Journal Article | LibreCat-ID: 706
Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” Journal of Combinatorial Optimization, vol. 36, no. 4, Springer, 2017, pp. 1168–94, doi:10.1007/s10878-017-0198-x.
LibreCat | Files available | DOI
 
[209]
2017 | Conference Paper | LibreCat-ID: 16347
Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta et al., vol. 10718, Springer, 2017, pp. 168–81, doi:10.1007/978-3-319-72751-6_13.
LibreCat | DOI
 
[208]
2017 | Conference Paper | LibreCat-ID: 55
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–19, doi:10.1145/3087556.3087575.
LibreCat | Files available | DOI
 
[207]
2017 | Conference Paper | LibreCat-ID: 79
Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.” Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), vol. 10787, Springer, 2017, pp. 207–22, doi:10.1007/978-3-319-89441-6.
LibreCat | Files available | DOI
 
[206]
2017 | Conference Paper | LibreCat-ID: 16348
Biermeier, Felix, et al. “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.” Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 285–300, doi:10.1007/978-3-319-89441-6_21.
LibreCat | DOI
 
[205]
2017 | Journal Article | LibreCat-ID: 63
Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.” Journal of Scheduling, Springer, 2017, doi:10.1007/s10951-017-0518-0.
LibreCat | Files available | DOI
 
[204]
2017 | Conference Paper | LibreCat-ID: 70
Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31, doi:10.1007/978-3-319-71147-8_2.
LibreCat | Files available | DOI
 
[203]
2017 | Conference Paper | LibreCat-ID: 82
Abu-Khzam, Faisal N., et al. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.” Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–50, doi:10.1007/978-3-319-59605-1_13.
LibreCat | Files available | DOI
 
[202]
2017 | Conference Paper | LibreCat-ID: 16349
Podlipyan, Pavel, et al. “A Continuous Strategy for Collisionless Gathering.” Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–97, doi:10.1007/978-3-319-72751-6_14 .
LibreCat | DOI
 
[201]
2016 | Conference Paper | LibreCat-ID: 143
Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8.
LibreCat | Files available | DOI
 
[200]
2016 | Conference Paper | LibreCat-ID: 16358
Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016, doi:10.1007/978-3-319-53058-1_5 .
LibreCat | DOI
 
[199]
2016 | Conference Paper | LibreCat-ID: 16360
Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51.
LibreCat | DOI
 
[198]
2016 | Preprint | LibreCat-ID: 16396
Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184, 2016.
LibreCat | arXiv
 
[197]
2016 | Conference (Editor) | LibreCat-ID: 163
Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016, doi:10.1145/2942358.
LibreCat | DOI
 
[196]
2016 | Conference Paper | LibreCat-ID: 16359
Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789.
LibreCat | DOI
 
[195]
2016 | Preprint | LibreCat-ID: 16450
Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016.
LibreCat | arXiv
 
[194]
2016 | Conference Paper | LibreCat-ID: 207
Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592, doi:10.1007/978-3-319-48749-6_42.
LibreCat | Files available | DOI
 
[193]
2016 | Special Issue | LibreCat-ID: 187
Meyer auf der Heide, Friedhelm, editor. “Introduction to the Special Issue on SPAA 2014.” Transactions on Parallel Computing (TOPC), no. 1, 2016, doi:10.1145/2936716.
LibreCat | Files available | DOI
 
[192]
2016 | Conference Paper | LibreCat-ID: 157
König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577, doi:10.1007/978-3-319-48749-6_41.
LibreCat | Files available | DOI
 
[191]
2016 | Journal Article | LibreCat-ID: 139
Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” Journal of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.
LibreCat | Files available | DOI
 
[190]
2016 | Conference Paper | LibreCat-ID: 16351
Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:10.1007/978-3-319-49487-6_7 .
LibreCat | DOI
 
[189]
2016 | Conference Paper | LibreCat-ID: 177
Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–88, doi:10.1007/978-3-319-48749-6_35.
LibreCat | Files available | DOI
 
[188]
2016 | Conference Paper | LibreCat-ID: 16364
Macker, Alexander, et al. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016, doi:10.1109/ipdps.2016.91.
LibreCat | DOI
 
[187]
2015 | Journal Article | LibreCat-ID: 16391
Degener, Bastian, et al. “Linear and Competitive Strategies for Continuous Robot Formation Problems.” ACM Transactions on Parallel Computing, 2015, pp. 1–18, doi:10.1145/2742341.
LibreCat | DOI
 
[186]
2015 | Preprint | LibreCat-ID: 16397
Abshoff, Sebastian, et al. “Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case.” ArXiv: 1501.04877, 2015.
LibreCat | arXiv
 
[185]
2015 | Conference Paper | LibreCat-ID: 240
Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.” Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288, doi:10.1007/978-3-319-21398-9_22.
LibreCat | Files available | DOI
 
[184]
2015 | Preprint | LibreCat-ID: 16449
Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” ArXiv:1510.05454, 2015.
LibreCat | arXiv
 
[183]
2015 | Preprint | LibreCat-ID: 16452
Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks.” ArXiv:1510.01866, 2015.
LibreCat | arXiv
 
[182]
2015 | Conference Paper | LibreCat-ID: 266
Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454.
LibreCat | Files available | DOI
 
[181]
2015 | Conference Paper | LibreCat-ID: 274
Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup Times.” Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, edited by Frank Dehne et al., 2015, pp. 542--553, doi:10.1007/978-3-319-21840-3_45.
LibreCat | Files available | DOI
 
[180]
2014 | Conference Paper | LibreCat-ID: 459
Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.
LibreCat | Files available | DOI
 
[179]
2014 | Conference Paper | LibreCat-ID: 380
Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–28, doi:10.1007/978-3-319-13129-0_34.
LibreCat | Files available | DOI
 
[178]
2014 | Book Chapter | LibreCat-ID: 16394
Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots.” Lecture Notes in Computer Science, 2014, doi:10.1007/978-3-319-14472-6_17.
LibreCat | DOI
 
[177]
2014 | Book (Editor) | LibreCat-ID: 16870
Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013. Vol. 8243, Springer, 2014, doi:10.1007/978-3-642-45346-5.
LibreCat | DOI
 
[176]
2014 | Conference Paper | LibreCat-ID: 379
Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing Problems.” Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34, doi:10.1007/978-3-319-12691-3_3.
LibreCat | Files available | DOI
 
[175]
2014 | Book Chapter | LibreCat-ID: 16395
Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation in Dynamic Ad-Hoc Networks.” Structural Information and Communication Complexity, 2014, doi:10.1007/978-3-319-09620-9_16.
LibreCat | DOI
 
[174]
2014 | Preprint | LibreCat-ID: 16460
Mäcker, Alexander, et al. “Online Top-k-Position Monitoring of Distributed Data Streams.” ArXiv:1410.7912, 2014.
LibreCat | arXiv
 
[173]
2014 | Conference Paper | LibreCat-ID: 368
Brinkmann, Andre, et al. “Scheduling Shared Continuous Resources on Many-Cores.” Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014, pp. 128–37, doi:10.1145/2612669.2612698.
LibreCat | Files available | DOI
 
[172]
2013 | Conference Paper | LibreCat-ID: 477
Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.” Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013, pp. 22–34, doi:10.1007/978-3-642-45346-5_3.
LibreCat | Files available | DOI
 
[171]
2013 | Conference Paper | LibreCat-ID: 505
Happe, Markus, et al. “On-The-Fly Computing: A Novel Paradigm for Individualized IT Services.” Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous Systems (SEUS), IEEE, 2013, doi:10.1109/ISORC.2013.6913232.
LibreCat | Files available | DOI
 
[170]
2013 | Preprint | LibreCat-ID: 524
Meyer auf der Heide, Friedhelm, and Kamil Swirkot. Hierarchies in Local Distributed Decision. arXiv, 2013.
LibreCat | Files available | arXiv
 
[169]
2013 | Journal Article | LibreCat-ID: 16393
Eikel, Benjamin, et al. “Spherical Visibility Sampling.” Computer Graphics Forum, 2013, pp. 49–58, doi:10.1111/cgf.12150.
LibreCat | DOI
 
[168]
2013 | Book Chapter | LibreCat-ID: 16406
Jähn, Claudius, et al. “Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.” Advances in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_12.
LibreCat | DOI
 
[167]
2013 | Conference Paper | LibreCat-ID: 563
Markarian, Christine, et al. “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–27, doi:10.1007/978-3-642-45346-5_16.
LibreCat | Files available | DOI
 
[166]
2013 | Book Chapter | LibreCat-ID: 16407
Petring, Ralf, et al. “Real-Time 3D Rendering of Heterogeneous Scenes.” Advances in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_44.
LibreCat | DOI
 
[165]
2013 | Conference Paper | LibreCat-ID: 507
Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.” Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22, doi:10.1007/978-3-319-03850-6_2.
LibreCat | Files available | DOI
 
[164]
2013 | Conference (Editor) | LibreCat-ID: 558
Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics. Vol. 8243, Springer, 2013, doi:10.1007/978-3-642-45346-5.
LibreCat | Files available | DOI
 
[163]
2012 | Conference Paper | LibreCat-ID: 636
Meyer auf der Heide, Friedhelm, et al. “An Algorithm for Facility Leasing.” Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2012, pp. 61–72, doi:10.1007/978-3-642-31104-8_6.
LibreCat | Files available | DOI
 
[162]
2012 | Book Chapter | LibreCat-ID: 16448
Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Local, Self-Organizing Strategies for Robotic Formation Problems.” Algorithms for Sensor Systems, 2012, doi:10.1007/978-3-642-28209-6_2.
LibreCat | DOI
 
[161]
2012 | Journal Article | LibreCat-ID: 579
Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.
LibreCat | Files available | DOI
 
[160]
2012 | Conference Paper | LibreCat-ID: 619
Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14, doi:10.1145/2414815.2414818.
LibreCat | Files available | DOI
 
[159]
2012 | Book Chapter | LibreCat-ID: 16445
Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Continuous Local Strategies for Robotic Formation Problems.” Experimental Algorithms, 2012, doi:10.1007/978-3-642-30850-5_2.
LibreCat | DOI
 
[158]
2012 | Book Chapter | LibreCat-ID: 16408
Süß, Tim, et al. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes.” Advances in Visual Computing, 2012, doi:10.1007/978-3-642-33179-4_48.
LibreCat | DOI
 
[157]
2012 | Conference Paper | LibreCat-ID: 16446
Kempkes, Barbara, et al. “Optimal and Competitive Runtime Bounds for Continuous, Local Gathering of Mobile Robots.” Proceedinbgs of the 24th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’12, 2012, doi:10.1145/2312005.2312009.
LibreCat | DOI
 
[156]
2011 | Book Chapter | LibreCat-ID: 16409
Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.
LibreCat | DOI
 
[155]
2011 | Conference Paper | LibreCat-ID: 16428
Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. 2011, doi:10.1145/1989493.
LibreCat | DOI
 
[154]
2011 | Conference Paper | LibreCat-ID: 16454
Kling, Peter, and Friedhelm Meyer auf der Heide. “Convergence of Local Communication Chain Strategies via Linear Transformations.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989517.
LibreCat | DOI
 
[153]
2011 | Book Chapter | LibreCat-ID: 16459
Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” Structural Information and Communication Complexity, 2011, doi:10.1007/978-3-642-22212-2_13.
LibreCat | DOI
 
[152]
2011 | Conference (Editor) | LibreCat-ID: 667
Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011, doi:10.1145/1989493.
LibreCat | DOI
 
[151]
2011 | Book Chapter | LibreCat-ID: 16412
Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How Do I Get My Stuff into the Boxes.” Algorithms Unplugged, 2011, pp. 367–74, doi:10.1007/978-3-642-15328-0_38.
LibreCat | DOI
 
[150]
2011 | Journal Article | LibreCat-ID: 16455
Degener, Bastian, et al. “Building Simple Formations in Large Societies of Tiny Mobile Robots.” Procedia Computer Science, 2011, pp. 153–55, doi:10.1016/j.procs.2011.09.049.
LibreCat | DOI
 
[149]
2011 | Journal Article | LibreCat-ID: 17009
Hsu, D. Frank, et al. “EDITORIAL.” Journal of Interconnection Networks, 2011, pp. vii–viii, doi:10.1142/s0219265911002885.
LibreCat | DOI
 
[148]
2011 | Book Chapter | LibreCat-ID: 16456
Degener, Bastian, et al. “Energy-Awareness in Self-Organising Robotic Exploration Teams.” Organic Computing — A Paradigm Shift for Complex Systems, 2011, doi:10.1007/978-3-0348-0130-0_35.
LibreCat | DOI
 
[147]
2011 | Conference Paper | LibreCat-ID: 664
Gehweiler, Joachim, et al. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40, doi:10.1007/978-3-642-31500-8_4.
LibreCat | Files available | DOI
 
[146]
2011 | Book Chapter | LibreCat-ID: 16410
Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” SOFSEM 2011: Theory and Practice of Computer Science, 2011, doi:10.1007/978-3-642-18381-2_15.
LibreCat | DOI
 
[145]
2011 | Conference Paper | LibreCat-ID: 16453
Degener, Bastian, et al. “A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989515.
LibreCat | DOI
 
[144]
2010 | Book Chapter | LibreCat-ID: 16365
Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” Structural Information and Communication Complexity, 2010, pp. 168–82, doi:10.1007/978-3-642-13284-1_14.
LibreCat | DOI
 
[143]
2010 | Book (Editor) | LibreCat-ID: 16404
Abramsky, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. 2010, doi:10.1007/978-3-642-14165-2.
LibreCat | DOI
 
[142]
2010 | Journal Article | LibreCat-ID: 16447
Degener, Bastian, et al. “A Survey on Relay Placement with Runtime and Approximation Guarantees.” Computer Science Review, 2010, pp. 57–68, doi:10.1016/j.cosrev.2010.09.005.
LibreCat | DOI
 
[141]
2010 | Book Chapter | LibreCat-ID: 16474
Bansal, Vikas, et al. “Labeling Smart Dust.” Algorithms – ESA 2004, 2010, doi:10.1007/978-3-540-30140-0_9.
LibreCat | DOI
 
[140]
2010 | Journal Article | LibreCat-ID: 1903
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5, 2010, pp. 468--474, doi:10.1007/s00287-010-0470-2.
LibreCat | DOI
 
[139]
2010 | Conference Paper | LibreCat-ID: 16401
Degener, Bastian, et al. “A Local O(N2) Gathering Algorithm.” Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10, 2010, doi:10.1145/1810479.1810523.
LibreCat | DOI
 
[138]
2010 | Conference Paper | LibreCat-ID: 16414
Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10. 2010, doi:10.1145/1810479.
LibreCat | DOI
 
[137]
2010 | Book (Editor) | LibreCat-ID: 16403
Abramsky, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. 2010, doi:10.1007/978-3-642-14162-1.
LibreCat | DOI
 
[136]
2009 | Conference Paper | LibreCat-ID: 16430
Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File Allocation in Mobile Ad Hoc Networks.” Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009, doi:10.1145/1583991.1584072.
LibreCat | DOI
 
[135]
2009 | Conference (Editor) | LibreCat-ID: 16431
Meyer auf der Heide, Friedhelm, and Michael A. Bender, editors. Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09. 2009, doi:10.1145/1583991.
LibreCat | DOI
 
[134]
2009 | Journal Article | LibreCat-ID: 16398
Bienkowski, Marcin, et al. “Optimal Algorithms for Page Migration in Dynamic Networks.” Journal of Discrete Algorithms, 2009, pp. 545–69, doi:10.1016/j.jda.2008.07.006.
LibreCat | DOI
 
[133]
2008 | Conference (Editor) | LibreCat-ID: 16466
Meyer auf der Heide, Friedhelm, and Nir Shavit, editors. Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08. ACM, 2008, doi:10.1145/1378533.
LibreCat | DOI
 
[132]
2008 | Journal Article | LibreCat-ID: 16429
Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies for Maintaining a Chain of Relays between an Explorer and a Base Camp.” Theoretical Computer Science, 2008, pp. 3391–405, doi:10.1016/j.tcs.2008.04.010.
LibreCat | DOI
 
[131]
2008 | Book Chapter | LibreCat-ID: 16463
Meyer auf der Heide, Friedhelm, and Barbara Schneider. “Local Strategies for Connecting Stations by Small Robotic Networks.” Biologically-Inspired Collaborative Computing, 2008, doi:10.1007/978-0-387-09655-1_9.
LibreCat | DOI
 
[130]
2008 | Book Chapter | LibreCat-ID: 16464
Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing Oder „Wie Bekomme Ich Die Klamotten in Die Kisten?“.” Taschenbuch Der Algorithmen, 2008, doi:10.1007/978-3-540-76394-9_40.
LibreCat | DOI
 
[129]
2008 | Preprint | LibreCat-ID: 16465
Fischer, Matthias, et al. “Planar Visibility Counting.” ArXiv:0810.0052, 2008.
LibreCat | arXiv
 
[128]
2007 | Conference Paper | LibreCat-ID: 16467
Dynia, Miroslaw, et al. “Local Strategies for Maintaining a Chain of Relay Stations between an Explorer and a Base Station.” Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’07, 2007, doi:10.1145/1248377.1248420.
LibreCat | DOI
 
[127]
2007 | Conference Paper | LibreCat-ID: 7970
Arens, Stephan, et al. “Smart Teams: Simulating Large Robotic Swarms in Vast Environments.” Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, Heinz Nixdorf Institut, University of Paderborn, 2007, pp. 215–22.
LibreCat | Download (ext.)
 
[126]
2007 | Conference Paper | LibreCat-ID: 2214
Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.
LibreCat | Files available
 
[125]
2006 | Book Chapter | LibreCat-ID: 16473
Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.” Lecture Notes in Computer Science, 2006, doi:10.1007/11821069_29.
LibreCat | DOI
 
[124]
2006 | Book Chapter | LibreCat-ID: 16470
Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.” Parallel Processing and Applied Mathematics, 2006, doi:10.1007/11752578_96.
LibreCat | DOI
 
[123]
2006 | Book Chapter | LibreCat-ID: 16471
Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.” Parallel Processing and Applied Mathematics, 2006, doi:10.1007/11752578_101.
LibreCat | DOI
 
[122]
2006 | Book Chapter | LibreCat-ID: 16476
Dynia, Miroslaw, et al. “Maintaining Communication Between an Explorer and a Base Station.” IFIP International Federation for Information Processing, 2006, doi:10.1007/978-0-387-34733-2_14.
LibreCat | DOI
 
[121]
2006 | Book Chapter | LibreCat-ID: 16472
Demaine, Erik D., et al. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” LATIN 2006: Theoretical Informatics, 2006, doi:10.1007/11682462_34.
LibreCat | DOI
 
[120]
2005 | Conference Paper | LibreCat-ID: 17112
Bienkowski, Marcin, et al. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, Technische Universiteit Eindhoven, 2005.
LibreCat | Files available
 
[119]
2005 | Book Chapter | LibreCat-ID: 16468
Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.” Peer-to-Peer Systems IV, 2005, doi:10.1007/11558989_20.
LibreCat | DOI
 
[118]
2005 | Conference (Editor) | LibreCat-ID: 17113
Leonardi, Stefano, et al., editors. Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks. Vol. 05361, 2005.
LibreCat | Files available
 
[117]
2005 | Journal Article | LibreCat-ID: 16399
Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments.” Presence: Teleoperators and Virtual Environments, 2005, pp. 617–37, doi:10.1162/1054746043280619.
LibreCat | DOI
 
[116]
2005 | Book Chapter | LibreCat-ID: 16469
Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” Mathematical Foundations of Computer Science 2005, 2005, doi:10.1007/11549345_1.
LibreCat | DOI
 
[115]
2004 | Conference Paper | LibreCat-ID: 16480
Leonardi, S., et al. “Scheduling against an Adversarial Network.” SPAA ’04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004, doi:10.1145/1007912.1007936.
LibreCat | DOI
 
[114]
2004 | Conference Paper | LibreCat-ID: 16475
Bienkowski, Marcin, et al. “Fighting against Two Adversaries.” Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’04, 2004, doi:10.1145/1007912.1007923.
LibreCat | DOI
 
[113]
2004 | Conference Paper | LibreCat-ID: 17346
Brinkmann, André, et al. “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.” 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, edited by Ben Kobler and P. C. Hariharan, IEEE, 2004, pp. 153--157.
LibreCat
 
[112]
2004 | Journal Article | LibreCat-ID: 16477
Meyer auf der Heide, Friedhelm, et al. “Congestion, Dilation, and Energy in Radio Networks.” Theory of Computing Systems, 2004, pp. 343–70, doi:10.1007/s00224-004-1124-z.
LibreCat | DOI
 
[111]
2003 | Journal Article | LibreCat-ID: 16481
Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications).” It - Information Technology, 2003, doi:10.1524/itit.45.2.108.19606.
LibreCat | DOI
 
[110]
2003 | Journal Article | LibreCat-ID: 16482
Juurlink, Ben, et al. “Optimal Broadcast on Parallel Locality Models.” Journal of Discrete Algorithms, 2003, pp. 151–66, doi:10.1016/s1570-8667(03)00023-6.
LibreCat | DOI
 
[109]
2003 | Conference Paper | LibreCat-ID: 2128
Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.
LibreCat | DOI
 
[108]
2003 | Conference (Editor) | LibreCat-ID: 16484
Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, editors. Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03. 2003, doi:10.1145/777412.
LibreCat | DOI
 
[107]
2003 | Conference Paper | LibreCat-ID: 16720
Bonorden, Olaf, et al. “A Holistic Methodology for Network Processor Design.” 28th Annual IEEE International Conference on Local Computer Networks, 2003, doi:10.1109/LCN.2003.1243185.
LibreCat | DOI
 
[106]
2002 | Book Chapter | LibreCat-ID: 16723
Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.” Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, 2002, doi:10.1007/3-540-45706-2_133.
LibreCat | DOI
 
[105]
2002 | Conference Paper | LibreCat-ID: 16490
Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.” Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02, 2002, doi:10.1145/585740.585764.
LibreCat | DOI
 
[104]
2002 | Journal Article | LibreCat-ID: 16489
Krick, C., et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” Theory of Computing Systems, 2002, pp. 217–45, doi:10.1007/s00224-001-1045-z.
LibreCat | DOI
 
[103]
2002 | Conference Paper | LibreCat-ID: 16491
Meyer auf der Heide, Friedhelm, et al. “Energy, Congestion and Dilation in Radio Networks.” Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02, 2002, doi:10.1145/564870.564910.
LibreCat | DOI
 
[102]
2001 | Conference Paper | LibreCat-ID: 16492
Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.” Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01, 2001, doi:10.1145/383259.383299.
LibreCat | DOI
 
[101]
2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide, Friedhelm. “Data Management in Networks.” Graph-Theoretic Concepts in Computer Science, 2001, doi:10.1007/3-540-45477-2_2.
LibreCat | DOI
 
[100]
2001 | Book (Editor) | LibreCat-ID: 16722
Meyer auf der Heide, Friedhelm, editor. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, Volume 2161), Springer , 2001, doi:10.1007/3-540-44676-1.
LibreCat | DOI
 
[99]
2001 | Journal Article | LibreCat-ID: 2139
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.
LibreCat | DOI
 
[98]
2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” Computational Science - ICCS 2001, 2001, doi:10.1007/3-540-45718-6_68.
LibreCat | DOI
 
[97]
2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.” Euro-Par 2000 Parallel Processing, 2000, doi:10.1007/3-540-44520-x_59.
LibreCat | DOI
 
[96]
2000 | Journal Article | LibreCat-ID: 17010
Czumaj, Artur, et al. “Contention Resolution in Hashing Based Shared Memory Simulations.” SIAM Journal on Computing, 2000, pp. 1703–39, doi:10.1137/s009753979529564x.
LibreCat | DOI
 
[95]
2000 | Conference Paper | LibreCat-ID: 16495
Meyer auf der Heide, Friedhelm, et al. “Data Management in Hierarchical Bus Networks.” Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000, doi:10.1145/341800.341814.
LibreCat | DOI
 
[94]
2000 | Conference Paper | LibreCat-ID: 16496
Meyer auf der Heide, Friedhelm, et al. “Caching in Networks (Extended Abstract).” SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.
LibreCat
 
[93]
1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” Algorithms - ESA’ 99, 1999, doi:10.1007/3-540-48481-7_9.
LibreCat | DOI
 
[92]
1999 | Journal Article | LibreCat-ID: 16501
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” Journal of Algorithms, 1999, pp. 105–31, doi:10.1006/jagm.1998.0980.
LibreCat | DOI
 
[91]
1999 | Journal Article | LibreCat-ID: 16502
Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.” Theory of Computing Systems, 1999, pp. 281–300, doi:10.1007/s002240000119.
LibreCat | DOI
 
[90]
1999 | Book Chapter | LibreCat-ID: 17052
Mayr, E. W., et al. “International Workshop on Communication and Data Management in Large Networks.” Informatik Aktuell, 1999, doi:10.1007/978-3-662-01069-3_47.
LibreCat | DOI
 
[89]
1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” LATIN’98: Theoretical Informatics, 1998, doi:10.1007/bfb0054332.
LibreCat | DOI
 
[88]
1998 | Conference Paper | LibreCat-ID: 16563
Cole, Richard, et al. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.” Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98, 1998, doi:10.1145/276698.276790.
LibreCat | DOI
 
[87]
1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.” Theoretical Computer Science, 1998, pp. 181–200, doi:10.1016/s0304-3975(97)86791-6.
LibreCat | DOI
 
[86]
1998 | Journal Article | LibreCat-ID: 16504
Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, pp. 175–203, doi:10.1016/s0304-3975(98)00020-6.
LibreCat | DOI
 
[85]
1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.
LibreCat | DOI
 
[84]
1997 | Journal Article | LibreCat-ID: 16567
Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing Systems, 1997, pp. 627–44, doi:10.1007/s002240000071.
LibreCat | DOI
 
[83]
1997 | Book Chapter | LibreCat-ID: 16568
Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” Algorithms — ESA ’97, 1997, doi:10.1007/3-540-63397-9_13.
LibreCat | DOI
 
[82]
1997 | Conference Paper | LibreCat-ID: 16689
Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, doi:10.1109/sfcs.1997.646117.
LibreCat | DOI
 
[81]
1997 | Journal Article | LibreCat-ID: 16564
Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387.
LibreCat | DOI
 
[80]
1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.
LibreCat | DOI
 
[79]
1997 | Journal Article | LibreCat-ID: 16565
Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” Information and Computation, 1997, pp. 103–20, doi:10.1006/inco.1997.2642.
LibreCat | DOI
 
[78]
1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.” Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997, doi:10.1145/258492.258522.
LibreCat | DOI
 
[77]
1997 | Journal Article | LibreCat-ID: 16566
Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” Information Processing Letters, 1997, pp. 103–10, doi:10.1016/s0020-0190(97)00032-x.
LibreCat | DOI
 
[76]
1997 | Book Chapter | LibreCat-ID: 16605
Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” Solving Irregularly Structured Problems in Parallel, 1997, doi:10.1007/3-540-63138-0_21.
LibreCat | DOI
 
[75]
1997 | Book Chapter | LibreCat-ID: 16693
Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’” Informatik ’97 Informatik Als Innovationsmotor, 1997, doi:10.1007/978-3-642-60831-5_22.
LibreCat | DOI
 
[74]
1997 | Conference Paper | LibreCat-ID: 2175
Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat | Files available
 
[73]
1996 | Journal Article | LibreCat-ID: 16699
Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” Algorithmica, 1996, pp. 413–27, doi:10.1007/bf01955042.
LibreCat | DOI
 
[72]
1996 | Book (Editor) | LibreCat-ID: 16702
Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. Automata, Languages and Programming, 23rd International Colloquium, ICALP96. 1996, doi:10.1007/3-540-61440-0.
LibreCat | DOI
 
[71]
1996 | Conference Paper | LibreCat-ID: 2183
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.
LibreCat | Files available
 
[70]
1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.” STACS 96, 1996, doi:10.1007/3-540-60922-9_16.
LibreCat | DOI
 
[69]
1996 | Conference Paper | LibreCat-ID: 2184
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33.
LibreCat | Files available
 
[68]
1996 | Conference Paper | LibreCat-ID: 2186
Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” STOC, ACM, 1996, pp. 356--365.
LibreCat | Files available
 
[67]
1996 | Journal Article | LibreCat-ID: 16700
Karp, R. M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” Algorithmica, 1996, pp. 517–42, doi:10.1007/bf01940878.
LibreCat | DOI
 
[66]
1996 | Journal Article | LibreCat-ID: 16698
Ameur, Foued, et al. “Trial and Error. A New Approach to Space-Bounded Learning.” Acta Informatica, 1996, pp. 621–30, doi:10.1007/bf03036467.
LibreCat | DOI
 
[65]
1996 | Journal Article | LibreCat-ID: 16701
Gil, Joseph, et al. “The Tree Model for Hashing: Lower and Upper Bounds.” SIAM Journal on Computing, 1996, pp. 936–55, doi:10.1137/s0097539793255722.
LibreCat | DOI
 
[64]
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2, 1996, pp. 245--281, doi:10.1016/0304-3975(96)00032-1.
LibreCat | DOI
 
[63]
1995 | Conference Paper | LibreCat-ID: 16707
Czumaj, A., et al. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995, doi:10.1109/istcs.1995.377051.
LibreCat | DOI
 
[62]
1995 | Conference Paper | LibreCat-ID: 2208
Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278.
LibreCat | Files available
 
[61]
1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” STACS 95, 1995, doi:10.1007/3-540-59042-0_81.
LibreCat | DOI
 
[60]
1995 | Book Chapter | LibreCat-ID: 16874
Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_131.
LibreCat | DOI
 
[59]
1995 | Book Chapter | LibreCat-ID: 16705
Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_133.
LibreCat | DOI
 
[58]
1995 | Book Chapter | LibreCat-ID: 16717
Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” Graph-Theoretic Concepts in Computer Science, 1995, doi:10.1007/3-540-60618-1_77.
LibreCat | DOI
 
[57]
1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995, doi:10.1145/215399.215430.
LibreCat | DOI
 
[56]
1995 | Conference Paper | LibreCat-ID: 2187
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” ESA, 1995, pp. 341--354, doi:10.1007/3-540-60313-1_154.
LibreCat | Files available | DOI
 
[55]
1995 | Conference Paper | LibreCat-ID: 2207
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995, pp. 137--146.
LibreCat | Files available
 
[54]
1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger, Martin, et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” SIAM Journal on Computing, 1994, pp. 738–61, doi:10.1137/s0097539791194094.
LibreCat | DOI
 
[53]
1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” Automata, Languages and Programming, 1993, doi:10.1007/3-540-56939-1_89.
LibreCat | DOI
 
[52]
1993 | Conference Paper | LibreCat-ID: 16731
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient Shared Memory Simulations.” Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93, 1993, doi:10.1145/165231.165246.
LibreCat | DOI
 
[51]
1993 | Journal Article | LibreCat-ID: 16729
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” Information and Computation, 1993, pp. 196–217, doi:10.1006/inco.1993.1007.
LibreCat | DOI
 
[50]
1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” Lecture Notes in Computer Science, 1993, doi:10.1007/3-540-56503-5_46.
LibreCat | DOI
 
[49]
1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” Data Structures and Efficient Algorithms, 1992, doi:10.1007/3-540-55488-2_31.
LibreCat | DOI
 
[48]
1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” Lecture Notes in Computer Science, 1992, doi:10.1007/3-540-56731-3_3.
LibreCat | DOI
 
[47]
1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” STACS 92, 1992, doi:10.1007/3-540-55210-3_176.
LibreCat | DOI
 
[46]
1992 | Conference Paper | LibreCat-ID: 16736
Karp, Richard M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992, doi:10.1145/129712.129743.
LibreCat | DOI
 
[45]
1992 | Book Chapter | LibreCat-ID: 16737
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” TEUBNER-TEXTE Zur Informatik, 1992, doi:10.1007/978-3-322-95233-2_7.
LibreCat | DOI
 
[44]
1990 | Book Chapter | LibreCat-ID: 16738
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” Automata, Languages and Programming, 1990, doi:10.1007/bfb0032018.
LibreCat | DOI
 
[43]
1990 | Book Chapter | LibreCat-ID: 16740
Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029630.
LibreCat | DOI
 
[42]
1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029597.
LibreCat | DOI
 
[41]
1990 | Conference Paper | LibreCat-ID: 16741
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a Dictionary in a Complete Network.” Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990, doi:10.1145/100216.100229.
LibreCat | DOI
 
[40]
1990 | Conference Paper | LibreCat-ID: 16742
Gil, J., et al. “Not All Keys Can Be Hashed in Constant Time.” Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990, doi:10.1145/100216.100247.
LibreCat | DOI
 
[39]
1990 | Journal Article | LibreCat-ID: 16824
Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” Informatik Spektrum, vol. 13, no. 4, 1990, pp. 231–32.
LibreCat
 
[38]
1989 | Book Chapter | LibreCat-ID: 16745
Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” STACS 89, 1989, doi:10.1007/bfb0028969.
LibreCat | DOI
 
[37]
1989 | Book Chapter | LibreCat-ID: 16746
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of Networks by Universal Parallel Computers.” STACS 89, 1989, doi:10.1007/bfb0028978.
LibreCat | DOI
 
[36]
1989 | Book Chapter | LibreCat-ID: 16789
Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” STACS 89, 1989, doi:10.1007/bfb0028983.
LibreCat | DOI
 
[35]
1989 | Journal Article | LibreCat-ID: 16743
Just, Bettina, et al. “On Computations with Integer Division.” RAIRO - Theoretical Informatics and Applications, 1989, pp. 101–11, doi:10.1051/ita/1989230101011.
LibreCat | DOI
 
[34]
1989 | Conference Paper | LibreCat-ID: 16744
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989, doi:10.1145/72935.72974.
LibreCat | DOI
 
[33]
1988 | Journal Article | LibreCat-ID: 16764
Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Journal of the ACM (JACM), 1988, pp. 740–47, doi:10.1145/44483.44490.
LibreCat | DOI
 
[32]
1988 | Journal Article | LibreCat-ID: 16765
Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” Theoretical Computer Science, 1988, pp. 57–68, doi:10.1016/0304-3975(88)90018-7.
LibreCat | DOI
 
[31]
1988 | Conference Paper | LibreCat-ID: 16766
Dietzfelbinger, M., et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988, doi:10.1109/sfcs.1988.21968.
LibreCat | DOI
 
[30]
1988 | Book Chapter | LibreCat-ID: 16767
Just, Bettina, et al. “On Computations with Integer Division.” STACS 88, 1988, doi:10.1007/bfb0035829.
LibreCat | DOI
 
[29]
1988 | Journal Article | LibreCat-ID: 16763
Babai, László, et al. “On the Limits of Computations with the Floor Function.” Information and Computation, 1988, pp. 99–107, doi:10.1016/0890-5401(88)90031-4.
LibreCat | DOI
 
[28]
1988 | Book Chapter | LibreCat-ID: 16768
Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.” SWAT 88, 1988, doi:10.1007/3-540-19487-8_24.
LibreCat | DOI
 
[27]
1987 | Journal Article | LibreCat-ID: 16772
Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” SIAM Journal on Computing, 1987, pp. 97–99, doi:10.1137/0216007.
LibreCat | DOI
 
[26]
1987 | Journal Article | LibreCat-ID: 16773
Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” SIAM Journal on Computing, 1987, pp. 100–07, doi:10.1137/0216008.
LibreCat | DOI
 
[25]
1986 | Journal Article | LibreCat-ID: 16771
Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers.” SIAM Journal on Computing, 1986, pp. 106–19, doi:10.1137/0215008.
LibreCat | DOI
 
[24]
1986 | Book Chapter | LibreCat-ID: 16776
Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” STACS 86, 1986, doi:10.1007/3-540-16078-7_89.
LibreCat | DOI
 
[23]
1986 | Book Chapter | LibreCat-ID: 16774
Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” Automata, Languages and Programming, 1986, doi:10.1007/3-540-16761-7_54.
LibreCat | DOI
 
[22]
1986 | Book Chapter | LibreCat-ID: 16775
Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” STACS 86, 1986, doi:10.1007/3-540-16078-7_72.
LibreCat | DOI
 
[21]
1985 | Conference Paper | LibreCat-ID: 16783
Fich, F. E., et al. “One, Two, Three . . . Infinity: Lower Bounds for Parallel Computation.” Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985, doi:10.1145/22145.22151.
LibreCat | DOI
 
[20]
1985 | Conference Paper | LibreCat-ID: 16788
Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear Search Algorithms.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.38.
LibreCat | DOI
 
[19]
1985 | Conference Paper | LibreCat-ID: 16784
Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985, doi:10.1145/22145.22191.
LibreCat | DOI
 
[18]
1985 | Journal Article | LibreCat-ID: 16823
Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models.” Information and Control, vol. 67, no. 1–3, 1985, pp. 195–211, doi:10.1016/S0019-9958(85)80035-8.
LibreCat | DOI
 
[17]
1985 | Journal Article | LibreCat-ID: 16780
Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” Journal of the ACM (JACM), 1985, pp. 929–37, doi:10.1145/4221.4250.
LibreCat | DOI
 
[16]
1985 | Journal Article | LibreCat-ID: 16779
Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.” Information Processing Letters, 1985, pp. 101–05, doi:10.1016/0020-0190(85)90042-0.
LibreCat | DOI
 
[15]
1985 | Journal Article | LibreCat-ID: 16781
Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” Theoretical Computer Science, 1985, pp. 325–30, doi:10.1016/0304-3975(85)90079-9.
LibreCat | DOI
 
[14]
1985 | Conference Paper | LibreCat-ID: 16782
Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.58.
LibreCat | DOI
 
[13]
1984 | Journal Article | LibreCat-ID: 16785
Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.” Journal of the ACM (JACM), 1984, pp. 668–76, doi:10.1145/828.322450.
LibreCat | DOI
 
[12]
1984 | Conference Paper | LibreCat-ID: 16786
Meyer auf der Heide, Friedhelm, and R. Reischuk. “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication.” 25th Annual Symposium OnFoundations of Computer Science, 1984., 1984, doi:10.1109/sfcs.1984.715901.
LibreCat | DOI
 
[11]
1984 | Book Chapter | LibreCat-ID: 16787
Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” STACS 84, 1984, doi:10.1007/3-540-12920-0_20.
LibreCat | DOI
 
[10]
1983 | Journal Article | LibreCat-ID: 16808
Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” Information Processing Letters, 1983, pp. 1–2, doi:10.1016/0020-0190(83)90001-7.
LibreCat | DOI
 
[9]
1983 | Book Chapter | LibreCat-ID: 16810
Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” Lecture Notes in Computer Science, 1983, doi:10.1007/bfb0036483.
LibreCat | DOI
 
[8]
1983 | Conference Paper | LibreCat-ID: 16809
Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983, doi:10.1145/800061.808734.
LibreCat | DOI
 
[7]
1983 | Journal Article | LibreCat-ID: 16806
Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” Acta Informatica, 1983, pp. 269–96, doi:10.1007/bf00265559.
LibreCat | DOI
 
[6]
1983 | Journal Article | LibreCat-ID: 16807
Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.” Acta Informatica, 1983, pp. 385–95, doi:10.1007/bf00290735.
LibreCat | DOI
 
[5]
1981 | Book Chapter | LibreCat-ID: 16813
Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” Fundamentals of Computation Theory, 1981, doi:10.1007/3-540-10854-8_29.
LibreCat | DOI
 
[4]
1981 | Journal Article | LibreCat-ID: 16820
Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Theoretical Computer Science, 1981, pp. 315–22, doi:10.1016/s0304-3975(81)80004-7.
LibreCat | DOI
 
[3]
1981 | Book Chapter | LibreCat-ID: 16814
Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” Lecture Notes in Computer Science, 1981, doi:10.1007/3-540-10856-4_111.
LibreCat | DOI
 
[2]
1980 | Book Chapter | LibreCat-ID: 16815
Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.” GI - 10. Jahrestagung, 1980, doi:10.1007/978-3-642-67838-7_34.
LibreCat | DOI
 
[1]
1979 | Journal Article | LibreCat-ID: 16812
Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Automata, Languages and Programming. ICALP 1979, 1979, pp. 411–21, doi:10.1007/3-540-09510-1_32 .
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed