Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 2. Titles of all years

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

TitleAuthor(s) [non member]Editor(s) [non member]YearType
Über Verdrahtungsalgorithmen
In: GI Jahrestagung (Fachgespräche), 79-89
Mehlhorn, KurtEhrich, Hans-Dieter1984Proceedings Article
Attachment IconÜber Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234
Mehlhorn, Kurt1986Journal Article
Attachment IconUFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452
El Kahoui, M'hammed2005Journal Article
Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201
Sibeyn, Jop F.[Banerjee, Prith]
[Prasanna, Viktor K.]
[Sinha, Bhabani F.]
1999Proceedings Article
Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660
Fountoulakis, Nikolaos
[Panagiotou, Konstantinos]
[Sauerwald, Thomas]
[Rabani, Yuval]2012Proceedings Article
Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
[Demetrescu, Camil]
[Goldberg, Andrew V.]
[Johnson, David S.]
2009Part of a Book
Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288
Jez, Artur
[Okhotin, Alexander]
[Beal, Marie-Pierre]
[Carton, Olivier]
2013Proceedings Article
Attachment IconUnbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
[Arge, Lars]
[Freivalds, Rusins]
2006Proceedings Article
Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
2007Journal Article
Attachment IconUnbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
Doerr, Benjamin
Klein, Christian
[Arun-Kumar, S.]
Garg, Naveen
2006Proceedings Article
Understanding LSI Via The Truncated Term-Term Matrix
Universität des Saarlandes
Newo Kenmogne, Regis2005Thesis - Masters thesis
Uniform generation of d-factors in dense host graphsP. Gao2012Unpublished/Draft
Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243
[Epstein, Leah]
[Levin, Asaf]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
Mestre, Julian
Skutella, Martin
[Stougie, Leen]
[Eisenbrand, Friedrich]
[Shepherd, F. Bruce]
2010Proceedings Article
Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586
[Epstein, Leah]
[Levin, Asaf]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
Mestre, Julian
Skutella, Martin
[Stougie, Leen]
2012Journal Article
Untere Schranken für den Platzbedarf bei der kontext-freien AnalyseAlt, Helmut
Mehlhorn, Kurt
1975Report
Untersuchung zur Implementierung eines parallelen Algorithmus mit guter asymptotischer Laufzeit auf einem Rechner mit verteiltem Speicher und Message-Passing
Universität des Saarlandes
Blanchebarbe, Markus1996Thesis - Masters thesis
Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic CurvesBerberich, Eric
[Fogel, Efi]
Meyer, Andreas
2007Report
Upper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes
Schröder, Bianca1998Thesis - Masters thesis
Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811
[Fellows, Michael R.]
[Fertin, Guillaume]
Hermelin, Danny
[Vialette, Stephane]
2011Journal Article
Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215
Dietzfelbinger, Martin
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, H.
Karlsson, Rolf
Lingas, Andrzej
1988Proceedings Article
Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71
Elbassioni, Khaled M.
[Lotker, Zvi]
[Seidel, Raimund]
2006Journal Article
Use and Avoidance of Randomness
Universität des Saarlandes
Friedrich, Tobias2007Thesis - PhD thesis
Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63
Gupta, Arvind
[Mahajan, Sanjeev]
1997Journal Article
Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833
[Diedrich, Florian]
Neumann, Frank
2008Proceedings Article
Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126
[McGeoch, Catherine]
Sanders, Peter
[Fleischer, Rudolf]
[Cohen, Paul R.]
[Precup, Doina]
[Fleischer, Rudolf]
[Moret, Bernard]
[Meineche Schmidt, Erik]
2002Part of a Book
Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49
Lenhof, Hans-Peter
Smid, Michiel
1994Journal Article
Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Schweitzer, Pascal2009Journal Article
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Gawrychowski, Pawel
Jez, Artur
[Jez, Lukasz]
2014Journal Article
Attachment IconVan Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199
Deussen, Peter
Mehlhorn, Kurt
1977Journal Article
Vector Balancing Games with Aging
In: Electronic Notes in Discrete Mathematics [10], xx-xx
Doerr, Benjamin2001Journal Article
Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154
[Krithivasan, Kamala]
[Rema, Anna]
Schirra, Stefan
[Vijaykumar, P.I.]
[Fiala, Frank]
[Kranakis, Evangelos]
[Sack, Jörg-Rüdiger]
1996Proceedings Article
Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes
Abo-Hasna, Ziad1994Thesis - Masters thesis
Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes
Klär, Gerhard1994Thesis - Masters thesis
Verfahren zur Ansteuerung von Matrixanzeigen[Xu, Chihao]
[Wahl, Jürgen]
[Eeisenbrand, Friedrich]
Karrenbauer, Andreas
[Soh, Kian Min]
[Hitzelberger, Christoph]
2005Miscellaneous
Vergleich von praxisnahen seriellen und parallelisierten Verfahren zur Bestimmung der Schnittpunkte von Liniensegmenten in der Ebene
Universität des Saarlandes
Nest, Martin1998Thesis - Masters thesis
Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
[Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine
[Gopalakrishnan, Ganesh]
[Qadeer, Shaz]
2011Proceedings Article
Verlustfreie Datenkompression mit selbstorganisierenden Listen
Universität des Saarlandes
Reinstädtler, Martin1998Thesis - Masters thesis
Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172
[Gupta, Arvind]
[Kaller, Damon]
[Mahajan, Sanjeev]
[Shermer, Thomas C.]
[Karlsson, Rolf]
[Lingas, Andrzej]
1996Proceedings Article
Attachment IconVertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447
Johannsen, Daniel
Panagiotou, Konstantinos
[Charikar, Moses]2010Proceedings Article
Vertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45
Panagiotou, Konstantinos2009Proceedings Article
Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130
Panagiotou, Konstantinos
[Sinha, Makrand]
2012Journal Article
Attachment IconViolation Heaps: A Better Substitute for Fibonacci HeapsElmasry, AmrElmasry, Amr2008Report
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 456-468
[Park, Sang-Min]
Lee, Jae-Ha
[Chwa, Kyung-Yong]
[Orejas, Fernando]
[Spirakis, Paul G.]
[Leeuwen, Jan van]
2001Proceedings Article
Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes
Schanne, Thomas2001Thesis - Masters thesis
Attachment IconVisualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes
Emeliyanenko, Pavel2007Thesis - Masters thesis
Attachment IconVisualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225
Emeliyanenko, Pavel
Kerber, Michael
[Teillaud, Monique]
[Welzl, Emo]
2008Proceedings Article
Attachment IconVisualizing and Exploring Planar Algebraic Arrangements - a Web ApplicationEmeliyanenko, Pavel
Kerber, Michael
2008Report
Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
[Bebis, George]
[Boyle, Richard]
[Parvin, Bahram]
[Koracin, Darko]
[Kuno, Yoshinori]
[Wang, Junxian]
[Pajarola, Renato]
[Lindstrom, Peter]
[Hinkenjann, André]
[Encarnação, Miguel L.]
[Silva, Cláudio T.]
[Coming, Daniel]
2009Proceedings Article
Attachment IconVisuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales ZeichnenKlau, Gunnar W.1998Miscellaneous
VLSI algorithms and architectures : Aegean workshop on computingMakedon, Fillia
Mehlhorn, Kurt
Papatheodorou, Theodore S.
Spirakis, Paul G.
1986Proceedings
VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
[Fürer, Martin]
[Mehlhorn, Kurt]
Makedon, Fillia
Mehlhorn, Kurt
Papatheodorou, Theodore S.
Spirakis, Paul G.
1986Proceedings
VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
[Fürer, Martin]
[Mehlhorn, Kurt]
Makedon, Fillia
Mehlhorn, Kurt
Papatheodorou, Theodore S.
Spirakis, Paul G.
1986Proceedings
VLSI Complexity, Efficient VLSI Algorithms and the HILL Design SystemLengauer, Thomas
Mehlhorn, Kurt
1983Report
Attachment IconVLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89
Lengauer, Thomas
Mehlhorn, Kurt
Trullemans, C1986Part of a Book
Voronoi diagram of ellipses: CGAL-based implementation[Emiris, Ioannis]
Hemmer, Michael
[Tsigaridas, Elias]
[Tzoumas, Georg]
2008Report
Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems
In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319
Papatriantafilou, Marina
Tsigas, Philippas
1995Proceedings Article
Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113
Hermelin, Danny
[Wu, Xi]
[Rabani, Yuval]2012Proceedings Article
Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91
Bradford, Phillip Gnassi
Capoyleas, Vasilis
1997Journal Article
Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36
Kutz, Martin[Felsner, Stefan]2005Proceedings Article
Attachment IconWeak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 239-244
[Ray, Saurabh]
Mustafa, Nabil H.
2007Proceedings Article
Web-site with benchmark instances for planar curve arrangementsBerberich, Eric
Ebert, Franziska
[Fogel, Efi]
Kettner, Lutz
2006Report
Weighted flow time does not admit O(1)-competitive algorithms
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1238-1244
[Bansal, Nikhil]
Chan, Ho-Leung
[Mathieu, Claire]2009Proceedings Article
Weighted Matchings in General Graphs
Universität des Saarlandes
Schäfer, Guido2000Thesis - Masters thesis
Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10
Friedrich, Tobias
[Kroeger, Trent]
[Neumann, Frank]
2012Electronic Journal Article
Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
[Shervashidze, Nino]
Schweitzer, Pascal
[van Leeuwen, Erik Jan]
Mehlhorn, Kurt
[Borgwardt, Karsten M.]
2011Journal Article
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
[Fellows, Michael R.]
Hermelin, Danny
[Rosamond, Fraces A.]
2012Journal Article
When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63
Doerr, Benjamin
[Sudholt, Dirk]
[Witt, Carsten]
2013Proceedings Article
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 218-229
Bansal, Nikhil
[Gupta, Anupam]
[Li, Jian]
Mestre, Julián
[Nagarajan, Viswanath]
[Rudra, Atri]
[de Berg, Mark]
[Meyer, Ulrich]
2010Proceedings Article
When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21
Sagraloff, Michael2011Electronic Journal Article
When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 297-304
Sagraloff, Michael[van der Hoeven, Joris]
[van Hoeij, Mark]
2012Proceedings Article
When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003
Friedrich, Tobias
Neumann, Frank
2008Proceedings Article
When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294
Friedrich, Tobias
Neumann, Frank
2010Journal Article
When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35
Bast, Holger
Weber, Ingmar
[Broder, Andrei]
[Maarek, Yoelle]
2006Proceedings Article
Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75
Doerr, Benjamin
[Fouz, Mahmoud]
Friedrich, Tobias
2012Journal Article
Attachment IconWhy Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18
Bast, Holger
Majumdar, Debapriyo
[Marchionini, Gary]
[Moffat, Alistair]
[Tait, John]
[Baeza-Yates, Ricardo]
[Ziviani, Nivio]
2005Proceedings Article
Workshop über Komplexitätstheorie, Effiziente Algorithmen und DatenstrukturenMehlhorn, Kurt1987Proceedings
Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
[Juurlink, Ben]
Sibeyn, Jop F.
[Rao, P. Srinivasa]
[Bougé, Luc]
[Fraigniaud, Pierre]
[Mignotte, Anne]
[Robert, Yves]
1996Proceedings Article
Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118
Brodal, Gerth Stølting
Katajainen, Jyrki
[Arnborg, Stefan]
[Ivansson, Lars]
1998Proceedings Article
Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes
Schäfer, Guido2004Thesis - PhD thesis
Writing-All deterministically and optimally using a non-trivial number of asynchronous processors
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 311-320
Kowalski, Dariusz
[Shvartsman, Alex]
2004Proceedings Article
Zeichnen von Diagrammen - Theorie und Praxis
Universität des Saarlandes
Mutzel, Petra1999Thesis - Habilitation thesis
Zigzag Persistent Homology in Matrix Multiplication Time
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 216-225
Milosavljevic, Nikola
[Morozov, Dmitriy]
[Skraba, Primoz]
2011Proceedings Article
Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes
Kerzmann, Andreas2000Thesis - Masters thesis
Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken
Universität des Saarlandes
Bramer, Andreas2003Thesis - Masters thesis
Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150
Doerr, Benjamin
[Gnewuch, Michael]
[Kritzer, Peter]
[Pillichshammer, Peter]
2008Journal Article
$AT^2$-optimal VLSI for integer division and integer square rootingMehlhorn, Kurt1983Report
$AT^2$-optimal VLSI integer division and integer square rooting
In: Integration, the VLSI Journal [2], 163-167
Mehlhorn, Kurt1984Journal Article
$AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196
Mehlhorn, Kurt
Preparata, F. P.
1983Journal Article
Attachment Icon$D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199
El Kahoui, M'hammed2005Journal Article
Attachment Icon$k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129
Mehlhorn, Kurt
[Paul, Wolfgang J.]
Uhrig, C
1992Journal Article
$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404
Meyer, Ulrich
Sanders, Peter
[Bilardi, Gianfranco]
[Italiano, Giuseppe F.]
[Pietracaprina, Andrea]
[Pucci, Geppino]
1998Proceedings Article
$\Delta$-stepping: a parallelizable shortest path algorithm
In: Journal of Algorithms [49], 114-152
Meyer, Ulrich
Sanders, Peter
2003Journal Article
Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
Funke, Stefan
[Malamatos, Theocharis]
[Matijevic, Domagoj]
Wolpert, Nicola
[Rappaport, David]2006Proceedings Article
?
In: Conference on High-Performance Computing, 125-130
[Juurlink, Ben]
Mutzel, Petra
1995Proceedings Article

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)