dblp.uni-trier.dewww.uni-trier.de

Christian Schwarz

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2007
14 Lukas Arnold, Christoph Beetz, Jürgen Dreher, Holger Homann, Christian Schwarz, Rainer Grauer: Massively Parallel Simulations of Solar Flares and Plasma Turbulence. PARCO 2007: 467-474
2005
13EEChristian Schwarz, Stein Kåre Skytteren, Trond Marius Øvstetun: AutAT: an eclipse plugin for automatic acceptance testing of web applications. OOPSLA Companion 2005: 182-183
1998
12EEMordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid: Randomized Data Structures for the Dynamic Closest-Pair Problem. SIAM J. Comput. 27(4): 1036-1072 (1998)
1997
11EEKarl Kurbel, Georg Nenoglu, Christian Schwarz: Von der Geschäftsprozeßmodellierung zur Workflowspezifikation - Zur Kompatibilität von Modellen und Werkzeugen. HMD - Praxis Wirtschaftsinform. 198: (1997)
1995
10EEChristian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans: Minimal Enclosing Parallelogram with Application. Symposium on Computational Geometry 1995: C34-C35
9 Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid: Static and Dynamic Algorithms for k-Point Clustering Problems. J. Algorithms 19(3): 474-503 (1995)
8 Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid: Simple Randomized Algorithms for Closest Pair Problems. Nord. J. Comput. 2(1): 3-27 (1995)
1994
7 Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink: An Optimal Algorithm for the On-Line Closest-Pair Problem. Algorithmica 12(1): 18-29 (1994)
1993
6 Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid: Simple Randomized Algorithms for Closest Pair Problems. CCCG 1993: 246-251
5 Günter Rote, Christian Schwarz, Jack Snoeyink: Maintaining the Approximate Width of a Set of Points in the Plane. CCCG 1993: 258-263
4 Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid: Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA 1993: 301-310
3 Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid: Static and Dynamic Algorithms for k-Point Clustering Problems. WADS 1993: 265-276
1992
2EEChristian Schwarz, Michiel H. M. Smid: An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem. SODA 1992: 280-285
1EEChristian Schwarz, Michiel H. M. Smid, Jack Snoeyink: An Optimal Algorithm for the On-Line Closest-Pair Problem. Symposium on Computational Geometry 1992: 330-336

Coauthor Index

1Lukas Arnold [14]
2Christoph Beetz [14]
3Amitava Datta [3] [9]
4Jürgen Dreher [14]
5Brian L. Evans [10]
6Mordecai J. Golin [4] [6] [8] [12]
7Rainer Grauer [14]
8Holger Homann [14]
9Karl Kurbel [11]
10Hans-Peter Lenhof [3] [9]
11Georg Nenoglu [11]
12Trond Marius Øvstetun [13]
13Rajeev Raman [4] [6] [8] [12]
14Günter Rote [5]
15Stein Kåre Skytteren [13]
16Michiel H. M. Smid [1] [2] [3] [4] [6] [7] [8] [9] [12]
17Jack Snoeyink [1] [5] [7]
18Jürgen Teich [10]
19Alek Vainshtein (Alexander Vainshtein) [10]
20Emo Welzl [10]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)