MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

MPI-INF D1 Publications

Entries sorted by: 3. Type of Publication - 3. All Types: 15.4.1997-15.4.1999

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

#Author/EditorYearTitlePublisher / Institution
1
Show details for BookBook
9
Show details for Part of a BookPart of a Book
1
Show details for ProceedingsProceedings
130
Show details for Proceedings ArticleProceedings Article
91
Hide details for Journal ArticleJournal Article
Albers, Susanne1999Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473
SIAM
Albers, Susanne1998A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109
Albers, Susanne1998Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693
Albers, Susanne1997On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305
Albers, Susanne
Hagerup, Torben
1997Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51
Albers, Susanne
Koga, Hisashi
1998New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96
Albers, Susanne
Mitzenmacher, Michael
1998Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329
Albers, Susanne
Mitzenmacher, Michael
1997Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160
Althaus, Ernst
Mehlhorn, Kurt
1998Attachment IconMaximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113
Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos
1998All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110
Arikati, Srinivasa Rao
Maheshwari, Anil
Zaroliagis, Christos
1997Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16
Arikati, Srinivasa Rao
Mehlhorn, Kurt
1999Attachment IconA correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254
Elesevier
Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt
1999On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228
Arya, Sunil
Smid, Michiel
1997Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54
Springer
Auletta, Vincenzo
Dinitz, Yefim
Nutov, Zeev
Parente, Domenico
1999A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30
Academic Press
Barnes, Greg
Edmonds, Jeff A.
1998Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202
SIAM
Bodlaender, Hans L.
Deogun, Jitender S.
Jansen, Klaus
Kloks, Ton
Kratsch, Dieter
Müller, Haiko
Tuza, Zsolt
1998Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181
Bodlaender, Hans L.
Hagerup, Torben
1998Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746
Bradford, Phillip Gnassi
Capoyleas, Vasilis
1997Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91
Bradford, Phillip Gnassi
Fleischer, Rudolf
Smid, Michiel
1997More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400
Bradford, Phillip Gnassi
Rawlins, Gregory J.E.
Shannon, Greogory E.
1998Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490
Brandenburg, Franz J.
Jünger, Michael
Mutzel, Petra
1997Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207
Breslauer, Dany
Jiang, Tao
Jiang, Zhigen
1997Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353
Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos
1998A Parallel Priority Queue with Constant Time Operations
In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures [49], 4-21
Academic Press
Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard
1998A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302
Chaudhuri, Shiva
Dubhashi, Devdatt
1997Probabilistic recurrence relations revisited
In: Theoretical Computer Science [181], 45-56
Elsevier
Chaudhuri, Shiva
Garg, Naveen
Ravi, R.
1998The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134
Elsevier
Chaudhuri, Shiva
Radhakrishnan, Jaikumar
1997The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22
Chaudhuri, Shiva
Zaroliagis, Christos
1998Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
In: Theoretical Computer Science [203], 205-223
Cheriyan, Joseph
Mehlhorn, Kurt
1999Attachment IconAn analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242
Elsevier
Chong, Ka Wong
Lam, Tak Wah
1998Approximating Biconnectivity in Parallel
In: Algorithmica [21], 395-410
Springer
Christof, Thomas
Jünger, Michael
Kececioglu, John
Mutzel, Petra
Reinelt, Gerhard
1997A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447
Crochemore, Maxime
Galil, Zvi
Gasieniec, Leszek
Park, Kunsoo
Rytter, Wojciech
1997Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960
Crochemore, Maxime
Gasieniec, Leszek
Hariharan, Ramesh
Muthukrishnan, S.
Rytter, Wojciech
1998A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681
SIAM
Das, Gautam
Kapoor, Sanjiv
Smid, Michiel
1997On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: 16th Conference on Foundations of Software Technology and Theoretical Computer Science, 447-460
In: Algorithmica [19], 447-460
Springer
de Berg, Marc
van Kreveld, Marc
Schirra, Stefan
1998Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257
American Congress on Surveying and Mapping
Deng, Xiaotie
Mahajan, Sanjeev
1997The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802
Dietzfelbinger, Martin
Hagerup, Torben
Katajainen, Jyrki
Penttonen, Martti
1997A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51
Diks, Krzysztof
Hagerup, Torben
1998More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29
Elsevier
Dinitz, Yefim
Garg, Naveen
Goemans, Michel X.
1999On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41
Springer
Dinitz, Yefim
Nutov, Zeev
1999A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30
Academic Press
Dubhashi, Devdatt
Ranjan, Desh
1998Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124
Wiley
Edelsbrunner, Herbert
Ramos, Edgar A.
1997Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306
Springer
Ferragina, Paolo
Gross, Roberto
1998Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736
SIAM
Fleischer, Rudolf1999Decision trees: old and new results
In: Information and computation [152], 44-61
Academic Press
Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian
1997Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
Frederickson, Greg N.
Solis-Oba, Roberto
1998Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518
Gasieniec, Leszek
Pelc, Andrzej
1997Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20
Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel
1998Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
SIAM
Goodrich, Michael T.
Ramos, Edgar A.
1997Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420
Gupta, Arvind
Mahajan, Sanjeev
1997Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1999Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
Dasgupta, Bhaskar
1997The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456
Hagerup, Torben1997Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197
Hagerup, Torben
Kutylowski, Miroslaw
1997Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66
Hert, Susan
Lumelsky, Vladimir
1999Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639
Jünger, Michael
Leipert, Sebastian
Mutzel, Petra
1998A Note on Computing a Maximal Planar Subgraph using PQ-Trees
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [17], 609-612
IEEE
Jünger, Michael
Mutzel, Petra
19972-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25
Jünger, Michael
Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M.
1998The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos
1999Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1997Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
Kaufmann, Michael
Raman, Rajeev
Sibeyn, Jop F.
1997Routing on Meshes with Buses
In: Algorithmica [18], 417-444
Krysta, Piotr
Pacholski, Leszek
1999The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
Academic Press
Lenhof, Hans-Peter
Morgenstern, Burkhard
Reinert, Knut
1999An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210
Oxford University Press
Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin
1998A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
1998A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304
Elsevier
Mehlhorn, Kurt
Näher, Stefan
Seel, Michael
Seidel, Raimund
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
1999Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Mehlhorn, Kurt
Sack, Jörg-Rüdiger
Urrutia, Jorg
1999Editorial
In: Computational Geometry [12], 153-154
Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M.
1998The thickness of graphs: A survey
In: Graphs and Combinatorics [14], 59-73
Springer
Panconesi, Alessandro
Papatriantafilou, Marina
Tsigas, Philippas
Vitanyi, Paul
1998Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
Springer
Papatriantafilou, Marina
Tsigas, Philippas
1997Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328
Ramos, Edgar A.1997Intersection of unit-balls and diameter of a point set in R³
In: Computational Geometry Theory and Applications [8], 57-65
Elsevier
Rathe, Ulrich
Sanders, Peter
Knight, Peter
1999A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Elsevier
Rüb, Christine1997On the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346
Sanders, Peter1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Elsevier
Sanders, Peter1998Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309
Sanders, Peter1998Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165
GI-ITG: Parallel-Algorithmen, -Rechnerstrukturen und -Systemsoftware
Sanders, Peter1998Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97
Academic Press
Seiden, Steve S.1999Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416
Kluwer
Sibeyn, Jop F.1999Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
SIAM
Sibeyn, Jop F.1998List Ranking on Meshes
In: Acta Informatica [35], 543-566
Springer
Sibeyn, Jop F.1997Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287
Sibeyn, Jop F.
Grammatikakis, M.D.
Hsu, D.F.
Kraetzl, M.
1998Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132
Academic Press
Sibeyn, Jop F.
Guillaume, Frank
Seidel, Tillmann
1999Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180
Academic Press
Sibeyn, Jop F.
Juurlink, Ben
Rao, P. Srinivasa
1998Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525
IEEE
Sibeyn, Jop F.
Kaufmann, Michael
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Sibeyn, Jop F.
Kaufmann, Michael
Chlebus, Bogdan S.
1997Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141
Sridharan, K
Subramanian, C. R.
Sudha, N
1998Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7
Elsevier
Subramanian, C. R.1999Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123
Academic Press
Subramanian, C. R.
Fürer, Martin
Veni Madhavan, C. E.
1998Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158
Wiley
Zaroliagis, Christos1997Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37
50
Show details for Thesis - Master's thesisThesis - Master's thesis
3
Show details for Thesis - Doctoral dissertationThesis - Doctoral dissertation
6
Show details for Thesis - Habilitation thesisThesis - Habilitation thesis
1
Show details for Unpublished/DraftUnpublished/Draft
2
Show details for MiscellaneousMiscellaneous
294

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