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: 5. Year - 8. Counting Publications

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

#YAuthor/EditorTitle
1
Show details for ????
3
Show details for 20152015
18
Show details for 20142014
101
Show details for 20132013
145
Show details for 20122012
151
Show details for 20112011
144
Show details for 20102010
126
Show details for 20092009
140
Show details for 20082008
138
Show details for 20072007
121
Show details for 20062006
98
Show details for 20052005
99
Show details for 20042004
88
Show details for 20032003
74
Show details for 20022002
74
Show details for 20012001
96
Show details for 20002000
88
Show details for 19991999
104
Show details for 19981998
109
Show details for 19971997
84
Show details for 19961996
91
Hide details for 19951995
1
Show details for Part of a BookPart of a Book
50
Hide details for Proceedings ArticleProceedings Article
Albers, SusanneImproved randomized on-line algorithms for the list update problem
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 412-419
Albers, Susanne
Koga, Hisashi
Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158
Andersson, Arne
Hagerup, Torben
Nilsson, Stefan
Raman, Rajeev
Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436
Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos
All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376
Arya, Sunil
Das, Gautam
Mount, David M.
Salowe, Jeffrey S.
Smid, Michiel
Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498
Arya, Sunil
Mount, David M.
Approximate range searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181
Arya, Sunil
Mount, David M.
Narayan, Oruttom
Accounting for boundary effects in nearest neighbor searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344
Awerbuch, Baruch
Azar, Yossi
Grove, Edward
Kao, Ming-Yang
Krishnan, P.
Vitter, Jeffrey Scott
Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391
Bacik, Roman
Mahajan, Sanjeev
Semidefinite programming and its applications to NP problems
In: Computing and Combinatorics: 1st Annual International Conference (COCOON95), 566-575
Barve, Rakesh D.
Grove, Edward
Vitter, Jeffrey Scott
An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213
Berg, Marc de
Kreveld, Marc van
Schirra, Stefan
A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88
Berthomé, P.
Duboux, T.
Hagerup, Torben
Newman, I.
Schuster, Assaf
Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380
Bodlaender, Hans L.
Hagerup, Torben
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279
Bradford, Phillip Gnassi
Choppela, Venkatesh
Rawlins, Gregory J.E.
Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130
Bradford, Phillip Gnassi
Fleischer, Rudolf
Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408
Burnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
Attachment IconExact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
Chaudhuri, Shiva
Dubhashi, Devdatt
Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219
Chaudhuri, Shiva
Hagerup, Torben
Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218
Chaudhuri, Shiva
Zaroliagis, Christos
Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45
Chaudhuri, Shiva
Zaroliagis, Christos
Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255
Chian, Yi-Feng
Goodrich, Michael T.
Grove, Edward
Tamassia, Roberto
Vengroff, Darren Erik
Vitter, Jeffrey Scott
External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149
Dedorath, Jürgen
Gergov, Jordan
Hagerup, Torben
More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243
Djidjev, Hristo N.
Pantziou, Grammati E.
Zaroliagis, Christos
Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200
Djidjev, Hristo N.
Pantziou, Grammati E.
Zaroliagis, Christos
On-line and Dynamic Algorithms for Shortest Path Problems
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204
Evans, Brian
Schwarz, Christian
Teich, Jürgen
Vainshtein, Alek
Welzl, Emo
Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
Evans, B.L.
Schwarz, Christian
Teich, Jürgen
Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502
Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian
Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
Grove, EdwardOn-line Bin Packing with Lookahead
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 430-436
Grove, Edward
Kao, Ming-Yang
Krishnan, P.
Vitter, Jeffrey Scott
Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
Dasgupta, Bhaskar
The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171
Hagerup, Torben
Katajainen, Jyrki
Nishimura, Naomi
Ragde, Prabhakar
Characterizations 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
Hariharan, Ramesh
Mahajan, Sanjeev
Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16
Hoepman, Jaap-Henk
Papatriantafilou, Marina
Tsigas, Philippas
Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Janardan, Ravi
Smid, Michiel
On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198
Jünger, Michael
Mutzel, Petra
The Polyhedral Approach to the Maximum Planar Subgraph Problem:
New Chances for Related Problems
In: Graph Drawing: DIMACS International Workshop (GD94), 119-130
Juurlink, Ben
Mutzel, Petra
?
In: Conference on High-Performance Computing, 125-130
Juurlink, Ben
Sibeyn, Jop F.
Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760
Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos
On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos
Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44
Kaufmann, Michael
Sibeyn, Jop F.
Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422
Kaufmann, Michael
Sibeyn, Jop F.
Suel, Torsten
Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88
Mehlhorn, KurtExperiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518
Mehlhorn, Kurt
Priebe, Volker
On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198
Meyer, Ulrich
Sibeyn, Jop F.
Simulating the Simulator: Determinstic PRAM Simulation on a Mesh Simulator
In: Eurosim '95, 285-290
Mutzel, PetraA Polyhedral Approach to Planar Augmentation and Related Problems
In: Algorithms - ESA'95: 3rd Annual European Symposium, 494-507
Papatriantafilou, Marina
Tsigas, Philippas
Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems
In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319
Rüb, ChristineOn the Average Running Time of Odd-Even Merge Sort
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 491-501
Schömer, Elmar
Thiel, Christian
Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60
Sibeyn, Jop F.Sample Sort on Meshes
In: Proceedings of Computing Science in the Netherlands, SION, 217-228
28
Show details for Journal ArticleJournal Article
1
Show details for ReportReport
10
Show details for Thesis - Masters thesisThesis - Masters thesis
1
Show details for Thesis - PhD thesisThesis - PhD thesis
26
Show details for 19941994
11
Show details for 19931993
15
Show details for 19921992
10
Show details for 19911991
19
Show details for 19901990
12
Show details for 19891989
17
Show details for 19881988
14
Show details for 19871987
20
Show details for 19861986
13
Show details for 19851985
21
Show details for 19841984
13
Show details for 19831983
7
Show details for 19821982
7
Show details for 19811981
8
Show details for 19801980
11
Show details for 19791979
10
Show details for 19781978
5
Show details for 19771977
13
Show details for 19761976
7
Show details for 19751975
4
Show details for 19741974
3
Show details for 19731973
2359

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