en
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.
149 Publications
1989 | Book Chapter | LibreCat-ID: 16789
Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” STACS 89, 1989, doi:10.1007/bfb0028983.
LibreCat
| DOI
1988 | Book Chapter | LibreCat-ID: 16767
Just, Bettina, et al. “On Computations with Integer Division.” STACS 88, 1988, doi:10.1007/bfb0035829.
LibreCat
| DOI
1988 | Book Chapter | LibreCat-ID: 16768
Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.” SWAT 88, 1988, doi:10.1007/3-540-19487-8_24.
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16776
Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” STACS 86, 1986, doi:10.1007/3-540-16078-7_89.
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16774
Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” Automata, Languages and Programming, 1986, doi:10.1007/3-540-16761-7_54.
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16775
Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” STACS 86, 1986, doi:10.1007/3-540-16078-7_72.
LibreCat
| DOI
1984 | Book Chapter | LibreCat-ID: 16787
Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” STACS 84, 1984, doi:10.1007/3-540-12920-0_20.
LibreCat
| DOI
1981 | Book Chapter | LibreCat-ID: 16813
Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” Fundamentals of Computation Theory, 1981, doi:10.1007/3-540-10854-8_29.
LibreCat
| DOI
1981 | Book Chapter | LibreCat-ID: 16814
Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” Lecture Notes in Computer Science, 1981, doi:10.1007/3-540-10856-4_111.
LibreCat
| DOI