Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

12 Publications


2020 | Journal Article | LibreCat-ID: 16299
Gathering Anonymous, Oblivious Robots on a Grid
J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical Computer Science 815 (2020) 289–309.
LibreCat | DOI
 

2019 | Journal Article | LibreCat-ID: 2916
Complexity of single-swap heuristics for metric facility location and related problems
S. Brauer, Theoretical Computer Science 754 (2019) 88–106.
LibreCat | DOI
 

2013 | Journal Article | LibreCat-ID: 16451
Energy-efficient strategies for building short chains of mobile robots locally
P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, Theoretical Computer Science (2013) 97–112.
LibreCat | DOI
 

2009 | Journal Article | LibreCat-ID: 2999
Sampling methods for shortest vectors, closest vectors and successive minima
J. Blömer, S. Naewe, Theoretical Computer Science (2009) 1648–1665.
LibreCat | DOI
 

2009 | Journal Article | LibreCat-ID: 16429
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
J. Kutyłowski, F. Meyer auf der Heide, Theoretical Computer Science (2009) 3391–3405.
LibreCat | DOI
 

2005 | Journal Article | LibreCat-ID: 15058
Stability versus speed in a computable algebraic model
M. Ziegler, Theoretical Computer Science (2005) 14–26.
LibreCat | DOI
 

2004 | Journal Article | LibreCat-ID: 16521
New spectral lower bounds on the bisection width of graphs
S. Bezrukov, R. Elsässer, B. Monien, R. Preis, J.-P. Tillich, Theoretical Computer Science (2004) 155–174.
LibreCat | DOI
 

1998 | Journal Article | LibreCat-ID: 16503
Routing on networks of optical crossbars
F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science (1998) 181–200.
LibreCat | DOI
 

1998 | Journal Article | LibreCat-ID: 16504
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.
LibreCat | DOI
 

1988 | Journal Article | LibreCat-ID: 16765
A tradeoff between search and update time for the implicit dictionary problem
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical Computer Science (1988) 57–68.
LibreCat | DOI
 

1985 | Journal Article | LibreCat-ID: 16781
Simulating probabilistic by deterministic algebraic computation trees
F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.
LibreCat | DOI
 

1981 | Journal Article | LibreCat-ID: 16820
A comparison of two variations of a pebble game on graphs
F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.
LibreCat | DOI
 

Filters and Search Terms

issn=0304-3975

Search

Filter Publications

Display / Sort

Export / Embed