@article{16764, author = {{Meyer auf der Heide, Friedhelm}}, issn = {{0004-5411}}, journal = {{Journal of the ACM (JACM)}}, pages = {{740--747}}, title = {{{Fast algorithms for N-dimensional restrictions of hard problems}}}, doi = {{10.1145/44483.44490}}, year = {{1988}}, } @article{16765, author = {{Borodin, Allan and Fich, Faith E. and Meyer auf der Heide, Friedhelm and Upfal, Eli and Wigderson, Avi}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, pages = {{57--68}}, title = {{{A tradeoff between search and update time for the implicit dictionary problem}}}, doi = {{10.1016/0304-3975(88)90018-7}}, year = {{1988}}, } @inproceedings{16766, author = {{Dietzfelbinger, M. and Karlin, A. and Mehlhorn, K. and Meyer auf der Heide, Friedhelm and Rohnert, H. and Tarjan, R.E.}}, booktitle = {{[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science}}, isbn = {{0818608773}}, title = {{{Dynamic perfect hashing: upper and lower bounds}}}, doi = {{10.1109/sfcs.1988.21968}}, year = {{1988}}, } @inbook{16767, author = {{Just, Bettina and Mathematik, Fb and Meyer auf der Heide, Friedhelm and Informatik, Fb and Wigderson, Avi}}, booktitle = {{STACS 88}}, isbn = {{9783540188346}}, issn = {{0302-9743}}, title = {{{On computations with integer division}}}, doi = {{10.1007/bfb0035829}}, year = {{1988}}, } @inbook{16768, author = {{Dietzfelbinger, M. and Mehlhorn, K. and Meyer auf der Heide, Friedhelm and Rohnert, H.}}, booktitle = {{SWAT 88}}, isbn = {{9783540194873}}, issn = {{0302-9743}}, title = {{{Upper and lower bounds for the dictionary problem}}}, doi = {{10.1007/3-540-19487-8_24}}, year = {{1988}}, } @article{16772, author = {{Borodin, A. and Fich, F. and Meyer auf der Heide, Friedhelm and Upfal, E. and Wigderson, A.}}, issn = {{0097-5397}}, journal = {{SIAM Journal on Computing}}, pages = {{97--99}}, title = {{{A Time-Space Tradeoff for Element Distinctness}}}, doi = {{10.1137/0216007}}, year = {{1987}}, } @article{16773, author = {{Meyer auf der Heide, Friedhelm and Wigderson, Avi}}, issn = {{0097-5397}}, journal = {{SIAM Journal on Computing}}, pages = {{100--107}}, title = {{{The Complexity of Parallel Sorting}}}, doi = {{10.1137/0216008}}, year = {{1987}}, } @article{16771, author = {{Meyer auf der Heide, Friedhelm}}, issn = {{0097-5397}}, journal = {{SIAM Journal on Computing}}, pages = {{106--119}}, title = {{{Efficient Simulations among Several Models of Parallel Computers}}}, doi = {{10.1137/0215008}}, year = {{1986}}, } @inbook{16774, author = {{Borodin, Allan and Fich, Faith E. and Meyer auf der Heide, Friedhelm and Upfal, Eli and Wigderson, Avi}}, booktitle = {{Automata, Languages and Programming}}, isbn = {{9783540167617}}, issn = {{0302-9743}}, title = {{{A tradeoff between search and update time for the implicit dictionary problem}}}, doi = {{10.1007/3-540-16761-7_54}}, year = {{1986}}, } @inbook{16775, author = {{Meyer auf der Heide, Friedhelm}}, booktitle = {{STACS 86}}, isbn = {{9783540160786}}, issn = {{0302-9743}}, title = {{{Speeding up random access machines by few processors}}}, doi = {{10.1007/3-540-16078-7_72}}, year = {{1986}}, } @inbook{16776, author = {{Borodin, A. and Fich, F. and Meyer auf der Heide, Friedhelm and Upfal, E. and Wigderson, A.}}, booktitle = {{STACS 86}}, isbn = {{9783540160786}}, issn = {{0302-9743}}, title = {{{A time-space tradeoff for element distinctness}}}, doi = {{10.1007/3-540-16078-7_89}}, year = {{1986}}, } @article{16779, author = {{Lautemann, Clemens and Meyer auf der Heide, Friedhelm}}, issn = {{0020-0190}}, journal = {{Information Processing Letters}}, pages = {{101--105}}, title = {{{Lower time bounds for integer programming with two variables}}}, doi = {{10.1016/0020-0190(85)90042-0}}, year = {{1985}}, } @article{16780, author = {{Meyer auf der Heide, Friedhelm}}, issn = {{0004-5411}}, journal = {{Journal of the ACM (JACM)}}, pages = {{929--937}}, title = {{{Lower bounds for solving linear diophantine equations on random access machines}}}, doi = {{10.1145/4221.4250}}, year = {{1985}}, } @article{16781, author = {{Meyer auf der Heide, Friedhelm}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, pages = {{325--330}}, title = {{{Simulating probabilistic by deterministic algebraic computation trees}}}, doi = {{10.1016/0304-3975(85)90079-9}}, year = {{1985}}, } @inproceedings{16782, author = {{Meyer auf der Heide, Friedhelm and Wigderson, Avi}}, booktitle = {{26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}}, isbn = {{0818606444}}, title = {{{The complexity of parallel sorting}}}, doi = {{10.1109/sfcs.1985.58}}, year = {{1985}}, } @inproceedings{16783, author = {{Fich, F E and Meyer auf der Heide, Friedhelm and Ragde, P and Wigderson, A}}, booktitle = {{Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85}}, isbn = {{0897911512}}, title = {{{One, two, three . . . infinity: lower bounds for parallel computation}}}, doi = {{10.1145/22145.22151}}, year = {{1985}}, } @inproceedings{16784, author = {{Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85}}, isbn = {{0897911512}}, title = {{{Fast algorithms for n-dimensional restrictions of hard problems}}}, doi = {{10.1145/22145.22191}}, year = {{1985}}, } @inproceedings{16788, author = {{Meyer auf der Heide, Friedhelm}}, booktitle = {{26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}}, isbn = {{0818606444}}, title = {{{Nondeterministic versus probabilistic linear search algorithms}}}, doi = {{10.1109/sfcs.1985.38}}, year = {{1985}}, } @article{16823, author = {{Meyer auf der Heide, Friedhelm}}, journal = {{Information and Control}}, number = {{1-3}}, pages = {{195--211}}, title = {{{Lower time bounds for solving linear diophantine equations on several parallel computational models}}}, doi = {{10.1016/S0019-9958(85)80035-8}}, volume = {{67}}, year = {{1985}}, } @article{16785, author = {{Meyer auf der Heide, Friedhelm}}, issn = {{0004-5411}}, journal = {{Journal of the ACM (JACM)}}, pages = {{668--676}}, title = {{{A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem}}}, doi = {{10.1145/828.322450}}, year = {{1984}}, }