232 Publications

Mark all

[232]
2020 | Conference Paper | LibreCat-ID: 13868
Pukrop, S., Mäcker, A., & Meyer auf der Heide, F. (2020). Approximating Weighted Completion Time for Order Scheduling with Setup Times. In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM).
LibreCat
 
[231]
2020 | Preprint | LibreCat-ID: 16968
Braun, M., Castenow, J., & Meyer auf der Heide, F. (2020). Local Gathering of Mobile Robots in Three Dimensions. ArXiv:2005.07495.
LibreCat
 
[230]
2020 | Journal Article | LibreCat-ID: 16299
Castenow, J., Fischer, M., Harbig, J., Jung, D., & Meyer auf der Heide, F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science, 815, 289–309. https://doi.org/10.1016/j.tcs.2020.02.018
LibreCat | DOI
 
[229]
2019 | Conference Paper | LibreCat-ID: 12870
Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) (pp. 120–137). Springer. https://doi.org/10.1007/978-3-030-39479-0_9
LibreCat | DOI | arXiv
 
[228]
2019 | Journal Article | LibreCat-ID: 13873
Feldkord, B., & Meyer auf der Heide, F. (2019). The Mobile Server Problem. ACM Transactions on Parallel Computing (TOPC), 6(3). https://doi.org/10.1145/3364204
LibreCat | Files available | DOI
 
[227]
2019 | Preprint | LibreCat-ID: 16341
Brandt, S., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2019). Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels. ArXiv:1904.08225.
LibreCat | Download (ext.) | arXiv
 
[226]
2019 | Journal Article | LibreCat-ID: 13937
Meyer auf der Heide, F. (2019). Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln. Mathematische Semesterberichte, 66(2), 259–260. https://doi.org/10.1007/s00591-019-00249-0
LibreCat | DOI
 
[225]
2019 | Preprint | LibreCat-ID: 16462
Feldkord, B., & Meyer auf der Heide, F. (2019). The Mobile Server Problem. ArXiv:1904.05220.
LibreCat | arXiv
 
[224]
2019 | Book Chapter | LibreCat-ID: 13939
Kling, P., & Meyer auf der Heide, F. (2019). Continuous Protocols for Swarm Robotics. In Distributed Computing by Mobile Entities, Current Research in Moving and Computing (Vol. 11340, pp. 317–334). Springer. https://doi.org/10.1007/978-3-030-11072-7\_13
LibreCat | DOI
 
[223]
2019 | Journal Article | LibreCat-ID: 13946
Abu-Khzam, F. N., Li, S., Markarian, C., & Meyer auf der Heide, F. (2019). Efficient parallel algorithms for parameterized problems. Theoretical Computer Science, 786, 2–12. https://doi.org/10.1016/j.tcs.2018.11.006
LibreCat | DOI
 
[222]
2019 | Journal Article | LibreCat-ID: 13770
Karl, H., Kundisch, D., Meyer auf der Heide, F., & Wehrheim, H. (n.d.). A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering. https://doi.org/10.1007/s12599-019-00627-x
LibreCat | Files available | DOI
 
[221]
2019 | Journal Article | LibreCat-ID: 16337
Brandt, S., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2019). Visibility‐Aware Progressive Farthest Point Sampling on the GPU. Computer Graphics Forum, 38(7), 413–424. https://doi.org/10.1111/cgf.13848
LibreCat | DOI | Download (ext.)
 
[220]
2019 | Conference Paper | LibreCat-ID: 13942
Markarian, C., & Meyer auf der Heide, F. (2019). Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems (pp. 315–321). SciTePress. https://doi.org/10.5220/0007369503150321
LibreCat | DOI
 
[219]
2018 | Conference Paper | LibreCat-ID: 7570
Meyer auf der Heide, F., & Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. Vienna: ACM Press. https://doi.org/10.1145/3210377.3210662
LibreCat | Files available | DOI
 
[218]
2018 | Book Chapter | LibreCat-ID: 16392
Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2018). A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Cham. https://doi.org/10.1007/978-3-319-98355-4_18
LibreCat | DOI
 
[217]
2018 | Journal Article | LibreCat-ID: 2848
Li, S., Markarian, C., & Meyer auf der Heide, F. (2018). Towards Flexible Demands in Online Leasing Problems. . Algorithmica, 80(5), 1556–1574. https://doi.org/10.1007/s00453-018-0420-y
LibreCat | Files available | DOI
 
[216]
2018 | Conference Paper | LibreCat-ID: 2850
Hamann, H., Markarian, C., Meyer auf der Heide, F., & Wahby, M. (2018). Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In Ninth International Conference on Fun with Algorithms (FUN). https://doi.org/10.4230/LIPIcs.FUN.2018.22
LibreCat | Files available | DOI
 
[215]
2018 | Conference Paper | LibreCat-ID: 4375
Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4
LibreCat | Files available | DOI
 
[214]
2018 | Journal Article | LibreCat-ID: 2849
Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory of Computing Systems. https://doi.org/10.1007/s00224-017-9836-z
LibreCat | Files available | DOI
 
[213]
2018 | Journal Article | LibreCat-ID: 3551
König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2018). Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization, 36(4), 1356–1379. https://doi.org/10.1007/s10878-018-0325-3
LibreCat | Files available | DOI
 
[212]
2018 | Conference Paper | LibreCat-ID: 2485
Feldkord, B., & Meyer auf der Heide, F. (2018). Online Facility Location with Mobile Facilities. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 373–381). Wien: ACM. https://doi.org/10.1145/3210377.3210389
LibreCat | Files available | DOI
 
[211]
2017 | Book Chapter | LibreCat-ID: 16461
Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr, S., … Sundermeier, J. (2017). Monitoring of Domain-Related Problems in Distributed Data Streams. In Structural Information and Communication Complexity. Cham. https://doi.org/10.1007/978-3-319-72050-0_13
LibreCat | DOI
 
[210]
2017 | Journal Article | LibreCat-ID: 706
Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017). Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial Optimization, 36(4), 1168–1194. https://doi.org/10.1007/s10878-017-0198-x
LibreCat | Files available | DOI
 
[209]
2017 | Conference Paper | LibreCat-ID: 16347
Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. In A. Fernández Anta, T. Jurdzinski, M. A. Mosteiro, & Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} (Vol. 10718, pp. 168–181). Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-72751-6_13
LibreCat | DOI
 
[208]
2017 | Conference Paper | LibreCat-ID: 55
Feldkord, B., & Meyer auf der Heide, F. (2017). The Mobile Server Problem. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 313–319). https://doi.org/10.1145/3087556.3087575
LibreCat | Files available | DOI
 
[207]
2017 | Conference Paper | LibreCat-ID: 79
Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017). Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) (Vol. 10787, pp. 207–222). Springer. https://doi.org/10.1007/978-3-319-89441-6
LibreCat | Files available | DOI
 
[206]
2017 | Conference Paper | LibreCat-ID: 16348
Biermeier, F., Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2017). A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) (pp. 285–300). Springer. https://doi.org/10.1007/978-3-319-89441-6_21
LibreCat | DOI
 
[205]
2017 | Journal Article | LibreCat-ID: 63
Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., … Suess, T. (2017). Scheduling Shared Continuous Resources on Many-Cores. Journal of Scheduling. https://doi.org/10.1007/s10951-017-0518-0
LibreCat | Files available | DOI
 
[204]
2017 | Conference Paper | LibreCat-ID: 70
Feldkord, B., Markarian, C., & Meyer auf der Heide, F. (2017). Price Fluctuations in Online Leasing. In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 17–31). https://doi.org/10.1007/978-3-319-71147-8_2
LibreCat | Files available | DOI
 
[203]
2017 | Conference Paper | LibreCat-ID: 82
Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2017). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW) (pp. 139–150). https://doi.org/10.1007/978-3-319-59605-1_13
LibreCat | Files available | DOI
 
[202]
2017 | Conference Paper | LibreCat-ID: 16349
Podlipyan, P., Li, S., Markarian, C., & Meyer auf der Heide, F. (2017). A Continuous Strategy for Collisionless Gathering. In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) (pp. 182–197). https://doi.org/10.1007/978-3-319-72751-6_14
LibreCat | DOI
 
[201]
2016 | Conference Paper | LibreCat-ID: 143
Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON) (pp. 92–102). https://doi.org/10.1007/978-3-319-42634-1_8
LibreCat | Files available | DOI
 
[200]
2016 | Conference Paper | LibreCat-ID: 16358
Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2016). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. In Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer. https://doi.org/10.1007/978-3-319-53058-1_5
LibreCat | DOI
 
[199]
2016 | Conference Paper | LibreCat-ID: 16360
Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS) (pp. 689–699). IEEE. https://doi.org/10.1109/IPDPS.2016.51
LibreCat | DOI
 
[198]
2016 | Preprint | LibreCat-ID: 16396
Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. ArXiv:1609.01184.
LibreCat | arXiv
 
[197]
2016 | Conference (Editor) | LibreCat-ID: 163
Dressler, F., & Meyer auf der Heide, F. (Eds.). (2016). Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). Presented at the MobiHoc, Paderborn, Germany: ACM. https://doi.org/10.1145/2942358
LibreCat | DOI
 
[196]
2016 | Conference Paper | LibreCat-ID: 16359
Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 301–312). ACM. https://doi.org/10.1145/2935764.2935789
LibreCat | DOI
 
[195]
2016 | Preprint | LibreCat-ID: 16450
Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. ArXiv:1602.03303.
LibreCat | arXiv
 
[194]
2016 | Conference Paper | LibreCat-ID: 207
Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 578--592). https://doi.org/10.1007/978-3-319-48749-6_42
LibreCat | Files available | DOI
 
[193]
2016 | Special Issue | LibreCat-ID: 187
Meyer auf der Heide, F. (Ed.). (2016). Introduction to the Special Issue on SPAA 2014. Transactions on Parallel Computing (TOPC). https://doi.org/10.1145/2936716
LibreCat | Files available | DOI
 
[192]
2016 | Conference Paper | LibreCat-ID: 157
König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2016). Scheduling with Interjob Communication on Parallel Processors. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 563--577). https://doi.org/10.1007/978-3-319-48749-6_41
LibreCat | Files available | DOI
 
[191]
2016 | Journal Article | LibreCat-ID: 139
Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., & Pietrzyk, P. (2016). Towards the price of leasing online. Journal of Combinatorial Optimization, (4), 1197--1216. https://doi.org/10.1007/s10878-015-9915-5
LibreCat | Files available | DOI
 
[190]
2016 | Conference Paper | LibreCat-ID: 16351
Fischer, M., Jähn, C., Meyer auf der Heide, F., & Petring, R. (2016). Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In L. Kliemann & P. Sanders (Eds.), Algorithm Engineering (Vol. 9220, pp. 226–244). Springer. https://doi.org/10.1007/978-3-319-49487-6_7
LibreCat | DOI
 
[189]
2016 | Conference Paper | LibreCat-ID: 177
Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem. In Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 477–488). https://doi.org/10.1007/978-3-319-48749-6_35
LibreCat | Files available | DOI
 
[188]
2016 | Conference Paper | LibreCat-ID: 16364
Macker, A., Malatyali, M., & Meyer auf der Heide, F. (2016). On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps.2016.91
LibreCat | DOI
 
[187]
2015 | Journal Article | LibreCat-ID: 16391
Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2015). Linear and Competitive Strategies for Continuous Robot Formation Problems. ACM Transactions on Parallel Computing, 1–18. https://doi.org/10.1145/2742341
LibreCat | DOI
 
[186]
2015 | Preprint | LibreCat-ID: 16397
Abshoff, S., Andreas Cord-Landwehr, A., Jung, D., & Meyer auf der Heide, F. (2015). Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case. ArXiv: 1501.04877.
LibreCat | arXiv
 
[185]
2015 | Conference Paper | LibreCat-ID: 240
Li, S., Mäcker, A., Markarian, C., Meyer auf der Heide, F., & Riechers, S. (2015). Towards Flexible Demands in Online Leasing Problems. In Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON) (pp. 277--288). https://doi.org/10.1007/978-3-319-21398-9_22
LibreCat | Files available | DOI
 
[184]
2015 | Preprint | LibreCat-ID: 16449
Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2015). Gathering a Closed Chain of Robots on a Grid. ArXiv:1510.05454.
LibreCat | arXiv
 
[183]
2015 | Preprint | LibreCat-ID: 16452
Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2015). Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks. ArXiv:1510.01866.
LibreCat | arXiv
 
[182]
2015 | Conference Paper | LibreCat-ID: 266
Markarian, C., & Meyer auf der Heide, F. (2015). Online Resource Leasing. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC) (pp. 343–344). https://doi.org/10.1145/2767386.2767454
LibreCat | Files available | DOI
 
[181]
2015 | Conference Paper | LibreCat-ID: 274
Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2015). Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack, & U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings (pp. 542--553). https://doi.org/10.1007/978-3-319-21840-3_45
LibreCat | Files available | DOI
 
[180]
2014 | Conference Paper | LibreCat-ID: 459
Kniesburges, S., Markarian, C., Meyer auf der Heide, F., & Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 1–13). https://doi.org/10.1007/978-3-319-09620-9_1
LibreCat | Files available | DOI
 
[179]
2014 | Conference Paper | LibreCat-ID: 380
Cord-Landwehr, A., Mäcker, A., & Meyer auf der Heide, F. (2014). Quality of Service in Network Creation Games. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 423–428). https://doi.org/10.1007/978-3-319-13129-0_34
LibreCat | Files available | DOI
 
[178]
2014 | Book Chapter | LibreCat-ID: 16394
Lukovszki, T., & Meyer auf der Heide, F. (2014). Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots. In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-319-14472-6_17
LibreCat | DOI
 
[177]
2014 | Book (Editor) | LibreCat-ID: 16870
Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.). (2014). Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013 (Vol. 8243). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-45346-5
LibreCat | DOI
 
[176]
2014 | Conference Paper | LibreCat-ID: 379
Abshoff, S., Markarian, C., & Meyer auf der Heide, F. (2014). Randomized Online Algorithms for Set Cover Leasing Problems. In Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 25–34). https://doi.org/10.1007/978-3-319-12691-3_3
LibreCat | Files available | DOI
 
[175]
2014 | Book Chapter | LibreCat-ID: 16395
Abshoff, S., & Meyer auf der Heide, F. (2014). Continuous Aggregation in Dynamic Ad-Hoc Networks. In Structural Information and Communication Complexity. Cham. https://doi.org/10.1007/978-3-319-09620-9_16
LibreCat | DOI
 
[174]
2014 | Preprint | LibreCat-ID: 16460
Mäcker, A., Malatyali, M., & Meyer auf der Heide, F. (2014). Online Top-k-Position Monitoring of Distributed Data Streams. ArXiv:1410.7912.
LibreCat | arXiv
 
[173]
2014 | Conference Paper | LibreCat-ID: 368
Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., & Süss, T. (2014). Scheduling Shared Continuous Resources on Many-Cores. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 128–137). https://doi.org/10.1145/2612669.2612698
LibreCat | Files available | DOI
 
[172]
2013 | Conference Paper | LibreCat-ID: 477
Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., & Meyer auf der Heide, F. (2013). Token Dissemination in Geometric Dynamic Networks. In 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 (pp. 22–34). https://doi.org/10.1007/978-3-642-45346-5_3
LibreCat | Files available | DOI
 
[171]
2013 | Conference Paper | LibreCat-ID: 505
Happe, M., Kling, P., Plessl, C., Platzner, M., & Meyer auf der Heide, F. (2013). On-The-Fly Computing: A Novel Paradigm for Individualized IT Services. In Proceedings of the 9th IEEE Workshop on Software Technology for Future embedded and Ubiquitous Systems (SEUS). IEEE. https://doi.org/10.1109/ISORC.2013.6913232
LibreCat | Files available | DOI
 
[170]
2013 | Preprint | LibreCat-ID: 524
Meyer auf der Heide, F., & Swirkot, K. (2013). Hierarchies in Local Distributed Decision. arXiv.
LibreCat | Files available | arXiv
 
[169]
2013 | Journal Article | LibreCat-ID: 16393
Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2013). Spherical Visibility Sampling. Computer Graphics Forum, 49–58. https://doi.org/10.1111/cgf.12150
LibreCat | DOI
 
[168]
2013 | Book Chapter | LibreCat-ID: 16406
Jähn, C., Eikel, B., Fischer, M., Petring, R., & Meyer auf der Heide, F. (2013). Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties. In Advances in Visual Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_12
LibreCat | DOI
 
[167]
2013 | Conference Paper | LibreCat-ID: 563
Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2013). A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks. In Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS) (pp. 217–227). https://doi.org/10.1007/978-3-642-45346-5_16
LibreCat | Files available | DOI
 
[166]
2013 | Book Chapter | LibreCat-ID: 16407
Petring, R., Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2013). Real-Time 3D Rendering of Heterogeneous Scenes. In Advances in Visual Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_44
LibreCat | DOI
 
[165]
2013 | Conference Paper | LibreCat-ID: 507
Abshoff, S., Benter, M., Malatyali, M., & Meyer auf der Heide, F. (2013). On Two-Party Communication Through Dynamic Networks. In Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS) (pp. 11–22). https://doi.org/10.1007/978-3-319-03850-6_2
LibreCat | Files available | DOI
 
[164]
2013 | Conference (Editor) | LibreCat-ID: 558
Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.). (2013). Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer. https://doi.org/10.1007/978-3-642-45346-5
LibreCat | Files available | DOI
 
[163]
2012 | Conference Paper | LibreCat-ID: 636
Meyer auf der Heide, F., Pietrzyk, P., & Kling, P. (2012). An Algorithm for Facility Leasing. In Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO) (pp. 61–72). https://doi.org/10.1007/978-3-642-31104-8_6
LibreCat | Files available | DOI
 
[162]
2012 | Book Chapter | LibreCat-ID: 16448
Kempkes, B., & Meyer auf der Heide, F. (2012). Local, Self-organizing Strategies for Robotic Formation Problems. In Algorithms for Sensor Systems. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28209-6_2
LibreCat | DOI
 
[161]
2012 | Journal Article | LibreCat-ID: 579
Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., & Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms, (3), 30. https://doi.org/10.1145/2229163.2229174
LibreCat | Files available | DOI
 
[160]
2012 | Conference Paper | LibreCat-ID: 619
Brandes, P., & Meyer auf der Heide, F. (2012). Distributed Computing in Fault-Prone Dynamic Networks. In Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS) (pp. 9–14). https://doi.org/10.1145/2414815.2414818
LibreCat | Files available | DOI
 
[159]
2012 | Book Chapter | LibreCat-ID: 16445
Kempkes, B., & Meyer auf der Heide, F. (2012). Continuous Local Strategies for Robotic Formation Problems. In Experimental Algorithms. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30850-5_2
LibreCat | DOI
 
[158]
2012 | Book Chapter | LibreCat-ID: 16408
Süß, T., Koch, C., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2012). Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. In Advances in Visual Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33179-4_48
LibreCat | DOI
 
[157]
2012 | Conference Paper | LibreCat-ID: 16446
Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2012). Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. In Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA ’12. https://doi.org/10.1145/2312005.2312009
LibreCat | DOI
 
[156]
2011 | Book Chapter | LibreCat-ID: 16409
Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_52
LibreCat | DOI
 
[155]
2011 | Conference Paper | LibreCat-ID: 16428
Rajaraman, R., & Meyer auf der Heide, F. (2011). Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493
LibreCat | DOI
 
[154]
2011 | Conference Paper | LibreCat-ID: 16454
Kling, P., & Meyer auf der Heide, F. (2011). Convergence of local communication chain strategies via linear transformations. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493.1989517
LibreCat | DOI
 
[153]
2011 | Book Chapter | LibreCat-ID: 16459
Brandes, P., Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In Structural Information and Communication Complexity. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22212-2_13
LibreCat | DOI
 
[152]
2011 | Conference (Editor) | LibreCat-ID: 667
Meyer auf der Heide, F., & Rajaraman, R. (Eds.). (2011). 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/1989493
LibreCat | DOI
 
[151]
2011 | Book Chapter | LibreCat-ID: 16412
Gehweiler, J., & Meyer auf der Heide, F. (2011). Bin Packing - How Do I Get My Stuff into the Boxes. In Algorithms Unplugged (pp. 367–374). Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_38
LibreCat | DOI
 
[150]
2011 | Journal Article | LibreCat-ID: 16455
Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Building Simple Formations in Large Societies of Tiny Mobile Robots. Procedia Computer Science, 153–155. https://doi.org/10.1016/j.procs.2011.09.049
LibreCat | DOI
 
[149]
2011 | Journal Article | LibreCat-ID: 17009
Hsu, D. F., Magga, B. M., Ho, H. C. T., Hromkovic, J., Lau, F. C. M., & Meyer auf der Heide, F. (2011). EDITORIAL. Journal of Interconnection Networks, vii–viii. https://doi.org/10.1142/s0219265911002885
LibreCat | DOI
 
[148]
2011 | Book Chapter | LibreCat-ID: 16456
Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Energy-Awareness in Self-organising Robotic Exploration Teams. In Organic Computing — A Paradigm Shift for Complex Systems. Basel. https://doi.org/10.1007/978-3-0348-0130-0_35
LibreCat | DOI
 
[147]
2011 | Conference Paper | LibreCat-ID: 664
Gehweiler, J., Kling, P., & Meyer auf der Heide, F. (2011). An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 31--40). https://doi.org/10.1007/978-3-642-31500-8_4
LibreCat | Files available | DOI
 
[146]
2011 | Book Chapter | LibreCat-ID: 16410
Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18381-2_15
LibreCat | DOI
 
[145]
2011 | Conference Paper | LibreCat-ID: 16453
Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., & Wattenhofer, R. (2011). A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493.1989515
LibreCat | DOI
 
[144]
2010 | Book Chapter | LibreCat-ID: 16365
Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2010). A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In Structural Information and Communication Complexity (pp. 168–182). Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_14
LibreCat | DOI
 
[143]
2010 | Book (Editor) | LibreCat-ID: 16404
Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2
LibreCat | DOI
 
[142]
2010 | Journal Article | LibreCat-ID: 16447
Degener, B., Fekete, S. P., Kempkes, B., & Meyer auf der Heide, F. (2010). A survey on relay placement with runtime and approximation guarantees. Computer Science Review, 57–68. https://doi.org/10.1016/j.cosrev.2010.09.005
LibreCat | DOI
 
[141]
2010 | Book Chapter | LibreCat-ID: 16474
Bansal, V., Meyer auf der Heide, F., & Sohler, C. (2010). Labeling Smart Dust. In Algorithms – ESA 2004. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_9
LibreCat | DOI
 
[140]
2010 | Journal Article | LibreCat-ID: 1903
Meyer auf der Heide, F., & Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum, (5), 468--474. https://doi.org/10.1007/s00287-010-0470-2
LibreCat | DOI
 
[139]
2010 | Conference Paper | LibreCat-ID: 16401
Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2010). A local O(n2) gathering algorithm. In Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. https://doi.org/10.1145/1810479.1810523
LibreCat | DOI
 
[138]
2010 | Conference Paper | LibreCat-ID: 16414
Meyer auf der Heide, F., & Phillips, C. A. (2010). Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. https://doi.org/10.1145/1810479
LibreCat | DOI
 
[137]
2010 | Book (Editor) | LibreCat-ID: 16403
Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1
LibreCat | DOI
 
[136]
2009 | Conference Paper | LibreCat-ID: 16430
Mehler, J., & Meyer auf der Heide, F. (2009). Power-aware online file allocation in mobile ad hoc networks. In Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09. https://doi.org/10.1145/1583991.1584072
LibreCat | DOI
 
[135]
2009 | Conference (Editor) | LibreCat-ID: 16431
Meyer auf der Heide, F., & Bender, M. A. (Eds.). (2009). Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09. https://doi.org/10.1145/1583991
LibreCat | DOI
 
[134]
2009 | Journal Article | LibreCat-ID: 16398
Bienkowski, M., Byrka, J., Korzeniowski, M., & Meyer auf der Heide, F. (2009). Optimal algorithms for page migration in dynamic networks. Journal of Discrete Algorithms, 545–569. https://doi.org/10.1016/j.jda.2008.07.006
LibreCat | DOI
 
[133]
2008 | Conference (Editor) | LibreCat-ID: 16466
Meyer auf der Heide, F., & Shavit, N. (Eds.). (2008). Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA ’08. ACM. https://doi.org/10.1145/1378533
LibreCat | DOI
 
[132]
2008 | Journal Article | LibreCat-ID: 16429
Kutyłowski, J., & Meyer auf der Heide, F. (2008). Optimal strategies for maintaining a chain of relays between an explorer and a base camp. Theoretical Computer Science, 3391–3405. https://doi.org/10.1016/j.tcs.2008.04.010
LibreCat | DOI
 
[131]
2008 | Book Chapter | LibreCat-ID: 16463
Meyer auf der Heide, F., & Schneider, B. (2008). Local Strategies for Connecting Stations by Small Robotic Networks. In Biologically-Inspired Collaborative Computing. Boston, MA. https://doi.org/10.1007/978-0-387-09655-1_9
LibreCat | DOI
 
[130]
2008 | Book Chapter | LibreCat-ID: 16464
Gehweiler, J., & Meyer auf der Heide, F. (2008). Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“. In Taschenbuch der Algorithmen. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76394-9_40
LibreCat | DOI
 
[129]
2008 | Preprint | LibreCat-ID: 16465
Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., & Ziegler, M. (2008). Planar Visibility Counting. ArXiv:0810.0052.
LibreCat | arXiv
 
[128]
2007 | Conference Paper | LibreCat-ID: 16467
Dynia, M., Kutylowski, J., Meyer auf der Heide, F., & Schrieb, J. (2007). Local strategies for maintaining a chain of relay stations between an explorer and a base station. In Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’07. https://doi.org/10.1145/1248377.1248420
LibreCat | DOI
 
[127]
2007 | Conference Paper | LibreCat-ID: 7970
Arens, S., Buss, A., Deck, H., Dynia, M., Fischer, M., Hagedorn, H., … Wachsmuth, H. (2007). Smart Teams: Simulating Large Robotic Swarms in Vast Environments. In Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment (pp. 215–222). Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn.
LibreCat | Download (ext.)
 
[126]
2007 | Conference Paper | LibreCat-ID: 2214
Brinkmann, A., Effert, S., Meyer auf der Heide, F., & Scheideler, C. (2007). Dynamic and redundant data placement. In IEEE International Conference on Distributed Computing Systems (ICDCS).
LibreCat | Files available
 
[125]
2006 | Book Chapter | LibreCat-ID: 16473
Dynia, M., Kutyłowski, J., Meyer auf der Heide, F., & Schindelhauer, C. (2006). Smart Robot Teams Exploring Sparse Trees. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/11821069_29
LibreCat | DOI
 
[124]
2006 | Book Chapter | LibreCat-ID: 16470
Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2006). A Web Computing Environment for Parallel Algorithms in Java. In Parallel Processing and Applied Mathematics. Berlin, Heidelberg. https://doi.org/10.1007/11752578_96
LibreCat | DOI
 
[123]
2006 | Book Chapter | LibreCat-ID: 16471
Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2006). Load Balancing Strategies in a Web Computing Environment. In Parallel Processing and Applied Mathematics. Berlin, Heidelberg. https://doi.org/10.1007/11752578_101
LibreCat | DOI
 
[122]
2006 | Book Chapter | LibreCat-ID: 16476
Dynia, M., Kutyłowski, J., Lorek, P., & Meyer auf der Heide, F. (2006). Maintaining Communication Between an Explorer and a Base Station. In IFIP International Federation for Information Processing. Boston, MA. https://doi.org/10.1007/978-0-387-34733-2_14
LibreCat | DOI
 
[121]
2006 | Book Chapter | LibreCat-ID: 16472
Demaine, E. D., Meyer auf der Heide, F., Pagh, R., & Pǎtraşcu, M. (2006). De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg. https://doi.org/10.1007/11682462_34
LibreCat | DOI
 
[120]
2005 | Conference Paper | LibreCat-ID: 17112
Bienkowski, M., Damerow, V., Meyer auf der Heide, F., & Sohler, C. (2005). Average case complexity of Voronoi diagrams of n sites from the unit cube. In Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005. Technische Universiteit Eindhoven.
LibreCat | Files available
 
[119]
2005 | Book Chapter | LibreCat-ID: 16468
Bienkowski, M., Korzeniowski, M., & Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In Peer-to-Peer Systems IV. Berlin, Heidelberg. https://doi.org/10.1007/11558989_20
LibreCat | DOI
 
[118]
2005 | Conference (Editor) | LibreCat-ID: 17113
Leonardi, S., Meyer auf der Heide, F., & Wagner, D. (Eds.). (2005). Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks (Vol. 05361). Presented at the Dagstuhl Seminar Proceedings, Schloss Dagstuhl, Germany.
LibreCat | Files available
 
[117]
2005 | Journal Article | LibreCat-ID: 16399
Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., & Meyer auf der Heide, F. (2005). The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments. Presence: Teleoperators and Virtual Environments, 617–637. https://doi.org/10.1162/1054746043280619
LibreCat | DOI
 
[116]
2005 | Book Chapter | LibreCat-ID: 16469
Bienkowski, M., & Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg. https://doi.org/10.1007/11549345_1
LibreCat | DOI
 
[115]
2004 | Conference Paper | LibreCat-ID: 16480
Leonardi, S., Marchetti-Spaccamela, A., & Meyer auf der Heide, F. (2004). Scheduling against an adversarial network. In SPAA ’04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures. https://doi.org/10.1145/1007912.1007936
LibreCat | DOI
 
[114]
2004 | Conference Paper | LibreCat-ID: 16475
Bienkowski, M., Korzeniowski, M., & Meyer auf der Heide, F. (2004). Fighting against two adversaries. In Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’04. https://doi.org/10.1145/1007912.1007923
LibreCat | DOI
 
[113]
2004 | Conference Paper | LibreCat-ID: 17346
Brinkmann, A., Heidebuer, M., Meyer auf der Heide, F., Rückert, U., Salzwedel, K., & Vodisek, M. (2004). V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In B. Kobler & P. C. Hariharan (Eds.), 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA (pp. 153--157). IEEE.
LibreCat
 
[112]
2004 | Journal Article | LibreCat-ID: 16477
Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., & Grünewald, M. (2004). Congestion, Dilation, and Energy in Radio Networks. Theory of Computing Systems, 343–370. https://doi.org/10.1007/s00224-004-1124-z
LibreCat | DOI
 
[111]
2003 | Journal Article | LibreCat-ID: 16481
Meyer auf der Heide, F. (2003). Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). It - Information Technology. https://doi.org/10.1524/itit.45.2.108.19606
LibreCat | DOI
 
[110]
2003 | Journal Article | LibreCat-ID: 16482
Juurlink, B., Kolman, P., Meyer auf der Heide, F., & Rieping, I. (2003). Optimal broadcast on parallel locality models. Journal of Discrete Algorithms, 151–166. https://doi.org/10.1016/s1570-8667(03)00023-6
LibreCat | DOI
 
[109]
2003 | Conference Paper | LibreCat-ID: 2128
Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer. https://doi.org/10.1007/978-3-540-39658-1_17
LibreCat | DOI
 
[108]
2003 | Conference (Editor) | LibreCat-ID: 16484
Rosenberg, A. L., & Meyer auf der Heide, F. (Eds.). (2003). Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03. https://doi.org/10.1145/777412
LibreCat | DOI
 
[107]
2003 | Conference Paper | LibreCat-ID: 16720
Bonorden, O., Bruls, N., Kastens, U., Le, D. K., Meyer auf der Heide, F., Niemann, J.-C., … Thies, M. (2003). A holistic methodology for network processor design. In 28th Annual IEEE International Conference on Local Computer Networks. https://doi.org/10.1109/LCN.2003.1243185
LibreCat | DOI
 
[106]
2002 | Book Chapter | LibreCat-ID: 16723
Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., & Spirakis, P. (2002). Mobile Computing, Mobile Networks. In Euro-Par 2002 Parallel Processing (Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_133
LibreCat | DOI
 
[105]
2002 | Conference Paper | LibreCat-ID: 16490
Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., & Meyer auf der Heide, F. (2002). The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. In Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02. https://doi.org/10.1145/585740.585764
LibreCat | DOI
 
[104]
2002 | Journal Article | LibreCat-ID: 16489
Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann, M. (2002). Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory of Computing Systems, 217–245. https://doi.org/10.1007/s00224-001-1045-z
LibreCat | DOI
 
[103]
2002 | Conference Paper | LibreCat-ID: 16491
Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., & Grünewald, M. (2002). Energy, congestion and dilation in radio networks. In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’02. https://doi.org/10.1145/564870.564910
LibreCat | DOI
 
[102]
2001 | Conference Paper | LibreCat-ID: 16492
Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., & Straßer, W. (2001). The randomized z-buffer algorithm. In Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01. https://doi.org/10.1145/383259.383299
LibreCat | DOI
 
[101]
2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide, F. (2001). Data Management in Networks. In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_2
LibreCat | DOI
 
[100]
2001 | Book (Editor) | LibreCat-ID: 16722
Meyer auf der Heide, F. (Ed.). (2001). Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer . https://doi.org/10.1007/3-540-44676-1
LibreCat | DOI
 
[99]
2001 | Journal Article | LibreCat-ID: 2139
Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138. https://doi.org/10.1007/s004930170007
LibreCat | DOI
 
[98]
2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide, F., & Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In Computational Science - ICCS 2001. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_68
LibreCat | DOI
 
[97]
2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide, F., Kutyłowski, M., & Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-x_59
LibreCat | DOI
 
[96]
2000 | Journal Article | LibreCat-ID: 17010
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (2000). Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing, 1703–1739. https://doi.org/10.1137/s009753979529564x
LibreCat | DOI
 
[95]
2000 | Conference Paper | LibreCat-ID: 16495
Meyer auf der Heide, F., Räcke, H., & Westermann, M. (2000). Data management in hierarchical bus networks. In Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’00. https://doi.org/10.1145/341800.341814
LibreCat | DOI
 
[94]
2000 | Conference Paper | LibreCat-ID: 16496
Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (2000). Caching in networks (extended abstract). In SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 430–439).
LibreCat
 
[93]
1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_9
LibreCat | DOI
 
[92]
1999 | Journal Article | LibreCat-ID: 16501
Meyer auf der Heide, F., & Vöcking, B. (1999). Shortest-Path Routing in Arbitrary Networks. Journal of Algorithms, 105–131. https://doi.org/10.1006/jagm.1998.0980
LibreCat | DOI
 
[91]
1999 | Journal Article | LibreCat-ID: 16502
Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1999). Allocating Weighted Jobs in Parallel. Theory of Computing Systems, 281–300. https://doi.org/10.1007/s002240000119
LibreCat | DOI
 
[90]
1999 | Book Chapter | LibreCat-ID: 17052
Mayr, E. W., Meyer auf der Heide, F., & Wanka, R. (1999). International Workshop on Communication and Data Management in Large Networks. In Informatik aktuell. Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-01069-3_47
LibreCat | DOI
 
[89]
1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide, F., & Martinez, G. T. (1998). Communication-efficient parallel multiway and approximate minimum cut computation. In LATIN’98: Theoretical Informatics. Berlin, Heidelberg. https://doi.org/10.1007/bfb0054332
LibreCat | DOI
 
[88]
1998 | Conference Paper | LibreCat-ID: 16563
Cole, R., Maggs, B. M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A. W., Schröder, K., … Vöcking, B. (1998). Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC ’98. https://doi.org/10.1145/276698.276790
LibreCat | DOI
 
[87]
1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide, F., Schröder, K., & Schwarze, F. (1998). Routing on networks of optical crossbars. Theoretical Computer Science, 181–200. https://doi.org/10.1016/s0304-3975(97)86791-6
LibreCat | DOI
 
[86]
1998 | Journal Article | LibreCat-ID: 16504
Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1998). Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6
LibreCat | DOI
 
[85]
1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou, E., & Meyer auf der Heide, F. (1997). Routing on asyncronous processor networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/bfb0002741
LibreCat | DOI
 
[84]
1997 | Journal Article | LibreCat-ID: 16567
Meyer auf der Heide, F., Storch, M., & Wanka, R. (1997). Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems, 627–644. https://doi.org/10.1007/s002240000071
LibreCat | DOI
 
[83]
1997 | Book Chapter | LibreCat-ID: 16568
Fischer, M., Meyer auf der Heide, F., & Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. In Algorithms — ESA ’97. Berlin, Heidelberg. https://doi.org/10.1007/3-540-63397-9_13
LibreCat | DOI
 
[82]
1997 | Conference Paper | LibreCat-ID: 16689
Maggs, B. M., Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1997). Exploiting locality for data management in systems of limited bandwidth. In Proceedings 38th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1997.646117
LibreCat | DOI
 
[81]
1997 | Journal Article | LibreCat-ID: 16564
Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R. (1997). A lower bound for randomized algebraic decision trees. Computational Complexity, 357–375. https://doi.org/10.1007/bf01270387
LibreCat | DOI
 
[80]
1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide, F., & Vöcking, B. (1997). Static and dynamic data management in networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/bfb0002716
LibreCat | DOI
 
[79]
1997 | Journal Article | LibreCat-ID: 16565
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1997). Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation, 103–120. https://doi.org/10.1006/inco.1997.2642
LibreCat | DOI
 
[78]
1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1997). Allocating weighted jobs in parallel. In Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97. https://doi.org/10.1145/258492.258522
LibreCat | DOI
 
[77]
1997 | Journal Article | LibreCat-ID: 16566
Breslauer, D., Czumaj, A., Dubhashi, D. P., & Meyer auf der Heide, F. (1997). Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters, 103–110. https://doi.org/10.1016/s0020-0190(97)00032-x
LibreCat | DOI
 
[76]
1997 | Book Chapter | LibreCat-ID: 16605
Bäumker, A., & Meyer auf der Heide, F. (1997). Communication efficient parallel searching. In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_21
LibreCat | DOI
 
[75]
1997 | Book Chapter | LibreCat-ID: 16693
Meyer auf der Heide, F., & Decker, T. (1997). Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In Informatik ’97 Informatik als Innovationsmotor. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60831-5_22
LibreCat | DOI
 
[74]
1997 | Conference Paper | LibreCat-ID: 2175
Bock, S., Meyer auf der Heide, F., & Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.
LibreCat | Files available
 
[73]
1996 | Journal Article | LibreCat-ID: 16699
Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1996). Strongly adaptive token distribution. Algorithmica, 413–427. https://doi.org/10.1007/bf01955042
LibreCat | DOI
 
[72]
1996 | Book (Editor) | LibreCat-ID: 16702
Meyer auf der Heide, F., & Monien, B. (Eds.). (1996). Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0
LibreCat | DOI
 
[71]
1996 | Conference Paper | LibreCat-ID: 2183
Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 370--379).
LibreCat | Files available
 
[70]
1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink, P., Meyer auf der Heide, F., & Stemann, V. (1996). Fault-tolerant shared memory simulations. In STACS 96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_16
LibreCat | DOI
 
[69]
1996 | Conference Paper | LibreCat-ID: 2184
Meyer auf der Heide, F., & Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.
LibreCat | Files available
 
[68]
1996 | Conference Paper | LibreCat-ID: 2186
Cypher, R., Meyer auf der Heide, F., Scheideler, C., & Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM.
LibreCat | Files available
 
[67]
1996 | Journal Article | LibreCat-ID: 16700
Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1996). Efficient PRAM simulation on a distributed memory machine. Algorithmica, 517–542. https://doi.org/10.1007/bf01940878
LibreCat | DOI
 
[66]
1996 | Journal Article | LibreCat-ID: 16698
Ameur, F., Fischer, P., Höffgen, K.-U., & Meyer auf der Heide, F. (1996). Trial and error. A new approach to space-bounded learning. Acta Informatica, 621–630. https://doi.org/10.1007/bf03036467
LibreCat | DOI
 
[65]
1996 | Journal Article | LibreCat-ID: 16701
Gil, J., Meyer auf der Heide, F., & Wigderson, A. (1996). The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing, 936–955. https://doi.org/10.1137/s0097539793255722
LibreCat | DOI
 
[64]
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci., (2), 245--281. https://doi.org/10.1016/0304-3975(96)00032-1
LibreCat | DOI
 
[63]
1995 | Conference Paper | LibreCat-ID: 16707
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Improved optimal shared memory simulations, and the power of reconfiguration. In Proceedings Third Israel Symposium on the Theory of Computing and Systems. https://doi.org/10.1109/istcs.1995.377051
LibreCat | DOI
 
[62]
1995 | Conference Paper | LibreCat-ID: 2208
Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS (pp. 267--278).
LibreCat | Files available
 
[61]
1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide, F., & Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In STACS 95. Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_81
LibreCat | DOI
 
[60]
1995 | Book Chapter | LibreCat-ID: 16874
Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_131
LibreCat | DOI
 
[59]
1995 | Book Chapter | LibreCat-ID: 16705
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_133
LibreCat | DOI
 
[58]
1995 | Book Chapter | LibreCat-ID: 16717
Meyer auf der Heide, F., & Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_77
LibreCat | DOI
 
[57]
1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide, F., Storch, M., & Wanka, R. (1995). Optimal trade-offs between size and slowdown for universal parallel networks. In Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95. https://doi.org/10.1145/215399.215430
LibreCat | DOI
 
[56]
1995 | Conference Paper | LibreCat-ID: 2187
Meyer auf der Heide, F., & Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp. 341--354). https://doi.org/10.1007/3-540-60313-1_154
LibreCat | Files available | DOI
 
[55]
1995 | Conference Paper | LibreCat-ID: 2207
Meyer auf der Heide, F., & Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In SPAA (pp. 137--146).
LibreCat | Files available
 
[54]
1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., & Tarjan, R. E. (1994). Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing, 738–761. https://doi.org/10.1137/s0097539791194094
LibreCat | DOI
 
[53]
1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1993). Strongly adaptive token distribution. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_89
LibreCat | DOI
 
[52]
1993 | Conference Paper | LibreCat-ID: 16731
Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). Simple, efficient shared memory simulations. In Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93. https://doi.org/10.1145/165231.165246
LibreCat | DOI
 
[51]
1993 | Journal Article | LibreCat-ID: 16729
Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). An Optimal Parallel Dictionary. Information and Computation, 196–217. https://doi.org/10.1006/inco.1993.1007
LibreCat | DOI
 
[50]
1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier, K., & Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_46
LibreCat | DOI
 
[49]
1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In Data structures and efficient algorithms. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55488-2_31
LibreCat | DOI
 
[48]
1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56731-3_3
LibreCat | DOI
 
[47]
1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide, F., & Pham, H. T. (1992). On the performance of networks with multiple busses. In STACS 92. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_176
LibreCat | DOI
 
[46]
1992 | Conference Paper | LibreCat-ID: 16736
Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1992). Efficient PRAM simulation on a distributed memory machine. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92. https://doi.org/10.1145/129712.129743
LibreCat | DOI
 
[45]
1992 | Book Chapter | LibreCat-ID: 16737
Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). Dynamic Hashing in Real Time. In TEUBNER-TEXTE zur Informatik. Wiesbaden. https://doi.org/10.1007/978-3-322-95233-2_7
LibreCat | DOI
 
[44]
1990 | Book Chapter | LibreCat-ID: 16738
Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). A new universal class of hash functions and dynamic hashing in real time. In Automata, Languages and Programming. Berlin/Heidelberg. https://doi.org/10.1007/bfb0032018
LibreCat | DOI
 
[43]
1990 | Book Chapter | LibreCat-ID: 16740
Karpinski, M., & Meyer auf der Heide, F. (1990). On the complexity of genuinely polynomial computation. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029630
LibreCat | DOI
 
[42]
1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029597
LibreCat | DOI
 
[41]
1990 | Conference Paper | LibreCat-ID: 16741
Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). How to distribute a dictionary in a complete network. In Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90. https://doi.org/10.1145/100216.100229
LibreCat | DOI
 
[40]
1990 | Conference Paper | LibreCat-ID: 16742
Gil, J., Meyer auf der Heide, F., & Wigderson, A. (1990). Not all keys can be hashed in constant time. In Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90. https://doi.org/10.1145/100216.100247
LibreCat | DOI
 
[39]
1990 | Journal Article | LibreCat-ID: 16824
Meyer auf der Heide, F. (1990). Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum, 13(4), 231–232.
LibreCat
 
[38]
1989 | Book Chapter | LibreCat-ID: 16745
Meyer auf der Heide, F. (1989). On genuinely time bounded computations. In STACS 89. Berlin/Heidelberg. https://doi.org/10.1007/bfb0028969
LibreCat | DOI
 
[37]
1989 | Book Chapter | LibreCat-ID: 16746
Meyer auf der Heide, F., & Wanka, R. (1989). Time-optimal simulations of networks by universal parallel computers. In STACS 89. Berlin/Heidelberg. https://doi.org/10.1007/bfb0028978
LibreCat | DOI
 
[36]
1989 | Book Chapter | LibreCat-ID: 16789
Meyer auf der Heide, F. (1989). Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In STACS 89. Berlin, Heidelberg. https://doi.org/10.1007/bfb0028983
LibreCat | DOI
 
[35]
1989 | Journal Article | LibreCat-ID: 16743
Just, B., Meyer auf der Heide, F., & Wigderson, A. (1989). On computations with integer division. RAIRO - Theoretical Informatics and Applications, 101–111. https://doi.org/10.1051/ita/1989230101011
LibreCat | DOI
 
[34]
1989 | Conference Paper | LibreCat-ID: 16744
Dietzfelbinger, M., & Meyer auf der Heide, F. (1989). An optimal parallel dictionary. In Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89. https://doi.org/10.1145/72935.72974
LibreCat | DOI
 
[33]
1988 | Journal Article | LibreCat-ID: 16764
Meyer auf der Heide, F. (1988). Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM), 740–747. https://doi.org/10.1145/44483.44490
LibreCat | DOI
 
[32]
1988 | Journal Article | LibreCat-ID: 16765
Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1988). A tradeoff between search and update time for the implicit dictionary problem. Theoretical Computer Science, 57–68. https://doi.org/10.1016/0304-3975(88)90018-7
LibreCat | DOI
 
[31]
1988 | Conference Paper | LibreCat-ID: 16766
Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., & Tarjan, R. E. (1988). Dynamic perfect hashing: upper and lower bounds. In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1988.21968
LibreCat | DOI
 
[30]
1988 | Book Chapter | LibreCat-ID: 16767
Just, B., Mathematik, F., Meyer auf der Heide, F., Informatik, F., & Wigderson, A. (1988). On computations with integer division. In STACS 88. Berlin, Heidelberg. https://doi.org/10.1007/bfb0035829
LibreCat | DOI
 
[29]
1988 | Journal Article | LibreCat-ID: 16763
Babai, L., Just, B., & Meyer auf der Heide, F. (1988). On the limits of computations with the floor function. Information and Computation, 99–107. https://doi.org/10.1016/0890-5401(88)90031-4
LibreCat | DOI
 
[28]
1988 | Book Chapter | LibreCat-ID: 16768
Dietzfelbinger, M., Mehlhorn, K., Meyer auf der Heide, F., & Rohnert, H. (1988). Upper and lower bounds for the dictionary problem. In SWAT 88. Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_24
LibreCat | DOI
 
[27]
1987 | Journal Article | LibreCat-ID: 16772
Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1987). A Time-Space Tradeoff for Element Distinctness. SIAM Journal on Computing, 97–99. https://doi.org/10.1137/0216007
LibreCat | DOI
 
[26]
1987 | Journal Article | LibreCat-ID: 16773
Meyer auf der Heide, F., & Wigderson, A. (1987). The Complexity of Parallel Sorting. SIAM Journal on Computing, 100–107. https://doi.org/10.1137/0216008
LibreCat | DOI
 
[25]
1986 | Journal Article | LibreCat-ID: 16771
Meyer auf der Heide, F. (1986). Efficient Simulations among Several Models of Parallel Computers. SIAM Journal on Computing, 106–119. https://doi.org/10.1137/0215008
LibreCat | DOI
 
[24]
1986 | Book Chapter | LibreCat-ID: 16776
Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1986). A time-space tradeoff for element distinctness. In STACS 86. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_89
LibreCat | DOI
 
[23]
1986 | Book Chapter | LibreCat-ID: 16774
Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1986). A tradeoff between search and update time for the implicit dictionary problem. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_54
LibreCat | DOI
 
[22]
1986 | Book Chapter | LibreCat-ID: 16775
Meyer auf der Heide, F. (1986). Speeding up random access machines by few processors. In STACS 86. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_72
LibreCat | DOI
 
[21]
1985 | Conference Paper | LibreCat-ID: 16783
Fich, F. E., Meyer auf der Heide, F., Ragde, P., & Wigderson, A. (1985). One, two, three . . . infinity: lower bounds for parallel computation. In Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85. https://doi.org/10.1145/22145.22151
LibreCat | DOI
 
[20]
1985 | Conference Paper | LibreCat-ID: 16788
Meyer auf der Heide, F. (1985). Nondeterministic versus probabilistic linear search algorithms. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). https://doi.org/10.1109/sfcs.1985.38
LibreCat | DOI
 
[19]
1985 | Conference Paper | LibreCat-ID: 16784
Meyer auf der Heide, F. (1985). Fast algorithms for n-dimensional restrictions of hard problems. In Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85. https://doi.org/10.1145/22145.22191
LibreCat | DOI
 
[18]
1985 | Journal Article | LibreCat-ID: 16823
Meyer auf der Heide, F. (1985). Lower time bounds for solving linear diophantine equations on several parallel computational models. Information and Control, 67(1–3), 195–211. https://doi.org/10.1016/S0019-9958(85)80035-8
LibreCat | DOI
 
[17]
1985 | Journal Article | LibreCat-ID: 16780
Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM), 929–937. https://doi.org/10.1145/4221.4250
LibreCat | DOI
 
[16]
1985 | Journal Article | LibreCat-ID: 16779
Lautemann, C., & Meyer auf der Heide, F. (1985). Lower time bounds for integer programming with two variables. Information Processing Letters, 101–105. https://doi.org/10.1016/0020-0190(85)90042-0
LibreCat | DOI
 
[15]
1985 | Journal Article | LibreCat-ID: 16781
Meyer auf der Heide, F. (1985). Simulating probabilistic by deterministic algebraic computation trees. Theoretical Computer Science, 325–330. https://doi.org/10.1016/0304-3975(85)90079-9
LibreCat | DOI
 
[14]
1985 | Conference Paper | LibreCat-ID: 16782
Meyer auf der Heide, F., & Wigderson, A. (1985). The complexity of parallel sorting. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). https://doi.org/10.1109/sfcs.1985.58
LibreCat | DOI
 
[13]
1984 | Journal Article | LibreCat-ID: 16785
Meyer auf der Heide, F. (1984). A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. Journal of the ACM (JACM), 668–676. https://doi.org/10.1145/828.322450
LibreCat | DOI
 
[12]
1984 | Conference Paper | LibreCat-ID: 16786
Meyer auf der Heide, F., & Reischuk, R. (1984). On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication. In 25th Annual Symposium onFoundations of Computer Science, 1984. https://doi.org/10.1109/sfcs.1984.715901
LibreCat | DOI
 
[11]
1984 | Book Chapter | LibreCat-ID: 16787
Meyer auf der Heide, F. (1984). Efficient simulations among several models of parallel computers (extended abstract). In STACS 84. Berlin, Heidelberg. https://doi.org/10.1007/3-540-12920-0_20
LibreCat | DOI
 
[10]
1983 | Journal Article | LibreCat-ID: 16808
Meyer auf der Heide, F. (1983). Infinite cube-connected cycles. Information Processing Letters, 1–2. https://doi.org/10.1016/0020-0190(83)90001-7
LibreCat | DOI
 
[9]
1983 | Book Chapter | LibreCat-ID: 16810
Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0036483
LibreCat | DOI
 
[8]
1983 | Conference Paper | LibreCat-ID: 16809
Meyer auf der Heide, F. (1983). A polynomial linear search algorithm for the n-dimensional knapsack problem. In Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83. https://doi.org/10.1145/800061.808734
LibreCat | DOI
 
[7]
1983 | Journal Article | LibreCat-ID: 16806
Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. Acta Informatica, 269–296. https://doi.org/10.1007/bf00265559
LibreCat | DOI
 
[6]
1983 | Journal Article | LibreCat-ID: 16807
Klein, P., & Meyer auf der Heide, F. (1983). A lower time bound for the knapsack problem on random access machines. Acta Informatica, 385–395. https://doi.org/10.1007/bf00290735
LibreCat | DOI
 
[5]
1981 | Book Chapter | LibreCat-ID: 16813
Meyer auf der Heide, F., & Rollik, A. (1981). Random access machines and straight-line programs. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_29
LibreCat | DOI
 
[4]
1981 | Journal Article | LibreCat-ID: 16820
Meyer auf der Heide, F. (1981). A comparison of two variations of a pebble game on graphs. Theoretical Computer Science, 315–322. https://doi.org/10.1016/s0304-3975(81)80004-7
LibreCat | DOI
 
[3]
1981 | Book Chapter | LibreCat-ID: 16814
Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel computers. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_111
LibreCat | DOI
 
[2]
1980 | Book Chapter | LibreCat-ID: 16815
Klein, P., & Meyer auf der Heide, F. (1980). Untere Zeitschranken für das Rucksack-Problem. In GI - 10. Jahrestagung. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_34
LibreCat | DOI
 
[1]
1979 | Journal Article | LibreCat-ID: 16812
Meyer auf der Heide, F. (1979). A comparison of two variations of a pebble game on graphs. Automata, Languages and Programming. ICALP 1979, 411–421. https://doi.org/10.1007/3-540-09510-1_32
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

232 Publications

Mark all

[232]
2020 | Conference Paper | LibreCat-ID: 13868
Pukrop, S., Mäcker, A., & Meyer auf der Heide, F. (2020). Approximating Weighted Completion Time for Order Scheduling with Setup Times. In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM).
LibreCat
 
[231]
2020 | Preprint | LibreCat-ID: 16968
Braun, M., Castenow, J., & Meyer auf der Heide, F. (2020). Local Gathering of Mobile Robots in Three Dimensions. ArXiv:2005.07495.
LibreCat
 
[230]
2020 | Journal Article | LibreCat-ID: 16299
Castenow, J., Fischer, M., Harbig, J., Jung, D., & Meyer auf der Heide, F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science, 815, 289–309. https://doi.org/10.1016/j.tcs.2020.02.018
LibreCat | DOI
 
[229]
2019 | Conference Paper | LibreCat-ID: 12870
Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) (pp. 120–137). Springer. https://doi.org/10.1007/978-3-030-39479-0_9
LibreCat | DOI | arXiv
 
[228]
2019 | Journal Article | LibreCat-ID: 13873
Feldkord, B., & Meyer auf der Heide, F. (2019). The Mobile Server Problem. ACM Transactions on Parallel Computing (TOPC), 6(3). https://doi.org/10.1145/3364204
LibreCat | Files available | DOI
 
[227]
2019 | Preprint | LibreCat-ID: 16341
Brandt, S., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2019). Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels. ArXiv:1904.08225.
LibreCat | Download (ext.) | arXiv
 
[226]
2019 | Journal Article | LibreCat-ID: 13937
Meyer auf der Heide, F. (2019). Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln. Mathematische Semesterberichte, 66(2), 259–260. https://doi.org/10.1007/s00591-019-00249-0
LibreCat | DOI
 
[225]
2019 | Preprint | LibreCat-ID: 16462
Feldkord, B., & Meyer auf der Heide, F. (2019). The Mobile Server Problem. ArXiv:1904.05220.
LibreCat | arXiv
 
[224]
2019 | Book Chapter | LibreCat-ID: 13939
Kling, P., & Meyer auf der Heide, F. (2019). Continuous Protocols for Swarm Robotics. In Distributed Computing by Mobile Entities, Current Research in Moving and Computing (Vol. 11340, pp. 317–334). Springer. https://doi.org/10.1007/978-3-030-11072-7\_13
LibreCat | DOI
 
[223]
2019 | Journal Article | LibreCat-ID: 13946
Abu-Khzam, F. N., Li, S., Markarian, C., & Meyer auf der Heide, F. (2019). Efficient parallel algorithms for parameterized problems. Theoretical Computer Science, 786, 2–12. https://doi.org/10.1016/j.tcs.2018.11.006
LibreCat | DOI
 
[222]
2019 | Journal Article | LibreCat-ID: 13770
Karl, H., Kundisch, D., Meyer auf der Heide, F., & Wehrheim, H. (n.d.). A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering. https://doi.org/10.1007/s12599-019-00627-x
LibreCat | Files available | DOI
 
[221]
2019 | Journal Article | LibreCat-ID: 16337
Brandt, S., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2019). Visibility‐Aware Progressive Farthest Point Sampling on the GPU. Computer Graphics Forum, 38(7), 413–424. https://doi.org/10.1111/cgf.13848
LibreCat | DOI | Download (ext.)
 
[220]
2019 | Conference Paper | LibreCat-ID: 13942
Markarian, C., & Meyer auf der Heide, F. (2019). Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems (pp. 315–321). SciTePress. https://doi.org/10.5220/0007369503150321
LibreCat | DOI
 
[219]
2018 | Conference Paper | LibreCat-ID: 7570
Meyer auf der Heide, F., & Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. Vienna: ACM Press. https://doi.org/10.1145/3210377.3210662
LibreCat | Files available | DOI
 
[218]
2018 | Book Chapter | LibreCat-ID: 16392
Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2018). A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Cham. https://doi.org/10.1007/978-3-319-98355-4_18
LibreCat | DOI
 
[217]
2018 | Journal Article | LibreCat-ID: 2848
Li, S., Markarian, C., & Meyer auf der Heide, F. (2018). Towards Flexible Demands in Online Leasing Problems. . Algorithmica, 80(5), 1556–1574. https://doi.org/10.1007/s00453-018-0420-y
LibreCat | Files available | DOI
 
[216]
2018 | Conference Paper | LibreCat-ID: 2850
Hamann, H., Markarian, C., Meyer auf der Heide, F., & Wahby, M. (2018). Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In Ninth International Conference on Fun with Algorithms (FUN). https://doi.org/10.4230/LIPIcs.FUN.2018.22
LibreCat | Files available | DOI
 
[215]
2018 | Conference Paper | LibreCat-ID: 4375
Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4
LibreCat | Files available | DOI
 
[214]
2018 | Journal Article | LibreCat-ID: 2849
Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory of Computing Systems. https://doi.org/10.1007/s00224-017-9836-z
LibreCat | Files available | DOI
 
[213]
2018 | Journal Article | LibreCat-ID: 3551
König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2018). Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization, 36(4), 1356–1379. https://doi.org/10.1007/s10878-018-0325-3
LibreCat | Files available | DOI
 
[212]
2018 | Conference Paper | LibreCat-ID: 2485
Feldkord, B., & Meyer auf der Heide, F. (2018). Online Facility Location with Mobile Facilities. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 373–381). Wien: ACM. https://doi.org/10.1145/3210377.3210389
LibreCat | Files available | DOI
 
[211]
2017 | Book Chapter | LibreCat-ID: 16461
Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr, S., … Sundermeier, J. (2017). Monitoring of Domain-Related Problems in Distributed Data Streams. In Structural Information and Communication Complexity. Cham. https://doi.org/10.1007/978-3-319-72050-0_13
LibreCat | DOI
 
[210]
2017 | Journal Article | LibreCat-ID: 706
Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017). Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial Optimization, 36(4), 1168–1194. https://doi.org/10.1007/s10878-017-0198-x
LibreCat | Files available | DOI
 
[209]
2017 | Conference Paper | LibreCat-ID: 16347
Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. In A. Fernández Anta, T. Jurdzinski, M. A. Mosteiro, & Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} (Vol. 10718, pp. 168–181). Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-72751-6_13
LibreCat | DOI
 
[208]
2017 | Conference Paper | LibreCat-ID: 55
Feldkord, B., & Meyer auf der Heide, F. (2017). The Mobile Server Problem. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 313–319). https://doi.org/10.1145/3087556.3087575
LibreCat | Files available | DOI
 
[207]
2017 | Conference Paper | LibreCat-ID: 79
Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017). Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) (Vol. 10787, pp. 207–222). Springer. https://doi.org/10.1007/978-3-319-89441-6
LibreCat | Files available | DOI
 
[206]
2017 | Conference Paper | LibreCat-ID: 16348
Biermeier, F., Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2017). A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) (pp. 285–300). Springer. https://doi.org/10.1007/978-3-319-89441-6_21
LibreCat | DOI
 
[205]
2017 | Journal Article | LibreCat-ID: 63
Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., … Suess, T. (2017). Scheduling Shared Continuous Resources on Many-Cores. Journal of Scheduling. https://doi.org/10.1007/s10951-017-0518-0
LibreCat | Files available | DOI
 
[204]
2017 | Conference Paper | LibreCat-ID: 70
Feldkord, B., Markarian, C., & Meyer auf der Heide, F. (2017). Price Fluctuations in Online Leasing. In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 17–31). https://doi.org/10.1007/978-3-319-71147-8_2
LibreCat | Files available | DOI
 
[203]
2017 | Conference Paper | LibreCat-ID: 82
Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2017). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW) (pp. 139–150). https://doi.org/10.1007/978-3-319-59605-1_13
LibreCat | Files available | DOI
 
[202]
2017 | Conference Paper | LibreCat-ID: 16349
Podlipyan, P., Li, S., Markarian, C., & Meyer auf der Heide, F. (2017). A Continuous Strategy for Collisionless Gathering. In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) (pp. 182–197). https://doi.org/10.1007/978-3-319-72751-6_14
LibreCat | DOI
 
[201]
2016 | Conference Paper | LibreCat-ID: 143
Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON) (pp. 92–102). https://doi.org/10.1007/978-3-319-42634-1_8
LibreCat | Files available | DOI
 
[200]
2016 | Conference Paper | LibreCat-ID: 16358
Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2016). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. In Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer. https://doi.org/10.1007/978-3-319-53058-1_5
LibreCat | DOI
 
[199]
2016 | Conference Paper | LibreCat-ID: 16360
Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS) (pp. 689–699). IEEE. https://doi.org/10.1109/IPDPS.2016.51
LibreCat | DOI
 
[198]
2016 | Preprint | LibreCat-ID: 16396
Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. ArXiv:1609.01184.
LibreCat | arXiv
 
[197]
2016 | Conference (Editor) | LibreCat-ID: 163
Dressler, F., & Meyer auf der Heide, F. (Eds.). (2016). Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). Presented at the MobiHoc, Paderborn, Germany: ACM. https://doi.org/10.1145/2942358
LibreCat | DOI
 
[196]
2016 | Conference Paper | LibreCat-ID: 16359
Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 301–312). ACM. https://doi.org/10.1145/2935764.2935789
LibreCat | DOI
 
[195]
2016 | Preprint | LibreCat-ID: 16450
Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. ArXiv:1602.03303.
LibreCat | arXiv
 
[194]
2016 | Conference Paper | LibreCat-ID: 207
Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 578--592). https://doi.org/10.1007/978-3-319-48749-6_42
LibreCat | Files available | DOI
 
[193]
2016 | Special Issue | LibreCat-ID: 187
Meyer auf der Heide, F. (Ed.). (2016). Introduction to the Special Issue on SPAA 2014. Transactions on Parallel Computing (TOPC). https://doi.org/10.1145/2936716
LibreCat | Files available | DOI
 
[192]
2016 | Conference Paper | LibreCat-ID: 157
König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2016). Scheduling with Interjob Communication on Parallel Processors. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 563--577). https://doi.org/10.1007/978-3-319-48749-6_41
LibreCat | Files available | DOI
 
[191]
2016 | Journal Article | LibreCat-ID: 139
Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., & Pietrzyk, P. (2016). Towards the price of leasing online. Journal of Combinatorial Optimization, (4), 1197--1216. https://doi.org/10.1007/s10878-015-9915-5
LibreCat | Files available | DOI
 
[190]
2016 | Conference Paper | LibreCat-ID: 16351
Fischer, M., Jähn, C., Meyer auf der Heide, F., & Petring, R. (2016). Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In L. Kliemann & P. Sanders (Eds.), Algorithm Engineering (Vol. 9220, pp. 226–244). Springer. https://doi.org/10.1007/978-3-319-49487-6_7
LibreCat | DOI
 
[189]
2016 | Conference Paper | LibreCat-ID: 177
Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem. In Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 477–488). https://doi.org/10.1007/978-3-319-48749-6_35
LibreCat | Files available | DOI
 
[188]
2016 | Conference Paper | LibreCat-ID: 16364
Macker, A., Malatyali, M., & Meyer auf der Heide, F. (2016). On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps.2016.91
LibreCat | DOI
 
[187]
2015 | Journal Article | LibreCat-ID: 16391
Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2015). Linear and Competitive Strategies for Continuous Robot Formation Problems. ACM Transactions on Parallel Computing, 1–18. https://doi.org/10.1145/2742341
LibreCat | DOI
 
[186]
2015 | Preprint | LibreCat-ID: 16397
Abshoff, S., Andreas Cord-Landwehr, A., Jung, D., & Meyer auf der Heide, F. (2015). Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case. ArXiv: 1501.04877.
LibreCat | arXiv
 
[185]
2015 | Conference Paper | LibreCat-ID: 240
Li, S., Mäcker, A., Markarian, C., Meyer auf der Heide, F., & Riechers, S. (2015). Towards Flexible Demands in Online Leasing Problems. In Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON) (pp. 277--288). https://doi.org/10.1007/978-3-319-21398-9_22
LibreCat | Files available | DOI
 
[184]
2015 | Preprint | LibreCat-ID: 16449
Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2015). Gathering a Closed Chain of Robots on a Grid. ArXiv:1510.05454.
LibreCat | arXiv
 
[183]
2015 | Preprint | LibreCat-ID: 16452
Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2015). Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks. ArXiv:1510.01866.
LibreCat | arXiv
 
[182]
2015 | Conference Paper | LibreCat-ID: 266
Markarian, C., & Meyer auf der Heide, F. (2015). Online Resource Leasing. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC) (pp. 343–344). https://doi.org/10.1145/2767386.2767454
LibreCat | Files available | DOI
 
[181]
2015 | Conference Paper | LibreCat-ID: 274
Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2015). Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack, & U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings (pp. 542--553). https://doi.org/10.1007/978-3-319-21840-3_45
LibreCat | Files available | DOI
 
[180]
2014 | Conference Paper | LibreCat-ID: 459
Kniesburges, S., Markarian, C., Meyer auf der Heide, F., & Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 1–13). https://doi.org/10.1007/978-3-319-09620-9_1
LibreCat | Files available | DOI
 
[179]
2014 | Conference Paper | LibreCat-ID: 380
Cord-Landwehr, A., Mäcker, A., & Meyer auf der Heide, F. (2014). Quality of Service in Network Creation Games. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 423–428). https://doi.org/10.1007/978-3-319-13129-0_34
LibreCat | Files available | DOI
 
[178]
2014 | Book Chapter | LibreCat-ID: 16394
Lukovszki, T., & Meyer auf der Heide, F. (2014). Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots. In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-319-14472-6_17
LibreCat | DOI
 
[177]
2014 | Book (Editor) | LibreCat-ID: 16870
Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.). (2014). Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013 (Vol. 8243). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-45346-5
LibreCat | DOI
 
[176]
2014 | Conference Paper | LibreCat-ID: 379
Abshoff, S., Markarian, C., & Meyer auf der Heide, F. (2014). Randomized Online Algorithms for Set Cover Leasing Problems. In Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 25–34). https://doi.org/10.1007/978-3-319-12691-3_3
LibreCat | Files available | DOI
 
[175]
2014 | Book Chapter | LibreCat-ID: 16395
Abshoff, S., & Meyer auf der Heide, F. (2014). Continuous Aggregation in Dynamic Ad-Hoc Networks. In Structural Information and Communication Complexity. Cham. https://doi.org/10.1007/978-3-319-09620-9_16
LibreCat | DOI
 
[174]
2014 | Preprint | LibreCat-ID: 16460
Mäcker, A., Malatyali, M., & Meyer auf der Heide, F. (2014). Online Top-k-Position Monitoring of Distributed Data Streams. ArXiv:1410.7912.
LibreCat | arXiv
 
[173]
2014 | Conference Paper | LibreCat-ID: 368
Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., & Süss, T. (2014). Scheduling Shared Continuous Resources on Many-Cores. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 128–137). https://doi.org/10.1145/2612669.2612698
LibreCat | Files available | DOI
 
[172]
2013 | Conference Paper | LibreCat-ID: 477
Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., & Meyer auf der Heide, F. (2013). Token Dissemination in Geometric Dynamic Networks. In 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 (pp. 22–34). https://doi.org/10.1007/978-3-642-45346-5_3
LibreCat | Files available | DOI
 
[171]
2013 | Conference Paper | LibreCat-ID: 505
Happe, M., Kling, P., Plessl, C., Platzner, M., & Meyer auf der Heide, F. (2013). On-The-Fly Computing: A Novel Paradigm for Individualized IT Services. In Proceedings of the 9th IEEE Workshop on Software Technology for Future embedded and Ubiquitous Systems (SEUS). IEEE. https://doi.org/10.1109/ISORC.2013.6913232
LibreCat | Files available | DOI
 
[170]
2013 | Preprint | LibreCat-ID: 524
Meyer auf der Heide, F., & Swirkot, K. (2013). Hierarchies in Local Distributed Decision. arXiv.
LibreCat | Files available | arXiv
 
[169]
2013 | Journal Article | LibreCat-ID: 16393
Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2013). Spherical Visibility Sampling. Computer Graphics Forum, 49–58. https://doi.org/10.1111/cgf.12150
LibreCat | DOI
 
[168]
2013 | Book Chapter | LibreCat-ID: 16406
Jähn, C., Eikel, B., Fischer, M., Petring, R., & Meyer auf der Heide, F. (2013). Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties. In Advances in Visual Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_12
LibreCat | DOI
 
[167]
2013 | Conference Paper | LibreCat-ID: 563
Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2013). A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks. In Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS) (pp. 217–227). https://doi.org/10.1007/978-3-642-45346-5_16
LibreCat | Files available | DOI
 
[166]
2013 | Book Chapter | LibreCat-ID: 16407
Petring, R., Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2013). Real-Time 3D Rendering of Heterogeneous Scenes. In Advances in Visual Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_44
LibreCat | DOI
 
[165]
2013 | Conference Paper | LibreCat-ID: 507
Abshoff, S., Benter, M., Malatyali, M., & Meyer auf der Heide, F. (2013). On Two-Party Communication Through Dynamic Networks. In Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS) (pp. 11–22). https://doi.org/10.1007/978-3-319-03850-6_2
LibreCat | Files available | DOI
 
[164]
2013 | Conference (Editor) | LibreCat-ID: 558
Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.). (2013). Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer. https://doi.org/10.1007/978-3-642-45346-5
LibreCat | Files available | DOI
 
[163]
2012 | Conference Paper | LibreCat-ID: 636
Meyer auf der Heide, F., Pietrzyk, P., & Kling, P. (2012). An Algorithm for Facility Leasing. In Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO) (pp. 61–72). https://doi.org/10.1007/978-3-642-31104-8_6
LibreCat | Files available | DOI
 
[162]
2012 | Book Chapter | LibreCat-ID: 16448
Kempkes, B., & Meyer auf der Heide, F. (2012). Local, Self-organizing Strategies for Robotic Formation Problems. In Algorithms for Sensor Systems. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28209-6_2
LibreCat | DOI
 
[161]
2012 | Journal Article | LibreCat-ID: 579
Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., & Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms, (3), 30. https://doi.org/10.1145/2229163.2229174
LibreCat | Files available | DOI
 
[160]
2012 | Conference Paper | LibreCat-ID: 619
Brandes, P., & Meyer auf der Heide, F. (2012). Distributed Computing in Fault-Prone Dynamic Networks. In Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS) (pp. 9–14). https://doi.org/10.1145/2414815.2414818
LibreCat | Files available | DOI
 
[159]
2012 | Book Chapter | LibreCat-ID: 16445
Kempkes, B., & Meyer auf der Heide, F. (2012). Continuous Local Strategies for Robotic Formation Problems. In Experimental Algorithms. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30850-5_2
LibreCat | DOI
 
[158]
2012 | Book Chapter | LibreCat-ID: 16408
Süß, T., Koch, C., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2012). Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. In Advances in Visual Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33179-4_48
LibreCat | DOI
 
[157]
2012 | Conference Paper | LibreCat-ID: 16446
Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2012). Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. In Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA ’12. https://doi.org/10.1145/2312005.2312009
LibreCat | DOI
 
[156]
2011 | Book Chapter | LibreCat-ID: 16409
Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_52
LibreCat | DOI
 
[155]
2011 | Conference Paper | LibreCat-ID: 16428
Rajaraman, R., & Meyer auf der Heide, F. (2011). Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493
LibreCat | DOI
 
[154]
2011 | Conference Paper | LibreCat-ID: 16454
Kling, P., & Meyer auf der Heide, F. (2011). Convergence of local communication chain strategies via linear transformations. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493.1989517
LibreCat | DOI
 
[153]
2011 | Book Chapter | LibreCat-ID: 16459
Brandes, P., Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In Structural Information and Communication Complexity. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22212-2_13
LibreCat | DOI
 
[152]
2011 | Conference (Editor) | LibreCat-ID: 667
Meyer auf der Heide, F., & Rajaraman, R. (Eds.). (2011). 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/1989493
LibreCat | DOI
 
[151]
2011 | Book Chapter | LibreCat-ID: 16412
Gehweiler, J., & Meyer auf der Heide, F. (2011). Bin Packing - How Do I Get My Stuff into the Boxes. In Algorithms Unplugged (pp. 367–374). Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_38
LibreCat | DOI
 
[150]
2011 | Journal Article | LibreCat-ID: 16455
Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Building Simple Formations in Large Societies of Tiny Mobile Robots. Procedia Computer Science, 153–155. https://doi.org/10.1016/j.procs.2011.09.049
LibreCat | DOI
 
[149]
2011 | Journal Article | LibreCat-ID: 17009
Hsu, D. F., Magga, B. M., Ho, H. C. T., Hromkovic, J., Lau, F. C. M., & Meyer auf der Heide, F. (2011). EDITORIAL. Journal of Interconnection Networks, vii–viii. https://doi.org/10.1142/s0219265911002885
LibreCat | DOI
 
[148]
2011 | Book Chapter | LibreCat-ID: 16456
Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Energy-Awareness in Self-organising Robotic Exploration Teams. In Organic Computing — A Paradigm Shift for Complex Systems. Basel. https://doi.org/10.1007/978-3-0348-0130-0_35
LibreCat | DOI
 
[147]
2011 | Conference Paper | LibreCat-ID: 664
Gehweiler, J., Kling, P., & Meyer auf der Heide, F. (2011). An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 31--40). https://doi.org/10.1007/978-3-642-31500-8_4
LibreCat | Files available | DOI
 
[146]
2011 | Book Chapter | LibreCat-ID: 16410
Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18381-2_15
LibreCat | DOI
 
[145]
2011 | Conference Paper | LibreCat-ID: 16453
Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., & Wattenhofer, R. (2011). A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493.1989515
LibreCat | DOI
 
[144]
2010 | Book Chapter | LibreCat-ID: 16365
Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2010). A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In Structural Information and Communication Complexity (pp. 168–182). Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_14
LibreCat | DOI
 
[143]
2010 | Book (Editor) | LibreCat-ID: 16404
Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2
LibreCat | DOI
 
[142]
2010 | Journal Article | LibreCat-ID: 16447
Degener, B., Fekete, S. P., Kempkes, B., & Meyer auf der Heide, F. (2010). A survey on relay placement with runtime and approximation guarantees. Computer Science Review, 57–68. https://doi.org/10.1016/j.cosrev.2010.09.005
LibreCat | DOI
 
[141]
2010 | Book Chapter | LibreCat-ID: 16474
Bansal, V., Meyer auf der Heide, F., & Sohler, C. (2010). Labeling Smart Dust. In Algorithms – ESA 2004. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_9
LibreCat | DOI
 
[140]
2010 | Journal Article | LibreCat-ID: 1903
Meyer auf der Heide, F., & Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum, (5), 468--474. https://doi.org/10.1007/s00287-010-0470-2
LibreCat | DOI
 
[139]
2010 | Conference Paper | LibreCat-ID: 16401
Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2010). A local O(n2) gathering algorithm. In Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. https://doi.org/10.1145/1810479.1810523
LibreCat | DOI
 
[138]
2010 | Conference Paper | LibreCat-ID: 16414
Meyer auf der Heide, F., & Phillips, C. A. (2010). Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. https://doi.org/10.1145/1810479
LibreCat | DOI
 
[137]
2010 | Book (Editor) | LibreCat-ID: 16403
Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1
LibreCat | DOI
 
[136]
2009 | Conference Paper | LibreCat-ID: 16430
Mehler, J., & Meyer auf der Heide, F. (2009). Power-aware online file allocation in mobile ad hoc networks. In Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09. https://doi.org/10.1145/1583991.1584072
LibreCat | DOI
 
[135]
2009 | Conference (Editor) | LibreCat-ID: 16431
Meyer auf der Heide, F., & Bender, M. A. (Eds.). (2009). Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09. https://doi.org/10.1145/1583991
LibreCat | DOI
 
[134]
2009 | Journal Article | LibreCat-ID: 16398
Bienkowski, M., Byrka, J., Korzeniowski, M., & Meyer auf der Heide, F. (2009). Optimal algorithms for page migration in dynamic networks. Journal of Discrete Algorithms, 545–569. https://doi.org/10.1016/j.jda.2008.07.006
LibreCat | DOI
 
[133]
2008 | Conference (Editor) | LibreCat-ID: 16466
Meyer auf der Heide, F., & Shavit, N. (Eds.). (2008). Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA ’08. ACM. https://doi.org/10.1145/1378533
LibreCat | DOI
 
[132]
2008 | Journal Article | LibreCat-ID: 16429
Kutyłowski, J., & Meyer auf der Heide, F. (2008). Optimal strategies for maintaining a chain of relays between an explorer and a base camp. Theoretical Computer Science, 3391–3405. https://doi.org/10.1016/j.tcs.2008.04.010
LibreCat | DOI
 
[131]
2008 | Book Chapter | LibreCat-ID: 16463
Meyer auf der Heide, F., & Schneider, B. (2008). Local Strategies for Connecting Stations by Small Robotic Networks. In Biologically-Inspired Collaborative Computing. Boston, MA. https://doi.org/10.1007/978-0-387-09655-1_9
LibreCat | DOI
 
[130]
2008 | Book Chapter | LibreCat-ID: 16464
Gehweiler, J., & Meyer auf der Heide, F. (2008). Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“. In Taschenbuch der Algorithmen. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76394-9_40
LibreCat | DOI
 
[129]
2008 | Preprint | LibreCat-ID: 16465
Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., & Ziegler, M. (2008). Planar Visibility Counting. ArXiv:0810.0052.
LibreCat | arXiv
 
[128]
2007 | Conference Paper | LibreCat-ID: 16467
Dynia, M., Kutylowski, J., Meyer auf der Heide, F., & Schrieb, J. (2007). Local strategies for maintaining a chain of relay stations between an explorer and a base station. In Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’07. https://doi.org/10.1145/1248377.1248420
LibreCat | DOI
 
[127]
2007 | Conference Paper | LibreCat-ID: 7970
Arens, S., Buss, A., Deck, H., Dynia, M., Fischer, M., Hagedorn, H., … Wachsmuth, H. (2007). Smart Teams: Simulating Large Robotic Swarms in Vast Environments. In Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment (pp. 215–222). Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn.
LibreCat | Download (ext.)
 
[126]
2007 | Conference Paper | LibreCat-ID: 2214
Brinkmann, A., Effert, S., Meyer auf der Heide, F., & Scheideler, C. (2007). Dynamic and redundant data placement. In IEEE International Conference on Distributed Computing Systems (ICDCS).
LibreCat | Files available
 
[125]
2006 | Book Chapter | LibreCat-ID: 16473
Dynia, M., Kutyłowski, J., Meyer auf der Heide, F., & Schindelhauer, C. (2006). Smart Robot Teams Exploring Sparse Trees. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/11821069_29
LibreCat | DOI
 
[124]
2006 | Book Chapter | LibreCat-ID: 16470
Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2006). A Web Computing Environment for Parallel Algorithms in Java. In Parallel Processing and Applied Mathematics. Berlin, Heidelberg. https://doi.org/10.1007/11752578_96
LibreCat | DOI
 
[123]
2006 | Book Chapter | LibreCat-ID: 16471
Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2006). Load Balancing Strategies in a Web Computing Environment. In Parallel Processing and Applied Mathematics. Berlin, Heidelberg. https://doi.org/10.1007/11752578_101
LibreCat | DOI
 
[122]
2006 | Book Chapter | LibreCat-ID: 16476
Dynia, M., Kutyłowski, J., Lorek, P., & Meyer auf der Heide, F. (2006). Maintaining Communication Between an Explorer and a Base Station. In IFIP International Federation for Information Processing. Boston, MA. https://doi.org/10.1007/978-0-387-34733-2_14
LibreCat | DOI
 
[121]
2006 | Book Chapter | LibreCat-ID: 16472
Demaine, E. D., Meyer auf der Heide, F., Pagh, R., & Pǎtraşcu, M. (2006). De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg. https://doi.org/10.1007/11682462_34
LibreCat | DOI
 
[120]
2005 | Conference Paper | LibreCat-ID: 17112
Bienkowski, M., Damerow, V., Meyer auf der Heide, F., & Sohler, C. (2005). Average case complexity of Voronoi diagrams of n sites from the unit cube. In Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005. Technische Universiteit Eindhoven.
LibreCat | Files available
 
[119]
2005 | Book Chapter | LibreCat-ID: 16468
Bienkowski, M., Korzeniowski, M., & Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In Peer-to-Peer Systems IV. Berlin, Heidelberg. https://doi.org/10.1007/11558989_20
LibreCat | DOI
 
[118]
2005 | Conference (Editor) | LibreCat-ID: 17113
Leonardi, S., Meyer auf der Heide, F., & Wagner, D. (Eds.). (2005). Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks (Vol. 05361). Presented at the Dagstuhl Seminar Proceedings, Schloss Dagstuhl, Germany.
LibreCat | Files available
 
[117]
2005 | Journal Article | LibreCat-ID: 16399
Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., & Meyer auf der Heide, F. (2005). The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments. Presence: Teleoperators and Virtual Environments, 617–637. https://doi.org/10.1162/1054746043280619
LibreCat | DOI
 
[116]
2005 | Book Chapter | LibreCat-ID: 16469
Bienkowski, M., & Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg. https://doi.org/10.1007/11549345_1
LibreCat | DOI
 
[115]
2004 | Conference Paper | LibreCat-ID: 16480
Leonardi, S., Marchetti-Spaccamela, A., & Meyer auf der Heide, F. (2004). Scheduling against an adversarial network. In SPAA ’04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures. https://doi.org/10.1145/1007912.1007936
LibreCat | DOI
 
[114]
2004 | Conference Paper | LibreCat-ID: 16475
Bienkowski, M., Korzeniowski, M., & Meyer auf der Heide, F. (2004). Fighting against two adversaries. In Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’04. https://doi.org/10.1145/1007912.1007923
LibreCat | DOI
 
[113]
2004 | Conference Paper | LibreCat-ID: 17346
Brinkmann, A., Heidebuer, M., Meyer auf der Heide, F., Rückert, U., Salzwedel, K., & Vodisek, M. (2004). V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In B. Kobler & P. C. Hariharan (Eds.), 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA (pp. 153--157). IEEE.
LibreCat
 
[112]
2004 | Journal Article | LibreCat-ID: 16477
Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., & Grünewald, M. (2004). Congestion, Dilation, and Energy in Radio Networks. Theory of Computing Systems, 343–370. https://doi.org/10.1007/s00224-004-1124-z
LibreCat | DOI
 
[111]
2003 | Journal Article | LibreCat-ID: 16481
Meyer auf der Heide, F. (2003). Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). It - Information Technology. https://doi.org/10.1524/itit.45.2.108.19606
LibreCat | DOI
 
[110]
2003 | Journal Article | LibreCat-ID: 16482
Juurlink, B., Kolman, P., Meyer auf der Heide, F., & Rieping, I. (2003). Optimal broadcast on parallel locality models. Journal of Discrete Algorithms, 151–166. https://doi.org/10.1016/s1570-8667(03)00023-6
LibreCat | DOI
 
[109]
2003 | Conference Paper | LibreCat-ID: 2128
Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer. https://doi.org/10.1007/978-3-540-39658-1_17
LibreCat | DOI
 
[108]
2003 | Conference (Editor) | LibreCat-ID: 16484
Rosenberg, A. L., & Meyer auf der Heide, F. (Eds.). (2003). Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03. https://doi.org/10.1145/777412
LibreCat | DOI
 
[107]
2003 | Conference Paper | LibreCat-ID: 16720
Bonorden, O., Bruls, N., Kastens, U., Le, D. K., Meyer auf der Heide, F., Niemann, J.-C., … Thies, M. (2003). A holistic methodology for network processor design. In 28th Annual IEEE International Conference on Local Computer Networks. https://doi.org/10.1109/LCN.2003.1243185
LibreCat | DOI
 
[106]
2002 | Book Chapter | LibreCat-ID: 16723
Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., & Spirakis, P. (2002). Mobile Computing, Mobile Networks. In Euro-Par 2002 Parallel Processing (Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_133
LibreCat | DOI
 
[105]
2002 | Conference Paper | LibreCat-ID: 16490
Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., & Meyer auf der Heide, F. (2002). The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. In Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02. https://doi.org/10.1145/585740.585764
LibreCat | DOI
 
[104]
2002 | Journal Article | LibreCat-ID: 16489
Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann, M. (2002). Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory of Computing Systems, 217–245. https://doi.org/10.1007/s00224-001-1045-z
LibreCat | DOI
 
[103]
2002 | Conference Paper | LibreCat-ID: 16491
Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., & Grünewald, M. (2002). Energy, congestion and dilation in radio networks. In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’02. https://doi.org/10.1145/564870.564910
LibreCat | DOI
 
[102]
2001 | Conference Paper | LibreCat-ID: 16492
Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., & Straßer, W. (2001). The randomized z-buffer algorithm. In Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01. https://doi.org/10.1145/383259.383299
LibreCat | DOI
 
[101]
2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide, F. (2001). Data Management in Networks. In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_2
LibreCat | DOI
 
[100]
2001 | Book (Editor) | LibreCat-ID: 16722
Meyer auf der Heide, F. (Ed.). (2001). Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer . https://doi.org/10.1007/3-540-44676-1
LibreCat | DOI
 
[99]
2001 | Journal Article | LibreCat-ID: 2139
Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138. https://doi.org/10.1007/s004930170007
LibreCat | DOI
 
[98]
2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide, F., & Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In Computational Science - ICCS 2001. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_68
LibreCat | DOI
 
[97]
2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide, F., Kutyłowski, M., & Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-x_59
LibreCat | DOI
 
[96]
2000 | Journal Article | LibreCat-ID: 17010
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (2000). Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing, 1703–1739. https://doi.org/10.1137/s009753979529564x
LibreCat | DOI
 
[95]
2000 | Conference Paper | LibreCat-ID: 16495
Meyer auf der Heide, F., Räcke, H., & Westermann, M. (2000). Data management in hierarchical bus networks. In Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’00. https://doi.org/10.1145/341800.341814
LibreCat | DOI
 
[94]
2000 | Conference Paper | LibreCat-ID: 16496
Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (2000). Caching in networks (extended abstract). In SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 430–439).
LibreCat
 
[93]
1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_9
LibreCat | DOI
 
[92]
1999 | Journal Article | LibreCat-ID: 16501
Meyer auf der Heide, F., & Vöcking, B. (1999). Shortest-Path Routing in Arbitrary Networks. Journal of Algorithms, 105–131. https://doi.org/10.1006/jagm.1998.0980
LibreCat | DOI
 
[91]
1999 | Journal Article | LibreCat-ID: 16502
Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1999). Allocating Weighted Jobs in Parallel. Theory of Computing Systems, 281–300. https://doi.org/10.1007/s002240000119
LibreCat | DOI
 
[90]
1999 | Book Chapter | LibreCat-ID: 17052
Mayr, E. W., Meyer auf der Heide, F., & Wanka, R. (1999). International Workshop on Communication and Data Management in Large Networks. In Informatik aktuell. Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-01069-3_47
LibreCat | DOI
 
[89]
1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide, F., & Martinez, G. T. (1998). Communication-efficient parallel multiway and approximate minimum cut computation. In LATIN’98: Theoretical Informatics. Berlin, Heidelberg. https://doi.org/10.1007/bfb0054332
LibreCat | DOI
 
[88]
1998 | Conference Paper | LibreCat-ID: 16563
Cole, R., Maggs, B. M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A. W., Schröder, K., … Vöcking, B. (1998). Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC ’98. https://doi.org/10.1145/276698.276790
LibreCat | DOI
 
[87]
1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide, F., Schröder, K., & Schwarze, F. (1998). Routing on networks of optical crossbars. Theoretical Computer Science, 181–200. https://doi.org/10.1016/s0304-3975(97)86791-6
LibreCat | DOI
 
[86]
1998 | Journal Article | LibreCat-ID: 16504
Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1998). Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6
LibreCat | DOI
 
[85]
1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou, E., & Meyer auf der Heide, F. (1997). Routing on asyncronous processor networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/bfb0002741
LibreCat | DOI
 
[84]
1997 | Journal Article | LibreCat-ID: 16567
Meyer auf der Heide, F., Storch, M., & Wanka, R. (1997). Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems, 627–644. https://doi.org/10.1007/s002240000071
LibreCat | DOI
 
[83]
1997 | Book Chapter | LibreCat-ID: 16568
Fischer, M., Meyer auf der Heide, F., & Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. In Algorithms — ESA ’97. Berlin, Heidelberg. https://doi.org/10.1007/3-540-63397-9_13
LibreCat | DOI
 
[82]
1997 | Conference Paper | LibreCat-ID: 16689
Maggs, B. M., Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1997). Exploiting locality for data management in systems of limited bandwidth. In Proceedings 38th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1997.646117
LibreCat | DOI
 
[81]
1997 | Journal Article | LibreCat-ID: 16564
Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R. (1997). A lower bound for randomized algebraic decision trees. Computational Complexity, 357–375. https://doi.org/10.1007/bf01270387
LibreCat | DOI
 
[80]
1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide, F., & Vöcking, B. (1997). Static and dynamic data management in networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/bfb0002716
LibreCat | DOI
 
[79]
1997 | Journal Article | LibreCat-ID: 16565
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1997). Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation, 103–120. https://doi.org/10.1006/inco.1997.2642
LibreCat | DOI
 
[78]
1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1997). Allocating weighted jobs in parallel. In Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97. https://doi.org/10.1145/258492.258522
LibreCat | DOI
 
[77]
1997 | Journal Article | LibreCat-ID: 16566
Breslauer, D., Czumaj, A., Dubhashi, D. P., & Meyer auf der Heide, F. (1997). Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters, 103–110. https://doi.org/10.1016/s0020-0190(97)00032-x
LibreCat | DOI
 
[76]
1997 | Book Chapter | LibreCat-ID: 16605
Bäumker, A., & Meyer auf der Heide, F. (1997). Communication efficient parallel searching. In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_21
LibreCat | DOI
 
[75]
1997 | Book Chapter | LibreCat-ID: 16693
Meyer auf der Heide, F., & Decker, T. (1997). Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In Informatik ’97 Informatik als Innovationsmotor. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60831-5_22
LibreCat | DOI
 
[74]
1997 | Conference Paper | LibreCat-ID: 2175
Bock, S., Meyer auf der Heide, F., & Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.
LibreCat | Files available
 
[73]
1996 | Journal Article | LibreCat-ID: 16699
Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1996). Strongly adaptive token distribution. Algorithmica, 413–427. https://doi.org/10.1007/bf01955042
LibreCat | DOI
 
[72]
1996 | Book (Editor) | LibreCat-ID: 16702
Meyer auf der Heide, F., & Monien, B. (Eds.). (1996). Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0
LibreCat | DOI
 
[71]
1996 | Conference Paper | LibreCat-ID: 2183
Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 370--379).
LibreCat | Files available
 
[70]
1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink, P., Meyer auf der Heide, F., & Stemann, V. (1996). Fault-tolerant shared memory simulations. In STACS 96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_16
LibreCat | DOI
 
[69]
1996 | Conference Paper | LibreCat-ID: 2184
Meyer auf der Heide, F., & Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.
LibreCat | Files available
 
[68]
1996 | Conference Paper | LibreCat-ID: 2186
Cypher, R., Meyer auf der Heide, F., Scheideler, C., & Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM.
LibreCat | Files available
 
[67]
1996 | Journal Article | LibreCat-ID: 16700
Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1996). Efficient PRAM simulation on a distributed memory machine. Algorithmica, 517–542. https://doi.org/10.1007/bf01940878
LibreCat | DOI
 
[66]
1996 | Journal Article | LibreCat-ID: 16698
Ameur, F., Fischer, P., Höffgen, K.-U., & Meyer auf der Heide, F. (1996). Trial and error. A new approach to space-bounded learning. Acta Informatica, 621–630. https://doi.org/10.1007/bf03036467
LibreCat | DOI
 
[65]
1996 | Journal Article | LibreCat-ID: 16701
Gil, J., Meyer auf der Heide, F., & Wigderson, A. (1996). The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing, 936–955. https://doi.org/10.1137/s0097539793255722
LibreCat | DOI
 
[64]
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci., (2), 245--281. https://doi.org/10.1016/0304-3975(96)00032-1
LibreCat | DOI
 
[63]
1995 | Conference Paper | LibreCat-ID: 16707
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Improved optimal shared memory simulations, and the power of reconfiguration. In Proceedings Third Israel Symposium on the Theory of Computing and Systems. https://doi.org/10.1109/istcs.1995.377051
LibreCat | DOI
 
[62]
1995 | Conference Paper | LibreCat-ID: 2208
Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS (pp. 267--278).
LibreCat | Files available
 
[61]
1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide, F., & Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In STACS 95. Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_81
LibreCat | DOI
 
[60]
1995 | Book Chapter | LibreCat-ID: 16874
Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_131
LibreCat | DOI
 
[59]
1995 | Book Chapter | LibreCat-ID: 16705
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_133
LibreCat | DOI
 
[58]
1995 | Book Chapter | LibreCat-ID: 16717
Meyer auf der Heide, F., & Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_77
LibreCat | DOI
 
[57]
1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide, F., Storch, M., & Wanka, R. (1995). Optimal trade-offs between size and slowdown for universal parallel networks. In Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95. https://doi.org/10.1145/215399.215430
LibreCat | DOI
 
[56]
1995 | Conference Paper | LibreCat-ID: 2187
Meyer auf der Heide, F., & Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp. 341--354). https://doi.org/10.1007/3-540-60313-1_154
LibreCat | Files available | DOI
 
[55]
1995 | Conference Paper | LibreCat-ID: 2207
Meyer auf der Heide, F., & Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In SPAA (pp. 137--146).
LibreCat | Files available
 
[54]
1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., & Tarjan, R. E. (1994). Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing, 738–761. https://doi.org/10.1137/s0097539791194094
LibreCat | DOI
 
[53]
1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1993). Strongly adaptive token distribution. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_89
LibreCat | DOI
 
[52]
1993 | Conference Paper | LibreCat-ID: 16731
Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). Simple, efficient shared memory simulations. In Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93. https://doi.org/10.1145/165231.165246
LibreCat | DOI
 
[51]
1993 | Journal Article | LibreCat-ID: 16729
Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). An Optimal Parallel Dictionary. Information and Computation, 196–217. https://doi.org/10.1006/inco.1993.1007
LibreCat | DOI
 
[50]
1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier, K., & Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_46
LibreCat | DOI
 
[49]
1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In Data structures and efficient algorithms. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55488-2_31
LibreCat | DOI
 
[48]
1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56731-3_3
LibreCat | DOI
 
[47]
1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide, F., & Pham, H. T. (1992). On the performance of networks with multiple busses. In STACS 92. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_176
LibreCat | DOI
 
[46]
1992 | Conference Paper | LibreCat-ID: 16736
Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1992). Efficient PRAM simulation on a distributed memory machine. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92. https://doi.org/10.1145/129712.129743
LibreCat | DOI
 
[45]
1992 | Book Chapter | LibreCat-ID: 16737
Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). Dynamic Hashing in Real Time. In TEUBNER-TEXTE zur Informatik. Wiesbaden. https://doi.org/10.1007/978-3-322-95233-2_7
LibreCat | DOI
 
[44]
1990 | Book Chapter | LibreCat-ID: 16738
Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). A new universal class of hash functions and dynamic hashing in real time. In Automata, Languages and Programming. Berlin/Heidelberg. https://doi.org/10.1007/bfb0032018
LibreCat | DOI
 
[43]
1990 | Book Chapter | LibreCat-ID: 16740
Karpinski, M., & Meyer auf der Heide, F. (1990). On the complexity of genuinely polynomial computation. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029630
LibreCat | DOI
 
[42]
1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029597
LibreCat | DOI
 
[41]
1990 | Conference Paper | LibreCat-ID: 16741
Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). How to distribute a dictionary in a complete network. In Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90. https://doi.org/10.1145/100216.100229
LibreCat | DOI
 
[40]
1990 | Conference Paper | LibreCat-ID: 16742
Gil, J., Meyer auf der Heide, F., & Wigderson, A. (1990). Not all keys can be hashed in constant time. In Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90. https://doi.org/10.1145/100216.100247
LibreCat | DOI
 
[39]
1990 | Journal Article | LibreCat-ID: 16824
Meyer auf der Heide, F. (1990). Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum, 13(4), 231–232.
LibreCat
 
[38]
1989 | Book Chapter | LibreCat-ID: 16745
Meyer auf der Heide, F. (1989). On genuinely time bounded computations. In STACS 89. Berlin/Heidelberg. https://doi.org/10.1007/bfb0028969
LibreCat | DOI
 
[37]
1989 | Book Chapter | LibreCat-ID: 16746
Meyer auf der Heide, F., & Wanka, R. (1989). Time-optimal simulations of networks by universal parallel computers. In STACS 89. Berlin/Heidelberg. https://doi.org/10.1007/bfb0028978
LibreCat | DOI
 
[36]
1989 | Book Chapter | LibreCat-ID: 16789
Meyer auf der Heide, F. (1989). Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In STACS 89. Berlin, Heidelberg. https://doi.org/10.1007/bfb0028983
LibreCat | DOI
 
[35]
1989 | Journal Article | LibreCat-ID: 16743
Just, B., Meyer auf der Heide, F., & Wigderson, A. (1989). On computations with integer division. RAIRO - Theoretical Informatics and Applications, 101–111. https://doi.org/10.1051/ita/1989230101011
LibreCat | DOI
 
[34]
1989 | Conference Paper | LibreCat-ID: 16744
Dietzfelbinger, M., & Meyer auf der Heide, F. (1989). An optimal parallel dictionary. In Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89. https://doi.org/10.1145/72935.72974
LibreCat | DOI
 
[33]
1988 | Journal Article | LibreCat-ID: 16764
Meyer auf der Heide, F. (1988). Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM), 740–747. https://doi.org/10.1145/44483.44490
LibreCat | DOI
 
[32]
1988 | Journal Article | LibreCat-ID: 16765
Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1988). A tradeoff between search and update time for the implicit dictionary problem. Theoretical Computer Science, 57–68. https://doi.org/10.1016/0304-3975(88)90018-7
LibreCat | DOI
 
[31]
1988 | Conference Paper | LibreCat-ID: 16766
Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., & Tarjan, R. E. (1988). Dynamic perfect hashing: upper and lower bounds. In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1988.21968
LibreCat | DOI
 
[30]
1988 | Book Chapter | LibreCat-ID: 16767
Just, B., Mathematik, F., Meyer auf der Heide, F., Informatik, F., & Wigderson, A. (1988). On computations with integer division. In STACS 88. Berlin, Heidelberg. https://doi.org/10.1007/bfb0035829
LibreCat | DOI
 
[29]
1988 | Journal Article | LibreCat-ID: 16763
Babai, L., Just, B., & Meyer auf der Heide, F. (1988). On the limits of computations with the floor function. Information and Computation, 99–107. https://doi.org/10.1016/0890-5401(88)90031-4
LibreCat | DOI
 
[28]
1988 | Book Chapter | LibreCat-ID: 16768
Dietzfelbinger, M., Mehlhorn, K., Meyer auf der Heide, F., & Rohnert, H. (1988). Upper and lower bounds for the dictionary problem. In SWAT 88. Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_24
LibreCat | DOI
 
[27]
1987 | Journal Article | LibreCat-ID: 16772
Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1987). A Time-Space Tradeoff for Element Distinctness. SIAM Journal on Computing, 97–99. https://doi.org/10.1137/0216007
LibreCat | DOI
 
[26]
1987 | Journal Article | LibreCat-ID: 16773
Meyer auf der Heide, F., & Wigderson, A. (1987). The Complexity of Parallel Sorting. SIAM Journal on Computing, 100–107. https://doi.org/10.1137/0216008
LibreCat | DOI
 
[25]
1986 | Journal Article | LibreCat-ID: 16771
Meyer auf der Heide, F. (1986). Efficient Simulations among Several Models of Parallel Computers. SIAM Journal on Computing, 106–119. https://doi.org/10.1137/0215008
LibreCat | DOI
 
[24]
1986 | Book Chapter | LibreCat-ID: 16776
Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1986). A time-space tradeoff for element distinctness. In STACS 86. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_89
LibreCat | DOI
 
[23]
1986 | Book Chapter | LibreCat-ID: 16774
Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1986). A tradeoff between search and update time for the implicit dictionary problem. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_54
LibreCat | DOI
 
[22]
1986 | Book Chapter | LibreCat-ID: 16775
Meyer auf der Heide, F. (1986). Speeding up random access machines by few processors. In STACS 86. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_72
LibreCat | DOI
 
[21]
1985 | Conference Paper | LibreCat-ID: 16783
Fich, F. E., Meyer auf der Heide, F., Ragde, P., & Wigderson, A. (1985). One, two, three . . . infinity: lower bounds for parallel computation. In Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85. https://doi.org/10.1145/22145.22151
LibreCat | DOI
 
[20]
1985 | Conference Paper | LibreCat-ID: 16788
Meyer auf der Heide, F. (1985). Nondeterministic versus probabilistic linear search algorithms. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). https://doi.org/10.1109/sfcs.1985.38
LibreCat | DOI
 
[19]
1985 | Conference Paper | LibreCat-ID: 16784
Meyer auf der Heide, F. (1985). Fast algorithms for n-dimensional restrictions of hard problems. In Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85. https://doi.org/10.1145/22145.22191
LibreCat | DOI
 
[18]
1985 | Journal Article | LibreCat-ID: 16823
Meyer auf der Heide, F. (1985). Lower time bounds for solving linear diophantine equations on several parallel computational models. Information and Control, 67(1–3), 195–211. https://doi.org/10.1016/S0019-9958(85)80035-8
LibreCat | DOI
 
[17]
1985 | Journal Article | LibreCat-ID: 16780
Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM), 929–937. https://doi.org/10.1145/4221.4250
LibreCat | DOI
 
[16]
1985 | Journal Article | LibreCat-ID: 16779
Lautemann, C., & Meyer auf der Heide, F. (1985). Lower time bounds for integer programming with two variables. Information Processing Letters, 101–105. https://doi.org/10.1016/0020-0190(85)90042-0
LibreCat | DOI
 
[15]
1985 | Journal Article | LibreCat-ID: 16781
Meyer auf der Heide, F. (1985). Simulating probabilistic by deterministic algebraic computation trees. Theoretical Computer Science, 325–330. https://doi.org/10.1016/0304-3975(85)90079-9
LibreCat | DOI
 
[14]
1985 | Conference Paper | LibreCat-ID: 16782
Meyer auf der Heide, F., & Wigderson, A. (1985). The complexity of parallel sorting. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). https://doi.org/10.1109/sfcs.1985.58
LibreCat | DOI
 
[13]
1984 | Journal Article | LibreCat-ID: 16785
Meyer auf der Heide, F. (1984). A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. Journal of the ACM (JACM), 668–676. https://doi.org/10.1145/828.322450
LibreCat | DOI
 
[12]
1984 | Conference Paper | LibreCat-ID: 16786
Meyer auf der Heide, F., & Reischuk, R. (1984). On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication. In 25th Annual Symposium onFoundations of Computer Science, 1984. https://doi.org/10.1109/sfcs.1984.715901
LibreCat | DOI
 
[11]
1984 | Book Chapter | LibreCat-ID: 16787
Meyer auf der Heide, F. (1984). Efficient simulations among several models of parallel computers (extended abstract). In STACS 84. Berlin, Heidelberg. https://doi.org/10.1007/3-540-12920-0_20
LibreCat | DOI
 
[10]
1983 | Journal Article | LibreCat-ID: 16808
Meyer auf der Heide, F. (1983). Infinite cube-connected cycles. Information Processing Letters, 1–2. https://doi.org/10.1016/0020-0190(83)90001-7
LibreCat | DOI
 
[9]
1983 | Book Chapter | LibreCat-ID: 16810
Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0036483
LibreCat | DOI
 
[8]
1983 | Conference Paper | LibreCat-ID: 16809
Meyer auf der Heide, F. (1983). A polynomial linear search algorithm for the n-dimensional knapsack problem. In Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83. https://doi.org/10.1145/800061.808734
LibreCat | DOI
 
[7]
1983 | Journal Article | LibreCat-ID: 16806
Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. Acta Informatica, 269–296. https://doi.org/10.1007/bf00265559
LibreCat | DOI
 
[6]
1983 | Journal Article | LibreCat-ID: 16807
Klein, P., & Meyer auf der Heide, F. (1983). A lower time bound for the knapsack problem on random access machines. Acta Informatica, 385–395. https://doi.org/10.1007/bf00290735
LibreCat | DOI
 
[5]
1981 | Book Chapter | LibreCat-ID: 16813
Meyer auf der Heide, F., & Rollik, A. (1981). Random access machines and straight-line programs. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_29
LibreCat | DOI
 
[4]
1981 | Journal Article | LibreCat-ID: 16820
Meyer auf der Heide, F. (1981). A comparison of two variations of a pebble game on graphs. Theoretical Computer Science, 315–322. https://doi.org/10.1016/s0304-3975(81)80004-7
LibreCat | DOI
 
[3]
1981 | Book Chapter | LibreCat-ID: 16814
Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel computers. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_111
LibreCat | DOI
 
[2]
1980 | Book Chapter | LibreCat-ID: 16815
Klein, P., & Meyer auf der Heide, F. (1980). Untere Zeitschranken für das Rucksack-Problem. In GI - 10. Jahrestagung. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_34
LibreCat | DOI
 
[1]
1979 | Journal Article | LibreCat-ID: 16812
Meyer auf der Heide, F. (1979). A comparison of two variations of a pebble game on graphs. Automata, Languages and Programming. ICALP 1979, 411–421. https://doi.org/10.1007/3-540-09510-1_32
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed