LEA

Autorenliste / List of authors

Group Members

Alumni

Susanne Albers

(with Dennis Kraft)
Motivating Time-Inconsistent Agents: A Computational Approach
Technical Report 1601.00479,
arXiv, 2016.
[BibTex]

(with Dario Frascaria)
Quantifying Competitiveness in Paging with Locality of Reference
Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming,
ICALP'15
(July 6-10, 2015, Kyoto, Japan),
LNCS 9134, pp. 26-38, Springer-Verlag, 2015.
[BibTex]

(with Matthias Hellwig)
Online Makespan Minimization with Parallel Schedules
Proceedings of the 14th Scandinavian Symposium and Workshops on Algorithm Theory,
SWAT'14
(July 2-4, 2014, Copenhagen, Denmark),
LNCS 8503, pp. 13-25, Springer-Verlag, 2014.
[BibTex]

(with Fabian Müller, Swen Schmelzer)
Speed Scaling on Parallel Processors
Algorithmica 68(2):404-425, 2014.
[BibTex]

(with Antonios Antoniadis)
Race to Idle: New Algorithms for Speed Scaling with a Sleep State
ACM Transactions on Algorithms 10(2):9:1-9:31, 2014.
[BibTex]

(with Pascal Lenzner)
On Approximate Nash Equilibria in Network Design
Internet Mathematics 9(4):384-405, 2013.
[BibTex]

Recent Advances for a Classical Scheduling Problem
Proceedings of the 40th International Colloquium on Automata, Languages, and Programming,
ICALP'13
(July 8-12, 2013, Riga, Latvia),
LNCS 7966, pp. 4-14, Springer-Verlag, 2013.
[BibTex]

Recent Results for Online Makespan Minimization
(Extended Abstract)

Proceedings of the 19th Int. Computing and Combinatorics Conference,
COCOON'13
(June 21-23, 2013, Hangzhou, China),
LNCS 7936, pp. 1-3, Springer-Verlag, 2013.
[BibTex]

(with Antonios Antoniadis, Gero Greiner)
On Multi-Processor Speed Scaling with Migration
Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA'11
(June 4-6, 2011, San Jose, CA, USA), pp. 279-288, 2011.
[BibTex]

Matthias Baumgart

Ranking and Ordering Problems of Spanning Trees
Dissertation, Institut für Informatik, Technische Universität München, 2009.
[BibTex]

(with Christian Scheideler, Stefan Schmid)
A DoS-Resilient Information System for Dynamic Data Management
Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA'09
(August 11-13, 2009, Calgary, Canada), pp. 300-309, 2009.
[BibTex]

(with Christian Scheideler, Stefan Schmid)
A DoS-Resilient Information System for Dynamic Data Management
Technical Report TUM-I0906,
Institut für Informatik, TU München, 2009.
[BibTex]

Partitioning Bispanning Graphs into Spanning Trees
Proceedings of the 19th International Workshop on Combinatorial Algorithms,
IWOCA'08
(September 13-15, 2008, Nagoya, Japan), pp. 50-62, 2008.
[BibTex]

(with Hanjo Täubig)
The Complexity of Computing Graph-Approximating Spanning Trees
Technical Report TUM-I0822,
Institut für Informatik, TU München, 2008.
[BibTex]

Partitioning Bispanning Graphs into Spanning Trees
Technical Report TUM-I0813,
Institut für Informatik, TU München, 2008.
[BibTex]

(with Stefan Eckhardt, Jan H. Griebsch, Sven Kosub, Johannes Nowak)
All-Pairs Common-Ancestor Problems in Weighted Dags
Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
ESCAPE'07
(April 7-9, 2007, Hangzhou, China),
LNCS 4614, pp. 282-293, Springer-Verlag, 2007.
[BibTex]

(with Stefan Eckhardt, Jan H. Griebsch, Sven Kosub, Johannes Nowak)
All-Pairs Common-Ancestor Problems in Weighted Dags
Technical Report TUM-I0606,
Institut für Informatik, TU München, 2006.
[BibTex]

Thomas Bayer

Intersections of Polynomial Rings and Modules with Applications
Dissertation, Institut für Informatik, Technische Universität München, 2006.
[BibTex]

Optimal Descriptions of Orbit Spaces and Strata of finite Groups
Proceedings of the International Symposium on Symbolic and Algebraic Computation,
ISSAC'04
(July 4-7, 2004, Santander, Spain), pp. 19-26, ACM Press, 2004.
[BibTex]

STRATIFY - A SINGULAR Package for Computing Stratifications of Compact Group Actions
Proceedings of the 7th International Workshop on Computer Algebra in Scientific Computing,
CASC'04
(July 12-19,2004, St. Petersburg, Russia), pp. 23-38, Institut für Informatik, TU München, 2004.
[BibTex]

Computing Optimal Descriptions of Stratifications of Actions of Compact Lie Groups
Technical Report TUM-I0401,
Institut für Informatik, TU München, 2004.
[BibTex]

Computing the Stratification of Actions of Compact Lie Groups
Proceedings of the 6th International Workshop on Computer Algebra in Scientific Computing,
CASC 2003
(September 20-26, 2003, Passau, Germany), pp. 19-29, Institut für Informatik, TU München, 2003.
[BibTex]

An algorithm for computing invariants of linear actions of algebraic groups up to a given degree
Journal of Symbolic Computation 35(4):441-449, 2003.
[BibTex]

Algorithms for the computation of moduli spaces for semiquasihomogeneous singularities
Revista Matemática Complutense 16(1):103-129, 2003.
[BibTex]

Moduli Spaces of Low Dimension for Semi Brieskorn-Pham Singularities w.r.t. Right Equivalence
Proceedings of the 5th International Workshop on Computer Algebra in Scientific Computing,
CASC 2002
(September 22-27, 2002, Yalta, Ukraine), pp. 7-16, Institut für Informatik, TU München, 2002.
[BibTex]

On the Intersection of Invariant Rings
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry 43(2):551-555, 2002.
[BibTex]

An Algorithm for Computing Invariants of Linear Actions of Algebraic Groups up to a Given Degree
Technical Report TUM-I0201,
Institut für Informatik, TU München, 2002.
[BibTex]

Computing Stratifications of Quotients of Finite Groups and an Application to Shape Memory Alloys
Proceedings of the 4th International Workshop on Computer Algebra in Scientific Computing,
CASC 2001
(September 22-26, 2001, Konstanz, Germany), pp. 13-23, Springer-Verlag, 2001.
[BibTex]

Anna Bernasconi

(with Lavinia Egidi)
Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions
Information and Computation 153(1):1-25, 1999.
[BibTex]

(with Carsten Damm, Igor Shparlinski)
On the Average Sensitivity of Testing Square-Free Numbers
Proceedings of the 5th Annual International Computing and Combinatorics Conference,
COCOON'99 (July 26-28 1999, Tokyo, Japan),
LNCS 1627, pp. 291-299, Springer-Verlag, 1999.
[BibTex]

(with Bruno Codenotti, Valentino Crespi, Giovanni Resta)
How fast can one compute the permanent of circulant matrices?
Linear Algebra and its Applications 292:15-37, 1999.
[BibTex]

On the complexity of balanced Boolean functions
Information Processing Letters 70(4):157-163, 1999.
[BibTex]

(with Bruno Codenotti)
Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem
IEEE Transactions on Computers 48(3):345-351, 1999.
[BibTex]

(with Igor Shparlinski)
Circuit Complexity of Testing Square-Free Numbers
Proceedings of the 16th Symposium on Theoretical Aspects in Computer Science,
STACS'99
(March 4-6 1999, Trier, Germany),
LNCS 1563, pp. 47-56, Springer-Verlag, 1999.
[BibTex]

(with Carsten Damm, Igor Shparlinski)
On the Average Sensitivity of Testing Square-Free Numbers
Technical Report TUM-I9908,
Institut für Informatik, TU München, 1999.
[BibTex]

On the polynomial representation of Boolean functions over GF(2)
Proceedings of the 6th Italian Conference on Theoretical Computer Science,
ICTCS'98
(November 9-11 1998, Prato, Italy), pp. 265-276, World Scientific Publishing, 1998.
[BibTex]

(with Bruno Codenotti)
Introduzione alla Complessità Computazionale
Springer-Verlag, 1998.
[BibTex]

Combinatorial properties of classes of functions hard to compute in constant depth
Proceedings of the 4th Annual International Computing and Combinatorics Conference,
COCOON'98 (August 12-14 1998, Taipei, Taiwan),
LNCS 1449, pp. 339-348, Springer-Verlag, 1998.
[BibTex]

(with Carsten Damm, Igor Shparlinski)
Circuit and Decision Tree Complexity of Some Number Theoretic Problems
Technical Report 98-21,
Forschungsbericht Mathematik/Informatik, Universität Trier, 1998.
[BibTex]

Stefan Bischof

(with Ralf Ebner, Thomas Erlebach)
Parallel Load Balancing for Problems with Good Bisectors
Journal of Parallel and Distributed Computing 60(9):1047-1073, 2000.
[BibTex]

Efficient Algorithms for On-Line Scheduling and Load Distribution in Parallel Systems
Dissertation, Institut für Informatik, Technische Universität München, 1999.
[BibTex]

(with Thomas Schickinger, Angelika Steger)
Load Balancing Using Bisectors ­ A Tight Average-Case Analysis
Proceedings of the 7th Annual European Symposium on Algorithms,
ESA'99
(July 16-18 1999, Prague, Czech Republic),
LNCS 1643, pp. 172-183, Springer-Verlag, 1999.
[BibTex]

(with Ralf Ebner, Thomas Erlebach)
Parallel Load Balancing for Problems with Good Bisectors
Proceedings of the International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing,
IPPS/SPDP'99
(April 12-16 1999, San Juan, Puerto Rico), pp. 531-538, IEEE Computer Society Press, 1999.
[BibTex]

(with Ernst W. Mayr)
On-Line Scheduling of Parallel Jobs with Runtime Restrictions
Proceedings of the 9th Annual International Symposium on Algorithms and Computation,
ISAAC'98
(December 14-16 1998, Taejon, Korea),
LNCS 1533, pp. 119-128, Springer-Verlag, 1998.
[BibTex]

(with Ralf Ebner, Thomas Erlebach)
Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
Proceedings of the 4th International Euro-Par Conference on Parallel Processing,
Euro-Par'98
(September 1-4 1998, Southampton, UK),
LNCS 1470, pp. 383-389, Springer-Verlag, 1998.
[BibTex]

(with Ralf Ebner, Thomas Erlebach)
Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
Technical Report TUM-I9811,
Institut für Informatik, TU München, 1998.
[BibTex]

(with Ernst W. Mayr)
On-Line Scheduling of Parallel Jobs with Runtime Restrictions
Technical Report TUM-I9810,
Institut für Informatik, TU München, 1998.
[BibTex]

(with Ralf Ebner, Thomas Erlebach)
Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
Proceedings of the Workshop Anwendungsbezogene Lastverteilung,
ALV'98
(March 25-26 1998, München), pp. 1-12, 1998.
[BibTex]

(with Thomas Erlebach, Volker Heun, Ulla Koppenhagen, Klaus Kühnle, Ernst W. Mayr, Hans Stadtherr)
27. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen
Technical Report TUM-I9530,
Institut für Informatik, TU München, 1995.
[BibTex]

Arno Buchner

(with Monika Götz, Helgard Nirenberg, Sibylle Krause, Heike Wolters, Siegfried Draeger, Jana Lottmann, Gabriele Berg, Kornelia Smalla)
Fungal endophytes in potato roots studied by traditional isolation and cultivation-independent DNA-based methods
FEMS Microbiology Ecology 58(3):404-413, 2006.
[BibTex]

(with Hanjo Täubig, Jan H. Griebsch)
PAST: fast structure-based searching in the PDB
Nucleic Acids Research 34(Web Server):W20-W23, 2006.
[BibTex]

(with Hanjo Täubig, Jan H. Griebsch)
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB
Proceedings of the German Conference on Bioinformatics,
GCB'04 (October 4-6, 2004, Bielefeld, Germany),
LNI P-53, pp. 65-74, Köllen Verlag, 2004.
[BibTex]

(with Wolfgang Ludwig, Oliver Strunk, Ralf Westram, Lothar Richter, Harald Meier, Yadhu Kumar, Tina Lai, Susanne Steppi, Gangolf Jobb, Wolfram Förster, Igor Brettske, Stefan Gerber, Anton W. Ginhart, Oliver Gross, Silke Grumann, Stefan Hermann, Ralf Jost, Andreas König, Thomas Liss, Ralph Lüßmann, Michael May, Björn Nonhoff, Boris Reichel, Robert Strehlow, Alexandros Stamatakis, Norbert Stuckmann, Alexander Vilbig, Michael Lenke, Thomas Ludwig, Arndt Bode, Karl-Heinz Schleifer)
ARB: a software environment for sequence data
Nucleic Acids Research 32(4):1363-1371, 2004.
[BibTex]

(with Hanjo Täubig, Jan H. Griebsch)
A Fast Method for Motif Detection and Searching in a Protein Structure Database
Proceedings of the German Conference on Bioinformatics,
GCB'03
(October 12-14, 2003, Neuherberg / Garching b. München, Germany), pp. 186-188, 2003.
[BibTex]

(with Hanjo Täubig)
A Fast Method for Motif Detection and Searching in a Protein Structure Database
Technical Report TUM-I0314,
Institut für Informatik, TU München, 2003.
[BibTex]

(with Newton C. Marcial Gomes, Olajire Fagbola, Rodrigo Costa, Norma Gouvea Rumjanek, Leda Mendonça-Hagler, Kornelia Smalla)
Dynamics of Fungal Communities in Bulk and Maize Rhizosphere Soil in the Tropics
Applied and Environmental Microbiology 69(7):3758-3766, 2003.
[BibTex]

Dmytro Chibisov

Design of Algorithms for Motion Planning and Motion Prediction
Dissertation, Institut für Informatik, Technische Universität München, 2009.
[BibTex]

(with Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov)
Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations
Proceedings of the 10th International Workshop on Computer Algebra in Scientific Computing,
CASC'07
(September 16-20, 2007, Bonn, Germany),
LNCS 4770, pp. 102-117, Springer-Verlag, 2007.
[BibTex]

(with Ernst W. Mayr)
Motion planning for 6R-Robots: multiple tasks with constrained velocity and orientation of the end-effector
Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation,
SNC'07
(July 25-27, 2007, Ontario, Canada), pp. 72-78, ACM Press, 2007.
[BibTex]

(with Ernst W. Mayr)
Computing Minimum-Time Motion for 6R Robots and Application to Industrial Welding
Proceedings of the 4th Int. Workshop on Computer Algebra Systems in Teaching and Research,
CASTR'07
(January 31 – February 3, 2007, Siedlce, Poland), 2007.
[BibTex]

(with Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov)
On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions
Proceedings of the 9th Int. Workshop on Computer Algebra in Scientific Computing,
CASC'06
(September 11-15, 2006, Chisinau, Moldova),
LNCS 4194, pp. 109-128, Springer-Verlag, 2006.
[BibTex]

(with Ernst W. Mayr, Sergey Pankratov)
Spatial Planning and Geometric Optimization: Combining Configuration Space and Energy Methods
Proceedings of the 5th International Workshop on Automated Deduction in Geometry,
ADG'04
(September 16-18, 2004, Gainesville, Florida, USA),
LNCS 3763, pp. 156-168, Springer-Verlag, 2006.
[BibTex]

(with Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov)
Generation of Orthogonal Grids on Curvilinear Trimmed Regions in Constant Time
Proceedings of the 8th International Workshop on Computer Algebra in Scientific Computing,
CASC'05
(September 12-16, 2005, Kalamata, Greece),
LNCS 3718, pp. 105-114, Springer-Verlag, 2005.
[BibTex]

(with Victor G. Ganzha, Sergey Pankratov, Christoph Zenger)
Computer Algebra in Nanosciences: Modeling Electronic States in Quantum Dots
Proceedings of the 8th International Workshop on Computer Algebra in Scientific Computing,
CASC'05
(September 12-16, 2005, Kalamata, Greece),
LNCS 3718, pp. 115-124, Springer-Verlag, 2005.
[BibTex]

(with Victor G. Ganzha, Evgenii V. Vorozhtsov)
Hierarchical Advancing Front Triangulation Using Symmetry Properties
Proceedings of the 7th International Workshop on Computer Algebra in Scientific Computing,
CASC'04
(July 12-19,2004, St. Petersburg, Russia), pp. 173-184, Institut für Informatik, TU München, 2004.
[BibTex]

(with Victor G. Ganzha, Evgenii V. Vorozhtsov)
Object Oriented Modelling in Numerical Computation: Multigrid Calculations using Maple
Proceedings of the 6th International Workshop on Computer Algebra in Scientific Computing,
CASC 2003
(September 20-26, 2003, Passau, Germany), pp. 121-141, Institut für Informatik, TU München, 2003.
[BibTex]

Stefan Eckhardt

Complexity Analysis of Tries and Spanning Tree Problems
Dissertation, Institut für Informatik, Technische Universität München, 2010.
[BibTex]

(with Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke)
Combinatorial network abstraction by trees and distances
Theoretical Computer Science 407(1-3):1-20, 2008.
[BibTex]

(with Andreas M. Mühling, Johannes Nowak)
Fast Lowest Common Ancestor Computations in Dags
Proceedings of the 15th European Symposium on Algorithms,
ESA'07
(October 8-10, 2007, Eilat, Israel),
LNCS 4698, pp. 705-716, Springer-Verlag, 2007.
[BibTex]

(with Sven Kosub, Johannes Nowak)
Smoothed Analysis of Trie Height
Technical Report TUM-I0715,
Institut für Informatik, TU München, 2007.
[BibTex]

(with Matthias Baumgart, Jan H. Griebsch, Sven Kosub, Johannes Nowak)
All-Pairs Common-Ancestor Problems in Weighted Dags
Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
ESCAPE'07
(April 7-9, 2007, Hangzhou, China),
LNCS 4614, pp. 282-293, Springer-Verlag, 2007.
[BibTex]

(with Andreas M. Mühling, Johannes Nowak)
Fast Lowest Common Ancestor Computations in Dags
Technical Report TUM-I0707,
Institut für Informatik, TU München, 2007.
[BibTex]

(with Matthias Baumgart, Jan H. Griebsch, Sven Kosub, Johannes Nowak)
All-Pairs Common-Ancestor Problems in Weighted Dags
Technical Report TUM-I0606,
Institut für Informatik, TU München, 2006.
[BibTex]

(with Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke)
Combinatorial Network Abstraction by Trees and Distances
Proceedings of the 16th International Symposium on Algorithms and Computation,
ISAAC'05
(December 19-21, 2005, Hainan, China),
LNCS 3827, pp. 1100-1109, Springer-Verlag, 2005.
[BibTex]

(with Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke)
Combinatorial Network Abstraction by Trees and Distances
Technical Report TUM-I0502,
Institut für Informatik, TU München, 2005.
[BibTex]

(with Sebastian Wernicke)
On the Algorithmic Intractability of Computing Distance-Approximating Spanning Trees
Technical Report TUM-I0409,
Institut für Informatik, TU München, 2004.
[BibTex]

Thomas Erlebach

(with Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann)
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Theoretical Computer Science 261(1):119-156, 2001.
[BibTex]

(with Stefan Bischof, Ralf Ebner)
Parallel Load Balancing for Problems with Good Bisectors
Journal of Parallel and Distributed Computing 60(9):1047-1073, 2000.
[BibTex]

(with Ralf Ebner, Claudia Gold, Clemens Harlfinger, Roland Wismüller)
A Framework for Recording and Visualizing Event Traces in Parallel Systems with Load Balancing
Proceedings of the 5th Workshop on Parallel Systems and Algorithms,
PASA'99 (October 7 1999, Jena, Germany), pp. 155-162, 1999.
[BibTex]

(with Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano)
Optimal wavelength routing on directed fiber trees
Theoretical Computer Science 221:119-137, 1999.
[BibTex]

Scheduling Connections in Fast Networks
Dissertation, Institut für Informatik, Technische Universität München, 1999.
[BibTex]

(with Ralf Ebner, Andreas Ganz, Claudia Gold, Clemens Harlfinger, Roland Wismüller)
A Framework for Recording and Visualizing Event Traces in Parallel Systems with Load Balancing
Technical Report TUM-I9909,
Institut für Informatik, TU München, 1999.
[BibTex]

(with Stefan Bischof, Ralf Ebner)
Parallel Load Balancing for Problems with Good Bisectors
Proceedings of the International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing,
IPPS/SPDP'99
(April 12-16 1999, San Juan, Puerto Rico), pp. 531-538, IEEE Computer Society Press, 1999.
[BibTex]

(with Klaus Jansen)
Maximizing the Number of Connections in Optical Tree Networks
Proceedings of the 9th Annual International Symposium on Algorithms and Computation,
ISAAC'98
(December 14-16 1998, Taejon, Korea),
LNCS 1533, pp. 179-188, Springer-Verlag, 1998.
[BibTex]

(with Stefan Bischof, Ralf Ebner)
Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
Proceedings of the 4th International Euro-Par Conference on Parallel Processing,
Euro-Par'98
(September 1-4 1998, Southampton, UK),
LNCS 1470, pp. 383-389, Springer-Verlag, 1998.
[BibTex]

(with Stefan Bischof, Ralf Ebner)
Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
Technical Report TUM-I9811,
Institut für Informatik, TU München, 1998.
[BibTex]

(with Stefan Bischof, Ralf Ebner)
Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
Proceedings of the Workshop Anwendungsbezogene Lastverteilung,
ALV'98
(March 25-26 1998, München), pp. 1-12, 1998.
[BibTex]

(with Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann)
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Proceedings of the 8th International Workshop Algorithmic Learning Theory,
ALT'97
(October 6-8 1997, Sendai, Japan),
LNAI 1316, pp. 260-276, Springer-Verlag, 1997.
[BibTex]

(with Christos Kaklamanis, Pino Persiano, Klaus Jansen)
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing
Proceedings of the 24th International Colloquium on Automata, Languages and Programming,
ICALP'97
(July 7-11 1997, Bologna, Italy),
LNCS 1256, pp. 493-504, Springer-Verlag, 1997.
[BibTex]

(with Klaus Jansen)
Off-line and On-line Call-Scheduling in Stars and Trees
Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science,
WG'97 (June 18-20 1997, Berlin, Germany),
LNCS 1335, pp. 199-213, Springer-Verlag, 1997.
[BibTex]

(with Klaus Jansen, Christos Kaklamanis, Pino Persiano)
An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks
Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities Location,
(April 28-30 1997, Princeton, NJ),
DIMACS 40, pp. 117-129, American Mathematical Society, 1997.
[BibTex]

(with Klaus Jansen)
Call Scheduling in Trees, Rings and Meshes
Proceedings of the 30th Hawaii International Conference on System Sciences,
HICSS-30
pp. 221-222, IEEE Computer Society Press, 1997.
[BibTex]

(with Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann)
Efficient Learning of One-Variable Pattern Languages from Positive Data
Technical Report DOI-TR-128,
Department of Informatics, Kyushu University, Fukuoka, Japan, 1996.
[BibTex]

(with Klaus Jansen)
Scheduling of Virtual Connections in Fast Networks
Proceedings of the 4th Workshop on Parallel Systems and Algorithms,
PASA'96 pp. 13-32, World Scientific Publishing, 1996.
[BibTex]

(with Stefan Bischof, Volker Heun, Ulla Koppenhagen, Klaus Kühnle, Ernst W. Mayr, Hans Stadtherr)
27. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen
Technical Report TUM-I9530,
Institut für Informatik, TU München, 1995.
[BibTex]

Jens Ernst

A Distributed, Parallel System for Large-Scale Structure Recognition in Gene Expression Data
Proceedings of the 2nd Int. Conference on High Performance Computing and Communications,
HPCC'06
(September 13-15, 2006, Munich, Germany),
LNCS 4208, pp. 21-30, Springer-Verlag, 2006.
[BibTex]

Similarity-Based Clustering Algorithms for Gene Expression Profiles
Dissertation, Institut für Informatik, Technische Universität München, 2003.
[BibTex]

(with Alexander Loy, Angelika Lehner, Natuschka Lee, Justyna Adamczyk, Harald Meier, Karl-Heinz Schleifer, Michael Wagner)
Oligonucleotide Microarray for 16S rRNA Gene-Based Detection of All Recognized Lineages of Sulfate-Reducing Prokaryotes in the Environment
Applied and Environmental Microbiology 68(10):5064-5081, 2002.
[BibTex]

(with Volker Heun, Ulrich Voll)
Generalized Clustering of Gene Expression Profiles - A Spectral Approach
Proceedings of the International Conference on Bioinformatics,
InCoB 2002
(February 6-8 2002, Bangkok, Thailand), 2002.
[BibTex]

Dario Frascaria

Tom Friedetzky

Randomised Dynamic Load Balancing
Dissertation, Institut für Informatik, Technische Universität München, 2002.
[BibTex]

(with Petra Berenbrink, Artur Czumaj, Nikita Vvedenskaya)
Infinite Parallel Job Allocation
Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures,
SPAA'00
(July 9-12 2000, Bar Harbor, Maine, USA), pp. 99-108, ACM Press, 2000.
[BibTex]

(with Petra Berenbrink, Angelika Steger)
Randomized and Adversarial Load Balancing
Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures,
SPAA'99
(June 27-30 1999, Saint-Malo, France), pp. 175-184, ACM Press, 1999.
[BibTex]

(with Petra Berenbrink, Ernst W. Mayr)
Parallel Continuous Randomized Load Balancing
Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures,
SPAA'98
(June 28 - July 2 1998, Puerto Vallarta, Mexico), pp. 192-201, ACM Press, 1998.
[BibTex]

Stefanie Gerke

Gero Greiner

(with Tim Nonner, Alexander Souza)
The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling
Theory of Computing Systems 54(1):24-44, 2014.
[BibTex]

Sparse Matrix Computations and their I/O Complexity
Dissertation, Institut für Informatik, Technische Universität München, 2012.
[BibTex]

(with Susanne Albers, Antonios Antoniadis)
On Multi-Processor Speed Scaling with Migration
Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA'11
(June 4-6, 2011, San Jose, CA, USA), pp. 279-288, 2011.
[BibTex]

(with Riko Jacob)
Evaluating Non-Square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model
Technical Report TUM-I1015,
Institut für Informatik, TU München, 2010.
[BibTex]

(with Riko Jacob)
Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model
Proceedings of the 35th Int. Symposium on Mathematical Foundations of Computer Science,
MFCS'10
(August 23–27, 2010, Brno, Czech Republic),
LNCS 6281, pp. 393-404, Springer-Verlag, 2010.
[BibTex]

(with Riko Jacob)
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
Proceedings of the 9th Latin American Theoretical Informatics Symposium,
LATIN'10
(April 19-23, 2010, Oaxaca, Mexico),
LNCS 6034, pp. 143-156, Springer-Verlag, 2010.
[BibTex]

(with Tim Nonner, Alexander Souza)
The Bell is Ringing in Speed-Scaled Multiprocessor Scheduling
Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA'09
(August 11-13, 2009, Calgary, Canada), pp. 11-18, 2009.
[BibTex]

Jan H. Griebsch

(with Matthias Baumgart, Stefan Eckhardt, Sven Kosub, Johannes Nowak)
All-Pairs Common-Ancestor Problems in Weighted Dags
Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
ESCAPE'07
(April 7-9, 2007, Hangzhou, China),
LNCS 4614, pp. 282-293, Springer-Verlag, 2007.
[BibTex]

(with Hanjo Täubig, Arno Buchner)
PAST: fast structure-based searching in the PDB
Nucleic Acids Research 34(Web Server):W20-W23, 2006.
[BibTex]

(with Oliver Arafat, Wolfram Koska)
xAnVi – An Extensible Visualization and Analysis Framework
Proceedings of the 10th Int. Conference on Information Visualization,
IV'06
(July 5-7, 2006, London, UK), pp. 45-52, IEEE Computer Society Press, 2006.
[BibTex]

(with Matthias Baumgart, Stefan Eckhardt, Sven Kosub, Johannes Nowak)
All-Pairs Common-Ancestor Problems in Weighted Dags
Technical Report TUM-I0606,
Institut für Informatik, TU München, 2006.
[BibTex]

(with Stella M. Clarke, Timothy W. Simpson)
Analysis of Support Vector Regression for Approximation of Complex Engineering Analyses
Journal of Mechanical Design 127(6):1077-1087, 2005.
[BibTex]

(with Hanjo Täubig, Arno Buchner)
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB
Proceedings of the German Conference on Bioinformatics,
GCB'04 (October 4-6, 2004, Bielefeld, Germany),
LNI P-53, pp. 65-74, Köllen Verlag, 2004.
[BibTex]

(with Stella M. Clarke, Michael F. Zäh)
Predicting Haptic Data with Support Vector Regression for Telepresence Applications
Proceedings of the 3rd International Conference on Hybrid Intelligent Systems,
HIS'03
(December 14-17 2003, Melbourne, Australia), pp. 572-581, IOS Press, 2003.
[BibTex]

(with Arno Buchner, Hanjo Täubig)
A Fast Method for Motif Detection and Searching in a Protein Structure Database
Proceedings of the German Conference on Bioinformatics,
GCB'03
(October 12-14, 2003, Neuherberg / Garching b. München, Germany), pp. 186-188, 2003.
[BibTex]

(with Stella M. Clarke, Timothy W. Simpson)
Analysis of Support Vector Regression for Approximation of Complex Engineering Analyses
Proceedings of the 29th Design Automation Conference (ASME Design Engineering Technical Conferences),
DAC/DETC'03
(September 2-6 2003, Chicago, Illinois, USA), 2003.
[BibTex]

Alexander Hall

Volker Heun

Grundlegende Algorithmen
Einführung in den Entwurf und die Analyse effizienter Algorithmen

2. Auflage, Vieweg-Verlag, 2003.
[BibTex]

Approximate protein folding in the HP side chain model on extended cubic lattices
Discrete Applied Mathematics 127(1):163-177, 2003.
[BibTex]

(with Ernst W. Mayr)
Efficient Dynamic Embeddings of Binary Trees into Hypercubes
Journal of Algorithms 43(1):51-84, 2002.
[BibTex]

(with Ernst W. Mayr)
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
Journal of Algorithms 43(1):17-50, 2002.
[BibTex]

(with Jens Ernst, Ulrich Voll)
Generalized Clustering of Gene Expression Profiles - A Spectral Approach
Proceedings of the International Conference on Bioinformatics,
InCoB 2002
(February 6-8 2002, Bangkok, Thailand), 2002.
[BibTex]

(with Ernst W. Mayr)
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
Journal of Parallel and Distributed Computing 61(8):1110-1125, 2001.
[BibTex]

Grundlegende Algorithmen
Einführung in den Entwurf und die Analyse effizienter Algorithmen

1. Auflage, Vieweg-Verlag, 2000.
[BibTex]

Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices
Proceedings of the 7th Annual European Symposium on Algorithms,
ESA'99
(July 16-18 1999, Prague, Czech Republic),
LNCS 1643, pp. 212-223, Springer-Verlag, 1999.
[BibTex]

Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices
Technical Report ICSI-TR-98-029,
International Computer Science Institute (ICSI), Berkeley, 1998.
[BibTex]

(with Ernst W. Mayr)
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
Technical Report ICSI-TR-98-022,
International Computer Science Institute (ICSI), Berkeley, 1998.
[BibTex]

(with Ernst W. Mayr)
Efficient Dynamic Embeddings of Binary Trees into Hypercubes
Technical Report ICSI-TR-98-023,
International Computer Science Institute (ICSI), Berkeley, 1998.
[BibTex]

(with Ernst W. Mayr)
A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes
Proceedings of the 2nd International Euro-Par Conference on Parallel Processing,
Euro-Par'96
(Aug. 26-29 1996, Lyon, France),
LNCS 1123, pp. 222-233, Springer-Verlag, 1996.
[BibTex]

Efficient Dynamic Embeddings of Arbitrary Binary Trees into Hypercubes
Proceedings of the 3rd International Workshop on Parallel Algorithms for Irregularly Structured Problems,
IRREGULAR'96
(August 19-21 1996, Santa Barbara, CA, USA),
LNCS 1117, pp. 287-298, Springer-Verlag, 1996.
[BibTex]

(with Ernst W. Mayr)
Embedding Graphs with Bounded Treewidth into Optimal Hypercubes
Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science,
STACS'96 (Feb. 22-24, Grenoble, France),
LNCS 1046, pp. 157-168, Springer-Verlag, 1996.
[BibTex]

(with Ernst W. Mayr)
Optimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes
Technical Report TUM-I9607,
Institut für Informatik, TU München, 1996.
[BibTex]

(with Ernst W. Mayr)
Optimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes
Proceedings of the 4th Workshop on Parallel Systems and Algorithms,
PASA'96 pp. 195-209, World Scientific Publishing, 1996.
[BibTex]

Efficient Embeddings of Treelike Graphs into Hypercubes
Dissertation, Institut für Informatik, Technische Universität München,,
Reihe Informatik, Shaker Verlag 1996.
[BibTex]

(with Ernst W. Mayr)
Embedding Graphs with Bounded Treewidth into Optimal Hypercubes
Technical Report TUM-I9539,
Institut für Informatik, TU München, 1995.
[BibTex]

(with Stefan Bischof, Thomas Erlebach, Ulla Koppenhagen, Klaus Kühnle, Ernst W. Mayr, Hans Stadtherr)
27. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen
Technical Report TUM-I9530,
Institut für Informatik, TU München, 1995.
[BibTex]

(with Ernst W. Mayr)
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
Technical Report TUM-I9321,
Institut für Informatik, TU München, 1993.
[BibTex]

(with Ernst W. Mayr)
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
Proceedings of the 3rd Workshop on Parallel Systems and Algorithms,
PASA'93 (April 1-2 1993, Bonn, Germany), Mitteilungen - Gesellschaft für Informatik e.V., Parallel-Algorithmen und Rechnerstrukturen (11):7-11 1993.
[BibTex]

Klaus Holzapfel

Riko Jacob

(with Andréa Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig)
SKIP+: A Self-Stabilizing Skip Graph
Journal of the ACM 61(6):Article 36, 2014.
[BibTex]

(with Dominik Gall, Andréa Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig)
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
Theory of Computing Systems 55(1):110-135, 2014.
[BibTex]

(with Stephan Ritscher, Christian Scheideler, Stefan Schmid)
Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs
Theoretical Computer Science 457:137-148, 2012.
[BibTex]

(with Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Elias Vicari)
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model
Theory of Computing Systems 47(4):934-962, 2010.
[BibTex]

(with Gero Greiner)
Evaluating Non-Square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model
Technical Report TUM-I1015,
Institut für Informatik, TU München, 2010.
[BibTex]

(with Gero Greiner)
Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model
Proceedings of the 35th Int. Symposium on Mathematical Foundations of Computer Science,
MFCS'10
(August 23–27, 2010, Brno, Czech Republic),
LNCS 6281, pp. 393-404, Springer-Verlag, 2010.
[BibTex]

(with Dominik Gall, Andréa Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig)
Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization
Proceedings of the 9th Latin American Theoretical Informatics Symposium,
LATIN'10
(April 19-23, 2010, Oaxaca, Mexico),
LNCS 6034, pp. 294-305, Springer-Verlag, 2010.
[BibTex]

(with Gero Greiner)
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
Proceedings of the 9th Latin American Theoretical Informatics Symposium,
LATIN'10
(April 19-23, 2010, Oaxaca, Mexico),
LNCS 6034, pp. 143-156, Springer-Verlag, 2010.
[BibTex]

(with Stephan Ritscher, Christian Scheideler, Stefan Schmid)
A Self-stabilizing and Local Delaunay Graph Construction
Proceedings of the 20th Int. Symposium on Algorithms and Computation,
ISAAC'09
(December 16-18, 2009, Hawaii, USA),
LNCS 5878, pp. 771-780, Springer-Verlag, 2009.
[BibTex]

(with Dominik Gall, Andréa Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig)
Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization
Proceedings of the 11th Int. Symposium on Stabilization, Safety, and Security of Distributed Systems,
SSS'09
(November 3-6, 2009, Lyon, France),
LNCS 5873, pp. 781-782, Springer-Verlag, 2009.
[BibTex]

(with Andréa Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig)
A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs
Proceedings of the 28th Symposium on Principles of Distributed Computing,
PODC'09
(August 10-12, 2009, Calgary, Alberta, Canada), pp. 131-140, ACM Press, 2009.
[BibTex]

(with Mark Cieliebak, Alexander Hall, Marc Nunkesser)
Sequential Vector Packing
Theoretical Computer Science 409(3):351-363, 2008.
[BibTex]

(with Jörg Derungs, Peter Widmayer)
Approximate shortest paths guided by a small index
Algorithmica , 2008.
[BibTex]

(with Dominik Gall, Andréa Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig)
Modeling Scalability in Distributed Self-Stabilization: The Case of Graph Linearization
Technical Report TUM-I0835,
Institut für Informatik, TU München, 2008.
[BibTex]

(with Michael Schnupp)
Performing Permuting on a Multiprocessor Architecture Using Packet Communication
Technical Report TUM-I0817,
Institut für Informatik, TU München, 2008.
[BibTex]

(with Peter Marton, Jens Maue, Marc Nunkesser)
Multistage Methods for Freight Train Classification
Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems,
ATMOS'07
(November 15-16, 2007, Sevilla, Spain), pp. 158-174, Schloss Dagstuhl, Internationales Begegnungszentrum für Informatik, 2007.
[BibTex]

Klaus Jansen

(with Thomas Erlebach, Christos Kaklamanis, Milena Mihail, Pino Persiano)
Optimal wavelength routing on directed fiber trees
Theoretical Computer Science 221:119-137, 1999.
[BibTex]

(with Thomas Erlebach)
Maximizing the Number of Connections in Optical Tree Networks
Proceedings of the 9th Annual International Symposium on Algorithms and Computation,
ISAAC'98
(December 14-16 1998, Taejon, Korea),
LNCS 1533, pp. 179-188, Springer-Verlag, 1998.
[BibTex]

(with Christos Kaklamanis, Pino Persiano, Thomas Erlebach)
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing
Proceedings of the 24th International Colloquium on Automata, Languages and Programming,
ICALP'97
(July 7-11 1997, Bologna, Italy),
LNCS 1256, pp. 493-504, Springer-Verlag, 1997.
[BibTex]

(with Thomas Erlebach)
Off-line and On-line Call-Scheduling in Stars and Trees
Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science,
WG'97 (June 18-20 1997, Berlin, Germany),
LNCS 1335, pp. 199-213, Springer-Verlag, 1997.
[BibTex]

(with Thomas Erlebach, Christos Kaklamanis, Pino Persiano)
An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks
Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities Location,
(April 28-30 1997, Princeton, NJ),
DIMACS 40, pp. 117-129, American Mathematical Society, 1997.
[BibTex]

(with Thomas Erlebach)
Call Scheduling in Trees, Rings and Meshes
Proceedings of the 30th Hawaii International Conference on System Sciences,
HICSS-30
pp. 221-222, IEEE Computer Society Press, 1997.
[BibTex]

(with Thomas Erlebach)
Scheduling of Virtual Connections in Fast Networks
Proceedings of the 4th Workshop on Parallel Systems and Algorithms,
PASA'96 pp. 13-32, World Scientific Publishing, 1996.
[BibTex]

Sami Khuri

(with Klaus Holzapfel)
EVEGA: An Educational Visualization Environment for Graph Algorithms
Proceedings of the 6th Annual Conference on Innovation and Technology in Computer Science Education,
ITiCSE 2001
(June 25-27 2001, Canterbury, UK), pp. 101-104, ACM Press, 2001.
[BibTex]

(with Hsiu-Chin Hsu)
Tools for visualizing text compression algorithms
Proceedings of the ACM Symposium on Applied Computing,
SAC 2000
(March 19-21 2000, Como, Italy), pp. 119-123, ACM Press, 2000.
[BibTex]

(with Tim Walters, Yanti Sugono)
A grouping genetic algorithm for coloring the edges of graphs
Proceedings of the ACM Symposium on Applied Computing,
SAC 2000
(March 19-21 2000, Como, Italy), pp. 422-427, ACM Press, 2000.
[BibTex]

(with Sowmya Rao Miryala)
Genetic Algorithms for Solving Open Shop Scheduling Problems
Proceedings of the 9th Portuguese Conference on Artificial Intelligence,
EPIA'99
(September 21-24 1999, Évora, Portugal),
LNAI 1695, pp. 357-368, Springer-Verlag, 1999.
[BibTex]

Ulla Koppenhagen

(with Ernst W. Mayr)
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups
Journal of Symbolic Computation 31(1-2):259-276, 2001.
[BibTex]

(with Ernst W. Mayr)
Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups
Information and Computation 158(2):98-124, 2000.
[BibTex]

(with Ernst W. Mayr)
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
Journal of Symbolic Computation 28(3):317-338, 1999.
[BibTex]

(with Ernst W. Mayr)
The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups
Proceedings of the 11th International Symposium on Fundamentals of Computation Theory,
FCT'97 (September 1-3 1997, Krakow, Poland),
LNCS 1279, pp. 257-268, Springer-Verlag, 1997.
[BibTex]

Optimal Algorithms for Binomial Ideals and Commutative Semigroups
Dissertation, Institut für Informatik, Technische Universität München,,
Reihe Informatik, Shaker Verlag 1997.
[BibTex]

(with Ernst W. Mayr)
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
Proceedings of the International Symposium on Symbolic and Algebraic Computation,
ISSAC'96 (July 24-26 1996, Zürich, Switzerland), pp. 55-62, ACM Press, 1996.
[BibTex]

(with Ernst W. Mayr)
Optimal Gröbner Base Algorithms for Binomial Ideals
Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming,
ICALP'96
(July 8-12 1996, Paderborn, Germany),
LNCS 1099, pp. 244-255, Springer-Verlag, 1996.
[BibTex]

(with Ernst W. Mayr)
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals and Applications to Commutative Semigroups
Proceedings of the 2nd Magma Conference on Computational Algebra,
(May 12-16 1996, Milwaukee, Wisconsin, USA), 1996.
[BibTex]

(with Ernst W. Mayr)
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
Technical Report TUM-I9605,
Institut für Informatik, TU München, 1996.
[BibTex]

(with Ernst W. Mayr)
The Complexity of the Equivalence Problem for Commutative Semigroups
Technical Report TUM-I9603,
Institut für Informatik, TU München, 1996.
[BibTex]

(with Ernst W. Mayr)
Optimal Gröbner Base Algorithms for Binomial Ideals
Technical Report TUM-I9604,
Institut für Informatik, TU München, 1996.
[BibTex]

(with Stefan Bischof, Thomas Erlebach, Volker Heun, Klaus Kühnle, Ernst W. Mayr, Hans Stadtherr)
27. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen
Technical Report TUM-I9530,
Institut für Informatik, TU München, 1995.
[BibTex]

(with Ernst W. Mayr)
The Complexity of the Boundedness, Coverability, and Selfcoverability Problems for Commutative Semigroups
Technical Report TUM-I9518,
Institut für Informatik, TU München, 1995.
[BibTex]

Sven Kosub

(with Hanjo Täubig, Jeremias Weihmann, Raymond Hemmecke, Ernst W. Mayr)
Inequalities for the Number of Walks in Graphs
Algorithmica 66(4):804-828, 2013.
[BibTex]

(with Raymond Hemmecke, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann)
Inequalities for the Number of Walks in Graphs
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
ANALCO'12
(January 16, 2012, Kyoto, Japan), pp. 26-39, Society for Industrial and Applied Mathematics, 2012.
[BibTex]

(with Raymond Hemmecke, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann)
Inequalities for the Number of Walks in Trees and General Graphs and a Generalization of a Theorem of Erdös and Simonovits
Technical Report TUM-I1109,
Institut für Informatik, TU München, 2011.
[BibTex]

(with Stefan Eckhardt, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke)
Combinatorial network abstraction by trees and distances
Theoretical Computer Science 407(1-3):1-20, 2008.
[BibTex]

(with Klaus W. Wagner)
The Boolean Hierarchy of NP-Partitions
Information and Computation 206(5):538-568, 2008.
[BibTex]

(with Benjamin Hummel)
Acyclic Type-of-Relationship Problems on the Internet: An Experimental Analysis
Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference,
IMC'07
(October 24-26, 2007, San Diego, CA, USA), pp. 221-226, ACM Press, 2007.
[BibTex]

(with Christopher M. Homan)
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems
Proceedings of the 10th Italian Conference on Theoretical Computer Science,
ICTCS'07
(October 3-5, 2007, Rome, Italy), pp. 163-174, World Scientific Publishing, 2007.
[BibTex]

(with Lane A. Hemaspaandra, Christopher M. Homan)
Cluster Computing and the Power of Edge Recognition
Information and Computation 205(8):1274-1293, 2007.
[BibTex]

(with Stefan Eckhardt, Johannes Nowak)
Smoothed Analysis of Trie Height
Technical Report TUM-I0715,
Institut für Informatik, TU München, 2007.
[BibTex]

Computational Analysis of Complex Systems: Discrete Foundations, Algorithms, and the Internet
Habilitation, Institut für Informatik, Technische Universität München, 2007.
[BibTex]

(with Matthias Baumgart, Stefan Eckhardt, Jan H. Griebsch, Johannes Nowak)
All-Pairs Common-Ancestor Problems in Weighted Dags
Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
ESCAPE'07
(April 7-9, 2007, Hangzhou, China),
LNCS 4614, pp. 282-293, Springer-Verlag, 2007.
[BibTex]

(with Benjamin Hummel)
Acyclic Type-of-Relationship Problems on the Internet: An Experimental Analysis
Technical Report TUM-I0709,
Institut für Informatik, TU München, 2007.
[BibTex]

(with Christopher M. Homan)
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems
Technical Report TUM-I0706,
Institut für Informatik, TU München, 2007.
[BibTex]

Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems
Technical Report TUM-I0701,
Institut für Informatik, TU München, 2007.
[BibTex]

(with Lane A. Hemaspaandra, Christopher M. Homan, Klaus W. Wagner)
The Complexity of Computing the Size of an Interval
SIAM Journal on Computing 36(5):1264-1300, 2006.
[BibTex]

(with Klaus Holzapfel, Moritz G. Maaß, Hanjo Täubig)
The Complexity of Detecting Fixed-Density Clusters
Discrete Applied Mathematics 154(11):1547-1562, 2006.
[BibTex]

(with Moritz G. Maaß, Hanjo Täubig)
Acyclic Type-of-Relationship Problems on the Internet
Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking,
CAAN'06
(July 2, 2006, Chester, UK),
LNCS 4235, pp. 98-111, Springer-Verlag, 2006.
[BibTex]

(with Lane A. Hemaspaandra, Christopher M. Homan)
Cluster Computing and the Power of Edge Recognition
Proceedings of the 3rd Annual Conference on Theory and Applications of Models of Computation,
TAMC'06
(May 15-20, 2006, Beijing, China),
LNCS 3959, pp. 283-294, Springer-Verlag, 2006.
[BibTex]

(with Matthias Baumgart, Stefan Eckhardt, Jan H. Griebsch, Johannes Nowak)
All-Pairs Common-Ancestor Problems in Weighted Dags
Technical Report TUM-I0606,
Institut für Informatik, TU München, 2006.
[BibTex]

(with Moritz G. Maaß, Hanjo Täubig)
Acyclic Type-of-Relationship Problems on the Internet
Technical Report TUM-I0605,
Institut für Informatik, TU München, 2006.
[BibTex]

(with Stefan Eckhardt, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke)
Combinatorial Network Abstraction by Trees and Distances
Proceedings of the 16th International Symposium on Algorithms and Computation,
ISAAC'05
(December 19-21, 2005, Hainan, China),
LNCS 3827, pp. 1100-1109, Springer-Verlag, 2005.
[BibTex]

(with Lane A. Hemaspaandra, Christopher M. Homan)
Cluster Computing and the Power of Edge Recognition
Technical Report URCS-TR-2005-878,
Department of Computer Science, University of Rochester, 2005.
[BibTex]

(with Stefan Eckhardt, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke)
Combinatorial Network Abstraction by Trees and Distances
Technical Report TUM-I0502,
Institut für Informatik, TU München, 2005.
[BibTex]

(with Lane A. Hemaspaandra, Christopher M. Homan, Klaus W. Wagner)
The Complexity of Computing the Size of an Interval
Technical Report URCS-TR-2005-856,
Department of Computer Science, University of Rochester, 2005.
[BibTex]

Local Density
In: Ulrik Brandes, Thomas Erlebach (Ed.):
Network Analysis
Methodological Foundations

Springer-Verlag, 2005.
[BibTex]

NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
Theory of Computing Systems 38(1):83-113, 2005.
[BibTex]

Local Density
Technical Report TUM-I0421,
Institut für Informatik, TU München, 2004.
[BibTex]

Boolean NP-Partitions and Projective Closure
Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science,
DMTCS'03
(July 7-12 2003, Dijon, France),
LNCS 2731, pp. 225-236, Springer-Verlag, 2003.
[BibTex]

(with Matthias Galota, Heribert Vollmer)
Generic separations and leaf languages
Mathematical Logic Quarterly 49(4):353-362, 2003.
[BibTex]

(with Klaus Holzapfel, Moritz G. Maaß, Hanjo Täubig)
The Complexity of Detecting Fixed-Density Clusters
Proceedings of the 5th Italian Conference on Algorithms and Complexity,
CIAC'03
(May 28-30 2003, Rome, Italy),
LNCS 2653, pp. 201-212, Springer-Verlag, 2003.
[BibTex]

(with Klaus Holzapfel, Moritz G. Maaß, Hanjo Täubig)
The Complexity of Detecting Fixed-Density Clusters
Technical Report TUM-I0212,
Institut für Informatik, TU München, 2002.
[BibTex]

(with Klaus W. Wagner)
The Boolean Hierarchy of NP-Partitions
Technical Report TUM-I0209,
Institut für Informatik, TU München, 2002.
[BibTex]

(with Matthias Galota, Heribert Vollmer)
Generic Separations and Leaf Languages
Technical Report TUM-I0104,
Institut für Informatik, TU München, 2001.
[BibTex]

Dennis Kraft

Johannes Krugel

(with Andre Dau)
tt-analyze and tt-generate: Tools to Analyze and Generate Sequences with Trained Statistical Properties
Technical Report TUM-I1119,
Institut für Informatik, TU München, 2011.
[BibTex]

(with Andre Dau)
tt-analyze and tt-generate: Tools to Analyze and Generate Sequences with Trained Statistical Properties
Proceedings of the German Conference on Bioinformatics,
GCB'11
(September 7-9, 2011, Freising / Weihenstephan, Germany), 2011.
[BibTex]

Klaus Kühnle

Space Optimal Computation of Normal Forms of Polynomials
Dissertation, Institut für Informatik, Technische Universität München,,
Reihe Informatik, Shaker Verlag 1998.
[BibTex]

(with Ernst W. Mayr)
Exponential space computation of Gröbner bases
Proceedings of the International Symposium on Symbolic and Algebraic Computation,
ISSAC'96 (July 24-26 1996, Zürich, Switzerland), pp. 63-71, ACM Press, 1996.
[BibTex]

(with Ernst W. Mayr)
Exponential space computation of Gröbner bases
Technical Report TUM-I9606,
Institut für Informatik, TU München, 1996.
[BibTex]

(with Stefan Bischof, Thomas Erlebach, Volker Heun, Ulla Koppenhagen, Ernst W. Mayr, Hans Stadtherr)
27. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen
Technical Report TUM-I9530,
Institut für Informatik, TU München, 1995.
[BibTex]

Dimitrios Letsios

Moritz G. Maaß

(with Stefan Eckhardt, Sven Kosub, Hanjo Täubig, Sebastian Wernicke)
Combinatorial network abstraction by trees and distances
Theoretical Computer Science 407(1-3):1-20, 2008.
[BibTex]

Computing suffix links for suffix trees and arrays
Information Processing Letters 101(6):250-254, 2007.
[BibTex]

Average-Case Analysis of Approximate Trie Search
Algorithmica 46(3-4):469-491, 2006.
[BibTex]

Analysis of Algorithms and Data Structures for Text Indexing
Dissertation, Institut für Informatik, Technische Universität München, 2006.
[BibTex]

(with Klaus Holzapfel, Sven Kosub, Hanjo Täubig)
The Complexity of Detecting Fixed-Density Clusters
Discrete Applied Mathematics 154(11):1547-1562, 2006.
[BibTex]

(with Sven Kosub, Hanjo Täubig)
Acyclic Type-of-Relationship Problems on the Internet
Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking,
CAAN'06
(July 2, 2006, Chester, UK),
LNCS 4235, pp. 98-111, Springer-Verlag, 2006.
[BibTex]

(with Sven Kosub, Hanjo Täubig)
Acyclic Type-of-Relationship Problems on the Internet
Technical Report TUM-I0605,
Institut für Informatik, TU München, 2006.
[BibTex]

(with Johannes Nowak)
A new method for approximate indexing and dictionary lookup with one error
Information Processing Letters 96(5):185-191, 2005.
[BibTex]

(with Stefan Eckhardt, Sven Kosub, Hanjo Täubig, Sebastian Wernicke)
Combinatorial Network Abstraction by Trees and Distances
Proceedings of the 16th International Symposium on Algorithms and Computation,
ISAAC'05
(December 19-21, 2005, Hainan, China),
LNCS 3827, pp. 1100-1109, Springer-Verlag, 2005.
[BibTex]

Computing Suffix Links for Suffix Trees and Arrays
Technical Report TUM-I0514,
Institut für Informatik, TU München, 2005.
[BibTex]

(with Johannes Nowak)
Text Indexing with Errors
Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching,
CPM 2005
(June 19-22, 2005, Jeju Island, Korea),
LNCS 3537, pp. 21-32, Springer-Verlag, 2005.
[BibTex]

(with Johannes Nowak)
Text Indexing with Errors
Technical Report TUM-I0503,
Institut für Informatik, TU München, 2005.
[BibTex]

(with Stefan Eckhardt, Sven Kosub, Hanjo Täubig, Sebastian Wernicke)
Combinatorial Network Abstraction by Trees and Distances
Technical Report TUM-I0502,
Institut für Informatik, TU München, 2005.
[BibTex]

Average-Case Analysis of Approximate Trie Search
Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching,
CPM 2004
(July 5-7, 2004, Istanbul, Turkey),
LNCS 3109, pp. 472-483, Springer-Verlag, 2004.
[BibTex]

Average-Case Analysis of Approximate Trie Search
Technical Report TUM-I0405,
Institut für Informatik, TU München, 2004.
[BibTex]

A Fast Algorithm for the Inexact Characteristic String Problem
Technical Report TUM-I0312,
Institut für Informatik, TU München, 2003.
[BibTex]

Linear Bidirectional On-line Construction of Affix Trees
Algorithmica 37(1):43-74, 2003.
[BibTex]

(with Klaus Holzapfel, Sven Kosub, Hanjo Täubig)
The Complexity of Detecting Fixed-Density Clusters
Proceedings of the 5th Italian Conference on Algorithms and Complexity,
CIAC'03
(May 28-30 2003, Rome, Italy),
LNCS 2653, pp. 201-212, Springer-Verlag, 2003.
[BibTex]

(with Klaus Holzapfel, Sven Kosub, Hanjo Täubig)
The Complexity of Detecting Fixed-Density Clusters
Technical Report TUM-I0212,
Institut für Informatik, TU München, 2002.
[BibTex]

Linear Bidirectional On-line Construction of Affix Trees
Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching,
CPM 2000 (June 21-23, 2000, Montreal, Canada),
LNCS 1848, pp. 320-334, Springer-Verlag, 2000.
[BibTex]

Ernst W. Mayr

(with Jeremias Weihmann)
Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms
Fundamenta Informaticae 137(1):61-86, 2015.
[BibTex]

(with Jeremias Weihmann)
Complexity Results for Fork-Free Petri Nets
Technical Report TUM-I1514,
Institut für Informatik, TU München, 2015.
[BibTex]

(with Jeremias Weihmann)
A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
Proceedings of the 35th Int. Conference on Application and Theory of Petri Nets and Concurrency,
Petri Nets 2014
(June 23-27, 2014, Tunis, Tunisia),
LNCS 8489, pp. 314-333, Springer-Verlag, 2014.
[BibTex]

(with Jeremias Weihmann)
Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities
Proceedings of the 7th Int. Workshop on Reachability Problems,
RP'13
(September 25-27, 2013, Uppsala, Sweden),
LNCS 8169, pp. 209-221, Springer-Verlag, 2013.
[BibTex]

(with Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke)
Inequalities for the Number of Walks in Graphs
Algorithmica 66(4):804-828, 2013.
[BibTex]

(with Jeremias Weihmann)
Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Edge Multiplicities
Technical Report TUM-I1335,
Institut für Informatik, TU München, 2013.
[BibTex]

(with Jeremias Weihmann)
Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets
Proceedings of the 34th Int. Conference on Application and Theory of Petri Nets and Concurrency,
Petri Nets 2013
(June 24-28, 2013, Milano, Italy),
LNCS 7927, pp. 70-89, Springer-Verlag, 2013.
[BibTex]

(with Jeremias Weihmann)
Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets
Technical Report TUM-I1325,
Institut für Informatik, TU München, 2013.
[BibTex]

(with Stephan Ritscher)
Dimension-dependent bounds for Gröbner bases of polynomial ideals
Journal of Symbolic Computation 49:78-94, 2013.
[BibTex]

(with Raymond Hemmecke, Sven Kosub, Hanjo Täubig, Jeremias Weihmann)
Inequalities for the Number of Walks in Graphs
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
ANALCO'12
(January 16, 2012, Kyoto, Japan), pp. 26-39, Society for Industrial and Applied Mathematics, 2012.
[BibTex]

(with Stephan Ritscher)
Space-efficient Gröbner basis computation without degree bounds
Proceedings of the 36th Int. Symposium on Symbolic and Algebraic Computation,
ISSAC'11
(June 8-11, 2011, San Jose, CA, USA), pp. 257-264, ACM Press, 2011.
[BibTex]

(with Raymond Hemmecke, Sven Kosub, Hanjo Täubig, Jeremias Weihmann)
Inequalities for the Number of Walks in Trees and General Graphs and a Generalization of a Theorem of Erdös and Simonovits
Technical Report TUM-I1109,
Institut für Informatik, TU München, 2011.
[BibTex]

From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity
Proceedings of the 12th Int. Workshop on Computer Algebra in Scientific Computing,
CASC'10
(September 6-12, 2010, Tsakhkadzor, Armenia),
LNCS 6244, pp. 204, Springer-Verlag, 2010.
[BibTex]

(with Stephan Ritscher)
Degree bounds for Gröbner bases of low-dimensional polynomial ideals
Proceedings of the 35th Int. Symposium on Symbolic and Algebraic Computation,
ISSAC'10
(July 25-28, 2010, Munich, Germany), pp. 21-27, ACM Press, 2010.
[BibTex]

Space-efficient computation for low-dimensional polynomial ideals
Proceedings of the Int. Conference on Polynomial Computer Algebra,
PCA'09
(April 8-12, 2009, St. Petersburg, Russia), pp. 41, Steklov Institute of Mathematics, Russian Academy of Sciences, 2009.
[BibTex]

(with Dmytro Chibisov, Victor G. Ganzha, Evgenii V. Vorozhtsov)
Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations
Proceedings of the 10th International Workshop on Computer Algebra in Scientific Computing,
CASC'07
(September 16-20, 2007, Bonn, Germany),
LNCS 4770, pp. 102-117, Springer-Verlag, 2007.
[BibTex]

(with Dmytro Chibisov)
Motion planning for 6R-Robots: multiple tasks with constrained velocity and orientation of the end-effector
Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation,
SNC'07
(July 25-27, 2007, Ontario, Canada), pp. 72-78, ACM Press, 2007.
[BibTex]

(with Dmytro Chibisov)
Computing Minimum-Time Motion for 6R Robots and Application to Industrial Welding
Proceedings of the 4th Int. Workshop on Computer Algebra Systems in Teaching and Research,
CASTR'07
(January 31 – February 3, 2007, Siedlce, Poland), 2007.
[BibTex]

(with Dmytro Chibisov, Victor G. Ganzha, Evgenii V. Vorozhtsov)
On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions
Proceedings of the 9th Int. Workshop on Computer Algebra in Scientific Computing,
CASC'06
(September 11-15, 2006, Chisinau, Moldova),
LNCS 4194, pp. 109-128, Springer-Verlag, 2006.
[BibTex]

(with Dmytro Chibisov, Sergey Pankratov)
Spatial Planning and Geometric Optimization: Combining Configuration Space and Energy Methods
Proceedings of the 5th International Workshop on Automated Deduction in Geometry,
ADG'04
(September 16-18, 2004, Gainesville, Florida, USA),
LNCS 3763, pp. 156-168, Springer-Verlag, 2006.
[BibTex]

(with Dmytro Chibisov, Victor G. Ganzha, Evgenii V. Vorozhtsov)
Generation of Orthogonal Grids on Curvilinear Trimmed Regions in Constant Time
Proceedings of the 8th International Workshop on Computer Algebra in Scientific Computing,
CASC'05
(September 12-16, 2005, Kalamata, Greece),
LNCS 3718, pp. 105-114, Springer-Verlag, 2005.
[BibTex]

(with Stefan Pfingstl)
Fachinformationssystem Informatik (FIS-I) und Semantische Technologien für Informationsportale (SemIPort)
Erfassung und Bearbeitung bibliographischer Daten

Proceedings of the 35. Jahrestagung der GI (Band 2),
Informatik 2005
(September 19-22, 2005, Bonn, Germany),
LNI P-68, pp. 702-703, Köllen Verlag, 2005.
[BibTex]

(with Agnes Koschmider, Michael Ley, Peter Luksch, Jörg Maas, Andreas Oberweis, Paul Ortyl, Stefan Pfingstl, Ute Rusnak, Daniel Sommer, Wolffried Stucky, Roland Vollmar)
Entwicklung eines Informationsportals für die Informatik
Proceedings of the 34. Jahrestagung der GI (Band 2),
INFORMATIK 2004
(Sep 20-24, 2004, Ulm, Germany),
LNI P-51, pp. 208-212, Köllen Verlag, 2004.
[BibTex]

(with Lutz Horn, Michael Ley, Peter Luksch, Jörg Maas, Andreas Oberweis, Paul Ortyl, Stefan Pfingstl, Enzo Rossi, Felix Rüssel, Ute Rusnak, Daniel Sommer, Wolffried Stucky, Roland Vollmar, Marco von Mevius)
Konzeption und Betrieb eines Kompetenz- und Dienstleistungsnetzes für die Informatik
Proceedings of the 33. Jahrestagung der GI (Band 1),
INFORMATIK 2003
(Sep 29 - Oct 2, 2003, Frankfurt / Main, Germany),
LNI P-34, pp. 132-147, Köllen Verlag, 2003.
[BibTex]

(with Volker Heun)
Efficient Dynamic Embeddings of Binary Trees into Hypercubes
Journal of Algorithms 43(1):51-84, 2002.
[BibTex]

(with Volker Heun)
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
Journal of Algorithms 43(1):17-50, 2002.
[BibTex]

(with Volker Heun)
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
Journal of Parallel and Distributed Computing 61(8):1110-1125, 2001.
[BibTex]

(with Ulla Koppenhagen)
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups
Journal of Symbolic Computation 31(1-2):259-276, 2001.
[BibTex]

(with Ulla Koppenhagen)
Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups
Information and Computation 158(2):98-124, 2000.
[BibTex]

(with Ulla Koppenhagen)
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
Journal of Symbolic Computation 28(3):317-338, 1999.
[BibTex]

(with Stefan Bischof)
On-Line Scheduling of Parallel Jobs with Runtime Restrictions
Proceedings of the 9th Annual International Symposium on Algorithms and Computation,
ISAAC'98
(December 14-16 1998, Taejon, Korea),
LNCS 1533, pp. 119-128, Springer-Verlag, 1998.
[BibTex]

(with Volker Heun)
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
Technical Report ICSI-TR-98-022,
International Computer Science Institute (ICSI), Berkeley, 1998.
[BibTex]

(with Volker Heun)
Efficient Dynamic Embeddings of Binary Trees into Hypercubes
Technical Report ICSI-TR-98-023,
International Computer Science Institute (ICSI), Berkeley, 1998.
[BibTex]

(with Petra Berenbrink, Tom Friedetzky)
Parallel Continuous Randomized Load Balancing
Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures,
SPAA'98
(June 28 - July 2 1998, Puerto Vallarta, Mexico), pp. 192-201, ACM Press, 1998.
[BibTex]

(with Stefan Bischof)
On-Line Scheduling of Parallel Jobs with Runtime Restrictions
Technical Report TUM-I9810,
Institut für Informatik, TU München, 1998.
[BibTex]

Some Complexity Results for Polynomial Ideals
Journal of Complexity 13(3):303-325, 1997.
[BibTex]

(with Ulla Koppenhagen)
The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups
Proceedings of the 11th International Symposium on Fundamentals of Computation Theory,
FCT'97 (September 1-3 1997, Krakow, Poland),
LNCS 1279, pp. 257-268, Springer-Verlag, 1997.
[BibTex]

(with Andrei Z. Broder)
Counting Minimum Weight Spanning Trees
Journal of Algorithms 24(1):171-176, 1997.
[BibTex]

(with Ralph Werchner)
Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks
Algorithmica 18(3):445-460, 1997.
[BibTex]

Some Complexity Results for Polynomial Ideals
Technical Report TUM-I9704,
Institut für Informatik, TU München, 1997.
[BibTex]

(with Ralph Werchner)
Divide-and-conquer algorithms on the hypercube
Theoretical Computer Science 162(2):283-296, 1996.
[BibTex]

(with Hans Stadtherr)
Efficient parallel algorithms for scheduling with tree precedence constraints
Proceedings of the 2nd International Euro-Par Conference on Parallel Processing,
Euro-Par'96
(Aug. 26-29 1996, Lyon, France),
LNCS 1124, pp. 543-554, Springer-Verlag, 1996.
[BibTex]

(with Volker Heun)
A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes
Proceedings of the 2nd International Euro-Par Conference on Parallel Processing,
Euro-Par'96
(Aug. 26-29 1996, Lyon, France),
LNCS 1123, pp. 222-233, Springer-Verlag, 1996.
[BibTex]

(with Ulla Koppenhagen)
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
Proceedings of the International Symposium on Symbolic and Algebraic Computation,
ISSAC'96 (July 24-26 1996, Zürich, Switzerland), pp. 55-62, ACM Press, 1996.
[BibTex]

(with Ulla Koppenhagen)
Optimal Gröbner Base Algorithms for Binomial Ideals
Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming,
ICALP'96
(July 8-12 1996, Paderborn, Germany),
LNCS 1099, pp. 244-255, Springer-Verlag, 1996.
[BibTex]

(with Klaus Kühnle)
Exponential space computation of Gröbner bases
Proceedings of the International Symposium on Symbolic and Algebraic Computation,
ISSAC'96 (July 24-26 1996, Zürich, Switzerland), pp. 63-71, ACM Press, 1996.
[BibTex]

(with Ulla Koppenhagen)
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals and Applications to Commutative Semigroups
Proceedings of the 2nd Magma Conference on Computational Algebra,
(May 12-16 1996, Milwaukee, Wisconsin, USA), 1996.
[BibTex]

(with Volker Heun)
Embedding Graphs with Bounded Treewidth into Optimal Hypercubes
Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science,
STACS'96 (Feb. 22-24, Grenoble, France),
LNCS 1046, pp. 157-168, Springer-Verlag, 1996.
[BibTex]

(with Ulla Koppenhagen)
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
Technical Report TUM-I9605,
Institut für Informatik, TU München, 1996.
[BibTex]

(with Ulla Koppenhagen)
The Complexity of the Equivalence Problem for Commutative Semigroups
Technical Report TUM-I9603,
Institut für Informatik, TU München, 1996.
[BibTex]

(with Ulla Koppenhagen)
Optimal Gröbner Base Algorithms for Binomial Ideals
Technical Report TUM-I9604,
Institut für Informatik, TU München, 1996.
[BibTex]

(with Volker Heun)
Optimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes
Technical Report TUM-I9607,
Institut für Informatik, TU München, 1996.
[BibTex]

(with Klaus Kühnle)
Exponential space computation of Gröbner bases
Technical Report TUM-I9606,
Institut für Informatik, TU München, 1996.
[BibTex]

Scheduling Interval Orders in Parallel
Parallel Algorithms and Applications 8:21-34, 1996.
[BibTex]

(with Volker Heun)
Optimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes
Proceedings of the 4th Workshop on Parallel Systems and Algorithms,
PASA'96 pp. 195-209, World Scientific Publishing, 1996.
[BibTex]

(with Volker Heun)
Embedding Graphs with Bounded Treewidth into Optimal Hypercubes
Technical Report TUM-I9539,
Institut für Informatik, TU München, 1995.
[BibTex]

(with Ralph Werchner)
Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks
Technical Report TUM-I9532,
Institut für Informatik, TU München, 1995.
[BibTex]

(with Hans Stadtherr)
Optimal Parallel Algorithms for Two Processor Scheduling with Tree Precedence Constraints
Technical Report TUM-I9531,
Institut für Informatik, TU München, 1995.
[BibTex]

(with Stefan Bischof, Thomas Erlebach, Volker Heun, Ulla Koppenhagen, Klaus Kühnle, Hans Stadtherr)
27. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen
Technical Report TUM-I9530,
Institut für Informatik, TU München, 1995.
[BibTex]

(with Ulla Koppenhagen)
The Complexity of the Boundedness, Coverability, and Selfcoverability Problems for Commutative Semigroups
Technical Report TUM-I9518,
Institut für Informatik, TU München, 1995.
[BibTex]

On Polynomial Ideals, Their Complexity, and Applications
Technical Report TUM-I9520,
Institut für Informatik, TU München, 1995.
[BibTex]

Scheduling Interval Orders in Parallel
Proceedings of the 28th Annual Hawaii International Conference on System Sciences,
HICSS-28
(January 3-6 1995, Kihei, Maui, Hawaii), pp. 20-28, IEEE Computer Society Press, 1995.
[BibTex]

Scheduling Interval Orders in Parallel
Technical Report TUM-I9426,
Institut für Informatik, TU München, 1994.
[BibTex]

(with Ralph Werchner)
Divide-and-Conquer Algorithms on the Hypercube
Technical Report TUM-I9322,
Institut für Informatik, TU München, 1993.
[BibTex]

(with Volker Heun)
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
Technical Report TUM-I9321,
Institut für Informatik, TU München, 1993.
[BibTex]

(with Charles Gregory Plaxton)
Pipelined parallel prefix computations, and sorting on a pipelined hypercube
Journal of Parallel and Distributed Computing 17(4):374-380, 1993.
[BibTex]

(with Volker Heun)
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
Proceedings of the 3rd Workshop on Parallel Systems and Algorithms,
PASA'93 (April 1-2 1993, Bonn, Germany), Mitteilungen - Gesellschaft für Informatik e.V., Parallel-Algorithmen und Rechnerstrukturen (11):7-11 1993.
[BibTex]

(with Ralph Werchner)
Divide-and-Conquer Algorithms on the Hypercube
Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science,
STACS'93 (Feb. 25-27 1993, Würzburg, Germany),
LNCS 665, pp. 153-162, Springer-Verlag, 1993.
[BibTex]

(with Charles Gregory Plaxton)
On the Spanning Trees of Weighted Graphs
Combinatorica 12(4):433-447, 1992.
[BibTex]

Michal Mnuk

Degrees of Complexity in Polynomial Ideals
Habilitation, Institut für Informatik, Technische Universität München, 2006.
[BibTex]

The Computer Algebra Web
Proceedings of the 6th International Workshop on Computer Algebra in Scientific Computing,
CASC 2003
(September 20-26, 2003, Passau, Germany), pp. 263-273, Institut für Informatik, TU München, 2003.
[BibTex]

(with Gerd Baumann)
Elements - An object oriented approach to industrial software development
Technical Report TUM-I0308,
Institut für Informatik, TU München, 2003.
[BibTex]

How Helpful Are Systems for Algorithm Visualization?
Technical Report TUM-I0303,
Institut für Informatik, TU München, 2003.
[BibTex]

On an Algebraic Description of Colorability of Planar Graphs
Proceedings of the Logic, Mathematics and Computer Science: Interactions. Symp. in Honor of Buchberger's 60th Birthday,
LMCS 2002
(October 20-22, 2002, RISC Linz, Castle of Hagenberg, Austria), pp. 177-186, 2002.
[BibTex]

(with Gerd Baumann)
On Structured Representation of Physical Objects
Proceedings of the 5th International Workshop on Computer Algebra in Scientific Computing,
CASC 2002
(September 22-27, 2002, Yalta, Ukraine), pp. 227-235, Institut für Informatik, TU München, 2002.
[BibTex]

Representing Graph Properties by Polynomial Ideals
Proceedings of the 4th International Workshop on Computer Algebra in Scientific Computing,
CASC 2001
(September 22-26, 2001, Konstanz, Germany), pp. 431-444, Springer-Verlag, 2001.
[BibTex]

Johannes Nowak

Algorithmic Methods for Lowest Common Ancestor Problems in Directed Acyclic Graphs
Dissertation, Institut für Informatik, Technische Universität München, 2009.
[BibTex]

(with Stefan Eckhardt, Andreas M. Mühling)
Fast Lowest Common Ancestor Computations in Dags
Proceedings of the 15th European Symposium on Algorithms,
ESA'07
(October 8-10, 2007, Eilat, Israel),
LNCS 4698, pp. 705-716, Springer-Verlag, 2007.
[BibTex]

(with Stefan Eckhardt, Sven Kosub)
Smoothed Analysis of Trie Height
Technical Report TUM-I0715,
Institut für Informatik, TU München, 2007.
[BibTex]

(with Matthias Baumgart, Stefan Eckhardt, Jan H. Griebsch, Sven Kosub)
All-Pairs Common-Ancestor Problems in Weighted Dags
Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
ESCAPE'07
(April 7-9, 2007, Hangzhou, China),
LNCS 4614, pp. 282-293, Springer-Verlag, 2007.
[BibTex]

(with Abdullah N. Arslan)
Efficient approximate dictionary look-up for long words over small alphabets
Technical Report TUM-I0708,
Institut für Informatik, TU München, 2007.
[BibTex]

(with Stefan Eckhardt, Andreas M. Mühling)
Fast Lowest Common Ancestor Computations in Dags
Technical Report TUM-I0707,
Institut für Informatik, TU München, 2007.
[BibTex]

(with Matthias Baumgart, Stefan Eckhardt, Jan H. Griebsch, Sven Kosub)
All-Pairs Common-Ancestor Problems in Weighted Dags
Technical Report TUM-I0606,
Institut für Informatik, TU München, 2006.
[BibTex]

(with Moritz G. Maaß)
A new method for approximate indexing and dictionary lookup with one error
Information Processing Letters 96(5):185-191, 2005.
[BibTex]

(with Moritz G. Maaß)
Text Indexing with Errors
Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching,
CPM 2005
(June 19-22, 2005, Jeju Island, Korea),
LNCS 3537, pp. 21-32, Springer-Verlag, 2005.
[BibTex]

(with Moritz G. Maaß)
Text Indexing with Errors
Technical Report TUM-I0503,
Institut für Informatik, TU München, 2005.
[BibTex]

Stefan Pfingstl

Dublettenerkennung
Ähnlichkeitsmaße und Verfahren

Dissertation, Institut für Informatik, Technische Universität München, 2007.
[BibTex]

(with Ernst W. Mayr)
Fachinformationssystem Informatik (FIS-I) und Semantische Technologien für Informationsportale (SemIPort)
Erfassung und Bearbeitung bibliographischer Daten

Proceedings of the 35. Jahrestagung der GI (Band 2),
Informatik 2005
(September 19-22, 2005, Bonn, Germany),
LNI P-68, pp. 702-703, Köllen Verlag, 2005.
[BibTex]

(with Agnes Koschmider, Michael Ley, Peter Luksch, Jörg Maas, Ernst W. Mayr, Andreas Oberweis, Paul Ortyl, Ute Rusnak, Daniel Sommer, Wolffried Stucky, Roland Vollmar)
Entwicklung eines Informationsportals für die Informatik
Proceedings of the 34. Jahrestagung der GI (Band 2),
INFORMATIK 2004
(Sep 20-24, 2004, Ulm, Germany),
LNI P-51, pp. 208-212, Köllen Verlag, 2004.
[BibTex]

(with Paul Ortyl)
Extrahierung bibliographischer Daten aus dem Internet
Proceedings of the 34. Jahrestagung der GI (Band 2),
INFORMATIK 2004
(Sep 20-24, 2004, Ulm, Germany),
LNI P-51, pp. 203-207, Köllen Verlag, 2004.
[BibTex]

(with Lutz Horn, Michael Ley, Peter Luksch, Jörg Maas, Ernst W. Mayr, Andreas Oberweis, Paul Ortyl, Enzo Rossi, Felix Rüssel, Ute Rusnak, Daniel Sommer, Wolffried Stucky, Roland Vollmar, Marco von Mevius)
Konzeption und Betrieb eines Kompetenz- und Dienstleistungsnetzes für die Informatik
Proceedings of the 33. Jahrestagung der GI (Band 1),
INFORMATIK 2003
(Sep 29 - Oct 2, 2003, Frankfurt / Main, Germany),
LNI P-34, pp. 132-147, Köllen Verlag, 2003.
[BibTex]

Chris Pinkau

Martin Raab

(with Angelika Steger)
Balls into Bins - A Simple and Tight Analysis
Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science,
RANDOM'98
(October 8-10 1998, Barcelona, Spain),
LNCS 1518, pp. 159-170, Springer-Verlag, 1998.
[BibTex]

(with Oliver Krone, Béat Hirsbrunner)
Load Balancing for Network Based Multi-threaded Applications
Proceedings of the 5th European PVM-MPI Users Group Meeting,
EuroPVM/MPI (September 7-9 1998, Liverpool, UK),
LNCS 1497, pp. 206-214, Springer-Verlag, 1998.
[BibTex]

Stephan Ritscher

Harald Räcke

(with Chintan Shah)
Improved Guarantees for Tree Cut Sparsifiers
Proceedings of the 22nd European Symposium on Algorithms,
ESA'14
(September 8-12, 2014, Wroclaw, Poland),
LNCS 8737, pp. 774-785, Springer-Verlag, 2014.
[BibTex]

(with Matthias Englert, Anupam Gupta, Robert Krauthgamer, Inbal Talgam-Cohen, Kunal Talwar)
Vertex Sparsifiers: New Results from Old Techniques
SIAM Journal on Computing 43(4):1239-1262, 2014.
[BibTex]

(with Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini)
Online Stochastic Reordering Buffer Scheduling
Proceedings of the 41st International Colloquium on Automata, Languages, and Programming,
ICALP'14
(July 7-11, 2014, Copenhagen, Denmark),
LNCS 8572, pp. 465-476, Springer-Verlag, 2014.
[BibTex]

(with Chintan Shah, Hanjo Täubig)
Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms,
SODA'14
(January 5-7, 2014, Portland, Oregon, USA), pp. 227-238, Society for Industrial and Applied Mathematics, 2014.
[BibTex]

(with Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Christian Scheideler, Christian Sohler, Till Tantau)
Smoothed Analysis of Left-To-Right Maxima with Applications
ACM Transactions on Algorithms 8(3):30:1-30:28, 2012.
[BibTex]

(with Anna Adamaszek, Artur Czumaj, Matthias Englert)
Optimal online buffer scheduling for block devices
Proceedings of the 44th ACM Symposium on Theory of Computing,
STOC'12
(May 19-22, 2012, New York, NY, USA), pp. 589-598, ACM Press, 2012.
[BibTex]

(with Anna Adamaszek, Artur Czumaj, Matthias Englert)
An O(log k)-competitive Algorithm for Generalized Caching
Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms,
SODA'12
(January 17-19, 2012, Kyoto, Japan), pp. 1681-1689, Society for Industrial and Applied Mathematics, 2012.
[BibTex]

(with Adi Rosén)
Approximation Algorithms for Time-Constrained Scheduling on Line Networks
Theory of Computing Systems 49(4):834-856, 2011.
[BibTex]

(with Anna Adamaszek, Artur Czumaj, Matthias Englert)
Almost Tight Bounds for Reordering Buffer Management
Proceedings of the 43rd ACM Symposium on Theory of Computing,
STOC'11
(June 6-8, 2011, San Jose, CA, USA), pp. 607-616, ACM Press, 2011.
[BibTex]

Sandeep Sadanandan

Counting in the Jacobian of Hyperelliptic Curves
In the light of genus 2 curves for cryptography

Dissertation, Institut für Informatik, Technische Universität München, 2010.
[BibTex]

(with Rajyalakshmi Mahalingam)
Light Weight Cryptography and Applications
Proceedings of the 3rd Int. Conference on Telecommunications and Networking,
TeNe'07 / CISSE'07
(Dec 3-12, 2007, Internet conference), pp. 484-488, Springer-Verlag, 2008.
[BibTex]

Marouane Sayih

(with Anne Brüggemann-Klein, Lyuben Dimitrov)
Graphical User Interface Tool for Designing Model-Based User Interfaces with UIML
Proceedings of the XML Prague 2015,
(February 13-15, 2015, Prague, Czech Republic), pp. 139-158, 2015.
[BibTex]

(with Anne Brüggemann-Klein, Mustapha Maalej)
Identity constraints for XML
Proceedings of the Balisage: The Markup Conference 2014,
(August 5-8, 2014, Washington, DC, USA),
Balisage Series on Markup Technologies 13, 2014.
[BibTex]

(with Martin Kuhn, Anne Brüggemann-Klein)
GameX - Event-Based Programming with XML Technology
Proceedings of the Balisage: The Markup Conference 2014,
(August 5-8, 2014, Washington, DC, USA),
Balisage Series on Markup Technologies 13, 2014.
[BibTex]

(with Anne Brüggemann-Klein, Mustapha Maalej)
XML Schema Identity Constraints Revisited
Proceedings of the XML Prague 2014,
(February 14-16, 2014, Prague, Czech Republic), pp. 123-145, 2014.
[BibTex]

(with Anne Brüggemann-Klein, Jose Tomas Robles Hahn)
Leveraging XML Technology for Web Applications
Proceedings of the Balisage: The Markup Conference 2012,
(August 7-9, 2012, Montréal, Canada ),
Balisage Series on Markup Technologies 8, 2012.
[BibTex]

Mark Scharbrodt

(with Thomas Schickinger, Angelika Steger)
A new average case analysis for completion time scheduling
Proceedings of the 34th Annual ACM Symposium on Theory of Computing,
STOC'02
(May 19-21 2002, Montréal, Québec, Canada), pp. 170-178, ACM Press, 2002.
[BibTex]

Produktionsplanung in der Prozessindustrie: Modelle, effiziente Algorithmen und Umsetzung
Dissertation, Institut für Informatik, Technische Universität München, 2000.
[BibTex]

(with Angelika Steger, Horst Weisser)
Approximability of scheduling with fixed jobs
Journal of Scheduling 2(6):267-284, 1999.
[BibTex]

(with Angelika Steger, Horst Weisser)
Approximability of Scheduling with Fixed Jobs
Technical Report TUM-I9907,
Institut für Informatik, TU München, 1999.
[BibTex]

(with Angelika Steger, Horst Weisser)
Approximability of scheduling with fixed jobs
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms,
SODA'99
(January 17-19 1999, Baltimore, Maryland), pp. 961-962, ACM Press, 1999.
[BibTex]

Christian Scheideler

(with Riko Jacob, Andréa Richa, Stefan Schmid, Hanjo Täubig)
SKIP+: A Self-Stabilizing Skip Graph
Journal of the ACM 61(6):Article 36, 2014.
[BibTex]

(with Dominik Gall, Riko Jacob, Andréa Richa, Stefan Schmid, Hanjo Täubig)
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
Theory of Computing Systems 55(1):110-135, 2014.
[BibTex]

(with Riko Jacob, Stephan Ritscher, Stefan Schmid)
Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs
Theoretical Computer Science 457:137-148, 2012.
[BibTex]

(with Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Sohler, Till Tantau)
Smoothed Analysis of Left-To-Right Maxima with Applications
ACM Transactions on Algorithms 8(3):30:1-30:28, 2012.
[BibTex]

(with Thomas Clouser, Mikhail Nesterenko)
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science 428:18-35, 2012.
[BibTex]

(with Dominik Gall, Riko Jacob, Andréa Richa, Stefan Schmid, Hanjo Täubig)
Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization
Proceedings of the 9th Latin American Theoretical Informatics Symposium,
LATIN'10
(April 19-23, 2010, Oaxaca, Mexico),
LNCS 6034, pp. 294-305, Springer-Verlag, 2010.
[BibTex]

(with Riko Jacob, Stephan Ritscher, Stefan Schmid)
A Self-stabilizing and Local Delaunay Graph Construction
Proceedings of the 20th Int. Symposium on Algorithms and Computation,
ISAAC'09
(December 16-18, 2009, Hawaii, USA),
LNCS 5878, pp. 771-780, Springer-Verlag, 2009.
[BibTex]

(with Dominik Gall, Riko Jacob, Andréa Richa, Stefan Schmid, Hanjo Täubig)
Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization
Proceedings of the 11th Int. Symposium on Stabilization, Safety, and Security of Distributed Systems,
SSS'09
(November 3-6, 2009, Lyon, France),
LNCS 5873, pp. 781-782, Springer-Verlag, 2009.
[BibTex]

(with Matthias Baumgart, Stefan Schmid)
A DoS-Resilient Information System for Dynamic Data Management
Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA'09
(August 11-13, 2009, Calgary, Canada), pp. 300-309, 2009.
[BibTex]

(with Riko Jacob, Andréa Richa, Stefan Schmid, Hanjo Täubig)
A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs
Proceedings of the 28th Symposium on Principles of Distributed Computing,
PODC'09
(August 10-12, 2009, Calgary, Alberta, Canada), pp. 131-140, ACM Press, 2009.
[BibTex]

(with Stefan Schmid)
A Distributed and Oblivious Heap
Proceedings of the 36th Int. Colloquium on Automata, Languages and Programming,
ICALP'09
(July 5-12, 2009, Rhodes, Greece),
LNCS 5556, pp. 571-582, Springer-Verlag, 2009.
[BibTex]

(with Matthias Baumgart, Stefan Schmid)
A DoS-Resilient Information System for Dynamic Data Management
Technical Report TUM-I0906,
Institut für Informatik, TU München, 2009.
[BibTex]

(with Thomas Clouser, Mikhail Nesterenko)
Tiara: A Self-stabilizing Deterministic Skip List
Proceedings of the 10th Int. Symposium on Stabilization, Safety, and Security of Distributed Systems,
SSS'08
(November 21-23, 2008, Detroit, MI, USA),
LNCS 5340, pp. 124-140, Springer-Verlag, 2008.
[BibTex]

(with Baruch Awerbuch, Andréa Richa)
A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks
Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing,
PODC'08
(August 18-21, 2008, Toronto, Canada), pp. 45-54, ACM Press, 2008.
[BibTex]

(with Dominik Gall, Riko Jacob, Andréa Richa, Stefan Schmid, Hanjo Täubig)
Modeling Scalability in Distributed Self-Stabilization: The Case of Graph Linearization
Technical Report TUM-I0835,
Institut für Informatik, TU München, 2008.
[BibTex]

(with Andréa Richa, Paolo Santi)
An O(log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model
Proceedings of the 9th ACM Symposium on Mobile Ad Hoc Networking and Computing,
MobiHoc'08
(May 27-30, 2008, Hong Kong SAR, China), pp. 91-100, ACM Press, 2008.
[BibTex]

(with Mario Mense)
SPREAD: An adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems
Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms,
SODA'08
(January 20-22, 2008, San Francisco, CA, USA), pp. 1135-1144, ACM Press, 2008.
[BibTex]

(with Baruch Awerbuch)
A denial-of-service resistant DHT
Proceedings of the 21st International Symposium on Distributed Computing,
DISC'07
(September 24-26, 2007, Lemesos, Cyprus),
LNCS 4731, pp. 33-47, Springer-Verlag, 2007.
[BibTex]

(with Baruch Awerbuch)
A denial-of-service resistant DHT
Proceedings of the 26th Annual ACM Syposium on Principles of Distributed Computing,
PODC'07
(August 12-15, 2007, Portland, OR, USA), pp. 370-371, ACM Press, 2007.
[BibTex]

(with André Brinkmann, Sascha Effert, Friedhelm Meyer auf der Heide)
Dynamic and Redundant Data Placement
Proceedings of the 27th IEEE International Conference on Distributed Computing Systems ,
ICDCS'07
(June 25-29, 2007, Toronto, Canada), pp. 29-38, IEEE Computer Society Press, 2007.
[BibTex]

(with Baruch Awerbuch)
Towards Scalable and Robust Overlay Networks
Proceedings of the 6th Int. Workshop on Peer-to-Peer Systems,
IPTPS'07
(February 26-27, 2007, Bellevue, WA, USA), 2007.
[BibTex]

(with Melih Onus, Andréa Richa)
Linearization: Locally Self-Stabilizing Sorting in Graphs
Proceedings of the 9th Workshop on Algorithm Engineering and Experiments,
ALENEX'07
(January 6, 2007, New Orleans, Louisiana), Society for Industrial and Applied Mathematics, 2007.
[BibTex]

Overlay networks for wireless ad hoc networks
In: Prathima Agrawal, Daniel Matthew Andrews, Philip J. Fleming, George Yin, Lisa Zhang (Ed.):
Wireless Communications
The IMA Volumes in Mathematics and its Applications 143, Springer-Verlag, 2007.
[BibTex]

(with Baruch Awerbuch)
Robust Random Number Generation for Peer-to-Peer Systems
Proceedings of the 10th Int. Conference On Principles Of Distributed Systems,
OPODIS'06
(December 12-15, 2006, Bordeaux, France),
LNCS 4305, pp. 275-289, Springer-Verlag, 2006.
[BibTex]

(with Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein)
The Effect of Faults on Network Expansion
Theory of Computing Systems 39(6):903-928, 2006.
[BibTex]

(with Giuseppe Ateniese, Chris Riley)
Survivable Monitoring in Dynamic Networks
IEEE Transactions on Mobile Computing 5(9):1242-1254, 2006.
[BibTex]

(with Baruch Awerbuch)
Towards a Scalable and Robust DHT
Proceedings of the 18th Symposium on Parallelism in Algorithms and Architectures,
SPAA'06
(July 30 - August 2, 2006, Cambridge, MA, USA), pp. 318-327, ACM Press, 2006.
[BibTex]

(with Kishore Kothapalli, Melih Onus, Christian Schindelhauer)
Distributed Coloring in Õ(sqrt{log n}) Bit Rounds
Proceedings of the 20th Int. Parallel and Distributed Processing Symposium,
IPDPS'06
(April 25-29, 2006, Rhodes Island, Greece), 2006.
[BibTex]

Towards a paradigm for robust distributed algorithms and data structures
Proceedings of the 6th Int. Heinz Nixdorf Symposium on New Trends in Parallel & Distributed Computing,
(January 17-18, 2006, Paderborn, Germany), 2006.
[BibTex]

(with Miroslaw Korzeniowski)
Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment
Proceedings of the 8th Int. Symposium on Parallel Architectures, Algorithms, and Networks,
I-SPAN'05
(December 7-9, 2005, Las Vegas, Nevada, USA), pp. 182-187, IEEE Computer Society Press, 2005.
[BibTex]

(with Kishore Kothapalli)
Supervised Peer-to-Peer Systems
Proceedings of the 8th Int. Symposium on Parallel Architectures, Algorithms, and Networks,
I-SPAN'05
(December 7-9, 2005, Las Vegas, Nevada, USA), pp. 188-193, IEEE Computer Society Press, 2005.
[BibTex]

(with Melih Onus, Andréa Richa, Kishore Kothapalli)
Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks
Proceedings of the 8th Int. Symposium on Parallel Architectures, Algorithms, and Networks,
I-SPAN'05
(December 7-9, 2005, Las Vegas, Nevada, USA), pp. 346-351, IEEE Computer Society Press, 2005.
[BibTex]

Thomas Schickinger

(with Stefanie Gerke, Angelika Steger)
K<sub>5</sub>-Free Subgraphs of Random Graphs
Random Structures and Algorithms 24(2):194-232, 2004.
[BibTex]

Complete Subgraphs of Random Graphs
Dissertation, Institut für Informatik, Technische Universität München, 2002.
[BibTex]

(with Hans Jürgen Prömel, Angelika Steger)
A note on triangle-free and bipartite graphs
Discrete Mathematics 257(2-3):531-540, 2002.
[BibTex]

(with Mark Scharbrodt, Angelika Steger)
A new average case analysis for completion time scheduling
Proceedings of the 34th Annual ACM Symposium on Theory of Computing,
STOC'02
(May 19-21 2002, Montréal, Québec, Canada), pp. 170-178, ACM Press, 2002.
[BibTex]

(with Hans Jürgen Prömel, Angelika Steger)
On the Structure of Clique-free Graphs
Random Structures and Algorithms 19(1):37-53, 2001.
[BibTex]

(with Angelika Steger)
Diskrete Strukturen (Band 2)
Wahrscheinlichkeitstheorie und Statistik

Springer-Verlag, 2001.
[BibTex]

(with Angelika Steger)
Simplified Witness Tree Arguments
Proceedings of the 27th Annual Conference on Current Trends in Theory and Practice of Informatics,
SOFSEM 2000
(November 25 - December 2 2000, Milovy, Czech Republic),
LNCS 1963, pp. 71-87, Springer-Verlag, 2000.
[BibTex]

(with Stefan Bischof, Angelika Steger)
Load Balancing Using Bisectors ­ A Tight Average-Case Analysis
Proceedings of the 7th Annual European Symposium on Algorithms,
ESA'99
(July 16-18 1999, Prague, Czech Republic),
LNCS 1643, pp. 172-183, Springer-Verlag, 1999.
[BibTex]

Stefan Schmid

(with Riko Jacob, Andréa Richa, Christian Scheideler, Hanjo Täubig)
SKIP+: A Self-Stabilizing Skip Graph
Journal of the ACM 61(6):Article 36, 2014.
[BibTex]

(with Dominik Gall, Riko Jacob, Andréa Richa, Christian Scheideler, Hanjo Täubig)
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
Theory of Computing Systems 55(1):110-135, 2014.
[BibTex]

(with Riko Jacob, Stephan Ritscher, Christian Scheideler)
Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs
Theoretical Computer Science 457:137-148, 2012.
[BibTex]

(with Dominik Gall, Riko Jacob, Andréa Richa, Christian Scheideler, Hanjo Täubig)
Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization
Proceedings of the 9th Latin American Theoretical Informatics Symposium,
LATIN'10
(April 19-23, 2010, Oaxaca, Mexico),
LNCS 6034, pp. 294-305, Springer-Verlag, 2010.
[BibTex]

(with Riko Jacob, Stephan Ritscher, Christian Scheideler)
A Self-stabilizing and Local Delaunay Graph Construction
Proceedings of the 20th Int. Symposium on Algorithms and Computation,
ISAAC'09
(December 16-18, 2009, Hawaii, USA),
LNCS 5878, pp. 771-780, Springer-Verlag, 2009.
[BibTex]

(with Dominik Gall, Riko Jacob, Andréa Richa, Christian Scheideler, Hanjo Täubig)
Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization
Proceedings of the 11th Int. Symposium on Stabilization, Safety, and Security of Distributed Systems,
SSS'09
(November 3-6, 2009, Lyon, France),
LNCS 5873, pp. 781-782, Springer-Verlag, 2009.
[BibTex]

(with Matthias Baumgart, Christian Scheideler)
A DoS-Resilient Information System for Dynamic Data Management
Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA'09
(August 11-13, 2009, Calgary, Canada), pp. 300-309, 2009.
[BibTex]

(with Riko Jacob, Andréa Richa, Christian Scheideler, Hanjo Täubig)
A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs
Proceedings of the 28th Symposium on Principles of Distributed Computing,
PODC'09
(August 10-12, 2009, Calgary, Alberta, Canada), pp. 131-140, ACM Press, 2009.
[BibTex]

(with Christian Scheideler)
A Distributed and Oblivious Heap
Proceedings of the 36th Int. Colloquium on Automata, Languages and Programming,
ICALP'09
(July 5-12, 2009, Rhodes, Greece),
LNCS 5556, pp. 571-582, Springer-Verlag, 2009.
[BibTex]

(with Thomas Locher, Remo Meier, Roger Wattenhofer)
Robust Live Media Streaming in Swarms
Proceedings of the 19th Int. Workshop on Network and Operating Systems Support for Digital Audio and Video,
NOSSDAV'09
(June 3-5, 2009, Williamsburg, VA, USA), pp. 121-126, 2009.
[BibTex]

(with Dominic Meier, Yvonne Anne Pignolet (Oswald), Roger Wattenhofer)
Speed Dating Despite Jammers
Proceedings of the 5th IEEE Int. Conference on Distributed Computing in Sensor Systems,
DCOSS'09 (June 8-10, 2009, Marina del Rey, CA, USA),
LNCS 5516, pp. 1-14, Springer-Verlag, 2009.
[BibTex]

(with Raphael Eidenbenz)
Combinatorial Agency with Audits
Proceedings of the Int. Conference on Game Theory for Networks,
GameNets'09
(May 13-15, 2009, Istanbul, Turkey), pp. 374-383, 2009.
[BibTex]

(with Thomas Moscibroda)
On Mechanism Design Without Payments for Throughput Maximization
Proceedings of the 28th IEEE Conference on Computer Communications,
INFOCOM'09
(April 19-25, 2009, Rio de Janeiro, Brazil), pp. 972-980, 2009.
[BibTex]

(with Matthias Baumgart, Christian Scheideler)
A DoS-Resilient Information System for Dynamic Data Management
Technical Report TUM-I0906,
Institut für Informatik, TU München, 2009.
[BibTex]

(with Yvonne Anne Pignolet (Oswald), Roger Wattenhofer)
Tight Bounds for Delay-Sensitive Aggregation
Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing,
PODC'08
(August 18-21, 2008, Toronto, Canada), pp. 195-202, ACM Press, 2008.
[BibTex]

(with Fabian Kuhn, Thomas Locher)
Distributed Computation of the Mode
Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing,
PODC'08
(August 18-21, 2008, Toronto, Canada), pp. 15-24, ACM Press, 2008.
[BibTex]

(with Dominik Gall, Riko Jacob, Andréa Richa, Christian Scheideler, Hanjo Täubig)
Modeling Scalability in Distributed Self-Stabilization: The Case of Graph Linearization
Technical Report TUM-I0835,
Institut für Informatik, TU München, 2008.
[BibTex]

(with Dominic Meier, Yvonne Anne Pignolet (Oswald), Roger Wattenhofer)
On the Windfall of Friendship: Inoculation Strategies on Social Networks
Proceedings of the 9th ACM Conference on Electronic Commerce,
EC'08
(July 8-12, 2008, Chicago, IL, USA), pp. 8-12, ACM Press, 2008.
[BibTex]

(with Bernard Mans, Roger Wattenhofer)
Distributed Disaster Disclosure
Proceedings of the 11th Scandinavian Workshop on Algorithm Theory,
SWAT'08
(July 2-4, 2008, Gothenburg, Schweden),
LNCS 5124, pp. 246-257, Springer-Verlag, 2008.
[BibTex]

(with Michael Kuhn, Roger Wattenhofer)
Distributed Asymmetric Verification in Computational Grids
Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium,
IPDPS'08
(April 14-18, 2008, Miami, FL, USA), pp. 1-10, IEEE Computer Society Press, 2008.
[BibTex]

Michael Schnupp

Chintan Shah

Alexander Souza

Hans Stadtherr

(with Thomas Erlebach, Peter Rossmanith, Angelika Steger, Thomas Zeugmann)
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Theoretical Computer Science 261(1):119-156, 2001.
[BibTex]

Work Efficient Parallel Scheduling Algorithms
Dissertation, Institut für Informatik, Technische Universität München,, Utz Verlag 1998.
[BibTex]

(with Thomas Erlebach, Peter Rossmanith, Angelika Steger, Thomas Zeugmann)
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Proceedings of the 8th International Workshop Algorithmic Learning Theory,
ALT'97
(October 6-8 1997, Sendai, Japan),
LNAI 1316, pp. 260-276, Springer-Verlag, 1997.
[BibTex]

(with Thomas Erlebach, Peter Rossmanith, Angelika Steger, Thomas Zeugmann)
Efficient Learning of One-Variable Pattern Languages from Positive Data
Technical Report DOI-TR-128,
Department of Informatics, Kyushu University, Fukuoka, Japan, 1996.
[BibTex]

(with Ernst W. Mayr)
Efficient parallel algorithms for scheduling with tree precedence constraints
Proceedings of the 2nd International Euro-Par Conference on Parallel Processing,
Euro-Par'96
(Aug. 26-29 1996, Lyon, France),
LNCS 1124, pp. 543-554, Springer-Verlag, 1996.
[BibTex]

(with Ernst W. Mayr)
Optimal Parallel Algorithms for Two Processor Scheduling with Tree Precedence Constraints
Technical Report TUM-I9531,
Institut für Informatik, TU München, 1995.
[BibTex]

(with Stefan Bischof, Thomas Erlebach, Volker Heun, Ulla Koppenhagen, Klaus Kühnle, Ernst W. Mayr)
27. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen
Technical Report TUM-I9530,
Institut für Informatik, TU München, 1995.
[BibTex]

Angelika Steger

(with Stefanie Gerke, Thomas Schickinger)
K<sub>5</sub>-Free Subgraphs of Random Graphs
Random Structures and Algorithms 24(2):194-232, 2004.
[BibTex]

(with Hans Jürgen Prömel, Thomas Schickinger)
A note on triangle-free and bipartite graphs
Discrete Mathematics 257(2-3):531-540, 2002.
[BibTex]

(with Mark Scharbrodt, Thomas Schickinger)
A new average case analysis for completion time scheduling
Proceedings of the 34th Annual ACM Symposium on Theory of Computing,
STOC'02
(May 19-21 2002, Montréal, Québec, Canada), pp. 170-178, ACM Press, 2002.
[BibTex]

(with Hans Jürgen Prömel)
The Steiner Tree Problem
A Tour Through Graphs, Algorithms and Complexity

Vieweg-Verlag, 2002.
[BibTex]

(with Hans Jürgen Prömel, Thomas Schickinger)
On the Structure of Clique-free Graphs
Random Structures and Algorithms 19(1):37-53, 2001.
[BibTex]

(with Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Thomas Zeugmann)
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Theoretical Computer Science 261(1):119-156, 2001.
[BibTex]

(with Thomas Schickinger)
Diskrete Strukturen (Band 2)
Wahrscheinlichkeitstheorie und Statistik

Springer-Verlag, 2001.
[BibTex]

Diskrete Strukturen (Band 1)
Kombinatorik - Graphentheorie - Algebra

Springer-Verlag, 2001.
[BibTex]

(with Thomas Schickinger)
Simplified Witness Tree Arguments
Proceedings of the 27th Annual Conference on Current Trends in Theory and Practice of Informatics,
SOFSEM 2000
(November 25 - December 2 2000, Milovy, Czech Republic),
LNCS 1963, pp. 71-87, Springer-Verlag, 2000.
[BibTex]

(with Hans Jürgen Prömel)
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
Journal of Algorithms 36(1):89-101, 2000.
[BibTex]

(with Petra Berenbrink, Artur Czumaj, Berthold Vöcking)
Balanced Allocations: The Heavily Loaded Case
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing,
STOC 2000
(May 21-23 2000, Portland, Oregon, USA), pp. 745-754, ACM Press, 2000.
[BibTex]

(with Mark Scharbrodt, Horst Weisser)
Approximability of scheduling with fixed jobs
Journal of Scheduling 2(6):267-284, 1999.
[BibTex]

(with Nicholas Charles Wormald)
Generating random regular graphs quickly
Combinatorics, Probability and Computing 8(4):377-396, 1999.
[BibTex]

(with Stefan Bischof, Thomas Schickinger)
Load Balancing Using Bisectors ­ A Tight Average-Case Analysis
Proceedings of the 7th Annual European Symposium on Algorithms,
ESA'99
(July 16-18 1999, Prague, Czech Republic),
LNCS 1643, pp. 172-183, Springer-Verlag, 1999.
[BibTex]

(with Petra Berenbrink, Tom Friedetzky)
Randomized and Adversarial Load Balancing
Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures,
SPAA'99
(June 27-30 1999, Saint-Malo, France), pp. 175-184, ACM Press, 1999.
[BibTex]

(with Mark Scharbrodt, Horst Weisser)
Approximability of Scheduling with Fixed Jobs
Technical Report TUM-I9907,
Institut für Informatik, TU München, 1999.
[BibTex]

(with Mark Scharbrodt, Horst Weisser)
Approximability of scheduling with fixed jobs
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms,
SODA'99
(January 17-19 1999, Baltimore, Maryland), pp. 961-962, ACM Press, 1999.
[BibTex]

(with Martin Raab)
Balls into Bins - A Simple and Tight Analysis
Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science,
RANDOM'98
(October 8-10 1998, Barcelona, Spain),
LNCS 1518, pp. 159-170, Springer-Verlag, 1998.
[BibTex]

(with Yoshiharu Kohayakawa, Bernd Kreuter)
An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth
Combinatorica 18(1):101-120, 1998.
[BibTex]

(with Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Thomas Zeugmann)
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Proceedings of the 8th International Workshop Algorithmic Learning Theory,
ALT'97
(October 6-8 1997, Sendai, Japan),
LNAI 1316, pp. 260-276, Springer-Verlag, 1997.
[BibTex]

(with Hans Jürgen Prömel)
RNC-Approximation Algorithms for the Steiner Problem
Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science,
STACS'97
(February 27 - March 1, 1997, Lübeck, Germany),
LNCS 1200, pp. 559-570, Springer-Verlag, 1997.
[BibTex]

(with Hans Jürgen Prömel)
RNC-Approximation Algorithms for the Steiner Problem
Technical Report TUM-I9633,
Institut für Informatik, TU München, 1996.
[BibTex]

(with Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Thomas Zeugmann)
Efficient Learning of One-Variable Pattern Languages from Positive Data
Technical Report DOI-TR-128,
Department of Informatics, Kyushu University, Fukuoka, Japan, 1996.
[BibTex]

(with Hans Jürgen Prömel)
Counting H-free graphs
Discrete Mathematics 154:311-315, 1996.
[BibTex]

(with Colin McDiarmid)
Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers
Journal of Combinatorial Theory, Series A 74(1):147-152, 1996.
[BibTex]

(with Graham Brightwell, Hans Jürgen Prömel)
The Average Number of Linear Extensions of a Partial Order
Journal of Combinatorial Theory, Series A 73(2):193-206, 1996.
[BibTex]

(with Hans Jürgen Prömel)
On the asymptotic structure of sparse triangle-free graphs
Journal of Graph Theory 21(2):137-151, 1996.
[BibTex]

(with Hans Jürgen Prömel)
Random l-colorable graphs
Random Structures and Algorithms 6:21-37, 1995.
[BibTex]

(with Stefan Hougardy, Hans Jürgen Prömel)
Probabilistically checkable proofs and their consequences for approximation algorithms
Discrete Mathematics 136:175-223, 1994.
[BibTex]

Hanjo Täubig

Matrix Inequalities for Iterative Systems
Science Publishers / CRC Press / Taylor & Francis Group, 2016.
[BibTex]

Inequalities for Matrix Powers and Absolute Values: A Generalization of London's Conjecture
Technical Report TUM-I1655,
Institut für Informatik, TU München, 2016.
[BibTex]

Inequalities for the Number of Walks in Subdivision Graphs
MATCH Communications in Mathematical and in Computer Chemistry 76(1):61-68, 2016.
[BibTex]

Inequalities for Matrix Powers and the Number of Walks in Graphs
Habilitation, Institut für Informatik, Technische Universität München, 2015.
[BibTex]

Inequalities for the Number of Walks in Subdivision Graphs
Technical Report TUM-I1525,
Institut für Informatik, TU München, 2015.
[BibTex]

(with Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre)
Welfare Maximization in Fractional Hedonic Games
Proceedings of the 24th International Joint Conference on Artificial Intelligence,
IJCAI'15
(July 25-31, 2015, Buenos Aires, Argentina), pp. 461-467, AAAI Press, 2015.
[BibTex]

(with Riko Jacob, Andréa Richa, Christian Scheideler, Stefan Schmid)
SKIP+: A Self-Stabilizing Skip Graph
Journal of the ACM 61(6):Article 36, 2014.
[BibTex]

(with Jeremias Weihmann)
Matrix Power Inequalities and the Number of Walks in Graphs
Discrete Applied Mathematics 176:122-129, 2014.
[BibTex]

(with Dominik Gall, Riko Jacob, Andréa Richa, Christian Scheideler, Stefan Schmid)
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
Theory of Computing Systems 55(1):110-135, 2014.
[BibTex]

Further Results on the Number of Walks in Graphs and Weighted Entry Sums of Matrix Powers
Technical Report TUM-I1412,
Institut für Informatik, TU München, 2014.
[BibTex]

(with Harald Räcke, Chintan Shah)
Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms,
SODA'14
(January 5-7, 2014, Portland, Oregon, USA), pp. 227-238, Society for Industrial and Applied Mathematics, 2014.
[BibTex]

(with Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr)
Inequalities for the Number of Walks in Graphs
Algorithmica 66(4):804-828, 2013.
[BibTex]

(with Jeremias Weihmann)
Inequalities for the Number of Walks, the Spectral Radius, and the Energy of Graphs
Technical Report TUM-I1211,
Institut für Informatik, TU München, 2012.
[BibTex]

The number of walks and degree powers in directed graphs
Technical Report TUM-I123,
Institut für Informatik, TU München, 2012.
[BibTex]

(with Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Jeremias Weihmann)
Inequalities for the Number of Walks in Graphs
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
ANALCO'12
(January 16, 2012, Kyoto, Japan), pp. 26-39, Society for Industrial and Applied Mathematics, 2012.
[BibTex]

(with Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Jeremias Weihmann)
Inequalities for the Number of Walks in Trees and General Graphs and a Generalization of a Theorem of Erdös and Simonovits
Technical Report TUM-I1109,
Institut für Informatik, TU München, 2011.
[BibTex]

(with Dominik Gall, Riko Jacob, Andréa Richa, Christian Scheideler, Stefan Schmid)
Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization
Proceedings of the 9th Latin American Theoretical Informatics Symposium,
LATIN'10
(April 19-23, 2010, Oaxaca, Mexico),
LNCS 6034, pp. 294-305, Springer-Verlag, 2010.
[BibTex]

(with Dominik Gall, Riko Jacob, Andréa Richa, Christian Scheideler, Stefan Schmid)
Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization
Proceedings of the 11th Int. Symposium on Stabilization, Safety, and Security of Distributed Systems,
SSS'09
(November 3-6, 2009, Lyon, France),
LNCS 5873, pp. 781-782, Springer-Verlag, 2009.
[BibTex]

(with Riko Jacob, Andréa Richa, Christian Scheideler, Stefan Schmid)
A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs
Proceedings of the 28th Symposium on Principles of Distributed Computing,
PODC'09
(August 10-12, 2009, Calgary, Alberta, Canada), pp. 131-140, ACM Press, 2009.
[BibTex]

(with Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Sebastian Wernicke)
Combinatorial network abstraction by trees and distances
Theoretical Computer Science 407(1-3):1-20, 2008.
[BibTex]

(with Dominik Gall, Riko Jacob, Andréa Richa, Christian Scheideler, Stefan Schmid)
Modeling Scalability in Distributed Self-Stabilization: The Case of Graph Linearization
Technical Report TUM-I0835,
Institut für Informatik, TU München, 2008.
[BibTex]

(with Matthias Baumgart)
The Complexity of Computing Graph-Approximating Spanning Trees
Technical Report TUM-I0822,
Institut für Informatik, TU München, 2008.
[BibTex]

Fast Structure Searching for Computational Proteomics
Dissertation, Institut für Informatik, Technische Universität München, 2007.
[BibTex]

(with Klaus Holzapfel, Sven Kosub, Moritz G. Maaß)
The Complexity of Detecting Fixed-Density Clusters
Discrete Applied Mathematics 154(11):1547-1562, 2006.
[BibTex]

(with Arno Buchner, Jan H. Griebsch)
PAST: fast structure-based searching in the PDB
Nucleic Acids Research 34(Web Server):W20-W23, 2006.
[BibTex]

(with Sven Kosub, Moritz G. Maaß)
Acyclic Type-of-Relationship Problems on the Internet
Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking,
CAAN'06
(July 2, 2006, Chester, UK),
LNCS 4235, pp. 98-111, Springer-Verlag, 2006.
[BibTex]

(with Sven Kosub, Moritz G. Maaß)
Acyclic Type-of-Relationship Problems on the Internet
Technical Report TUM-I0605,
Institut für Informatik, TU München, 2006.
[BibTex]

(with Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Sebastian Wernicke)
Combinatorial Network Abstraction by Trees and Distances
Proceedings of the 16th International Symposium on Algorithms and Computation,
ISAAC'05
(December 19-21, 2005, Hainan, China),
LNCS 3827, pp. 1100-1109, Springer-Verlag, 2005.
[BibTex]

(with Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Sebastian Wernicke)
Combinatorial Network Abstraction by Trees and Distances
Technical Report TUM-I0502,
Institut für Informatik, TU München, 2005.
[BibTex]

(with Frank Kammer)
Connectivity
In: Ulrik Brandes, Thomas Erlebach (Ed.):
Network Analysis
Methodological Foundations

Springer-Verlag, 2005.
[BibTex]

(with Frank Kammer)
Graph Connectivity
Technical Report TUM-I0422,
Institut für Informatik, TU München, 2004.
[BibTex]

(with Arno Buchner, Jan H. Griebsch)
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB
Proceedings of the German Conference on Bioinformatics,
GCB'04 (October 4-6, 2004, Bielefeld, Germany),
LNI P-53, pp. 65-74, Köllen Verlag, 2004.
[BibTex]

(with Arno Buchner, Jan H. Griebsch)
A Fast Method for Motif Detection and Searching in a Protein Structure Database
Proceedings of the German Conference on Bioinformatics,
GCB'03
(October 12-14, 2003, Neuherberg / Garching b. München, Germany), pp. 186-188, 2003.
[BibTex]

(with Arno Buchner)
A Fast Method for Motif Detection and Searching in a Protein Structure Database
Technical Report TUM-I0314,
Institut für Informatik, TU München, 2003.
[BibTex]

(with Alexander Hall)
Comparing Push- and Pull-Based Broadcasting
Or: Would "Microsoft Watches" Profit from a Transmitter?

Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms,
WEA'03
(May 26-28 2003, Ascona, Switzerland),
LNCS 2647, pp. 148-164, Springer-Verlag, 2003.
[BibTex]

(with Klaus Holzapfel, Sven Kosub, Moritz G. Maaß)
The Complexity of Detecting Fixed-Density Clusters
Proceedings of the 5th Italian Conference on Algorithms and Complexity,
CIAC'03
(May 28-30 2003, Rome, Italy),
LNCS 2653, pp. 201-212, Springer-Verlag, 2003.
[BibTex]

(with Klaus Holzapfel, Sven Kosub, Moritz G. Maaß)
The Complexity of Detecting Fixed-Density Clusters
Technical Report TUM-I0212,
Institut für Informatik, TU München, 2002.
[BibTex]

Peter Ullrich

Ulrich Voll

(with Jens Ernst, Volker Heun)
Generalized Clustering of Gene Expression Profiles - A Spectral Approach
Proceedings of the International Conference on Bioinformatics,
InCoB 2002
(February 6-8 2002, Bangkok, Thailand), 2002.
[BibTex]

Threshold Phenomena in Branching Trees and Sparse Random Graphs
Dissertation, Institut für Informatik, Technische Universität München, 2002.
[BibTex]

Jeremias Weihmann

Generalized Petri Nets: Algorithms and Complexity
Dissertation, Institut für Informatik, Technische Universität München, 2015.
[BibTex]

(with Ernst W. Mayr)
Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms
Fundamenta Informaticae 137(1):61-86, 2015.
[BibTex]

(with Ernst W. Mayr)
Complexity Results for Fork-Free Petri Nets
Technical Report TUM-I1514,
Institut für Informatik, TU München, 2015.
[BibTex]

(with Hanjo Täubig)
Matrix Power Inequalities and the Number of Walks in Graphs
Discrete Applied Mathematics 176:122-129, 2014.
[BibTex]

(with Ernst W. Mayr)
A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
Proceedings of the 35th Int. Conference on Application and Theory of Petri Nets and Concurrency,
Petri Nets 2014
(June 23-27, 2014, Tunis, Tunisia),
LNCS 8489, pp. 314-333, Springer-Verlag, 2014.
[BibTex]

(with Ernst W. Mayr)
Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities
Proceedings of the 7th Int. Workshop on Reachability Problems,
RP'13
(September 25-27, 2013, Uppsala, Sweden),
LNCS 8169, pp. 209-221, Springer-Verlag, 2013.
[BibTex]

(with Hanjo Täubig, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr)
Inequalities for the Number of Walks in Graphs
Algorithmica 66(4):804-828, 2013.
[BibTex]

(with Ernst W. Mayr)
Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Edge Multiplicities
Technical Report TUM-I1335,
Institut für Informatik, TU München, 2013.
[BibTex]

(with Ernst W. Mayr)
Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets
Proceedings of the 34th Int. Conference on Application and Theory of Petri Nets and Concurrency,
Petri Nets 2013
(June 24-28, 2013, Milano, Italy),
LNCS 7927, pp. 70-89, Springer-Verlag, 2013.
[BibTex]

(with Ernst W. Mayr)
Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets
Technical Report TUM-I1325,
Institut für Informatik, TU München, 2013.
[BibTex]

(with Hanjo Täubig)
Inequalities for the Number of Walks, the Spectral Radius, and the Energy of Graphs
Technical Report TUM-I1211,
Institut für Informatik, TU München, 2012.
[BibTex]

(with Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig)
Inequalities for the Number of Walks in Graphs
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
ANALCO'12
(January 16, 2012, Kyoto, Japan), pp. 26-39, Society for Industrial and Applied Mathematics, 2012.
[BibTex]

(with Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig)
Inequalities for the Number of Walks in Trees and General Graphs and a Generalization of a Theorem of Erdös and Simonovits
Technical Report TUM-I1109,
Institut für Informatik, TU München, 2011.
[BibTex]

Sebastian Wernicke

(with Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig)
Combinatorial network abstraction by trees and distances
Theoretical Computer Science 407(1-3):1-20, 2008.
[BibTex]

(with Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig)
Combinatorial Network Abstraction by Trees and Distances
Proceedings of the 16th International Symposium on Algorithms and Computation,
ISAAC'05
(December 19-21, 2005, Hainan, China),
LNCS 3827, pp. 1100-1109, Springer-Verlag, 2005.
[BibTex]

A Faster Algorithm for Detecting Network Motifs
Proceedings of the 5th Workshop on Algorithms in Bioinformatics,
WABI'05
(October 3-6, 2005, Palma de Mallorca, Spain),
LNBI 3692, pp. 165-177, Springer-Verlag, 2005.
[BibTex]

(with Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier)
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
Proceedings of the 9th Workshop on Algorithms and Data Structures,
WADS'05
(August 15-17, 2005, Waterloo, Canada),
LNCS 3608, pp. 158-168, Springer-Verlag, 2005.
[BibTex]

(with Jiong Guo, Rolf Niedermeier)
Parameterized Complexity of Generalized Vertex Cover Problems
Proceedings of the 9th Workshop on Algorithms and Data Structures,
WADS'05
(August 15-17, 2005, Waterloo, Canada),
LNCS 3608, pp. 36-48, Springer-Verlag, 2005.
[BibTex]

(with Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig)
Combinatorial Network Abstraction by Trees and Distances
Technical Report TUM-I0502,
Institut für Informatik, TU München, 2005.
[BibTex]

(with Stefan Eckhardt)
On the Algorithmic Intractability of Computing Distance-Approximating Spanning Trees
Technical Report TUM-I0409,
Institut für Informatik, TU München, 2004.
[BibTex]