Jahresbibliographie 1997

Veröffentlichungen von
Angehörigen der Hochschulen des Saarlandes

Max-Planck-Institut für Informatik (MPI)

Albers, Susanne
- Better Bounds for Online Scheduling. - In: Proc. 29th Annual ACM Symp. on
Theory of Computing (STOC-97). - New York : ACM Press, 1997, S. 130-139
 
- Better Bounds for Online Scheduling. - Saarbrücken : Max-Planck-Institut
für Informatik, 1997, 16 S. - (Research Report ; MPI-I-97-1-009)
 
- u.a.: Exploring Unknown Environments. - In: Proc. 29th Annual ACM Symp. on
Theory of Computing (STOC-97). - New York : ACM Press, 1997, S. 416-425
 
- u.a.: Exploring Unknown Environments. - Saarbrücken : Max-Planck-Institut
für Informatik, 1997, 23 S. - (Research Report ; MPI-I-97-1-017)
 
- u.a.: Improved Parallel Integer Sorting without Concurrent Writing. - In:
Information and Computation. - 136 (1997), S. 25-51
 
- u.a.: Minimizing Stall Time in Single and Parallel Disk Systems. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 16 S. - (Research
Report ; MPI-I-97-1-024)
 
- On the Influence of Lookahead in Competitive Paging Algorithms. - In:
Algorithmica. - 18 (1997), S. 283-305
 
- u.a.: Revisiting the COUNTER algorithms for list update. - In: Information
Processing Letters. - 64 (1997), S. 155-160
 
Althaus, Ernst
- u.a.: Maximum Network Flow with Floating Point Arithmetic. - Saarbrücken :
Max-Planck-Institut für Informatik, 1997, 5 S. - (Research Report ; MPI-I-97-1-
022)
 
Arikati, Srinivasa Rao
- u.a.: Efficient Computation of implicit representations of sparse graphs. -
In: Discrete Applied Mathematics. - 78 (1997), S. 1-16
 
Arya, Sunil
- u.a.: Efficient construction of a bounded degree spanner with low weight. -
In: Algorithmica. - 17 (1997), S. 33-54
 
Bachmair, Leo
- u.a.: Elimination of Equality via Transformation with Ordering
Constraints. - Saarbrücken : Max-Planck-Institut für Informatik, 1997, 18 S. -
(Research Report ; MPI-I-97-2-012)
 
- u.a.: Strict Basic Superposition and Chaining. - Saarbrücken : Max-Planck-
Institut für Informatik, 1997, 22 S. - (Research Report ; MPI-I-97-2-011)
 
- u.a.: A Theory of Resolution. - Saarbrücken : Max-Planck-Institut für
Informatik, 1997, 79 S. - (Research Report ; MPI-I-97-2-005)
 
Barth, Peter
- u.a.: PLAM: ProLog and Algebraic Modelling. - In: Proc. Fifth Int. Conf.
on the Practical Application of Prolog. - London : The Practical Application
Company, 1997, S. 73-82
 
Basin, David A.
- u.a.: Labelled modal logics: quantifiers. - Saarbrücken : Max-Planck-
Institut für Informatik, 1997, 31 S. - (Research Report ; MPI-I-97-2-001)
 
- u.a.: Labelled Propositional Modal Logics: Theory and Practice. - In:
Journal of Logic and Computation. - 7 (1997), S. 685-717
 
- u.a.: Labelled quantified modal logics. - In: Proc. 21st Annual German
Conf. on Artificial Intelligence (KI-97): Advances in Artificial Intelligence
/ Ed.: Brewka, Gerhard .. - Berlin : Springer, 1997, S. 171-182. - (Lect.
Notes Artif. Intell. ; 1303)
 
- u.a.: A New Method for Bounding the Complexity of Modal Logics. - In:
Proc. 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory (KGC-
97) / Ed.: Gottlob, G. .. - Berlin : Springer, 1997, S. 89-102. - (Lect.
Notes Comput. Sci. ; 1289)
 
Bockmayr, Alexander
- u.a.: On the Chvßtal Rank of Polytopes in the 0/1 Cube. - Saarbrücken :
Max-Planck-Institut für Informatik, 1997, 12 S. - (Research Report ; MPI-I-97-
2-009)
 
- u.a.: PLAM: ProLog and Algebraic Modelling. - In: Proc. Fifth Int. Conf.
on the Practical Application of Prolog. - London : The Practical Application
Company, 1997, S. 73-82
 
- u.a.: A Unifying Framework for Integer and Finite Domain Constraint
Programming. - Saarbrücken : Max-Planck-Institut für Informatik, 1997, 24 S. -
(Research Report ; MPI-I-97-2-008)
 
Bradford, Phillip Gnassi
- u.a.: More efficient parallel totally monotone matrix searching. - In:
Journal of Algorithms. - 23 (1997), S. 386-400
 
- u.a.: Weak epsilon-Nets for Points on a Hypersphere. - In: Discrete &
Computational Geometry. - 18 (1997), S. 83-91
 
Breslauer, Dany
- u.a.: Rotations of periodic strings and short superstrings. - In: Journal
of Algorithms. - 24 (1997), S. 340-353
 
Brodal, Gerth Stølting
- Finger Search Trees with Constant Insertion Time. - Saarbrücken : Max-
Planck-Institut für Informatik, 1997, 17 S. - (Research Report ; MPI-I-97-1-
020)
 
- u.a.: A parallel priority data structure with applications. - In: Proc.
11th Int. Parallel Processing Symp. (IPPS-97) / Ed.: Feitelson, Dror G. .. -
Los Alamitos : IEEE Comput. Soc. Press, 1997, S. 689-693
 
- u.a.: A parallel priority queue with constant time operations. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 19 S. - (Research
Report ; MPI-I-97-1-011)
 
- Predecessor Queries in Dynamic Integer Sets. - In: Proc. 14th Annual Symp.
on Theoretical Aspects of Computer Science (STACS-97) / Ed.: Reischuk, Rudiger
.. - Berlin : Springer, 1997, S. 21-32. - (Lect. Notes Comput. Sci. ; 1200)
 
Burnikel, Christoph
- u.a.: A Strong and Easily Computable Separation Bound for Arithmetic
Expressions Involving Square Roots. - In: Proc. 8th Annual ACM-SIAM Symp. on
Discrete Algorithms (SODA-97). - New York/Philadelphia : ACM Press/SIAM
Publications, 1997, S. 702-709
 
Capoyleas, Vasilis
- u.a.: Weak epsilon-Nets for Points on a Hypersphere. - In: Discrete &
Computational Geometry. - 18 (1997), S. 83-91
 
Charatonik, Witold
- u.a.: Set Constraints with Intersection. - In: Proc. Twelfth Annual IEEE
Symp. on Logic in Computer Science (LICS-97) / Ed.: Winskel, Glynn. - New York
: IEEE Comput. Soc. Press, 1997, S. 362-375
 
- u.a.: Solving set constraints for greatest models. - Saarbrücken : Max-
Planck-Institut für Informatik, 1997, 12 S. - (Research Report ; MPI-I-97-2-
004)
 
Chaudhuri, Shiva
- u.a.: The Complexity of Parallel Prefix Problems on Small Domains. - In:
Information and Computation. - 138 (1997), S. 1-22
 
- u.a.: Probabilistic recurrence relations revisited. - In: Theoretical
Computer Science. - 181 (1997), S. 45-56
 
Chlebus, Bogdan S.
- u.a.: Deterministic Permutation Routing on Meshes. - In: Journal of
Algorithms. - 22 (1997), S. 111-141
 
- u.a.: Routing on the PADAM: Degrees of Optimality. - In: Proc. 3rd Int.
Euro-Par Conf. on Parallel Processing (Euro-Par-97) / Ed.: Lengauer, Christian
.. - Berlin : Springer, 1997, S. 272-279. - (Lect. Notes Comput. Sci. ; 1300)
 
Christof, Thomas
- u.a.: A branch-and-cut approach to physical mapping with end-probes. - In:
Proc. 1st Annual Int. Conf. on Computational Molecular Biology (RECOMB-97). -
New York : ACM Press, 1997, S. 84-92
 
Crauser, Andreas
- u.a.: Kürzeste-Wege-Berechnung bei sehr großen Datenmengen. - In:
Promotion tut not: Innovationsmotor "Graduiertenkolleg" / Hrsg.: Spaniol,
Otto. - Aachen : Augustinus, 1997, S. 113-132. - (Aachener Beiträge zur
Informatik ; 21)
 
Czumaj, Artur
- u.a.: The Architecture of a Software Library for String Processing. - In:
Proc. Workshop on Algorithm Engineering (WAE-97) / Ed.: Italiano, Giuseppe .. -
Venice : Università Ca' Foscari di Venezia, 1997, S. 166-176
 
- u.a.: Routing on the PADAM: Degrees of Optimality. - In: Proc. 3rd Int.
Euro-Par Conf. on Parallel Processing (Euro-Par-97) / Ed.: Lengauer, Christian
.. - Berlin : Springer, 1997, S. 272-279. - (Lect. Notes Comput. Sci. ; 1300)
 
Eisenbrand, Friedrich
- u.a.: On the Chvßtal Rank of Polytopes in the 0/1 Cube. - Saarbrücken :
Max-Planck-Institut für Informatik, 1997, 12 S. - (Research Report ; MPI-I-97-
2-009)
 
Ferragina, Paolo
- u.a.: The Architecture of a Software Library for String Processing. - In:
Proc. Workshop on Algorithm Engineering (WAE-97) / Ed.: Italiano, Giuseppe .. -
Venice : Università Ca' Foscari di Venezia, 1997, S. 166-176
 
Finkler, Ulrich
- u.a.: Runtime Prediction of Real Programs on Real Machines. - In: Proc.
8th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA-97). - New
York/Philadelphia : ACM Press/SIAM Publications, 1997, S. 380-389
 
Fleischer, Rudolf
- u.a.: Episode matching. - In: Proc. 8th Symp. on Combinatorial Pattern
Matching (CPM-97) / Ed.: Apostolico, Alberto .. - Berlin : Springer, 1997, S.
12-27. - (Lect. Notes Comput. Sci. ; 1264)
 
- u.a.: More efficient parallel totally monotone matrix searching. - In:
Journal of Algorithms. - 23 (1997), S. 386-400
 
- On the Bahncard Problem. - Saarbrücken : Max-Planck-Institut für
Informatik, 1997, 16 S. - (Research Report ; MPI-I-97-1-018)
 
- u.a.: A Strong and Easily Computable Separation Bound for Arithmetic
Expressions Involving Square Roots. - In: Proc. 8th Annual ACM-SIAM Symp. on
Discrete Algorithms (SODA-97). - New York/Philadelphia : ACM Press/SIAM
Publications, 1997, S. 702-709
 
Ganzinger, Harald
- u.a.: Elimination of Equality via Transformation with Ordering
Constraints. - Saarbrücken : Max-Planck-Institut für Informatik, 1997, 18 S. -
(Research Report ; MPI-I-97-2-012)
 
- u.a.: Soft Typing for Ordered Resolution. - In: Proc. 14th Int. Conf. on
Automated Deduction (CADE-14) / Ed.: McCune, William. - Berlin : Springer,
1997, S. 321-335. - (Lect. Notes Comput. Sci. ; 1249)
 
- u.a.: Strict Basic Superposition and Chaining. - Saarbrücken : Max-Planck-
Institut für Informatik, 1997, 22 S. - (Research Report ; MPI-I-97-2-011)
 
- u.a.: A Theory of Resolution. - Saarbrücken : Max-Planck-Institut für
Informatik, 1997, 79 S. - (Research Report ; MPI-I-97-2-005)
 
Garg, Naveen
- Approximating Sparsest Cuts. - Saarbrücken : Max-Planck-Institut für
Informatik, 1997, 9 S. - (Research Report ; MPI-I-97-1-002)
 
- u.a.: Evaluating a 2-approximation algorithm for edge-separators in planar
graphs. - Saarbrücken : Max-Planck-Institut für Informatik, 1997, 9 S. -
(Research Report ; MPI-I-97-1-010)
 
- u.a.: Faster and Simpler Algorithms for Multicommodity Flow and other
Fractional Packing Problems. - Saarbrücken : Max-Planck-Institut für
Informatik, 1997, 13 S. - (Research Report ; MPI-I-97-1-025)
 
- u.a.: Minimizing Stall Time in Single and Parallel Disk Systems. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 16 S. - (Research
Report ; MPI-I-97-1-024)
 
- u.a.: A polylogarithmic approximation algorithm for group Steiner tree
problem. - Saarbrücken : Max-Planck-Institut für Informatik, 1997, 7 S. -
(Research Report ; MPI-I-97-1-027)
 
Gasieniec, Leszek
- u.a.: The Architecture of a Software Library for String Processing. - In:
Proc. Workshop on Algorithm Engineering (WAE-97) / Ed.: Italiano, Giuseppe .. -
Venice : Università Ca' Foscari di Venezia, 1997, S. 166-176
 
- u.a.: Broadcasting with a bounded fraction of faulty nodes. - In: Journal
of Parallel and Distributed Computing. - 42 (1997), S. 11-20
 
- u.a.: Constant-time Randomized Parallel String Matching. - In: SIAM
Journal on Computing. - 26 (1997), S. 950-960
 
- u.a.: Efficient Parallel Computing with Memory Faults. - In: Proc. 11th
Symp. on Fundamentals of Computation Theory (FCT-97) / Ed.: Chlebus, Bogdan S.
.. - Berlin : Springer, 1997, S. 188-197. - (Lect. Notes Comput. Sci. ; 1279)
 
- u.a.: Episode matching. - In: Proc. 8th Symp. on Combinatorial Pattern
Matching (CPM-97) / Ed.: Apostolico, Alberto .. - Berlin : Springer, 1997, S.
12-27. - (Lect. Notes Comput. Sci. ; 1264)
 
- u.a.: External inverse pattern matching. - In: Proc. 8th Symp. on
Combinatorial Pattern Matching (CPM-97) / Ed.: Apostolico, Alberto .. - Berlin
: Springer, 1997, S. 90-101. - (Lect. Notes Comput. Sci. ; 1264)
 
- u.a.: On the complexity of computing evolutionary trees. - In: Proc. 3rd
Int. Conf. on Computing and Combinatorics (COCOON-97) / Ed.: Jiang, Tao .. -
Berlin : Springer, 1997, S. 134-145. - (Lect. Notes Comput. Sci. ; 1276)
 
Gunopulos, Dimitrios
- u.a.: Discovering all most specific sentences by randomized algorithms. -
In: Proc. 6th Int. Conf. on Database Theory (ICDT-97) / Ed.: Afrati, Foto .. -
Berlin : Springer, 1997, S. 215-229. - (Lect. Notes Comput. Sci. ; 1186)
 
- u.a.: Episode matching. - In: Proc. 8th Symp. on Combinatorial Pattern
Matching (CPM-97) / Ed.: Apostolico, Alberto .. - Berlin : Springer, 1997, S.
12-27. - (Lect. Notes Comput. Sci. ; 1264)
 
Gupta, Arvind
- u.a.: Using amplification to compute majority with small majority gates. -
In: Computational Complexity. - 6 (1997), S. 46-63
 
Gupta, Prosenjit
- u.a.: The rectangle enclosure and point-dominance problems revisited. -
In: International Journal of Computational Geometry and Applications. - 7
(1997), S. 437-456
 
Gutwenger, Carsten
- u.a.: AGD-Library: A Library of Algorithms for Graph Drawing. - In: Proc.
Workshop on Algorithm Engineering (WAE-97) / Ed.: Italiano, Giuseppe .. -
Venice : Universitá Ca' Foscari di Venezia, 1997, S. 112-123
 
Hagerup, Torben
- Allocating Independent Tasks to Parallel Processors: An Experimental
Study. - In: Journal of Parallel and Distributed Computing. - 47 (1997), S.
185-197
 
- Datenstrukturen und Algorithmen. - Saarbrücken : Max-Planck-Institut für
Informatik, 1997, 223 S. - (Research Report ; MPI-I-97-1-013)
 
- Dynamic algorithms for graphs of bounded treewidth. - In: Proc. 24th Int.
Colloquium on Automata, Languages, and Programming (ICALP-97) / Ed.: Degano,
Pierpaolo .. - Berlin : Springer, 1997, S. 292-302. - (Lect. Notes Comput.
Sci. ; 1256)
 
- u.a.: Fast integer merging on the EREW PRAM. - In: Algorithmica. - 17
(1997), S. 55-66
 
- u.a.: Improved Parallel Integer Sorting without Concurrent Writing. - In:
Information and Computation. - 136 (1997), S. 25-51
 
- u.a.: A reliable randomized algorithm for the closest-pair problem. - In:
Journal of Algorithms. - 25 (1997), S. 19-51
 
Henzinger, Monika R.
- u.a.: Exploring Unknown Environments. - Saarbrücken : Max-Planck-Institut
für Informatik, 1997, 23 S. - (Research Report ; MPI-I-97-1-017)
 
Hopf, Jörn
- Cooperative Coevolution of Fuzzy Rules. - In: Proc. 2nd Int. ICSC Symp. on
Fuzzy Logic and Applications (ISFL-97) / Ed.: Steele, N. - Millet : ICSC
Academic Press, 1997, S. 337-381
 
Hundack, Christoph
- u.a.: ArchE: A Graph Drawing System for Archaeology. - In: Proc. 5th Symp.
on Graph Drawing (GD-97) / Ed.: Di Battista, Giuseppe. - Berlin : Springer,
1997, S. 297-302. - (Lect. Notes Comput. Sci. ; 1353)
 
Hustadt, Ullrich
- u.a.: On Evaluating Decision Procedures for Modal Logics. - In: Proc.
Fifteenth Int. Joint Conf. on Artificial Intelligence (IJCAI-97) / Ed.:
Pollack, Martha E. - San Francisco : Morgan Kaufmann, 1997, S. 202-207
 
- u.a.: On evaluating decision procedures for modal logic. - Saarbrücken :
Max-Planck-Institut für Informatik, 1997, 50 S. - (Research Report ; MPI-I-97-
2-003)
 
Indyk, Piotr
- u.a.: External inverse pattern matching. - In: Proc. 8th Symp. on
Combinatorial Pattern Matching (CPM-97) / Ed.: Apostolico, Alberto .. - Berlin
: Springer, 1997, S. 90-101. - (Lect. Notes Comput. Sci. ; 1264)
 
Jaeger, Manfred
- Relational Bayesian Networks. - In: Proc. 13th Conf. of Uncertainty in
Artificial Intelligence (UAI-13) / Ed.: Geiger, Dan .. - San Francisco :
Morgan Kaufmann, 1997, S. 266-273
 
Jung, Bernd
- u.a.: Parallel Algorithms for MD-Simulations of Synthetic Polymers. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 32 S. - (Research
Report ; MPI-I-97-1-003)
 
Kärkkäinen, Juha
- u.a.: Episode matching. - In: Proc. 8th Symp. on Combinatorial Pattern
Matching (CPM-97) / Ed.: Apostolico, Alberto .. - Berlin : Springer, 1997, S.
12-27. - (Lect. Notes Comput. Sci. ; 1264)
 
Kasper, Thomas
- u.a.: A Unifying Framework for Integer and Finite Domain Constraint
Programming. - Saarbrücken : Max-Planck-Institut für Informatik, 1997, 24 S. -
(Research Report ; MPI-I-97-2-008)
 
Kaufmann, Michael
- u.a.: Deterministic Permutation Routing on Meshes. - In: Journal of
Algorithms. - 22 (1997), S. 111-141
 
Kececioglu, John
- u.a.: A Branch-And-Cut algorithm for multiple sequence alignment. - In:
Proc. 1st Annual Int. Conf. on Computational Molecular Biology (RECOMB-97). -
New York : ACM Press, 1997, S. 241-250
 
- u.a.: A branch-and-cut approach to physical mapping with end-probes. - In:
Proc. 1st Annual Int. Conf. on Computational Molecular Biology (RECOMB-97). -
New York : ACM Press, 1997, S. 84-92
 
Keßler, Christoph W.
- u.a.: Language and library support for practical PRAM programming. - In:
Proc. 5th Euromicro Workshop on Parallel and Distributed Processing (PDP-97). -
Los Alamitos : IEEE Comput. Soc. Press, 1997, S. 216-221
 
Khachiyan, Leonid
- u.a.: Computing Integral Points in Convex Semi-algebraic Sets. - In: Proc.
38th Annual Symp. on Foundations of Computer Science (FOCS-97). - Los Alamitos
: IEEE Comput. Soc. Press, 1997, S. 162-171
 
Könemann, Jochen
- u.a.: Faster and Simpler Algorithms for Multicommodity Flow and other
Fractional Packing Problems. - Saarbrücken : Max-Planck-Institut für
Informatik, 1997, 13 S. - (Research Report ; MPI-I-97-1-025)
 
Krysta, Piotr
- u.a.: External inverse pattern matching. - In: Proc. 8th Symp. on
Combinatorial Pattern Matching (CPM-97) / Ed.: Apostolico, Alberto .. - Berlin
: Springer, 1997, S. 90-101. - (Lect. Notes Comput. Sci. ; 1264)
 
Lee, E. K.
- u.a.: A Polyhedral Approach to the Multi-Layer Crossing Minimization
Problem. - In: Proc. 5th Symp. on Graph Drawing (GD-97) / Ed.: Di Battista,
Giuseppe. - Berlin : Springer, 1997, S. 13-24. - (Lect. Notes Comput. Sci. ;
1353)
 
Lenhof, Hans-Peter
- u.a.: A Branch-And-Cut algorithm for multiple sequence alignment. - In:
Proc. 1st Annual Int. Conf. on Computational Molecular Biology (RECOMB-97). -
New York : ACM Press, 1997, S. 241-250
 
- u.a.: Computational Molecular Biology. - In: Annotated Bibliographies in
Combinatorial Optimization / Ed.: Dell'Amico, M. .. - New York : Wiley, 1997,
S. 445-471
 
- u.a.: Langevin dynamics simulations of macromolecules on parallel
computers. - In: Macromolecular Theory and Simulation. - 6 (1997), S. 507-521
 
- New contact measures for the protein docking problem. - In: Proc. 1st
Annual Int. Conf. on Computational Molecular Biology (RECOMB-97). - New York :
ACM Press, 1997, S. 182-191
 
- New Contact Measures for the Protein Docking Problem. - Saarbrücken : Max-
Planck-Institut für Informatik, 1997, 10 S. - (Research Report ; MPI-I-97-1-
004)
 
- u.a.: Parallel Algorithms for MD-Simulations of Synthetic Polymers. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 32 S. - (Research
Report ; MPI-I-97-1-003)
 
- u.a.: Parallel MD-simulations of synthetic polymers. - In: Proc. 8th SIAM
Conf. on Parallel Processing for Scientific Computing (PPSC-97). -
Philadelphia : SIAM Publications, 1997, CD-ROM
 
- Parallel Protein Puzzle: A New Suite of Protein Docking Tools. - In:
Forschung und wissenschaftliches Rechnen: Beiträge zum Heinz-Billing-Preis
1996 / Hrsg.: Plesser, Theo .. - Göttingen : Gesellschaft für
wissenschaftliche Datenverarbeitung mbH, 1997, S. 31-48
 
Leonardi, Stefano
- u.a.: Minimizing Stall Time in Single and Parallel Disk Systems. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 16 S. - (Research
Report ; MPI-I-97-1-024)
 
- u.a.: On-line Network Routing - A Survey. - Saarbrücken : Max-Planck-
Institut für Informatik, 1997, 19 S. - (Research Report ; MPI-I-97-1-026)
 
- u.a. (Hrsg.): Randomized on-line call control revisited. - Saarbrücken :
Max-Planck-Institut für Informatik, 1997, 19 S. - (Research Report ; MPI-I-97-
1-023)
 
Mahajan, Sanjeev
- u.a.: The Cost of Derandomization: Computability or Competitiveness. - In:
SIAM Journal on Computing. - 26 (1997), S. 786-802
 
- u.a.: Solving some discrepancy problems in NC. - In: Proc. 17th Conf. on
Foundations of Software Technology and Theoretical Computer Science (FSTTCS-
97) / Ed.: Ramesh, S. .. - Berlin : Springer, 1997, S. 22-36. - (Lect. Notes
Comput. Sci. ; 1346)
 
Maheshwari, Anil
- u.a.: Efficient Computation of implicit representations of sparse graphs. -
In: Discrete Applied Mathematics. - 78 (1997), S. 1-16
 
Mannila, Heikki
- u.a.: Discovering all most specific sentences by randomized algorithms. -
In: Proc. 6th Int. Conf. on Database Theory (ICDT-97) / Ed.: Afrati, Foto .. -
Berlin : Springer, 1997, S. 215-229. - (Lect. Notes Comput. Sci. ; 1186)
 
Manss, Christian
- u.a.: Evaluating a 2-approximation algorithm for edge-separators in planar
graphs. - Saarbrücken : Max-Planck-Institut für Informatik, 1997, 9 S. -
(Research Report ; MPI-I-97-1-010)
 
Marchetti-Spaccamela, Alberto
- u.a. (Hrsg.): Randomized on-line call control revisited. - Saarbrücken :
Max-Planck-Institut für Informatik, 1997, 19 S. - (Research Report ; MPI-I-97-
1-023)
 
Matthews, Seßn
- Extending a logical framework with a modal connective for validity. - In:
Proc. 3rd Symp. on Theoretical Aspects of Computer Software (TACS-97) / Ed.:
Abadi, Martín .. - Berlin : Springer, 1997, S. 491-514. - (Lect. Notes Comput.
Sci. ; 1281)
 
- u.a.: Labelled modal logics: quantifiers. - Saarbrücken : Max-Planck-
Institut für Informatik, 1997, 31 S. - (Research Report ; MPI-I-97-2-001)
 
- u.a.: Labelled Propositional Modal Logics: Theory and Practice. - In:
Journal of Logic and Computation. - 7 (1997), S. 685-717
 
- u.a.: Labelled quantified modal logics. - In: Proc. 21st Annual German
Conf. on Artificial Intelligence (KI-97): Advances in Artificial Intelligence
/ Ed.: Brewka, Gerhard .. - Berlin : Springer, 1997, S. 171-182. - (Lect.
Notes Artif. Intell. ; 1303)
 
- u.a.: A New Method for Bounding the Complexity of Modal Logics. - In:
Proc. 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory (KGC-
97) / Ed.: Gottlob, G. .. - Berlin : Springer, 1997, S. 89-102. - (Lect.
Notes Comput. Sci. ; 1289)
 
- A practical implementation of simple consequence relations using inductive
definitions. - In: Proc. 14th Int. Conf. on Automated Deduction (CADE-14) /
Ed.: McCune, William. - Berlin : Springer, 1997, S. 306-320. - (Lect. Notes
Artif. Intell. ; 1249)
 
Mavronicolas, Marion
- u.a.: The impact of timing on linearizability in counting networks. - In:
Proc. 11th Int. Parallel Processing Symp. (IPPS-97) / Ed.: Feitelson, Dror G.
.. - Los Alamitos : IEEE Comput. Soc. Press, 1997, S. 684-688
 
Mehlhorn, Kurt
- u.a.: Average-case complexity of shortest-paths problems in the vertex-
potential model. - In: Proc. Int. Workshop on Randomization and Approximation
Techniques in Computer Science (RANDOM-97) / Ed.: Rolim, José. - Berlin :
Springer, 1997, S. 15-26. - (Lect. Notes Comput. Sci. ; 1269)
 
- u.a.: A Branch-And-Cut algorithm for multiple sequence alignment. - In:
Proc. 1st Annual Int. Conf. on Computational Molecular Biology (RECOMB-97). -
New York : ACM Press, 1997, S. 241-250
 
- u.a.: A complete roundness classification procedure. - In: Proc. 13th Int.
Annual Symp. on Computational Geometry (SCG-97). - New York : ACM Press, 1997,
S. 129-138
 
- u.a.: A Computational Basis for Higher-dimensional Computational Geometry
and Applications. - In: Proc. 13th Int. Annual Symp. on Computational Geometry
(SCG-97). - New York : ACM Press, 1997, S. 254-263
 
- u.a.: Kürzeste-Wege-Berechnung bei sehr großen Datenmengen. - In:
Promotion tut not: Innovationsmotor "Graduiertenkolleg" / Hrsg.: Spaniol,
Otto. - Aachen : Augustinus, 1997, S. 113-132. - (Aachener Beiträge zur
Informatik ; 21)
 
- u.a.: The LEDA platform for combinatorial and geometric computing. - In:
Proc. 24th Int. Colloquium on Automata, Languages, and Programming (ICALP-97)
/ Ed.: Degano, Pierpaolo .. - Berlin : Springer, 1997, S. 7-16. - (Lect. Notes
Comput. Sci. ; 1256)
 
- u.a.: Maintaining Dynamic Sequences under Equality Tests in
Polylogarithmic Time. - In: Algorithmica. - 17 (1997), S. 183-198
 
- u.a.: Maximum Network Flow with Floating Point Arithmetic. - Saarbrücken :
Max-Planck-Institut für Informatik, 1997, 5 S. - (Research Report ; MPI-I-97-1-
022)
 
- u.a.: On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka. -
In: Random Structures Algorithms. - 10 (1997), S. 205-220
 
- u.a.: Runtime Prediction of Real Programs on Real Machines. - In: Proc.
8th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA-97). - New
York/Philadelphia : ACM Press/SIAM Publications, 1997, S. 380-389
 
- u.a.: A Strong and Easily Computable Separation Bound for Arithmetic
Expressions Involving Square Roots. - In: Proc. 8th Annual ACM-SIAM Symp. on
Discrete Algorithms (SODA-97). - New York/Philadelphia : ACM Press/SIAM
Publications, 1997, S. 702-709
 
Meyer, Christoph
- u.a.: Soft Typing for Ordered Resolution. - In: Proc. 14th Int. Conf. on
Automated Deduction (CADE-14) / Ed.: McCune, William. - Berlin : Springer,
1997, S. 321-335. - (Lect. Notes Comput. Sci. ; 1249)
 
Meyer, Ulrich
- u.a.: Kürzeste-Wege-Berechnung bei sehr großen Datenmengen. - In:
Promotion tut not: Innovationsmotor "Graduiertenkolleg" / Hrsg.: Spaniol,
Otto. - Aachen : Augustinus, 1997, S. 113-132. - (Aachener Beiträge zur
Informatik ; 21)
 
- u.a.: Matrix Transpose on Meshes: Theory and Practice. - In: Computers and
Artificial Intelligence. - 16 (1997), S. 107-140
 
- u.a.: Matrix Transpose on Meshes: Theory and Practice. - In: Proc. 11th
Int. Parallel Processing Symp. (IPPS-97) / Ed.: Feitelson, Dror G. .. - Los
Alamitos : IEEE Comput. Soc. Press, 1997, S. 315-319
 
Miller, Tobias
- u.a.: A First Experimental Study of a Dynamic Transitive Closure
Algorithm. - In: Proc. Workshop on Algorithm Engineering (WAE-97) / Ed.:
Italiano, Giuseppe .. - Venice : Università Ca' Foscari di Venezia, 1997, S.
64-73
 
Müller, Michael
- u.a.: A Computational Basis for Higher-dimensional Computational Geometry
and Applications. - In: Proc. 13th Int. Annual Symp. on Computational Geometry
(SCG-97). - New York : ACM Press, 1997, S. 254-263
 
Müller, Peter
- u.a.: Langevin dynamics simulations of macromolecules on parallel
computers. - In: Macromolecular Theory and Simulation. - 6 (1997), S. 507-521
 
- u.a.: Parallel Algorithms for MD-Simulations of Synthetic Polymers. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 32 S. - (Research
Report ; MPI-I-97-1-003)
 
- u.a.: Parallel MD-simulations of synthetic polymers. - In: Proc. 8th SIAM
Conf. on Parallel Processing for Scientific Computing (PPSC-97). -
Philadelphia : SIAM Publications, 1997, CD-ROM
 
Mutzel, Petra
- u.a.: 2-Layer Straightline Crossing Minimization: Performance of Exact and
Heuristic Algorithms. - In: Journal of Graph Algorithms and Applications. - 1
(1997), S. 1-25
 
- u.a.: AGD-Library: A Library of Algorithms for Graph Drawing. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 13 S. - (Research
Report ; MPI-I-97-1-019)
 
- u.a.: AGD-Library: A Library of Algorithms for Graph Drawing. - In: Proc.
Workshop on Algorithm Engineering (WAE-97) / Ed.: Italiano, Giuseppe .. -
Venice : Universitá Ca' Foscari di Venezia, 1997, S. 112-123
 
- u.a.: Algorithmen zum automatischen Zeichnen von Graphen. - In: Informatik
Spektrum. - 20 (1997), S. 199-207
 
- u.a.: Algorithmen zum automatischen Zeichnen von Graphen. - Saarbrücken :
Max-Planck-Institut für Informatik, 1997, 9 S. - (Research Report ; MPI-I-97-1-
007)
 
- An alternative method to crossing minimization on hierarchical graphs. -
In: Proc. 4th Symp. on Graph Drawing (GD-96) / Ed.: North, Stephen. - Berlin :
Springer, 1997, S. 318-333. - (Lect. Notes Comput. Sci. ; 1190)
 
- An Alternative Method to Crossing Minimization on Hierarchical Graphs. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 15 S. - (Research
Report ; MPI-I-97-1-008)
 
- u.a.: ArchE: A Graph Drawing System for Archaeology. - In: Proc. 5th Symp.
on Graph Drawing (GD-97) / Ed.: Di Battista, Giuseppe. - Berlin : Springer,
1997, S. 297-302. - (Lect. Notes Comput. Sci. ; 1353)
 
- u.a.: A Branch-And-Cut algorithm for multiple sequence alignment. - In:
Proc. 1st Annual Int. Conf. on Computational Molecular Biology (RECOMB-97). -
New York : ACM Press, 1997, S. 241-250
 
- u.a.: A Branch-And-Cut Approach to Physical Mapping of Chromosomes by
Unique End-Probes. - In: Journal of Computational Biology. - 4 (1997), S. 433-
447
 
- u.a.: A branch-and-cut approach to physical mapping with end-probes. - In:
Proc. 1st Annual Int. Conf. on Computational Molecular Biology (RECOMB-97). -
New York : ACM Press, 1997, S. 84-92
 
- u.a.: Computational Molecular Biology. - In: Annotated Bibliographies in
Combinatorial Optimization / Ed.: Dell'Amico, M. .. - New York : Wiley, 1997,
S. 445-471
 
- u.a.: Pitfalls of using PQ--Trees in automatic graph drawing. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 12 S. - (Research
Report ; MPI-I-97-1-015)
 
- u.a.: Pitfalls of using PQ-Trees in Automatic graph Drawing. - In: Proc.
5th Symp. on Graph Drawing (GD-97) / Ed.: Di Battista, Giuseppe. - Berlin :
Springer, 1997, S. 193-204. - (Lect. Notes Comput. Sci. ; 1353)
 
- u.a.: A Polyhedral Approach to the Multi-Layer Crossing Minimization
Problem. - In: Proc. 5th Symp. on Graph Drawing (GD-97) / Ed.: Di Battista,
Giuseppe. - Berlin : Springer, 1997, S. 13-24. - (Lect. Notes Comput. Sci. ;
1353)
 
- u.a.: SPP 731 : Algorithmen zum automatischen Zeichnen von Graphen im
Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen für diskrete Probleme und
ihre Anwendungen". - In: Informatik '97 : Informatik als Innovationsmotor :
27. Jahrestagung der Gesellschaft für Informatik / Hrsg.: Jarke, Matthias .. -
Berlin : Springer, 1997, S. 58-67
 
Näher, Stefan
- u.a.: AGD-Library: A Library of Algorithms for Graph Drawing. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 13 S. - (Research
Report ; MPI-I-97-1-019)
 
- u.a.: A Computational Basis for Higher-dimensional Computational Geometry
and Applications. - In: Proc. 13th Int. Annual Symp. on Computational Geometry
(SCG-97). - New York : ACM Press, 1997, S. 254-263
 
- u.a.: The LEDA platform for combinatorial and geometric computing. - In:
Proc. 24th Int. Colloquium on Automata, Languages, and Programming (ICALP-97)
/ Ed.: Degano, Pierpaolo .. - Berlin : Springer, 1997, S. 7-16. - (Lect. Notes
Comput. Sci. ; 1256)
 
Nonnengart, Andreas
- u.a. (Hrsg.): Qualitative and Quantitative Practical Reasoning. - Berlin :
Springer, 1997, 602 S. - (Lect. Notes Artif. Intell., LNAI ; 1244)
 
Ohlbach, Hans Jürgen
- u.a.: Functional Translation and Second-Order Frame Properties of Modal
Logics. - In: Journal of Logic and Computation. - 7 (1997), S. 581-603
 
- u.a. (Hrsg.): Qualitative and Quantitative Practical Reasoning. - Berlin :
Springer, 1997, 602 S. - (Lect. Notes Artif. Intell., LNAI ; 1244)
 
Papatriantafilou, Marina
- u.a.: The impact of timing on linearizability in counting networks. - In:
Proc. 11th Int. Parallel Processing Symp. (IPPS-97) / Ed.: Feitelson, Dror G.
.. - Los Alamitos : IEEE Comput. Soc. Press, 1997, S. 684-688
 
- u.a.: Self-Stabilizing Wait-Free Clock Synchronization. - In: Parallel
Processing Letters. - 7 (1997), S. 321-328
 
Podelski, Andreas
- u.a.: Inclusion Constraints over Non-Empty Sets of Trees. - In: Theory and
Practice of Software Development, International Joint Conference
CAAP/FASE/TOOLS / Ed.: Dauchet, Max. - Springer-Verlag, 1997, S. 345-356. -
(Lecture Notes in Computer Science ; 1214)
 
- u.a.: Inclusion Constraints over Non-empty Sets of Trees. - In: Proc. 7th
Int. Joint Conf. CAAP/FASE: Theory and practice of software development
(TAPSOFT-97) / Ed.: Bidoit, Michel .. - Berlin : Springer, 1997, S. 345-356. -
(Lect. Notes Comput. Sci. ; 1214)
 
- u.a.: Minimal Ascending and Descending Tree Automata. - In: SIAM Journal
on Computing. - 26 (1997), S. 39-58
 
- u.a.: Ordering Constraints over Feature Trees. - In: Proceedings of the
Third International Conference on Principles and Practice of Constraint
Programming / Ed.: Smolka, Gert. - Springer-Verlag, 1997, S. 297-311. -
(Lecture Notes in Computer Science ; 1330)
 
- u.a.: Ordering Constraints over Feature Trees. - In: Proc. Third Int.
Conf. on Principles and Practice of Constraint Programming (CP-97) / Ed.:
Smolka, Gert. - Berlin : Springer, 1997, S. 549-562. - (Lect. Notes Comput.
Sci. ; 1330)
 
- u.a.: Set Constraints with Intersection. - In: Proc. Twelfth Annual IEEE
Symp. on Logic in Computer Science (LICS-97) / Ed.: Winskel, Glynn. - New York
: IEEE Comput. Soc. Press, 1997, S. 362-375
 
- u.a.: Set Constraints: a Pearl in Research on Constraints. - In: Proc.
Third Int. Conf. on Principles and Practice of Constraint Programming (CP-97)
/ Ed.: Smolka, Gert. - Berlin : Springer, 1997, S. 549-562. - (Lect. Notes
Comput. Sci. ; 1330)
 
- Set-Based Analysis of Logic Programs and Reactive Logic Programs. - In:
Proc. Int. Symp. on Logic Programming (ILPS-14) / Ed.: Maluszynski, Jan. -
Cambridge : MIT Press, 1997, S. 35-36
 
- u.a.: Situated Simplification. - In: Theoretical Computer Science. - 173
(1997), S. 209-233
 
- u.a.: Situated Simplification. - In: Theoretical Computer Science. - 173
(1997), S. 235-252
 
- u.a.: Solving set constraints for greatest models. - Saarbrücken : Max-
Planck-Institut für Informatik, 1997, 12 S. - (Research Report ; MPI-I-97-2-
004)
 
Porkolab, Lorant
- u.a.: Computing Integral Points in Convex Semi-algebraic Sets. - In: Proc.
38th Annual Symp. on Foundations of Computer Science (FOCS-97). - Los Alamitos
: IEEE Comput. Soc. Press, 1997, S. 162-171
 
Presciutti, Alessio
- u.a. (Hrsg.): Randomized on-line call control revisited. - Saarbrücken :
Max-Planck-Institut für Informatik, 1997, 19 S. - (Research Report ; MPI-I-97-
1-023)
 
Priebe, Volker
- u.a.: Average-case complexity of shortest-paths problems in the vertex-
potential model. - In: Proc. Int. Workshop on Randomization and Approximation
Techniques in Computer Science (RANDOM-97) / Ed.: Rolim, José. - Berlin :
Springer, 1997, S. 15-26. - (Lect. Notes Comput. Sci. ; 1269)
 
- u.a.: On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka. -
In: Random Structures Algorithms. - 10 (1997), S. 205-220
 
Ramos, Edgar A.
- u.a.: Bounded-independence derandomization of geometric partitioning with
applications to parallel fixed-dimensional linear programming. - In: Discrete
and Computational Geometry. - 18 (1997), S. 397-420
 
- Construction of 1-d lower envelopes and applications. - In: Proc. 13th
Int. Annual Symp. on Computational Geometry (SCG-97). - New York : ACM Press,
1997, S. 57-66
 
- u.a.: Efficient approximation and optimization algorithms for
computational metrology. - In: Proc. 8th Annual ACM-SIAM Symp. on Discrete
Algorithms (SODA-97). - New York/Philadelphia : ACM Press/SIAM Publications,
1997, S. 121-130
 
- u.a.: Inclusion-exclusion complexes for pseudo-disk collections. - In:
Discrete and Computational Geometry. - 17 (1997), S. 287-306
 
- Intersection of unit-balls and diameter of a point set in R³. - In:
Computational Geometry Theory and Applications. - 8 (1997), S. 57-65
 
- u.a.: Solving some discrepancy problems in NC. - In: Proc. 17th Conf. on
Foundations of Software Technology and Theoretical Computer Science (FSTTCS-
97) / Ed.: Ramesh, S. .. - Berlin : Springer, 1997, S. 22-36. - (Lect. Notes
Comput. Sci. ; 1346)
 
Reinert, Knut
- u.a.: A Branch-And-Cut algorithm for multiple sequence alignment. - In:
Proc. 1st Annual Int. Conf. on Computational Molecular Biology (RECOMB-97). -
New York : ACM Press, 1997, S. 241-250
 
Roséen, Adi
- u.a. (Hrsg.): Randomized on-line call control revisited. - Saarbrücken :
Max-Planck-Institut für Informatik, 1997, 19 S. - (Research Report ; MPI-I-97-
1-023)
 
Rüb, Christine
- u.a.: Langevin dynamics simulations of macromolecules on parallel
computers. - In: Macromolecular Theory and Simulation. - 6 (1997), S. 507-521
 
- On Batcher's Merge Sorts as Parallel Sorting Algorithms. - Saarbrücken :
Max-Planck-Institut für Informatik, 1997, 23 S. - (Research Report ; MPI-I-97-
1-012)
 
- On the average running time of odd-even merge sort. - In: Journal of
Algorithms. - 22 (1997), S. 329-346
 
- u.a.: Parallel Algorithms for MD-Simulations of Synthetic Polymers. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 32 S. - (Research
Report ; MPI-I-97-1-003)
 
- u.a.: Parallel MD-simulations of synthetic polymers. - In: Proc. 8th SIAM
Conf. on Parallel Processing for Scientific Computing (PPSC-97). -
Philadelphia : SIAM Publications, 1997, CD-ROM
 
Saluja, Sanjeev
- u.a.: Discovering all most specific sentences by randomized algorithms. -
In: Proc. 6th Int. Conf. on Database Theory (ICDT-97) / Ed.: Afrati, Foto .. -
Berlin : Springer, 1997, S. 215-229. - (Lect. Notes Comput. Sci. ; 1186)
 
Schirra, Stefan
- u.a.: A Computational Basis for Higher-dimensional Computational Geometry
and Applications. - In: Proc. 13th Int. Annual Symp. on Computational Geometry
(SCG-97). - New York : ACM Press, 1997, S. 254-263
 
- u.a.: Computing the Minimum Diameter for Moving Points: An Exact
Implementation using Parametric Search. - In: Proc. 13th Int. Annual Symp. on
Computational Geometry (SCG-97). - New York : ACM Press, 1997, S. 466-468
 
- Designing a Computational Geometry Algorithms Library. - Saarbrücken : Max-
Planck-Institut für Informatik, 1997, 8 S. - (Research Report ; MPI-I-97-1-
014)
 
- Precision and Robustness in Geometric Computations. - In: Algorithmic
Foundations of Geographic Information Systems / Ed.: van Kreveld, Marc .. -
Berlin : Springer, 1997, S. 255-287. - (Lect. Notes Comput. Sci. ; 1340)
 
- u.a.: A Strong and Easily Computable Separation Bound for Arithmetic
Expressions Involving Square Roots. - In: Proc. 8th Annual ACM-SIAM Symp. on
Discrete Algorithms (SODA-97). - New York/Philadelphia : ACM Press/SIAM
Publications, 1997, S. 702-709
 
Schmidt, Renate A.
- u.a.: Functional Translation and Second-Order Frame Properties of Modal
Logics. - In: Journal of Logic and Computation. - 7 (1997), S. 581-603
 
- u.a.: On Evaluating Decision Procedures for Modal Logics. - In: Proc.
Fifteenth Int. Joint Conf. on Artificial Intelligence (IJCAI-97) / Ed.:
Pollack, Martha E. - San Francisco : Morgan Kaufmann, 1997, S. 202-207
 
- u.a.: On evaluating decision procedures for modal logic. - Saarbrücken :
Max-Planck-Institut für Informatik, 1997, 50 S. - (Research Report ; MPI-I-97-
2-003)
 
- Resolution is a decision procedure for many propositional modal logics. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 60 S. - (Research
Report ; MPI-I-97-2-002)
 
Seel, Michael
- u.a.: A Computational Basis for Higher-dimensional Computational Geometry
and Applications. - In: Proc. 13th Int. Annual Symp. on Computational Geometry
(SCG-97). - New York : ACM Press, 1997, S. 254-263
 
Sibeyn, Jop F.
- Better Trade-offs for Parallel List Ranking. - In: Proc. 9th Symp. on
Parallel Algorithms and Architectures (SPAA-97). - New York : ACM Press, 1997,
S. 221-230
 
- u.a.: BSP-Like External-Memory Computation. - In: Proc. 3rd Italian Conf.
on Algorithms and Complexity (CIAC-97) / Ed.: Bongiovanni, Giancarlo .. -
Berlin : Springer, 1997, S. 229-240. - (Lect. Notes Comput. Sci. ; 1203)
 
- u.a.: BSP-Like External-Memory Computation. - Saarbrücken : Max-Planck-
Institut für Informatik, 1997, 14 S. - (Research Report ; MPI-I-97-1-001)
 
- u.a.: Deterministic Permutation Routing on Meshes. - In: Journal of
Algorithms. - 22 (1997), S. 111-141
 
- From Parallel to External List Ranking. - Saarbrücken : Max-Planck-
Institut für Informatik, 1997, 15 S. - (Research Report ; MPI-I-97-1-021)
 
- u.a.: Matrix Transpose on Meshes: Theory and Practice. - In: Computers and
Artificial Intelligence. - 16 (1997), S. 107-140
 
- u.a.: Matrix Transpose on Meshes: Theory and Practice. - In: Proc. 11th
Int. Parallel Processing Symp. (IPPS-97) / Ed.: Feitelson, Dror G. .. - Los
Alamitos : IEEE Comput. Soc. Press, 1997, S. 315-319
 
- u.a.: Practical Parallel List Ranking. - In: Proc. 4th Symp. on Solving
Irregularly Structured Problems in Parallel (IRREGULAR-97) / Ed.: Bilardi, G.
.. - Berlin : Springer, 1997, S. 25-36. - (Lect. Notes Comput. Sci. ; 1253)
 
- u.a.: Randomized Multipacket Routing and Sorting on Meshes. - In:
Algorithmica. - 17 (1997), S. 224-244
 
- u.a.: Randomized Multipacket Routing and Sorting on Meshes. - In:
Algorithmica. - 17 (1997), S. 224-244
 
- u.a.: Routing on Meshes with Buses. - In: Algorithmica. - 18 (1997), S.
417-444
 
- u.a.: Routing on the PADAM: Degrees of Optimality. - In: Proc. 3rd Int.
Euro-Par Conf. on Parallel Processing (Euro-Par-97) / Ed.: Lengauer, Christian
.. - Berlin : Springer, 1997, S. 272-279. - (Lect. Notes Comput. Sci. ; 1300)
 
- Routing on Triangles, Tori and Honeycombs. - In: International Journal on
the Foundations of Computer Science. - 8 (1997), S. 269-287
 
- Routing with Finite Speeds of Memory and Network. - In: Proc. 22nd Symp.
on the Mathematical Foundations of Computer Science (MFCS-97) / Ed.: Prívara,
Igor .. - Berlin : Springer, 1997, S. 488-497. - (Lect. Notes Comput. Sci. ;
1295)
 
- Sample Sort on Meshes. - In: Proc. 3rd Int. Euro-Par Conf. on Parallel
Processing (Euro-Par-97) / Ed.: Lengauer, Christian .. - Berlin : Springer,
1997, S. 389-398. - (Lect. Notes Comput. Sci. ; 1300)
 
Smid, Michiel
- u.a.: Computing the largest empty anchored cylinder, and related problems.
- In: International Journal of Computational Geometry and Applications. - 7
(1997), S. 563-580
 
- u.a.: Efficient construction of a bounded degree spanner with low weight. -
In: Algorithmica. - 17 (1997), S. 33-54
 
- u.a.: More efficient parallel totally monotone matrix searching. - In:
Journal of Algorithms. - 23 (1997), S. 386-400
 
- u.a.: The rectangle enclosure and point-dominance problems revisited. -
In: International Journal of Computational Geometry and Applications. - 7
(1997), S. 437-456
 
Struth, Georg
- On the Word Problem for Free Lattices. - In: Proc. 8th Int. Conf. on
Rewriting Techniques and Applications (RTA-97) / Ed.: Comon, Hubert. - Berlin
: Springer, 1997, S. 128-141. - (Lect. Notes Comput. Sci. ; 1103)
 
Stuber, Jürgen
- Strong Symmetrization, Semi-Compatibility of Normalized Rewriting and
First-Order Theorem Proving. - In: Proc. Int. Workshop on First-Order Theorem
Proving (FTP-97) / Ed.: Bonacina, Maria Paola .. - Linz : Johannes Kepler
Universität, 1997, S. 125-129. - (RISC-Linz Report ; 97-50)
 
Subrahmanyam, K.V.
- u.a.: Solving some discrepancy problems in NC. - In: Proc. 17th Conf. on
Foundations of Software Technology and Theoretical Computer Science (FSTTCS-
97) / Ed.: Ramesh, S. .. - Berlin : Springer, 1997, S. 22-36. - (Lect. Notes
Comput. Sci. ; 1346)
 
Thorup, Mikkel
- Faster deterministic sorting and priority queues in linear space. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 9 S. - (Research
Report ; MPI-I-97-1-016)
 
Träff, Jesper L.
- u.a.: A parallel priority queue with constant time operations. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 19 S. - (Research
Report ; MPI-I-97-1-011)
 
Träff, Jesper Larsson
- u.a.: The Architecture of a Software Library for String Processing. - In:
Proc. Workshop on Algorithm Engineering (WAE-97) / Ed.: Italiano, Giuseppe .. -
Venice : Università Ca' Foscari di Venezia, 1997, S. 166-176
 
- u.a.: Language and library support for practical PRAM programming. - In:
Proc. 5th Euromicro Workshop on Parallel and Distributed Processing (PDP-97). -
Los Alamitos : IEEE Comput. Soc. Press, 1997, S. 216-221
 
- u.a.: A meticulous analysis of mergesort programs. - In: Proc. 3rd Italian
Conf. on Algorithms and Complexity (CIAC-97) / Ed.: Bongiovanni, Giancarlo .. -
Berlin : Springer, 1997, S. 217-228. - (Lect. Notes Comput. Sci. ; 1203)
 
- u.a.: A parallel priority data structure with applications. - In: Proc.
11th Int. Parallel Processing Symp. (IPPS-97) / Ed.: Feitelson, Dror G. .. -
Los Alamitos : IEEE Comput. Soc. Press, 1997, S. 689-693
 
Tsigas, Philippas
- u.a.: The impact of timing on linearizability in counting networks. - In:
Proc. 11th Int. Parallel Processing Symp. (IPPS-97) / Ed.: Feitelson, Dror G.
.. - Los Alamitos : IEEE Comput. Soc. Press, 1997, S. 684-688
 
- u.a.: Self-Stabilizing Wait-Free Clock Synchronization. - In: Parallel
Processing Letters. - 7 (1997), S. 321-328
 
Tzakova, Miroslava
- u.a.: Two Hybrid Logics. - Saarbrücken : Max-Planck-Institut für
Informatik, 1997, 33 S. - (Research Report ; MPI-I-97-2-007)
 
Uhrig, Christian
- u.a.: A Computational Basis for Higher-dimensional Computational Geometry
and Applications. - In: Proc. 13th Int. Annual Symp. on Computational Geometry
(SCG-97). - New York : ACM Press, 1997, S. 254-263
 
- u.a.: The LEDA platform for combinatorial and geometric computing. - In:
Proc. 24th Int. Colloquium on Automata, Languages, and Programming (ICALP-97)
/ Ed.: Degano, Pierpaolo .. - Berlin : Springer, 1997, S. 7-16. - (Lect. Notes
Comput. Sci. ; 1256)
 
- u.a.: Maintaining Dynamic Sequences under Equality Tests in
Polylogarithmic Time. - In: Algorithmica. - 17 (1997), S. 183-198
 
van der Torre, Leendert W.N.
- u.a.: Distinguishing different roles in normative reasoning. - In: Proc.
6th Int. Conf. on Artificial Intelligence and Law (ICAIL-97). - 1515 Broadway
: ACM Press, 1997, S. 225-232
 
- u.a.: Reasoning about exceptions. - In: Proc. 21st Annual German Conf. on
Artificial Intelligence (KI-97): Advances in Artificial Intelligence / Ed.:
Brewka, Gerhard .. - Berlin : Springer, 1997, S. 405-408. - (Lect. Notes
Artif. Intell. ; 1303)
 
Viganò, Luca
- u.a.: Labelled modal logics: quantifiers. - Saarbrücken : Max-Planck-
Institut für Informatik, 1997, 31 S. - (Research Report ; MPI-I-97-2-001)
 
- u.a.: Labelled Propositional Modal Logics: Theory and Practice. - In:
Journal of Logic and Computation. - 7 (1997), S. 685-717
 
- u.a.: Labelled quantified modal logics. - In: Proc. 21st Annual German
Conf. on Artificial Intelligence (KI-97): Advances in Artificial Intelligence
/ Ed.: Brewka, Gerhard .. - Berlin : Springer, 1997, S. 171-182. - (Lect.
Notes Artif. Intell. ; 1303)
 
- u.a.: A New Method for Bounding the Complexity of Modal Logics. - In:
Proc. 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory (KGC-
97) / Ed.: Gottlob, G. .. - Berlin : Springer, 1997, S. 89-102. - (Lect.
Notes Comput. Sci. ; 1289)
 
Vorobyov, Sergei
- u.a.: Complexity of Nonrecursive Logic Programs with Complex Values. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 46 S. - (Research
Report ; MPI-I-97-2-010)
 
- The first-order theory of one step rewriting in linear noetherian systems
is undecidable. - In: Proc. 8th Int. Conf. on Rewriting Techniques and
Applications (RTA-97) / Ed.: Comon, Hubert. - Berlin : Springer, 1997, S. 254-
268. - (Lect. Notes Comput. Sci. ; 1232)
 
- The "hardest" natural decidable theory. - In: Proc. Twelfth Annual IEEE
Symp. on Logic in Computer Science (LICS-97) / Ed.: Winskel, Glynn. - New York
: IEEE Comput. Soc. Press, 1997, S. 294-305
 
- Third-order matching in \lambda\rightarrow-Curry is undecidable. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 17 S. - (Research
Report ; MPI-I-97-2-006)
 
Voronkov, Andrei
- u.a.: Complexity of Nonrecursive Logic Programs with Complex Values. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 46 S. - (Research
Report ; MPI-I-97-2-010)
 
- u.a.: Elimination of Equality via Transformation with Ordering
Constraints. - Saarbrücken : Max-Planck-Institut für Informatik, 1997, 18 S. -
(Research Report ; MPI-I-97-2-012)
 
Waldmann, Uwe
- A Superposition Calculus for Divisible Torsion-Free Abelian Groups. - In:
Proc. Int. Workshop on First-Order Theorem Proving (FTP-97) / Ed.: Bonacina,
Maria Paola .. - Linz : Johannes Kepler Universität, 1997, S. 130-134. - (RISC-
Linz Report Series)
 
Wang, Yaoguang
- Bicriteria Job Sequencing with Release Dates. - Saarbrücken : Max-Planck-
Institut für Informatik, 1997, 18 S. - (Research Report ; MPI-I-97-1-005)
 
- u.a.: Restricted 2-Factor Polytopes. - Saarbrücken : Max-Planck-Institut
für Informatik, 1997, 30 S. - (Research Report ; MPI-I-97-1-006)
 
Wang, Yongge
- NP-hard sets are superterse unless NP is small. - In: Information
Processing Letters. - 61 (1997), S. 1-6
 
- Randomization and Approximation Techniques in Computer Science. - In:
Proc. Int. Workshop on Randomization and Approximation Techniques in Computer
Science (RANDOM-97) / Ed.: Rolim, José. - Berlin : Springer, 1997, S. 209-225.
- (Lecture notes in computer science ; 1269)
 
Weidenbach, Christoph
- u.a.: Soft Typing for Ordered Resolution. - In: Proc. 14th Int. Conf. on
Automated Deduction (CADE-14) / Ed.: McCune, William. - Berlin : Springer,
1997, S. 321-335. - (Lect. Notes Comput. Sci. ; 1249)
 
- SPASS Version 0.49. - In: Journal of Automated Reasoning. - 18 (1997), S.
247-252
 
Weydert, Emil
- u.a. (Hrsg.): Proceedings of the Third Dutch/German Workshop on
Nonmonotonic Reasoning Techniques and their Applications (DGNMR-97). -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 182 S.
 
- Qualitative Entropy Maximization - A preliminary report. - In: Proc. Third
Dutch/German Workshop on Nonmonotonic Reasoning Techniques and their
Applications (DGNMR-97) / Ed.: Weydert, Emil .. - Saarbrücken : Max-Planck-
Institut für Informatik, 1997, S. 63-72
 
- Rational Default Quantifier Logic. - In: Proc. 1st Int. Joint Conf. on
Qualitative and Quantitative Practical Reasoning (ESQARU-FAPR-97) / Ed.:
Gabbay, Dov .. - Heidelberg : Springer, 1997, S. 589-600. - (Lect. Notes
Artif. Intell. ; 1244)
 
Zaroliagis, Christos
- u.a.: Efficient Computation of implicit representations of sparse graphs. -
In: Discrete Applied Mathematics. - 78 (1997), S. 1-16
 
- u.a.: A First Experimental Study of a Dynamic Transitive Closure
Algorithm. - In: Proc. Workshop on Algorithm Engineering (WAE-97) / Ed.:
Italiano, Giuseppe .. - Venice : Università Ca' Foscari di Venezia, 1997, S.
64-73
 
- u.a.: A parallel priority data structure with applications. - In: Proc.
11th Int. Parallel Processing Symp. (IPPS-97) / Ed.: Feitelson, Dror G. .. -
Los Alamitos : IEEE Comput. Soc. Press, 1997, S. 689-693
 
- Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning
Tree Problem. - In: Parallel Processing Letters. - 7 (1997), S. 25-37
 
Zaroliagis, Christos D.
- u.a.: A parallel priority queue with constant time operations. -
Saarbrücken : Max-Planck-Institut für Informatik, 1997, 19 S. - (Research
Report ; MPI-I-97-1-011)
 
Ziegler, Joachim
- u.a.: A Computational Basis for Higher-dimensional Computational Geometry
and Applications. - In: Proc. 13th Int. Annual Symp. on Computational Geometry
(SCG-97). - New York : ACM Press, 1997, S. 254-263
 
Zosin, Leonid
- A 2-Approximation Algorithm for the Directed Multiway Cut Problem. - In:
Proc. 38th Annual Symp. on Foundations of Computer Science (FOCS-97). - Los
Alamitos : IEEE Comput. Soc. Press, 1997, S. 548-553