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: 1. Author,Editor - 1. by Individual - 3. A..Z Index-Comment

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

#YearTitleAG Editor CommentType
1
Hide details for Nishimura, NaomiNishimura, Naomi
1995Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649
Proceedings Article
1
Hide details for Nissen, MarcoNissen, Marco
1998Graph Iterators: Decoupling Graph Structures from Algorithms
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for North, StephenNorth, Stephen
1998Graph Drawing Contest Report
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435
Proceedings Article
2
Hide details for Nor, IgorNor, Igor
2012Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Journal Article
2010Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213
Proceedings Article
1
Hide details for Novotni, DominikNovotni, Dominik
2006Attachment IconAlgorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173
ok / ch 070207
- aus Webseite aufergänzt

2005 -> 2006, da nicht gefunden / ch060612
Journal Article
3
Hide details for Nowotka, DirkNowotka, Dirk
2014Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349
Proceedings Article
2013Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219
Proceedings Article
2013Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268
Proceedings Article
3
Hide details for Nutov, ZeevNutov, Zeev
2000On Integrality, Stability and Composition of Dicycle Packings and Covers
In: Journal of Combinatorial Optimization [4], 235 - 252
Journal Article
1999A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30
Journal Article
1999A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30
Journal Article
3
Hide details for O'Dúnlaing, ColmO'Dúnlaing, Colm
1991On the construction of abstract Voronoi diagrams
In: Discrete & Computational Geometry [6], 211-224
Journal Article
1990On the Construction of Abstract Voronoi Diagrams
In: Theoretical aspects of computer science (STACS-90) : 7th annual symposium, 227-239
Proceedings Article
1989Attachment IconOn the construction of abstract Voronoi diagramsgefunden via KVK -> GBV / ch061102

Teil:
1: / K. Mehlhorn ; S. Meiser ; C. O'Dunlaing
Verfasser:
Mehlhorn, K. ; Meiser, S. ; O'Dunlaing, C.
Erschienen:
1989
Umfang:
14 S.
Schriftenreihe:
Reports / SAARBRUECKEN UNIV SAARLAND ; A 89/01
Report-Nr.:
A 89 01
Report
1
Hide details for O'Leary, DianneO'Leary, Dianne
2008Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x
Journal Article
1
Hide details for O'Neill, Michael (ed.)O'Neill, Michael (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
3
Hide details for O'Reilly, Una-MayO'Reilly, Una-May
2012The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340
Proceedings Article
2011Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80
kein MPI- AutorProceedings Article
2011Attachment IconOptimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
Proceedings Article
1
Hide details for Oberhauser, FredOberhauser, Fred
1997Arithmetik der Transduktoren
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Odenthal, ThomasOdenthal, Thomas
1998The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
Journal Article
1998The thickness of graphs: A survey
In: Graphs and Combinatorics [14], 59-73
Journal Article
1997A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 13-24
Proceedings Article
1
Hide details for Okamoto, YoshioOkamoto, Yoshio
2012On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84
Proceedings Article
2
Hide details for Okhotin, AlexanderOkhotin, Alexander
2014Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94
Journal Article
2013Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288
Proceedings Article
2
Hide details for Oliveto, PietroOliveto, Pietro
2009Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476
Journal Article
2008Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952
Proceedings Article
3
Hide details for Oliveto, Pietro SimoneOliveto, Pietro Simone
2010Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213
Proceedings Article
2009Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842
Proceedings Article
2009Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462
Proceedings Article
1
Hide details for Oliveto, Pietro S.Oliveto, Pietro S.
2010Ant Colony Optimization and the Minimum Cut Problem
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400
Proceedings Article
3
Hide details for Orlin, James B.Orlin, James B.
1990Attachment IconFaster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223
Journal Article
1988Faster Algorithms for the Shortest Path Problemok - aufergänzt aus Papierfassung / ch 060920

übertragen aus der Book -DB / ch 060803
Report
1988Faster Algorithms for the Shortest Path Problemok - 060927:
- gefunden via http://liinwww.ira.uka.de/bibliography/index.html
- http://72.14.221.104/search?q=cache:gXfS6FAu490J:www.mit.edu/~orc/research/reports/tr_1980s.html+193+%22Faster+Algorithms+for+the+Shortest+Path+Problem%22+Massachusetts&hl=de&gl=de&ct=clnk&cd=1
Report
1
Hide details for Orlis, ChristosOrlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
6
Hide details for Osbild, RalfOsbild, Ralf
2011A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528
Journal Article
2008A General Approach to the Analysis of Controlled Perturbation AlgorithmsReport
2007Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46
Journal Article
2006Attachment IconReliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310
ch 061004: pdf nicht möglich herunterzuladen, login wird verlangt

ch 060814:
From DBLP (2006):
@InProceedings{conf/icalp/MehlhornOS06,
title = "Reliable and Efficient Computational Geometry Via
Controlled Perturbation",
author = "Kurt Mehlhorn and Ralf Osbild and Michael Sagraloff",
bibdate = "2006-07-03",
bibsource ="DBLP,
http://dblp.uni-trier.de/db/conf/icalp/icalp2006-1.html#MehlhornOS06",
booktitle ="ICALP (1)",
booktitle ="Automata, Languages and Programming, 33rd
International Colloquium, {ICALP} 2006, Venice, Italy,
July 10-14, 2006, Proceedings, Part {I}",
publisher = "Springer",
year = "2006",
volume = "4051",
editor = "Michele Bugliesi and Bart Preneel and Vladimiro
Sassone and Ingo Wegener",
ISBN = "3-540-35904-4",
pages = "299--310",
series = "Lecture Notes in Computer Science",
URL = "http://dx.doi.org/10.1007/11786986_27",
}
Proceedings Article
2006Attachment IconUnbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112
ok / ch 070201Proceedings Article
2005Attachment IconRounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109
Proceedings Article
2
Hide details for Osipov, VitalyOsipov, Vitaly
2009Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307
Part of a Book
2007Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12
Proceedings Article
1
Hide details for Ossamy, RodrigueOssamy, Rodrigue
2002TSP Cuts Outside the Template Paradigm
Universität des Saarlandes
qThesis - Masters thesis
4
Hide details for Osthus, DerykOsthus, Deryk
2009Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297
Journal Article
2009Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463
Journal Article
20083-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505
Journal Article
2008The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141
Journal Article
1
Hide details for Östlin, AnnaÖstlin, Anna
1997On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145
gefunden durch BibliotheksabgleichProceedings Article
2
Hide details for Ost, KirstinOst, Kirstin
2001Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12
Journal Article
1995Algorithmen für das Kantenfärbungsproblem
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Ott, SebastianOtt, Sebastian
2013How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73
Proceedings Article
2012Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Oudalov, VladimirOudalov, Vladimir
2008A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109
Proceedings Article
3
Hide details for Overmars, Mark H.Overmars, Mark H.
2000A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Proceedings Article
1981Attachment IconOptimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98
Journal Article
1980Optimal dynamization of decomposable searching problemsgefunden via BVB / ch 061102Report
1
Hide details for Pacholski, LeszekPacholski, Leszek
1999The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
Journal Article
2
Hide details for Pagh, RasmusPagh, Rasmus
2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
ok / ch060619Journal Article
2003Attachment IconSpace Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
okProceedings Article
6
Hide details for Paluch, KatarzynaPaluch, Katarzyna
2012Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506
Electronic Proceedings Article
2006Attachment IconA New Approximation Algorithm for Multidimensional Rectangle Tiling
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721
Proceedings Article
2006Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
ok / ch 070312
- mit Webseite abgeglichen
Journal Article
2004Attachment IconA Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
Proceedings Article
2004Attachment IconRank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75
Proceedings Article
2004Attachment IconStrongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233
Proceedings Article
1
Hide details for Paluch, Katarzyna E.Paluch, Katarzyna E.
2007Attachment IconStrongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18
Journal Article
1
Hide details for Pal, ArindamPal, Arindam
2012Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275
Electronic Proceedings Article
27
Hide details for Panagiotou, KonstantinosPanagiotou, Konstantinos
2013Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145
Online 3.10.12 smJournal Article
2013Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456
Proceedings Article
2013On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-?
noch nicht erschienen 4.2.13Journal Article
2012Catching the k-NAESAT Threshold
In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907
Proceedings Article
2012Attachment IconEfficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144
Proceedings Article
2012Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178
Journal Article
2012Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333
Journal Article
2012Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660
Proceedings Article
2012Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130
Journal Article
20113-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412
Journal Article
2011Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688
Proceedings Article
2011Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704
Electronic Proceedings Article
2011On the Degree Sequence of Random Planar Graphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210
Proceedings Article
2011The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236
Proceedings Article
2010Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21
Journal Article
2010Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359
Proceedings Article
2010Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560
Proceedings Article
2010Rumor spreading on random regular graphs and expanders
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573
Proceedings Article
2010Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964
Proceedings Article
2010Attachment IconVertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447
Proceedings Article
2009Blocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744
Electronic Proceedings Article
2009Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530
Proceedings Article
2009Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440
Proceedings Article
2009The Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681
Journal Article
2009The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530
Proceedings Article
2009Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19
Electronic Journal Article
2009Vertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45
Proceedings Article
2
Hide details for Panconesi, AlessandroPanconesi, Alessandro
2013Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336
Proceedings Article
1998Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
Angaben via link.springer-ny.com gefunden. UB.Journal Article
8
Hide details for Pantziou, Grammati E.Pantziou, Grammati E.
2000Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Journal Article
1999Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
q / ch 8.9.03Journal Article
1996Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154
Journal Article
1995Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200
Proceedings Article
1995On-line and Dynamic Algorithms for Shortest Path Problems
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204
Proceedings Article
1995On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Proceedings Article
1995Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44
Proceedings Article
1995The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140
Journal Article
1
Hide details for Pantziou, G. E.Pantziou, G. E.
2000Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389
Journal Article
2
Hide details for Papadopoulou, VickyPapadopoulou, Vicky
2002Attachment IconOn Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92
qProceedings Article
2002Attachment IconRadiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
In: Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, 223-234
qProceedings Article
2
Hide details for Papaioannou, EviPapaioannou, Evi
2007A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160
12th International Colloquium on Structural Information and Communication ComplexityJournal Article
2007Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136
Proceedings Article
1
Hide details for Papatheodorou, Theodore S. (ed.)Papatheodorou, Theodore S. (ed.)
1986VLSI algorithms and architectures : Aegean workshop on computingÜbertragenes abgeglichen mit der Books-DB / ch 060804

http://dblp.uni-trier.de/db/conf/awoc/awoc86.html#FurerM86
Proceedings
11
Hide details for Papatriantafilou, MarinaPapatriantafilou, Marina
2010NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
Journal Article
2009Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Online ersch. im August 2008Journal Article
2009Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30
Electronic Journal Article
2009NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35
Online First 22.01.2009
Springer Choice
Electronic Journal Article
2007LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Proceedings Article
1998Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
Angaben via link.springer-ny.com gefunden. UB.Journal Article
1997Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328
Journal Article
1997The impact of timing on linearizability in counting networks
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688
Proceedings Article
1996Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations
In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 18-25
Proceedings Article
1995Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Proceedings Article
1995Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems
In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319
Proceedings Article
1
Hide details for Parente, DomenicoParente, Domenico
1999A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30
Journal Article
1
Hide details for Park, KunsooPark, Kunsoo
1997Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960
Journal Article
3
Hide details for Park, Sang-MinPark, Sang-Min
2001Visibility-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
Proceedings Article
2000Characterization of Rooms Searchable by Two Guards
In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526
Proceedings Article
2000Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220
Journal Article
2
Hide details for Parreira, JosianeParreira, Josiane
2003Information Retrieval by Dimension Reduction - A Comparative Study
Universität des Saarlandes
okThesis - Masters thesis
2003On the Role of the Singular Values in Latent Semantic Indexing
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Pascual, FannyPascual, Fanny
2007Attachment IconScheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197
Proceedings Article
1
Hide details for Pasechnik, DmitriiPasechnik, Dmitrii
2001CGAL Reference and User ManualsUnknown Form: eBookForm
2
Hide details for Pasquale, FrancescoPasquale, Francesco
2013Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013),
Proceedings Article
2013Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336
Proceedings Article
1
Hide details for Pasqualone, GiulioPasqualone, Giulio
1998An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380
Proceedings Article
2
Hide details for Paterson, MikePaterson, Mike
2000Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096
Journal Article
1995Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45
Journal Article
1
Hide details for Patt-Shamir, BoazPatt-Shamir, Boaz
2004Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
ok/ch050411Journal Article
1
Hide details for Paturi, RamamohanPaturi, Ramamohan
2012On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84
Proceedings Article
2
Hide details for Pauling, JoschPauling, Josch
2012Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176
Proceedings Article
2012Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764
Journal Article
1
Hide details for Pauly, MarkPauly, Mark
2007Attachment IconMedial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 123-124
ok - export0707 / ch
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf
Proceedings Article
1
Hide details for Paul, ChristophePaul, Christophe
2012Attachment IconA Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130
Proceedings Article
1
Hide details for Paul, MarkusPaul, Markus
1991Attachment IconComputing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240
Journal Article
2
Hide details for Paul, Wolfgang J.Paul, Wolfgang J.
1992Attachment Icon$k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129
Journal Article
1989Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609
Proceedings Article
13
Hide details for Pelc, AndrzejPelc, Andrzej
2006Complexity of searching for a black holenachhaken! ch 070205
ist es folgendes dokument:
http://iospress.metapress.com/(ozrhbgaybnbicxqvx3ldvk55)/app/home/contribution.asp?referrer=parent&backto=issue,5,11;journal,10,83;linkingpublicationresults,1:300178,1
und: ist es nun im zusmammenhang mit dem mpi erschienen oder nicht? bei keinem steht das mpi als adresse. petra meyer / ulrich meyer fragen ...


to appear/ch050501

gefunden in google / ch060613:
J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc, Complexity of searching for a black hole, Fundamenta Informaticae, 72 (2006), 1-14
Unpublished/Draft
2006Deterministic rendezvous in graphsch 070205: da Algorithmica _und_ Isaac 2004 erwähnt wird, dupliziere ich diesen Datensatz und bastel damit den Algorithmica-Datensatz.

to appear/ch050501
Unpublished/Draft
2006Attachment IconDeterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96
ok / ch 070205
- unpublished/draft kopiert, aus Webseite aufergänzt
- pdf eingesetzt / download verbidden

ch 070205: da Algorithmica _und_ Isaac 2004 erwähnt wird, dupliziere ich diesen Datensatz und bastel damit den Algorithmica-Datensatz.

to appear/ch050501
Journal Article
2005Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80
ok / ch051103Proceedings Article
2005Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371
ok / ch051117Journal Article
2004Centralized deterministic broadcasting in undirected multi-hop radio networks
In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 171-182
ok/ch050501Proceedings Article
2004Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151
Proceedings Article
2004Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656
ok/ch050501Proceedings Article
2004Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891
q/ch050411Journal Article
2003Time of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), 195-210
Proceedings Article
1997Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20
gefunden durch BibliotheksabgleichJournal Article
1996Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912
Journal Article
1996Minimizing Congestion of Layouts for ATM Networks with Faulty Links
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403
Proceedings Article
1
Hide details for Peleg, DavidPeleg, David
2009Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article
2
Hide details for Pelikan, Martin (ed.)Pelikan, Martin (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Pemmaraju, Sriram V.Pemmaraju, Sriram V.
2011Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21
Journal Article
1
Hide details for Penninkx, EelkoPenninkx, Eelko
2006On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
Proceedings Article
1
Hide details for Penn, MichaelPenn, Michael
2000On Integrality, Stability and Composition of Dicycle Packings and Covers
In: Journal of Combinatorial Optimization [4], 235 - 252
Journal Article
1
Hide details for Penttonen, MarttiPenttonen, Martti
1997A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51
Journal Article
2
Hide details for Pérennes, StéphanePérennes, Stéphane
2009Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article
2009Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
Journal Article
1
Hide details for Perez-Gimenez, XavierPerez-Gimenez, Xavier
2011Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322
Journal Article
1
Hide details for Petersson, OlaPetersson, Ola
2000Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578
Journal Article
3
Hide details for Petitjean, SylvainPetitjean, Sylvain
2011A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494
Journal Article
2008Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of QuadricsReport
2007Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Proceedings Article
1
Hide details for Petri, Tobias H.Petri, Tobias H.
2009Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Electronic Proceedings Article
8
Hide details for Pettie, SethPettie, Seth
2011Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26
Journal Article
2005Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network ModelsTitel existiert laut google nur am MPI => nirgends sonst erschienen. ch / 060619Unpublished/Draft
2005Attachment IconNew Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681
ok / ch051114
q/ch050425 - seitenzahl ergänzen!
Proceedings Article
2005Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973
ok / ch060420Proceedings Article
2005The complexity of implicit and space-efficient priority queues
In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60
ok / ch060420Proceedings Article
2005Towards a final analysis of pairing heaps
In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 174-183
ok / ch060420Proceedings Article
2004Attachment IconA simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
Journal Article
2004Attachment IconA Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
12.8.05: aus RR-DB kopiert / chReport
21
Hide details for Philip, GeevarghesePhilip, Geevarghese
2012Attachment IconA Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130
Proceedings Article
2012Attachment IconBeyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423
Electronic Proceedings Article
2012Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
Journal Article
2012Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
Journal Article
2012Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23
Journal Article
2011Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
Proceedings Article
2011Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
Kein MPI-Autor auf VÖ.smJournal Article
2011Attachment IconHitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200
Proceedings Article
2011Attachment IconMinimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175
Proceedings Article
2011Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
Kein MPI AutorProceedings Article
2011Attachment IconPattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193
Proceedings Article
2011Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
KEIn MPI-Autor auf VÖ.smProceedings Article
2011Attachment IconThe Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64
Proceedings Article
2011Attachment IconThe Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute
Thesis - PhD thesis
2010Attachment IconA Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207
Proceedings Article
2010Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
Proceedings Article
2010Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article
2010Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
Proceedings Article
2010Attachment IconThe effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
Proceedings Article
2009Attachment IconSolving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705
Proceedings Article
2008Attachment IconFixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Homi Bhabha National Institute
Thesis - Masters thesis
3
Hide details for Pilipczuk, MarcinPilipczuk, Marcin
2012Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265
Proceedings Article
2012Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
Proceedings Article
2011Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
Kein MPI-Autor auf VÖ.smJournal Article
1
Hide details for Pilipczuk, MichaPilipczuk, Micha
1
Hide details for l{}l{}
2011Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
Kein MPI-Autor auf VÖ.smJournal Article
2
Hide details for Pilipczuk, MichałPilipczuk, Michał
2012Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265
Proceedings Article
2012Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
Proceedings Article
1
Hide details for Pillichshammer, FriedrichPillichshammer, Friedrich
2008Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149
Journal Article
1
Hide details for Pillichshammer, PeterPillichshammer, Peter
2008 Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150
Journal Article
1
Hide details for Pinotti, M. CristinaPinotti, M. Cristina
1998Comparator Networks for Binary Heap Construction
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168
Proceedings Article
14
Hide details for Pion, SylvainPion, Sylvain
2008Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
in Press, online bereits ersch. 05.02.08/bcJournal Article
2008Prototype implementation of the algebraic kernelReport
2007Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155
ok - export0707 / ch
- Abgleich mit BiVis
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- no abstract
- pdf nur mit Login


s. auch Bivis etc. / ch 070214
Part of a Book
2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
2007Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2006Interface specification of algebraic kernelReport
2006Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
ch 061004: pdf nicht möglich herunterzuladen, login wird verlangt

ok - ch 060922: http://dblp.uni-trier.de/rec/bibtex/conf/iccsa/KettnerMPSY06
Proc.Daten aus Books-DB
Proceedings Article
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2004Classroom Examples of Robustness Problems in Geometric ComputationsReport
2004Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
ch - ok/ch050422Proceedings Article
2001An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
Proceedings Article
2001CGAL Reference and User ManualsUnknown Form: eBookForm
2001Interval arithmetic yields efficient dynamic filters for computational geometry
In: Discrete Applied Mathematics [109], 25-47
Journal Article
1998Interval analysis yields efficient dynamic filters for computational geometry
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 165-174
Proceedings Article
1
Hide details for Piskorski, JakubPiskorski, Jakub
1994Parallele Graphenalgorithmen für den Hypercube
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Piwowarski, BenjaminPiwowarski, Benjamin
2006Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120
achtung: eigentlich nicht 3. bis 7-10, sondern 3. und 7.10 !!!Proceedings Article
4
Hide details for Plandowski, WojciechPlandowski, Wojciech
2014Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15
Proceedings Article
1996Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Proceedings Article
1996Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266
Proceedings Article
1996Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Proceedings Article
2
Hide details for Pocchiola, MichelPocchiola, Michel
2006Attachment IconCounting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
ok / ch 070205
- aus Webseite aufergänzt
- pdf eingesetzt / download verbidden
Journal Article
2005Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110
auch hier nicht gefunden:
http://www.ec-securehost.com/cgi-bin/SIAM/search.cgi

s.: Dementiev, Kärkkäinen, Mehnert, Sanders / ch060619


ok / ch060621 - per Fernleihbestllung Restdaten erhalten.
Proceedings Article
4
Hide details for Pogalnikova, RozaPogalnikova, Roza
2012Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989
Journal Article
2011Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158],
Electronic Journal Article
2011Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196
Proceedings Article
2010Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68
Electronic Proceedings Article
2
Hide details for Pohl, SebastianPohl, Sebastian
2012Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1317-1324
Proceedings Article
2006Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Poli, Ricardo (ed.)Poli, Ricardo (ed.)
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Poli, Riccardo (ed.)Poli, Riccardo (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
1
Hide details for Pollack, Jordan (ed.)Pollack, Jordan (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
7
Hide details for Polzin, TobiasPolzin, Tobias
2003Algorithms for the Steiner Problem in Networks
Universität des Saarlandes
okThesis - PhD thesis
2003Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14
okProceedings Article
2003On Steiner trees and minimum spanning trees in hypergraphs
In: Operations Research Letters [31], 12-20
okJournal Article
2002Extending Reduction Techniques for the Steiner Tree Problem
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807
erledigt / bc 09.05.03Proceedings Article
2001A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261
Journal Article
2001Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300
Journal Article
2000Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225
Proceedings Article
1
Hide details for Pool, RenePool, Rene
2012Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43
Proceedings Article
1
Hide details for Poon, Sheung-HungPoon, Sheung-Hung
2003Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429
okProceedings Article
3
Hide details for Porkolab, LorantPorkolab, Lorant
2002Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520
erledigt - frisch aus der ZeitschriftJournal Article
2000Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224
Journal Article
1997Computing Integral Points in Convex Semi-algebraic Sets
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171
Proceedings Article
1
Hide details for Portz, SaschaPortz, Sascha
1994Darstellung und Implementierung polynomieller und streng polynomieller Algorithmen für das Minimum-Cost-Flow-Problem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Pór, AttilaPór, Attila
2005Attachment IconAngel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934
ok / ch051117

STATUS: published (06.10.05)
Copyright muss noch geklaert werden!
Botz, 22.07.05:
Die im CTA genannte URL der LNCS ist gar nicht mehr aktuell. Wahrscheinlich
handelt es sich auch um eine alte Copyright Form. Der Link zu LNCS lautet:
http://www.springerlink.com/openurl.asp?genre=journal&issn=0302-9743
Die von mir gefundene Copyright Policy von Springer ist hier
http://www.springeronline.com/sgw/cda/pageitems/document/cda_downloaddocumen
t/0,11996,0-0-45-69724-0,00.pdf
zu finden.
Dort steht ausdrücklich:
"An author may self-archive an author-created version of his/her article on
his/her own website and his/her institution’s repository, including his/her final
version"
Ich werde das Thema aber beim Treffen mit den Springer-Leuten nächste Woche
ansprechen.
Bib 01.08.05:
welche Version? - Springer will Link auf Orig.?
Bestimmungen fuer LNCS sind nicht identisch mit Journal CTA
Angegebene URL ist aktuell!!! (Mail an Herrn Botz 01.08.05)
Proceedings Article
1
Hide details for Potikoglou, IoannisPotikoglou, Ioannis
1999Parallele Algorithmen zur Lösung des Single-Source Shortest Path Problems
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Pouchkarev, IgorPouchkarev, Igor
2000ArchEd: Ein interaktives Zeichensystem für die Archäologie
Universität des Saarlandes
Thesis - Masters thesis
1997ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302
Proceedings Article
1
Hide details for Pountourakis, EmmanouilPountourakis, Emmanouil
2010A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157
Proceedings Article
1
Hide details for Pourmiri, AliPourmiri, Ali
2013Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456
Proceedings Article
1
Hide details for Prädel, LarsPrädel, Lars
2011Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
3
Hide details for Prasad, SushilPrasad, Sushil
2006Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299
Journal Article
2003Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894
okProceedings Article
1
Hide details for Prechelt, LutzPrechelt, Lutz
1998SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
Proceedings Article
1
Hide details for Precup, DoinaPrecup, Doina
2002Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126
qPart of a Book
1
Hide details for Preetham, A. J.Preetham, A. J.
1996Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, -
Proceedings Article
1
Hide details for Preis, B.Preis, B.
1993Attachment IconExact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322
Proceedings Article
1
Hide details for Prellberg, ThomasPrellberg, Thomas
2008Attachment IconCounting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92
Electronic Journal Article
11
Hide details for Preparata, Franco P.Preparata, Franco P.
1987Attachment IconArea-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
In: Information and Computation [72], 270-282
nur abstract, kein pdf online erhältich; Titel wie im Paper siehe bei "Personal Comments", da der Titel nicht in dieser Form eingefügt werden kann / ch 060912Journal Article
1987Attachment IconDeterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15
in DBLP gefunden, aus Papierfassung aufergänzt / ch 060921

http://websok.libris.kb.se/websearch/showrecord;jsessionid=046CC02F4BAA278125C493CE4625A5D2?searchId=22729&nr=1
Proceedings Article
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article
1986Area-time Optimal Division for T=Omega(log n)$^1+epsilon$"
In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, 341-352
http://dblp.uni-trier.de/db/conf/stacs/stacs86.html#MehlhornP86",Proceedings Article
1986Attachment IconChannel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221
Journal Article
1986Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Proceedings Article
1985Area-time optimal division for T=omega((logn)1+epsilon)ok - aus Papierfassung Seitenzahl aufergänzt / ch 060920

übertragen aus der Books-DB / ch 060806
Report
1985Deterministic simulation of idealized parallel computers on more realistic onesok - Seitenzahl aus Papierfassung aufergänzt / ch 060920

übertragen aus der Books-DB / ch 060803
Report
1984Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
In: Automata, languages and programming (ICALP-84) : 11th colloquium, 347-357
LNCS-Anteil aus Books-DB bzw. GBV / ch 060806Proceedings Article
1983Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Timeok - gemäß Papierfassung / ch 060919Report
1983Attachment IconArea-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156
Journal Article
3
Hide details for Preparata, F. P.Preparata, F. P.
1986Attachment IconRouting through a Rectangle
In: Journal of the ACM [33], 60-85
ok - ch 061110 :
- abgeglichen mit http://portal.acm.org/citation.cfm?doid=4904.4994
- Abstract + keys + pdf eingefügt
Journal Article
1983Routing through a Rectangleok - aus BiVis übertragen, Seitenzahl aus SULB, mit Papierfassung abgeglichen / ch060919Report
1983$AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196
Journal Article
6
Hide details for Priebe, VolkerPriebe, Volker
2002Attachment IconAll-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
qJournal Article
2001Average-case complexity of shortest-paths problems
Universität des Saarlandes
Thesis - PhD thesis
2000Attachment IconAverage-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46
Journal Article
1997Average-case complexity of shortest-paths problems in the vertex-potential model
In: International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 15-26
Proceedings Article
1997On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka
In: Random Structures Algorithms [10], 205-220
ch 060828: http://dblp.uni-trier.de/db/journals/rsa/rsa10.html#MehlhornP97
http://dblp.uni-trier.de/rec/bibtex/journals/rsa/MehlhornP97
Journal Article
1995On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198
Proceedings Article
2
Hide details for Privetivy, AlesPrivetivy, Ales
2007On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545
Journal Article
2005Attachment IconOn the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26
Proceedings Article
1
Hide details for Prömel, Hans JürgenPrömel, Hans Jürgen
1997Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433
aus bib; not-mpi pruefen!Part of a Book
6
Hide details for Pruhs, KIrkPruhs, KIrk
2011Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582
Journal Article
2011Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517
Journal Article
2009Nonclairvoyant Speed Scaling for Flow and Energy
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264
Electronic Proceedings Article
2009Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
In: SPAA'09 : proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, 1-10
Proceedings Article
2009Speed Scaling with an Arbitrary Power Function
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 693-701
Proceedings Article
2008Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Journal Article
1
Hide details for Przytycka, TeresaPrzytycka, Teresa
2000An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404
erledigt / bc 09.05.03Journal Article
1
Hide details for Przytyzka, TeresaPrzytyzka, Teresa
2008Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x
Journal Article
1
Hide details for Puglisi, Simon J.Puglisi, Simon J.
2014LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742
Proceedings Article
9
Hide details for Pyrga, EvangeliaPyrga, Evangelia
2011Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130
Falsch: Halldórsson, Mangús M. - richtig: Halldórsson, Magnús M.Proceedings Article
2010Algorithmic Game Theory and Networks
Universität des Saarlandes
Thesis - PhD thesis
2010Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441
Proceedings Article
2010Attachment IconOn the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97
Proceedings Article
2009Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195
Proceedings Article
2008New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207
Proceedings Article
2007Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
Journal Article
2007Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Journal Article
2005Shortest Paths in Time-Dependent Networks and their Applications
Universität des Saarlandes
ok / ch051109Thesis - Masters thesis
3
Hide details for P. GaoP. Gao
2012Distribution of the number of spanning regular subgraphs in random graphsUnpublished/Draft
2012Distributions of sparse spanning subgraphs in random graphsUnpublished/Draft
2012Uniform generation of d-factors in dense host graphsUnpublished/Draft
1
Hide details for Qian, JiaweiQian, Jiawei
2012On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617
Proceedings Article
3
Hide details for Räcke, HaraldRäcke, Harald
2003Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
okJournal Article
2003Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
ok - 9.6.04Journal Article
2002Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
qProceedings Article
3
Hide details for Radhakrishnan, JaikumarRadhakrishnan, Jaikumar
1997The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22
Journal Article
1996Deterministic restrictions in circuit complexity
In: Theory of Computing : 28th Annual ACM Symposium (STOC-28), 30-36
Proceedings Article
1996The randomized complexity of maintaining the minimum
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 4-15
Proceedings Article
1
Hide details for Radhakrishnan, R.Radhakrishnan, R.
1996The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351
Journal Article
1
Hide details for Ragde, PrabhakarRagde, Prabhakar
1995Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649
Proceedings Article
1
Hide details for Raghavendra Rao, B. V.Raghavendra Rao, B. V.
2013Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230
Proceedings Article
1
Hide details for Raidl, Günther R. (ed.)Raidl, Günther R. (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
1
Hide details for Rajaraman, RajmohanRajaraman, Rajmohan
2001A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254
Proceedings Article
1
Hide details for Rakrak, SaidRakrak, Said
2007Attachment IconStructure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
Attachment = Preprint u.T.: Structure of Groebner bases with respect to elimination ordersJournal Article
1
Hide details for Ramachandran, VijayaRamachandran, Vijaya
1995Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Journal Article
1
Hide details for Ramakrishna, G.Ramakrishna, G.
2013Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236
Proceedings Article
1
Hide details for Ramanujan, M. S.Ramanujan, M. S.
2010Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article
6
Hide details for Raman, RajeevRaman, Rajeev
1998Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
Gefunden durch Bibliotheksabgleich. UB.Journal Article
1997Routing on Meshes with Buses
In: Algorithmica [18], 417-444
Journal Article
1995Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
Journal Article
1995Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Journal Article
1995Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436
Proceedings Article
1993Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201
Proceedings Article
6
Hide details for Raman, RajivRaman, Rajiv
2012On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Khaled Elbassioni, Rajiv Raman, Saurabh Ray, René SittersJournal Article
2011Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21
Journal Article
2010On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179
Proceedings Article
2009Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350
Proceedings Article
2009Attachment IconOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286
Proceedings Article
2009On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219
Proceedings Article
8
Hide details for Raman, VenkateshRaman, Venkatesh
2012Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
Journal Article
2012Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
Journal Article
2012Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23
Journal Article
2011Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
Kein MPI AutorProceedings Article
2010Attachment IconA Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207
Proceedings Article
2010Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
Proceedings Article
2010Attachment IconThe effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
Proceedings Article
2009Attachment IconSolving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705
Proceedings Article
5
Hide details for Ramesh, HariharanRamesh, Hariharan
2000Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Proceedings Article
1999Covering Rectilinear Polygons with Axis-Parallel Rectangles
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 445-454
Proceedings Article
1999Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99), 241-251
Proceedings Article
1996Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52
Old: Editors wrong: Mahajan, Sanjeev; Ramesh, Hariharan. UB.Proceedings Article
1996Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44
pruefen, wer not-MPI ist; in MPI-Bib gefundenJournal Article
3
Hide details for Ramezani, FahimehRamezani, Fahimeh
2013On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Proceedings Article
2012Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Journal Article
2010Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Journal Article
25
Hide details for Ramos, Edgar A.Ramos, Edgar A.
2005Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120
ok / ch051109Journal Article
2003Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429
okProceedings Article
2002Smooth-Surface Reconstruction in Near-Linear Time
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 781-790
qProceedings Article
2001A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265
Journal Article
2001An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
In: Discrete and Computational Geometry [26], 233-244
Journal Article
2001Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337
Journal Article
2001Reconstructing a Collection of Curves with Corners and Endpoints
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 344-353
Proceedings Article
2001Solving Some Discrepancy Problems in NC
In: Algorithmica [29], 371-395
Journal Article
2001Surface Reconstruction in almost Linear Time under Locally Uniform Sampling
In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01), 129-132
Electronic Proceedings Article
2000Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706
Proceedings Article
2000Attachment IconCurve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
Mehlhorn139.pdf=Verlagsversion
139.pdf=Autorenversion
Journal Article
2000Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 290-299
Proceedings Article
2000Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212
Proceedings Article
2000Linear Programming Queries Revisited
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 176-181
Proceedings Article
1999Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206
Proceedings Article
1999I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138
Proceedings Article
1999On range reporting, ray shooting and $k$-level construction
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 390-399
Proceedings Article
1998Improved deterministic parallel padded sorting
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416
Proceedings Article
1998Attachment IconRandomized External-Memory Algorithms for some Geometric Problems
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 259-268
Proceedings Article
1997Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420
Journal Article
1997Construction of 1-d lower envelopes and applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 57-66
Proceedings Article
1997Efficient approximation and optimization algorithms for computational metrology
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 121-130
Proceedings Article
1997Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306
Journal Article
1997Intersection of unit-balls and diameter of a point set in R³
In: Computational Geometry Theory and Applications [8], 57-65
Journal Article
1997Solving some discrepancy problems in NC
In: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS-97), 22-36
Proceedings Article
1
Hide details for Rangan, C. PanduRangan, C. Pandu
1996Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, -
Proceedings Article
2
Hide details for Ranjan, DeshRanjan, Desh
1998Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124
Durch Abgleich mit der Bibliothek von Birgit gefunden. Mitarbeiter nicht mehr hier. UBJournal Article
1993Attachment IconSearching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443
Proceedings Article
2
Hide details for Rao, P. SrinivasaRao, P. Srinivasa
1998Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525
Journal Article
1996Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
Proceedings Article
1
Hide details for Rao, S. SrinivasaRao, S. Srinivasa
2003Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
okPart of a Book
2
Hide details for Rasch, RonaldRasch, Ronald
2001Attachment IconFurthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616
Journal Article
1994Furthest Site Abstract Voronoi Diagrams
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Rast, ThomasRast, Thomas
2011Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158
Proceedings Article
1
Hide details for Rathe, UlrichRathe, Ulrich
1999A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Journal Article
2
Hide details for Rauch, MonikaRauch, Monika
1990On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906
Journal Article
1989On the Complexity of a Game Related to the Dictionary Problem
In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 546-548
Proc-Titel etc. aus dem GBV / ch 060405Proceedings Article
10
Hide details for Rauf, ImranRauf, Imran
??On Enumerating Minimal Transversals of Geometric HypergraphsUnpublished/Draft
2011Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442
Electronic Proceedings Article
2011On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304
Journal Article
2010Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363
Journal Article
2010Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in GeometryUnpublished/Draft
2009Attachment IconOn the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505
Proceedings Article
2009Attachment IconOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
Proceedings Article
2008Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102
Proceedings Article
2007Information Brokerage Via Location-Free Double Rulings
In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100
Proceedings Article
2005Attachment IconEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
ok/ch050501 - 2. referee aufergänzenThesis - Masters thesis
1
Hide details for Rau, StephanRau, Stephan
1997Ein experimenteller Vergleich von zwei Algorithmen zur Berechnung des maximalen Flusses in einem asymmetrischen Netzwerk mit reellen Kapazitäten
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Ravi, R.Ravi, R.
2000Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
Achtung "Steiner" wird in MPG-Jahrbuch-Format klein geschriebenJournal Article
1998The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134
gefunden in mpi-bibJournal Article
6
Hide details for Rawitz, DrorRawitz, Dror
2012Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56
Proceedings Article
2011Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364
Journal Article
2011Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594
Journal Article
2010Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266
Proceedings Article
2010Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
Journal Article
2007Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346
Proceedings Article
2
Hide details for Rawlins, Gregory J.E.Rawlins, Gregory J.E.
1998Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490
Journal Article
1995Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130
Proceedings Article
9
Hide details for Ray, RahulRay, Rahul
2004Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
ok/ch050501Journal Article
2004Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4
Proceedings Article
2004Finding Planar Regions in a Terrain: In Practice and with a Guarantee
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 96-105
Proceedings Article
2004Geometric Algorithms for Object Placement and Planarity in a Terrain
Universität des Saarlandes
ok/ch050501 referees + supervisor aufergänzen! Date of Kolloquium prüfen! (wirklich gleich mit Sivadasan?)Thesis - PhD thesis
2002An O(nlogn) Algorithm for Classifying Identical CurvesMiscellaneous
2002Attachment IconComputing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
Proceedings Article
2002Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
q
erledigt / bc 09.05.03
Journal Article
2002Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
erledigt / bc 09.05.03Proceedings Article
2001Surface Topography Quantification using Computational GeometryMiscellaneous
18
Hide details for Ray, SaurabhRay, Saurabh
??On Enumerating Minimal Transversals of Geometric HypergraphsUnpublished/Draft
2013Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89
Proceedings Article
2012Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52
Journal Article
2012Attachment IconCounting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68
Proceedings Article
2012On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Khaled Elbassioni, Rajiv Raman, Saurabh Ray, René SittersJournal Article
2011Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442
Electronic Proceedings Article
2010Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600
Journal Article
2010Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683
Journal Article
2010Improved Results on Geometric Hitting Set Problems
In: Discrete & Computational Geometry [44], 883-895
Journal Article
2009Attachment IconOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286
Proceedings Article
2009On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219
Proceedings Article
2008New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207
Proceedings Article
2007Attachment IconAn Optimal Generalization of the Centerpoint Theorem, and its Extensions
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141
ok - export0707 / ch
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf
Proceedings Article
2007Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187
Proceedings Article
2007Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear)
Proceedings Article
2007On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Proceedings Article
2007Attachment 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
ok - export0707 / ch
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract - Achtung: das epsilon konnte nicht mitkopiert werden und wurde deswegen mit der latex-kodierung eingefügt.
- pdf
Proceedings Article
2004Counting Straight-Edge Triangulations of Planar Point Sets
Universität des Saarlandes
ok/ch050501 - referees + supevisor ergänzen!Thesis - Masters thesis
1
Hide details for Raza, SarfrazRaza, Sarfraz
2010Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600
Journal Article
1
Hide details for Razgon, IgorRazgon, Igor
2009Attachment IconSolving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85
Proceedings Article
2
Hide details for Reed, BruceReed, Bruce
2008The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86
Journal Article
2007Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486
Journal Article
11
Hide details for Reichel, JoachimReichel, Joachim
2011Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342
Journal Article
2008Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81
Proceedings Article
2008Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786
Proceedings Article
2007Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Journal Article
2006Attachment IconCombinatorial Approaches for the Trunk Packing Problem
Universität des Saarlandes
Thesis - PhD thesis
2005Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
ok / ch051116

STATUS: accepted (01.08.05)
Copyright muss noch geklaert werden!
Botz, 22.07.05:
Die im CTA genannte URL der LNCS ist gar nicht mehr aktuell. Wahrscheinlich
handelt es sich auch um eine alte Copyright Form. Der Link zu LNCS lautet:
http://www.springerlink.com/openurl.asp?genre=journal&issn=0302-9743
Die von mir gefundene Copyright Policy von Springer ist hier
http://www.springeronline.com/sgw/cda/pageitems/document/cda_downloaddocumen
t/0,11996,0-0-45-69724-0,00.pdf
zu finden.
Dort steht ausdrücklich:
"An author may self-archive an author-created version of his/her article on
his/her own website and his/her institution’s repository, including his/her final
version"
Ich werde das Thema aber beim Treffen mit den Springer-Leuten nächste Woche
ansprechen.
Bib 01.08.05:
welche Version? - Springer will Link auf Orig.?
Bestimmungen fuer LNCS sind nicht identisch mit Journal CTA
Angegebene URL ist aktuell!!! (Mail an Herrn Botz 01.08.05)
Proceedings Article
2005Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
ok / ch051109Proceedings Article
2004EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2003Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
okProceedings Article
2002Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
qProceedings Article
2001Attachment IconOptimale Hüllkörper für Objekte mit gekrümmten Oberflächen
Universität des Saarlandes
Thesis - Masters thesis
4
Hide details for Reinelt, GerhardReinelt, Gerhard
1997A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447
Journal Article
1997A branch-and-cut approach to physical mapping with end-probes
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 84-92
Proceedings Article
1996Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371
Journal Article
1995Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496
Journal Article
11
Hide details for Reinert, KnutReinert, Knut
2006Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425
Journal Article
2002Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics
In: Proceedings of the European Conference on Computational Biology (ECCB 2002), S4-S16
Proceedings Article
2000Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
Journal Article
2000The practical use of the A* algorithm for exact multiple sequence alignment
In: Journal of Computational Biology [7], 665-671
Download nur fuer Institutsmitglieder (IP 139.19.*.*. )
Sonderzeichen Titel?
Journal Article
1999A polyhedral approach to sequence alignment problems
Universität des Saarlandes
Thesis - PhD thesis
1999An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210
Journal Article
1998A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
Journal Article
1998A polyhedral approach to RNA sequence structure alignment
In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162
Proceedings Article
1997Attachment IconA Branch-And-Cut algorithm for multiple sequence alignment
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250
Proceedings Article
1996Lower Bounds for Row Minima Searching
In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), 454-465
Proceedings Article
1994Deferred Data Structuring
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Reinhard, KlausReinhard, Klaus
2002Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237
qJournal Article
2
Hide details for Reinstädtler, MartinReinstädtler, Martin
2002On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246
q
erledigt / bc 09.05.03
Journal Article
1998Verlustfreie Datenkompression mit selbstorganisierenden Listen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Rema, AnnaRema, Anna
1996Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154
Proceedings Article
1
Hide details for Remy, JanRemy, Jan
2006Shape Distributions and Protein Similarity
In: GCB, 1-10
Proceedings Article
1
Hide details for Reps, Thomas (ed.)Reps, Thomas (ed.)
1994Attachment IconIncremental Computation and Dynamic Algorithms 02.05.-06.05.94ok - mit Papierfassung abgeglichen / ch 061002

ch 060927: pdf - file s. Email: Angelika Mueller <angelika.mueller@dagstuhl.de> wrote on 02.08.2006 11:55:22

übertragen aus der Books-DB / ch 060801
Report
1
Hide details for Reussner, RalfReussner, Ralf
1998SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
Proceedings Article
2
Hide details for Reuter, MaxReuter, Max
2012Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Journal Article
2010Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213
Proceedings Article
1
Hide details for Richards, BradRichards, Brad
2002Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
q
lt. Springer ersch. der Band erst 2002!!! (Susan oder Anja, Datum unbekannt)
Proceedings Article
1
Hide details for Richa, Andrea W.Richa, Andrea W.
2001A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254
Proceedings Article
1
Hide details for Rieger, H.Rieger, H.
2009Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Electronic Journal Article
1
Hide details for Rieger, JoachimRieger, Joachim
1995Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces
In: Journal of Mathematical Imaging and Vision [5], 207-217
Journal Article
2
Hide details for Rinaldi, GiovanniRinaldi, Giovanni
1996Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371
Journal Article
1995Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496
Journal Article
1
Hide details for Rivals, EricRivals, Eric
1999q-gram Based Database Searching Using a Suffix Array (QUASAR)
In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 77-83
Proceedings Article
4
Hide details for Rizkallah, ChristineRizkallah, Christine
2013A Framework for the Verification of Certifying Computationsnoch nicht erschienen 4.2.13 smUnpublished/Draft
2011Attachment IconGlivenko and Kuroda for Simple Type TheoryUnpublished/Draft
2011Maximum Cardinality Matching
In: Archive of Formal Proofs,
Electronic Journal Article
2011Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
Proceedings Article
3
Hide details for Rizzi, RomeoRizzi, Romeo
2012Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474
Proceedings Article
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312
Proceedings Article
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312
Proceedings Article
1
Hide details for Rizzi, R.Rizzi, R.
2009Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Journal Article
3
Hide details for Röglin, HeikoRöglin, Heiko
2012Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
Journal Article
2010Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
2007Attachment IconThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67
Proceedings Article
4
Hide details for Rohnert, HansRohnert, Hans
1994Attachment IconDynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761
Journal Article
1992Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Part of a Book
1991Dynamic Perfect Hashing: Upper and Lower Boundsok - aus dem Internet übertragen; kein pdf gefunden / ch 060918Report
1988Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531
prüfen: wirklich ohne editor?Proceedings Article
2
Hide details for Rohnert, H.Rohnert, H.
1988Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215
Proceedings Article
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
1
Hide details for Röhrig, HeinRöhrig, Hein
1998Tree Decomposition: A Feasibility Study
Universität des Saarlandes
Gefunden von Christine durch Abgleich mit der Bibliotheksrecherche IB14. UB.Thesis - Masters thesis
1
Hide details for Rosamond, Fraces A.Rosamond, Fraces A.
2012Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
Journal Article
2
Hide details for Rosamond, Frances A.Rosamond, Frances A.
2011Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527
Proceedings Article
2011Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
2
Hide details for Rosenberg, Arnold L.Rosenberg, Arnold L.
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
ok - abgeglichen mit dem Volume/paper-Form / ch 060912

ok - ch 061109 :
- abgeglichen mit http://portal.acm.org/citation.cfm?doid=2157.322401
- pdf eingesetzt
- abstract + keywords eingesetzt + umformatiert
Journal Article
1981Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55
Proc.Daten aus Books-DB übertragen / ch 060806Proceedings Article
3
Hide details for Rosenstiehl, PierreRosenstiehl, Pierre
1986Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
Journal Article
1985Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203
Proc.Daten aus Book-DB übertragen/ ch 060721

allerdings steht -im Gegensatz zur Books-DB- in dblp ein editor:
editor = "Joseph O'Rourke"
Proceedings Article
1984Sorting Jordan sequences in linear timeSeitenzahl fehlt !!! / 060920
übertragen aus der Books-DB / ch 060803
Report
1
Hide details for Rosen, AdiRosen, Adi
2004Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102
Proceedings Article
1
Hide details for Rossignac, JarekRossignac, Jarek
2003The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116
okJournal Article
2
Hide details for Rote, GünterRote, Günter
1992Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Journal Article
1990On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
(ch 060324) noch zu prüfen: http://purl.org/CITIDEL/DBLP/db/conf/compgeom/compgeom90.html#FleischerMRWY90",Proceedings Article
1
Hide details for Rote, Günter (ed.)Rote, Günter (ed.)
200521st Annual Symposium on Computational Geometry (SCG'05)ok / ch060420Proceedings
1
Hide details for Rotics, UdiRotics, Udi
2006Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477
Journal Article
1
Hide details for Rottmann, Klaus-DieterRottmann, Klaus-Dieter
1996Bewegung eines Polygons zwischen polygonalen Hindernisse
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Rozenberg, LiatRozenberg, Liat
2011Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
8
Hide details for Rüb, ChristineRüb, Christine
2000Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522
Journal Article
1999Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22
Proceedings Article
1998On Batcher's Merge Sorts as Parallel Sorting Algorithms
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 410-420
gefunden in mpi-bibProceedings Article
1997Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521
Journal Article
1997On the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346
Journal Article
1997Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM
Proceedings Article
1996A Circuit for Exact Summation of Floating-Point Numbers
In: Information Processing Letters [57], 159-163
Journal Article
1995On the Average Running Time of Odd-Even Merge Sort
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 491-501
Proceedings Article
2
Hide details for Rudolf, GaborRudolf, Gabor
2008On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
Journal Article
2007Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231
Proceedings Article
1
Hide details for Rudra, AtriRudra, Atri
2010When 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
Proceedings Article
3
Hide details for Rülling, WolfgangRülling, Wolfgang
1996A Circuit for Exact Summation of Floating-Point Numbers
In: Information Processing Letters [57], 159-163
Journal Article
1988Attachment IconOn Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402
ok - ch 061004 ; ProcDaten mit Books-DB abgeglichen.

Prüfen: Editor?

prüfen:
http://dblp.uni-trier.de/db/conf/compgeom/compgeom88.html#GaoJKMR89",
URL = "http://doi.acm.org/10.1145/73393.73433",
Proceedings Article
1988On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
Proc aus Books-DBProceedings Article
3
Hide details for Rülling, W.Rülling, W.
1990Attachment IconCompaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397
ok - kein pdf-file online abrufbar / ch 060912Journal Article
1988Compaction on the Torusok - aus BIVis / der Papierfassung / ch 060920Report
1988Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225
Proceedings Article
1
Hide details for Ruppert, BarbaraRuppert, Barbara
1999Polygontriangulierung in Linearzeit
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Rusinov, MomchilRusinov, Momchil
2010Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262
Journal Article
6
Hide details for Rytter, WojciechRytter, Wojciech
1998A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681
Gefunden durch Bibliotheksabgleich. UBJournal Article
1998Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239
gefunden am 9.9.03 via google:
M. Crochemore, L. Gasieniec and W. Rytter, Constant-space string matching in sublinear average time, in Compression and Complexity of Sequences, B. Carpentieri, A. De Santis, U. Vaccaro and J.A. Storer, eds., IEEE Computer Society, 1998, 230--239.

Noch nicht erschienen. Eingetragen für 1997
Proceedings Article
1998Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 43-54
Gefunden durch Abgleich mit Bibliothek. UBProceedings Article
1997Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960
Journal Article
1996Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Proceedings Article
1996Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Proceedings Article
1
Hide details for Sabo, HolgerSabo, Holger
1999Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Sack, Jörg-RüdigerSack, Jörg-Rüdiger
2000Editorial
In: Computational Geometry [17], 1-2
Vorwort d. Hrsg.???Journal Article
1999Editorial
In: Computational Geometry [12], 153-154
Journal Article
1
Hide details for Sagot, Marie-FranceSagot, Marie-France
2012Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Journal Article
32
Hide details for Sagraloff, MichaelSagraloff, Michael
2013Analytic Root Clustering: A Complete Algorithm using Soft Zero TestsUnpublished/Draft
2013Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Journal Article
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
2013From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
Electronic Journal Article
2012A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258
Journal Article
2012Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46
Electronic Journal Article
2012Exaktes geometrisches RechnenMiscellaneous
2012On the Complexity of Solving a Bivariate Polynomial System
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161
Proceedings Article
2012When 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
Proceedings Article
2011A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90
Journal Article
2011A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528
Journal Article
2011A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430
This issue features 14 papers selected from “The Japan Conference on Computational
Geometry and Graphs (JCCGG2009),” held at Kanazawa Culture Hall, Kanazawa,
Japan, November 11–13, 2009.
Journal Article
2011A Simple But Exact and Efficient Algorithm for Complex Root Isolation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 353-360
Proceedings Article
2011An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47
Proceedings Article
2011Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697],
Electronic Journal Article
2011Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98
Proceedings Article
2011Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216
NOTE = {An extended version has been submitted to Journal of Symbolic Computation}Proceedings Article
2011When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21
Electronic Journal Article
2010A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506
Journal Article
2010An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278
Special Issue on 24th Annual Symposium on Computational Geometry (SoCG'08)Journal Article
2010An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16
Electronic Journal Article
2010On the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33
Electronic Journal Article
2009A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647
Journal Article
2009Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
2009Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254
Proceedings Article
2009Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Proceedings Article
2008A deterministic Bitstream Descartes AlgorithmReport
2008A General Approach to the Analysis of Controlled Perturbation AlgorithmsReport
2008Attachment IconA Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182
Proceedings Article
2008Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
Proceedings Article
2008Attachment IconGeometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32
Proceedings Article
2006Attachment IconReliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310
ch 061004: pdf nicht möglich herunterzuladen, login wird verlangt

ch 060814:
From DBLP (2006):
@InProceedings{conf/icalp/MehlhornOS06,
title = "Reliable and Efficient Computational Geometry Via
Controlled Perturbation",
author = "Kurt Mehlhorn and Ralf Osbild and Michael Sagraloff",
bibdate = "2006-07-03",
bibsource ="DBLP,
http://dblp.uni-trier.de/db/conf/icalp/icalp2006-1.html#MehlhornOS06",
booktitle ="ICALP (1)",
booktitle ="Automata, Languages and Programming, 33rd
International Colloquium, {ICALP} 2006, Venice, Italy,
July 10-14, 2006, Proceedings, Part {I}",
publisher = "Springer",
year = "2006",
volume = "4051",
editor = "Michele Bugliesi and Bart Preneel and Vladimiro
Sassone and Ingo Wegener",
ISBN = "3-540-35904-4",
pages = "299--310",
series = "Lecture Notes in Computer Science",
URL = "http://dx.doi.org/10.1007/11786986_27",
}
Proceedings Article
6
Hide details for Saha, ChandanSaha, Chandan
2013A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article
2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
2012Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
Proceedings Article
2012Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
Journal Article
2012Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
Electronic Journal Article
2011Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
Proceedings Article
1
Hide details for Salowe, Jeffrey S.Salowe, Jeffrey S.
1995Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498
Proceedings Article
1
Hide details for Saluja, SanjeevSaluja, Sanjeev
1997Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229
Proceedings Article
2
Hide details for Sanders, GeoffSanders, Geoff
2011Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk RankingUnpublished/Draft
2011Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671
Journal Article
74
Hide details for Sanders, PeterSanders, Peter
2013Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
2011Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319
Journal Article
2009Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Journal Article
2008Algorithms and Data Structures: The Basic ToolboxBook
2007Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
Journal Article
2007In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59
Proceedings Article
2006Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327
ok / ch 070207
- aus Webseite aufergänzt
Proceedings Article
2006How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791
ok / ch 070312
- mit Webseite und auch den übrigen bereits eingetragenen ESA-Datensätzen abgeglichen.
Proceedings Article
2005An Asymptotic Approximation Scheme for Multigraph Edge Coloring
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 897-906
ch - ok/ch050419Proceedings Article
2005Attachment IconBetter External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 86-97
to appear ?? / ch051031

isbn und alles, aber kein content zu finden :-( /ch060602

ok / ch060616 - per Fernleihbestllung Restdaten erhalten.
Proceedings Article
2005Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network ModelsTitel existiert laut google nur am MPI => nirgends sonst erschienen. ch / 060619Unpublished/Draft
2005Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
ok / ch060619Journal Article
2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
ok / ch060619Journal Article
2005STXXL: Standard Template Library for XXL Data SetsReport
2005STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651
ok / ch060420Proceedings Article
2005Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
ok - ProcDaten aus Books-DB übertragen, abstract + pdf-File übertragen / ch061004Proceedings Article
2004Attachment IconA simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
Journal Article
2004Attachment IconA Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
12.8.05: aus RR-DB kopiert / chReport
2004Algorithms for Scalable Storage Servers
In: SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science, 82-101
ch - ok/ch050426Proceedings Article
2004Attachment IconConstant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111
Proceedings Article
2004Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151
Proceedings Article
2004Attachment IconEngineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208
q/ch050411Proceedings Article
2004Attachment IconOnline Scheduling with Bounded Migration12.8.05: aus RR-DB kopiert / chReport
2004Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
ch - ok/ch050412Proceedings Article
2004Super Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796
ch - ok/ch050411Proceedings Article
2003A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38
okJournal Article
2003A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
okProceedings Article
2003Attachment IconApproximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241
okProceedings Article
2003Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148
okProceedings Article
2003Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184
okJournal Article
2003Memory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
Part of a Book
2003Polynomial Time Algorithms For Network Information Flow
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294
okProceedings Article
2003Attachment IconScanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93
ok - ch 061004:
- Abstract eingefügt + pdf ausgetauscht
- mit Springer-Webseite abgeglichen
Mehlhorn_a_2003_i.pdf ist Verlagsversion
Journal Article
2003Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
okProceedings Article
2003Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
okProceedings Article
2003Attachment IconSpace Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
okProceedings Article
2003Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
okJournal Article
2003$\Delta$-stepping: a parallelizable shortest path algorithm
In: Journal of Algorithms [49], 114-152
okJournal Article
2002Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23
qPart of a Book
2002Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
qProceedings Article
2002Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
qJournal Article
2002Presenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196
qPart of a Book
2002Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130
qProceedings Article
2002Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573
qJournal Article
2002Reconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723
qJournal Article
2002The factor algorithm for regular all-to-all communication on clusters of SMP nodes
In: Proceedings of the 8th International Euro-Par Conference, 799-803
q
Volume statt Number - und die auch noch falsch!
Proceedings Article
2002Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237
qJournal Article
2002Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126
qPart of a Book
2001Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73
Proceedings Article
2001How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
Journal Article
2001Reconciling Simplicity and Realism in Parallel Disk Models
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 67-76
Proceedings Article
2001The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335
Proceedings Article
2000A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926
Proceedings Article
2000Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98
Proceedings Article
2000Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Proceedings Article
2000Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
11.9.: no pages! deshalb bleibt das Feld leer. (ch)

ACHTUNG: Journal ersch. nur in elektr. Form; Zugang funktioniert für MPII trotz zahlreicher Reklamationen noch nicht
Electronic Journal Article
2000How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Proceedings Article
2000Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470
Proceedings Article
1999A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Journal Article
1999Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
Proceedings Article
1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Journal Article
1999Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
1999Berechnungen mit großen Datenmengen
In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540
Part of a Book
1999Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
Proceedings Article
1999High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
Proceedings Article
1998Attachment IconA Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731
Proceedings Article
1998An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154
Proceedings Article
1998Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
Proceedings Article
1998Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309
Journal Article
1998Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165
Journal Article
1998Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97
Journal Article
1998SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
Proceedings Article
1998Tree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132
Proceedings Article
1998$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404
Proceedings Article
1
Hide details for Sanders, Peter (ed.)Sanders, Peter (ed.)
2003Algorithms for Memory HierarchiesokBook
2
Hide details for Saptharishi, RamprasadSaptharishi, Ramprasad
2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
2012Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
Proceedings Article
1
Hide details for Sarrafzadeh, MajiSarrafzadeh, Maji
1986Attachment IconChannel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221
Journal Article
2
Hide details for Sastry, Kumara (ed.)Sastry, Kumara (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
33
Hide details for Sauerwald, ThomasSauerwald, Thomas
2014Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted
Proceedings Article
2013Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
Juli 2012 in arXiv:1207.2125 [math.PR] / 6.2.13 smElectronic Proceedings Article
2013Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
Proceedings Article
2013Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456
Proceedings Article
2012A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280
Proceedings Article
2012Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361
Journal Article
2012Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Proceedings Article
2012Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Electronic Proceedings Article
2012Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
Journal Article
2012Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641
Proceedings Article
2012Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350
Proceedings Article
2012Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660
Proceedings Article
2011Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199
Proceedings Article
2011Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
Proceedings Article
2011Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83
Proceedings Article
2011Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3
Journal Article
2011Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439
Proceedings Article
2011Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
Proceedings Article
2011Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
Journal Article
2011Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158
Proceedings Article
2011Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641
Journal Article
2010Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530
Proceedings Article
2010Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421
Proceedings Article
2010Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629
Proceedings Article
2010Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
Electronic Journal Article
2010The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
Proceedings Article
2010The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30
Electronic Journal Article
2009Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130
Proceedings Article
2009Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247
Journal Article
2009Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153
Proceedings Article
2009Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377
Proceedings Article
2009Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
Proceedings Article
2008Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781
Proceedings Article
13
Hide details for Saurabh, SaketSaurabh, Saket
2012Attachment IconBeyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423
Electronic Proceedings Article
2012Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
Journal Article
2012Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
Journal Article
2012On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84
Proceedings Article
2012Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 424-434
Electronic Proceedings Article
2011Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
Proceedings Article
2011Attachment IconHitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200
Proceedings Article
2011Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
Kein MPI AutorProceedings Article
2011Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
KEIn MPI-Autor auf VÖ.smProceedings Article
2010Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
Proceedings Article
2010Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
Proceedings Article
2010Attachment IconThe effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
Proceedings Article
2009Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article
2
Hide details for Sau, IgnasiSau, Ignasi
2009Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article
2009Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
Journal Article
4
Hide details for Saxena, NitinSaxena, Nitin
2013A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article
2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
2012Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
Proceedings Article
2012Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
Electronic Journal Article
16
Hide details for Schäfer, GuidoSchäfer, Guido
2010Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Journal Article
2006Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
ok - pdf eingefügt / 061004

ok / ch060416
Journal Article
2004Cross-monotonic cost sharing methods for connected facility location games
In: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004, 242-243
Proceedings Article
2004Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442
Journal Article
2004Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
ok/ch050523Proceedings Article
2004Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
ok /ch050523Proceedings Article
2004Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes
Thesis - PhD thesis
2003Attachment IconA Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
okJournal Article
2003Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471
okProceedings Article
2003Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM
Proceedings Article
2002Attachment IconAll-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
qJournal Article
2002Attachment IconImplementation of $O(nm \log n)$ Weighted Matchings in General Graphs: The Power of Data Structures
In: Proceedings of the n?th Conference on,
In: Journal of Experimental Algorithmics [7],
q - 11.9.: no pages! deshalb bleibt das Feld leer. (ch)
-- bis auf: "pages: online"
Electronic Journal Article
2001A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 242-253
Proceedings Article
2000Attachment IconImplementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38
Proceedings Article
2000Weighted Matchings in General Graphs
Universität des Saarlandes
Thesis - Masters thesis
1998An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380
Proceedings Article
3
Hide details for Schalekamp, FransSchalekamp, Frans
2012A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486
Proceedings Article
2012On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617
Proceedings Article
2011Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
Electronic Proceedings Article
1
Hide details for Schanne, ThomasSchanne, Thomas
2001Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schapira, MichaelSchapira, Michael
2008Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832
Proceedings Article
2
Hide details for Scharbrodt, M.Scharbrodt, M.
1998The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
Journal Article
1998The thickness of graphs: A survey
In: Graphs and Combinatorics [14], 59-73
Journal Article
1
Hide details for Schehr, GregorySchehr, Gregory
2009Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Electronic Journal Article
2
Hide details for Scheideler, ChristianScheideler, Christian
2011Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158
Proceedings Article
2010Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530
Proceedings Article
3
Hide details for Schenkel, RalfSchenkel, Ralf
2006IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
ed? publisher?Electronic Proceedings Article
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486
ok / ch 070201
- abgeglichen mit http://dblp.uni-trier.de/rec/bibtex/conf/vldb/BastMSTW06
- pdf eingefügt / download verbidden
- abgeglichen mit gleichem Datensatz in der D5
Proceedings Article
1
Hide details for Schieber, BaruchSchieber, Baruch
2004Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
ok/ch050411Journal Article
3
Hide details for Schilz, ThomasSchilz, Thomas
2000Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes
Thesis - PhD thesis
1999Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
1996Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
3
Hide details for Schindelhauer, ChristianSchindelhauer, Christian
2007Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
UB: Jahr von 2006 auf 20076 geschoben. Kein Tagungsband in gedruckter Form verfügbar. Website bietet nur Download der Extended Abstracts an. Diese werden aber nicht für die Jahrbuchmeldung akzeptiert.Proceedings Article
2005Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
@inproceedings{DELIS-TR-0287, author = {Gerhard Weikum and Holger Bast and Geoffrey Canright and David Hales and Christian Schindelhauer and Peter Triantafillou}, title = {Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search}, booktitle = {ECCS Workshop on Peer-to-peer data management in the Complex Systems perspective}, year = {2005}, key = {DELIS-TR-0287} }Proceedings Article
2000Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Proceedings Article
40
Hide details for Schirra, StefanSchirra, Stefan
2009A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Journal Article
2008Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
in Press, online bereits ersch. 05.02.08/bcJournal Article
2007Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2006Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
ch 061004: pdf nicht möglich herunterzuladen, login wird verlangt

ok - ch 060922: http://dblp.uni-trier.de/rec/bibtex/conf/iccsa/KettnerMPSY06
Proc.Daten aus Books-DB
Proceedings Article
2004Classroom Examples of Robustness Problems in Geometric ComputationsReport
2004Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
ch - ok/ch050422Proceedings Article
2004The LEDA class real number -- extended versionReport
2002Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2
erledigt - frisch aus der ZeitschriftProceedings Article
2001Attachment IconA Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
Proceedings Article
2001CGAL Reference and User ManualsUnknown Form: eBookForm
2001Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12
Journal Article
2001Attachment IconExact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172
ch 060831: http://dblp.uni-trier.de/rec/bibtex/books/sp/alefeld01/MehlhornS01

2001/2002 (ich weiß nicht, wer das geschrieben hat / ch 060831):
laut Aussage von Kurt noch nicht erschienen
Part of a Book

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