Tamás Lukovszki

Period. Polytech. Electr. Eng. Comput. Sci., 2022

2020

Asynchronous Filling by Myopic Luminous Robots.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2020

2019

Asynchronous Filling by Luminous Robots.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Approximate and incremental network function placement.

[BibT_eX]

[DOI]

Matthias Rost

Stefan Schmid

J. Parallel Distributed Comput., 2018

Filling Arbitrary Connected Areas by Silent Robots with Minimum Visibility Range.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2018

2017

Uniform dispersal of silent oblivious robots.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Symposium on Intelligent Systems and Informatics, 2017

Uniform Dispersal of Robots with Minimum Visibility Range.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2017

2016

It's a Match!: Near-Optimal and Incremental Middlebox Deployment.

[BibT_eX]

[DOI]

Matthias Rost

Stefan Schmid

Comput. Commun. Rev., 2016

2015

Online Admission Control and Embedding of Service Chains.

[BibT_eX]

[DOI]

Stefan Schmid

Proceedings of the Structural Information and Communication Complexity, 2015

2014

Surrounding Robots - A Discrete Localized Solution for the Intruder Problem -.

[BibT_eX]

[DOI]

J. Adv. Comput. Intell. Intell. Informatics, 2014

Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots.

[BibT_eX]

[DOI]

Friedhelm Meyer auf der Heide

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013

On a balanced neighbor selection strategy for tracker-based peer-to-peer networks.

[BibT_eX]

[DOI]

Sándor Laki

Proceedings of the 13th IEEE International Conference on Peer-to-Peer Computing, 2013

Balanced Neighbor Selection for BitTorrent-Like Networks.

[BibT_eX]

[DOI]

Sándor Laki

Proceedings of the Algorithms - ESA 2013, 2013

Fast Localized Sensor Self-Deployment for Focused Coverage.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Modeling resource constrained BitTorrent proxies for energy efficient mobile content sharing.

[BibT_eX]

[DOI]

Peer-to-Peer Netw. Appl., 2012

Simulating Network Coding for Accelerating Tit-for-Tat in Peer-to-Peer Content Sharing.

[BibT_eX]

[DOI]

Akos Ludanyi

Proceedings of the Information and Communication Technologies, 2012

Target Surrounding Solution for Swarm Robots.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Technologies, 2012

Surrounding robots - A localized solution for the intruder problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE 3rd International Conference on Cognitive Infocommunications, 2012

2011

Extending mobile BitTorrent environment with network coding.

[BibT_eX]

[DOI]

Jukka Kalevi Nurminen

Proceedings of the 2011 IEEE Consumer Communications and Networking Conference, 2011

2010

Space Efficient Algorithms for the Burrows-Wheeler Backtransformation.

[BibT_eX]

[DOI]

Ulrich Lauther

Algorithmica, 2010

Evaluating Dynamically Evolving Mobile-Based Social Networks.

[BibT_eX]

[DOI]

Hassan Charaf

Acta Cybern., 2010

Experiences with Phonebook-Centric Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 7th IEEE Consumer Communications and Networking Conference, 2010

2006

Resource Efficient Maintenance of Wireless Network Topologies.

[BibT_eX]

[DOI]

Christian Schindelhauer

Klaus Volbert

J. Univers. Comput. Sci., 2006

I/O-Efficient Well-Separated Pair Decomposition and Applications.

[BibT_eX]

[DOI]

Algorithmica, 2006

2003

Worst case mobility in ad hoc networks.

[BibT_eX]

[DOI]

Christian Schindelhauer

Stefan Rührup

Klaus Volbert

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

András A. Benczúr

Uwe Glässer

Proceedings of the Abstract State Machines, 2003

2002

Distributed Maintenance of Resource Efficient Wireless Network Topologies (Distinguished Paper).

[BibT_eX]

[DOI]

Matthias Grünewald

Christian Schindelhauer

Klaus Volbert

Proceedings of the Euro-Par 2002, 2002

2001

I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.

[BibT_eX]

[DOI]

Anil Maheshwari

Norbert Zeh

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

2000

I/O-Efficient Well-Separated Pair Decomposition and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1999

New results on geometric spanners and their applications.

[BibT_eX]

[DOI]

PhD thesis, 1999

New Results of Fault Tolerant Geometric Spanners.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Partitioned neighborhood spanners of minimal outdegree.

[BibT_eX]

[DOI]

Matthias Fischer

Martin Ziegler

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

A Network Based Approach for Realtime Walkthrough of Massive Models.

[BibT_eX]

Matthias Fischer

Martin Ziegler

Proceedings of the Algorithm Engineering, 2nd International Workshop, 1998

Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.

[BibT_eX]

[DOI]

Matthias Fischer