CINXE.COM

Chair of Prof. Seidel

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"> <html> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8"> <meta name="author" content="Christian Engels"> <title>Chair of Prof. Seidel</title> </head> <body bgcolor="#ffffff"> <a name="Anfang"></a><p style="margin-bottom: 0cm"><img src="static/img/ICpoint.gif" alt="---" align="bottom" width="100%" height="2" border="0"></p> <!-- main header --> <center> <table width="100%" border="0" cellpadding="2" cellspacing="2"> <tr> <td> <p align="center"><font size="5">F</font><font size="3">achrichtung</font> <font size="5">6.2</font> <br><a href="http://www.cs.uni-saarland.de/"><img src="static/img/eule_bunt.gif" name="Graphic3" alt="[Informatik]" align="bottom" width="100" height="100" border="0"></a> <br><font size="3">Informatik</font> </p> </td> <td> <p align="center"><font size="5">Chair of Theoretical Computer Science<br><br><strong>Prof. Dr. Raimund Seidel</strong></font></p> </td> <td> <p align="center"><font size="5" color="#0040b0">T</font><font size="3">heoretical</font> <br><a href="static/img/voronoi_large.jpeg"><img src="static/img/voronoi.gif" name="Graphic4" alt="[Voronoi]" align="bottom" width="100" height="100" border="0"></a> <br><font size="5" color="#0050b0">C</font><font size="3">omputer</font> <font size="5" color="#0040b0">S</font><font size="3">cience</font> </p> </td> </tr> </table> </center> <p><br><img src="static/img/ICpoint.gif" alt="----" align="bottom" width="100%" height="2" border="0"></p> <!-- Navigation --> <center> <table cellpadding="2" cellspacing="2"> <tr> <td><p><a href="index.html#Forschung"><img src="static/img/ICbulb.gif" alt="[forschung]" align="middle" width="40" height="40" border="0">Research</a></p></td> <td width="50"></td> <td><p><a href="index.html#Publikationen"><img src="static/img/ICbook.gif" alt="[publications]" align="middle" width="40" height="40" border="0">Publications</a></p></td> </tr> <tr> <td><p><a href="index.html#Lehre"><img src="static/img/ICboard.gif" alt="[courses]" align="middle" width="40" height="40" border="0">Courses</a></p></td> <td width="50"></td> <td><p><a href="index.html#Adresse"><img src="static/img/ICsign.gif" alt="[address]" align="middle" width="40" height="40" border="0">Address</a></p></td> </tr> <tr> <td><p><a href="index.html#Personen"><img src="static/img/ICpeople.gif" alt="[People]" align="middle" width="40" height="40" border="0">People</a></p></td> <td width="50"></td> <td><p><a href="index.html#Ressourcen"><img src="static/img/ICjack.gif" alt="[ressources]" align="middle" width="40" height="40" border="0">Ressources</a></p></td> </tr> </table> </center> <p><a name="Forschung"></a><br><img src="static/img/ICpoint.gif" align="bottom" alt="----" width="100%" height="2" border="0"></p> <h2>Research</h2> <p>The main area of research in this unit is the design and the analysis of efficient algorithms and data structures, especially for geomtric problems. Typical examples are computational problems involving higher-dimensional polyhedra, localizing query points amidst a very large number of geometric objects, and approximative geometric query answering. As ancillary subjects we also study combinatorial geometry and randomization.</p> <p>Currently the following more specific topics are being investigated: the efficient encoding of complicated geometric data structures such as triangulations, complexes, or arrangements; computations with complicated geometric objects such as ellipsoids; geometric algorithms in the ``transdichotomous model&#x27;&#x27;, i.e. the exploitation of the limited parallelism provided by the usual computer word operations.</p> <p><a href="index.html#Anfang"><img src="static/img/ICuparrow.gif" alt="[Up]" align="bottom" border="0" height="20" width="75"></a> <a name="Lehre"></a><img src="static/img/ICpoint.gif" align="bottom" alt="----" width="100%" height="2" border="0"></p> <h2>Courses</h2> <ul> <li><h3>Winter Term 2021/2022</h3></li> <ul> <li><h4><a href="https://cms.sic.saarland/gzad21/">Lecture "Grundz眉ge von Algorithmen und Datenstrukturen 21/22"</a></h4></li> <li><h4><a href="https://cms.sic.saarland/algodat_21/">Algorithm and Data Structures (block course)</a></h4></li> </ul> <hr> <li><h3><a href="course_past/index.html">Past Terms</a></h3></li> <li><h3>Winter Term 2020/2021</h3></li> <ul> <li><h4><a href="course/69/index.html">Lecture "Grundzuege Algorithmen und Datenstrukturen 20/21"</a></h4></li> </ul> </ul> <p><a href="index.html#Anfang"><img src="static/img/ICuparrow.gif" alt="[Up]" align="bottom" border="0" height="20" width="75"></a> <a name="Personen"></a><img src="static/img/ICpoint.gif" align="bottom" alt="----" width="100%" height="2" border="0"></p> <h2>People</h2> <ul> <li><h3>Head</h3> <dl><dt> <strong>Raimund Seidel</strong><br> E 1 3, Room 409<br> Phone: +49 (681) 302-4513 <br> Office Hour: Mo, Fr 11:00-12:00<br> E-mail: <a href="mailto: rseidel at cs.uni-saarland.de">rseidel at cs.uni-saarland.de</a> </dt> </dl> </li> <li><h3>Staff</h3> <dl> <dt> <a href="http://www.lkozma.net/research.html"><strong>L谩szl贸 Kozma</strong></a><br> Room 416<br> Phone: +49 681 302 3420<br> Office Hour: blank<br> E-mail: <a href="mailto: kozma at cs.uni-saarland.de">kozma at cs.uni-saarland.de</a> </dt> </dl> <br> <dt> <strong>Giorgi Nadiradze</strong><br> Room 421<br> Phone: +49 681 302 3235<br> Office Hour: <br> E-mail: <a href="mailto: gnadiradze at cs.uni-saarland.de">gnadiradze at cs.uni-saarland.de</a> </dt> </dl> <br> <dt> <strong>Lavinia Dinu</strong><br> Room 416<br> Phone: +49 681 302 3420<br> Office Hour: Tu, Th 12:00-13:00<br> E-mail: <a href="mailto: ldinu at cs.uni-saarland.de">ldinu at cs.uni-saarland.de</a> </dt> </dl> </li> <li><h3>Former Staff</h3> <dl> <dt> <a href="http://www.victoralvarez.net/"><strong>Victor Alvarez</strong></a> Email: <a href="mailto:alvarez at cs.uni-sb.de">alvarez at cs.uni-sb.de</a> </dt> <br> <dt> <a href="http://www-tcs.cs.uni-saarland.de/wding/"><strong>Wei Ding</strong></a> Email: <a href="mailto:wding at cs.uni-sb.de">wding at cs.uni-sb.de</a> </dt> <br> <dt> <strong>Ulrike Lehmberg</strong> Email: <a href="mailto:lehmb at cs.uni-sb.de">lehmb at cs.uni-sb.de</a> </dt> <br> <dt> <strong>Dierk Johannes</strong> Email: <a href="mailto:johannes at cs.uni-sb.de">johannes at cs.uni-sb.de</a> </dt> <br> <dt> <strong>Nicola Wolpert</strong> Email: <a href="mailto:nicola at mpi-sb.mpg.de">nicola at mpi-sb.mpg.de</a> </dt> <br> <dt> <strong>Markus Denny</strong> Email: <a href="mailto:mdenny at cs.uni-sb.de">mdenny at cs.uni-sb.de</a> </dt> <br> <dt> <strong>Frank Lehmann</strong> Email: <a href="mailto:lehmann at cs.uni-sb.de">lehmann at cs.uni-sb.de</a> </dt> <br> <dt> <strong>Saurabh Ray</strong> Email: <a href="mailto:saurabh at cs.uni-sb.de">saurabh at cs.uni-sb.de</a> </dt> <br> <dt> <a href="http://hansrajt.wordpress.com/"><strong>Hans Raj Tiwary</strong></a> Email: <a href="mailto:hansraj at cs.uni-sb.de">hansraj at cs.uni-sb.de</a> </dt> <br> <dt> <strong>J枚rg L盲ssig</strong> Email: <a href="mailto:laej at cs.uni-sb.de">laej at cs.uni-sb.de</a> </dt> <br> <dt> <a href="http://www-tcs.cs.uni-saarland.de/parduhn/"><strong>Sascha Parduhn</strong></a> Email: <a href="mailto:parduhn at cs.uni-sb.de">parduhn at cs.uni-sb.de</a> </dt> </dl> </li> <li><h3>Former Students</h3> <dl> <dt> <strong>Alexander Malkis</strong> </dt> <br> <dt> <strong>Ralf Osbild</strong> Email: <a href="mailto:osbild at mpi-sb.mpg.de">osbild at mpi-sb.mpg.de</a> </dt> <br> <dt> <strong>Udo Adamy</strong> </dt> <br> <dt> <strong>Torsten B眉cheler</strong> Email: <a href="mailto:mac at cs.uni-sb.de">mac at cs.uni-sb.de</a> </dt> <br> <dt> <strong>Jochen Comes</strong> Email: <a href="mailto:comi at cs.uni-sb.de">comi at cs.uni-sb.de</a> </dt> <br> <dt> <strong>Armin Juhlke</strong> </dt> <br> <dt> <strong>Paul McCabe</strong> </dt> <br> <dt> <strong>Christian Sohler</strong> Email: <a href="mailto:csohler at uni-paderborn.de">csohler at uni-paderborn.de</a> </dt> <br> <dt> <strong>Mark Ziegelmann</strong> </dt> </dl> </li> </ul> <p><a href="index.html#Anfang"><img src="static/img/ICuparrow.gif" alt="[Up]" align="bottom" border="0" height="20" width="75"></a> <a name="Publikationen"></a><img src="static/img/ICpoint.gif" align="bottom" alt="----" width="100%" height="2" border="0"></p> <h2>Selected Publications</h2> <ul> <li><p style="Margin-bottom: 0cm">Raimund Seidel, Micha Sharir<br> <strong>Top-Down Analysis of Path Compression.</strong> <a href="media/papers/2013/Top-DownAnalysisofPathCompression.gz">pdf</a><br> SIAM Journal of Computing. <br> </p> </li> <br> <li><p style="Margin-bottom: 0cm">Raimund Seidel, Udo Adamy<br> <strong>On the Exact Query Complexity of Planar Point Location.</strong> <a href="media/papers/2000/OntheExactQueryComplexityofPlanarPointLocation.gz">pdf</a><br> Journal of Algorithms, pp. 189-217. <br> </p> </li> <br> <li><p style="Margin-bottom: 0cm">Markus Denny, Christian Sohler<br> <strong>Encoding a triangulation as a permutation of its point set.</strong> <a href="media/papers/1997/Encodingatriangulationasapermutationofitspointset.ps">pdf</a><br> Proc. 9th Canad. Conf. Comput. Geom., pp. 39-43. <br> </p> </li> <br> <li><p style="Margin-bottom: 0cm">David Avis, David Bremner, Raimund Seidel<br> <strong>How good are convex hull algorithms?</strong> <a href="media/papers/1997/Howgoodareconvexhullalgorithms.ps">pdf</a><br> Comput. Geom. Theory and Appl., pp. 265-302. <br> </p> </li> <br> <li><p style="Margin-bottom: 0cm">Raimund Seidel, Cecilia Aragon<br> <strong>Randomized Search Trees.</strong> <a href="media/papers/1996/RandomizedSearchTrees.ps">pdf</a><br> Algorithmica 16, pp. 464-497. <br> </p> </li> <br> <li><p style="Margin-bottom: 0cm">Raimund Seidel<br> <strong>A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons.</strong> <a href="media/papers/1991/Asimpleandfastin.ps">pdf</a><br> Comput. Geom. Theory and Appl., pp. 51-64. <br> </p> </li> </ul> <p><a href="index.html#Anfang"><img src="static/img/ICuparrow.gif" alt="[Up]" align="bottom" border="0" height="20" width="75"></a> <a name="Address"></a><br><img src="static/img/ICpoint.gif" align="bottom" alt="----" width="100%" height="2" border="0"></p> <h2>Address and Route</h2> <DL> <DT STYLE="margin-bottom: 0.5cm"> </DT><DT> <STRONG>Postal Address</STRONG> </DT><DD STYLE="margin-bottom: 0.5cm"> Universit&auml;t des Saarlandes<BR>FR 6.2 Informatik<BR>Prof. Dr. Raimund Seidel<BR>Postfach 151150<BR>D-66041 Saarbr&uuml;cken<BR>Germany </DD><DT> <STRONG>Visitors Address</STRONG> </DT><DD STYLE="margin-bottom: 0.5cm"> Universit&auml;t des Saarlandes<BR>Im Stadtwald<BR>Building E 1.3, 4.Stock, Zimmer 410<BR>D-66123 Saarbr&uuml;cken<BR>Germany </DD></DL> <p><a href="index.html#Anfang"><img src="static/img/ICuparrow.gif" alt="[Up]" align="bottom" border="0" height="20" width="75"></a> <a name="Ressourcen"></a><br><img src="static/img/ICpoint.gif" align="bottom" alt="----" width="100%" height="2" border="0"></p> <h2>Ressources</h2> <a href="http://compgeom.cs.uiuc.edu/~jeffe/compgeom/">Computational Geometry Pages</a> of Jeff Erickson <br> <a href="http://www.dcc.unicamp.br/~guialbu/geompages.html#geometers">Computational Geometry on the World Wide Web</a> by Guilherme Albuquerque Pinto. <p><a href="index.html#Anfang"><img src="static/img/ICuparrow.gif" alt="[Up]" align="bottom" border="0" height="20" width="75"></a> <a name="Ressourcen"></a><br><img src="static/img/ICpoint.gif" align="bottom" alt="----" width="100%" height="2" border="0"></p> <center> <p align="left"><a href="http://www.cs.uni-saarland.de">to Fachrichtung 6.2</a></p> <p align="left"><a href="https://www.uni-saarland.de/en/footer/dialogue/privacy.html">Online Privacy Policy</a></p> </center> </body> </html>

Pages: 1 2 3 4 5 6 7 8 9 10