Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Property Testing in Computational Geometry
A. Czumaj, C. Sohler, M. Ziegler, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), Springer, Berlin, Heidelberg, 2000, pp. 155–166.
LibreCat: /record/17990
DOI: 10.1007/3-540-45253-2_15

Medienbildung und Gesellschaft
J. Fromme, S. Ganguin, S. Iske, D.M. Meister, U. Sander, eds., Medienbildung und Gesellschaft, VS Verlag, 2000.
LibreCat: /record/18121

Computing the Dimension of Linear Subspaces
M. Ziegler, V. Brattka, in: SOFSEM 2000: Theory and Practice of Informatics, Springer, Berlin, Heidelberg, 2000, pp. 450–458.
LibreCat: /record/18146
DOI: 10.1007/3-540-44411-4_34

Complexity Theory and Algorithms
F. Meyer auf der Heide, M. Kutyowski, P. Ragde, in: Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI
J. Simon, A. Reinefeld, O. Heinz, in: H. Hellwagner, A. Reinefeld (Eds.), SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters, Springer, Berlin / Heidelberg, 1999, pp. 367–381.
LibreCat: /record/2435
DOI: 10.1007/10704208

Eine quasistationäre Meßmethode zur Ermittlung der Wärmeleitfähigkeit polymerer Zwischenschichten in Abhängigkeit von der Temperatur
M. Koyro, G. Meschut, in: Tagungsband Zur Veranstaltung Werkstoffprüfung 1999, 1999, pp. 173–184.
LibreCat: /record/20992

New Results on Fault Tolerant Geometric Spanners
T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.
LibreCat: /record/18959
DOI: 10.1007/3-540-48447-7_20

Provably Good and Practical Strategies for Non-uniform Data Management in Networks
F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

Communication Synthesis for Reconfigurable Embedded Systems
M. Eisenring, M. Platzner, L. Thiele, in: Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL), Springer, 1999, pp. 205–214.
LibreCat: /record/13608
DOI: 10.1007/978-3-540-48302-1_21

Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.
LibreCat: /record/17412
DOI: 10.1007/3-540-68530-8_14

Communication-efficient parallel multiway and approximate minimum cut computation
F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.
LibreCat: /record/16562
DOI: 10.1007/bfb0054332

Acceleration of satisfiability algorithms by reconfigurable hardware
M. Platzner, G. De Micheli, in: Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) , Springer , Berlin, Heidelberg, 1998, pp. 69–78.
LibreCat: /record/13606
DOI: 10.1007/bfb0055234

Bounded degree spanning trees
A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.
LibreCat: /record/19869
DOI: 10.1007/3-540-63397-9_9

Denesting by bounded degree radicals
J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

Dynamic data structures for realtime management of large geometric scenes
M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 1157–170.
LibreCat: /record/16568
DOI: 10.1007/3-540-63397-9_13

Static and dynamic data management in networks
F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat: /record/16569
DOI: 10.1007/bfb0002716

Communication efficient parallel searching
A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.
LibreCat: /record/16605
DOI: 10.1007/3-540-63138-0_21

Routing on asyncronous processor networks
E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat: /record/16687
DOI: 10.1007/bfb0002741

Learning a representation for optimizable formulas
H. Kleine Büning, T. Lettmann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996.
LibreCat: /record/19816
DOI: 10.1007/3-540-61863-5_33