Max-Planck-Institut für Informatik
max planck institut
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
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
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)