Jahresbibliographie 1999

Veröffentlichungen von
Angehörigen der Hochschulen des Saarlandes

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

Afshordel, Bijan
- u.a.: System Description: SPASS Version 1.0.0. - In: Proc. 16th Int. Conf.
on Automated Deduction (CADE-16) / Ed.: Ganzinger, Harald. - Berlin :
Springer, 1999, S. 314-318. - (Lect. Notes Artif. Intell. ; 1632)
 
Albers, Susanne
- u.a.: Exploring unknown environments with obstacles. - In: Proc. 10th
Annual ACM-SIAM Symp. on Discrete Algorithms (SODA-99). - New York : ACM,
1999, S. 842-843
 
- u.a.: Page replacement for general caching problems. - In: Proc. 10th
Annual ACM-SIAM Symp. on Discrete Algorithms (SODA-99). - New York : ACM,
1999, S. 31-40
 
- u.a.: Scheduling with unexpected machine breakdowns. - In: Proc. 2nd
International Workshop on Approximation Algorithms for Combinatorial
Optimization Problems. - Berlin u.a.O : Springer-Verlag, 1999, S. 267-280. -
(Springer Lecture Notes in Computer Science ; 1671)
 
Basin, David
- u.a.: Formalization of the Development Process. - In: Algebraic
foundations of systems specification / Ed.: Astesiano, Egidio .. - Berlin :
Springer, 1999, S. 521-562
 
- u.a.: Modeling a Hardware Synthesis Methodology in Isabelle. - In: Formal
Methods in Systems Design, 15 (1999), S. 99-122
 
Bockmayr, Alexander
- u.a.: On the Chvátal Rank of Polytopes in the 0/1 Cube. - In: Discrete
Applied Mathematics, 98 (1999), S. 21-27
 
Boghossian, Nicolas Pascal
- u.a.: BALL: Biochemical Algorithms Library. - In: Proc. 3rd Int. Workshop
on Algorithm Engineering (WAE-99) / Ed.: Vitter, Jeffrey S. .. - Berlin :
Springer, 1999, S. 330-344. - (Lect. Notes Comput. Sci. ; 1668)
 
- u.a.: BALL: Biochemical Algorithms Library. - Saarbrücken : Max-Planck-
Institut für Informatik, 1999, 20 S. - (Research Report ; MPI-I-1999-1-002)
 
Brahm, Uwe
- u.a.: System Description: SPASS Version 1.0.0. - In: Proc. 16th Int. Conf.
on Automated Deduction (CADE-16) / Ed.: Ganzinger, Harald. - Berlin :
Springer, 1999, S. 314-318. - (Lect. Notes Artif. Intell. ; 1632)
 
Brengel, Klaus
- u.a.: An Experimental Study of Priority Queues in External Memory. - In:
Proc. 3rd Int. Workshop on Algorithm Engineering (WAE-99) / Ed.: Vitter,
Jeffrey S. .. - Berlin : Springer, 1999, S. 345-359. - (Lect. Notes Comput.
Sci. ; 1668)
 
Brodal, Gerth Stølting
- u.a.: I/O-Efficient Dynamic Point Location in Monotone Subdivisions. - In:
Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA-99). - New York
: ACM, 1999, S. 11-20
 
Burkhardt, Stefan
- u.a.: q-gram Based Database Searching Using a Suffix Array (QUASAR). - In:
Proc. 3rd Annual Int. Conf. on Computational Molecular Biology (RECOMB-99) /
Ed.: Istrail, Sorin .. - New York : ACM, 1999, S. 77-83
 
Burnikel, Christoph
- u.a.: Efficient exact geometric computation made easy. - In: Proc. 15th
Annual Symp. on Computational Geometry (SCG-99). - New York : ACM, 1999, S.
341-350
 
- u.a.: A simple way to recognize a correct Voronoi diagram of line
segments. - Saarbrücken : Max-Planck-Institut für Informatik, 1999, 11 S. -
(Research Report ; MPI-I-1999-1-007)
 
Charatonik, Witold
- Automata on DAG Representations of Finite Trees. - Saarbrücken : Max-
Planck-Institut für Informatik, 1999, 30 S. - (Research Report ; MPI-I-1999-2-
001)
 
- u.a.: Set-based Failure Analysis for Logic Programs and Concurrent
Constraint Programs. - In: Proceedings of ESOP'99, the European Symposium of
Programing / ED.: Swierstra, S. Doaitse. - Springer, 1999. - (LNCS)
 
- u.a.: Set-based Failure Analysis for Logic Programs and Concurrent
Constraint Programs. - In: Programming Languages and Systems: Proc. 8th
European Symp. on Programming (ESOP-99) / Ed.: Swierstra, S. Doaitse. - Berlin
: Springer, 1999, S. 177-192. - (Lect. Notes Comput. Sci. ; 1576)
 
Cohrs, Christian
- u.a.: System Description: SPASS Version 1.0.0. - In: Proc. 16th Int. Conf.
on Automated Deduction (CADE-16) / Ed.: Ganzinger, Harald. - Berlin :
Springer, 1999, S. 314-318. - (Lect. Notes Artif. Intell. ; 1632)
 
Cortier, Veronique
- u.a.: Decidable fragments of simultaneous rigid reachability. -
Saarbrücken : Max-Planck-Institut für Informatik, 1999, 19 S. - (Research
Report ; MPI-I-1999-2-004)
 
- u.a.: Decidable fragments of simultaneous rigid reachability. - In: Proc.
26th Int. Colloquium on Automata, Languages and Programming (ICALP-99) / Ed.:
Wiedermann, Jiri .. - Berlin : Springer, 1999, S. 250-260. - (Lect. Notes
Comput. Sci. ; 1644)
 
Crauser, Andreas
- u.a.: An Experimental Study of Priority Queues in External Memory. - In:
Proc. 3rd Int. Workshop on Algorithm Engineering (WAE-99) / Ed.: Vitter,
Jeffrey S. .. - Berlin : Springer, 1999, S. 345-359. - (Lect. Notes Comput.
Sci. ; 1668)
 
- u.a.: I/O-optimal computation of segment intersections. - In: Proc. DIMACS
Workshop on External Algorithms and Visualization / Ed.: Abello, James M. .. -
Providence : AMS, 1999, S. 131-138. - (DIMACS Series in Discrete Mathematics
and Theoretical Computer Science ; 50)
 
- u.a.: LEDA-SM: Extending LEDA to Secondary Memory. - In: Proc. 3rd Int.
Workshop on Algorithm Engineering (WAE-99) / Ed.: Vitter, Jeffrey S. .. -
Berlin : Springer, 1999, S. 228-242. - (Lect. Notes Comput. Sci. ; 1668)
 
- u.a.: On Constructing Suffix Arrays in External Memory. - In: Proc. 7th
Annual European Symp. on Algorithms (ESA-99) / Ed.: Nesetril, Jaroslav. -
Berlin : Springer, 1999, S. 224-235. - (Lect. Notes Comput. Sci. ; 1643)
 
- u.a.: q-gram Based Database Searching Using a Suffix Array (QUASAR). - In:
Proc. 3rd Annual Int. Conf. on Computational Molecular Biology (RECOMB-99) /
Ed.: Istrail, Sorin .. - New York : ACM, 1999, S. 77-83
 
- u.a.: A Theoretical and Experimental Study on the Construction of Suffix
Arrays in External Memory. - Saarbrücken : Max-Planck-Institut für Informatik,
1999, 40 S. - (Research Report ; MPI-I-1999-1-001)
 
Daubert, Katja
- u.a.: Photon Tracing with RenderMan Light Source Shaders. - In: Proc. 4th
Conf. on Vision, Modeling, and Visualization (VMV-99) / Ed.: Girod, Bernd .. -
Sankt Augustin : infix, 1999, S. 277-284
 
de Alfaro, Luca
- u.a.: Automating modular verification. - In: Proc. 10th Int. Conf. on
Concurrency Theory (CONCUR-99) / Ed.: Baeten, Jos C. M. .. - Berlin :
Springer, 1999, S. 82-97. - (Lect. Notes Comput. Sci. ; 1664)
 
De Nivelle, Hans
- u.a.: A Superposition Decision Procedure for the Guarded Fragment with
Equality. - In: Proc. 14th Annual IEEE Symp. on Logic in Computer Science
(LICS-99) / Ed.: Longo, Giuseppe. - Los Alamitos : IEEE Computer Society,
1999, S. 295-303
 
Delzanno, Giorgio
- u.a.: Constraint-Based Analysis of Broadcast Protocols. - In: Proc. 13th
Int. Workshop on Computer Science Logic (CSL-99), 8th Annual Conf. on the
EACSL / Ed.: Flum, Jörg .. - Berlin : Springer, 1999, S. 50-66. - (Lect. Notes
Comput. Sci. ; 1683)
 
- u.a.: Logic Programming and Multi-Agent Systems: a Synergic Combination
for Applications and Semantics. - In: The Logic Programming Paradigm: a 25-
Year Perspective / Ed.: Apt, K. .. - Berlin : Springer, 1999, S. 5-32. -
(Artificial Intelligence)
 
- u.a.: Model Checking in CLP. - In: Proc. 5th Int. Conf. on Tools and
Algorithms for Construction and Analysis of Systems (TACAS-99) / Ed.:
Cleaveland, Rance. - Berlin : Springer, 1999, S. 223-239. - (Lect. Notes
Comput. Sci. ; 1579)
 
- u.a.: Multi-Agent Systems Development as a Software Engineering
Enterprise. - In: Proc. 1st Int. Workshop on Practical Aspects of Declarative
Languages (PADL-99) / Ed.: Gupta, Gopal. - Berlin : Springer, 1999, S. 46-60. -
(Lect. Notes Comput. Sci. ; 1551)
 
- u.a.: A specification logic for concurrent object-oriented programming. -
In: Mathematical Structures in Computer Science, 9 (1999), S. 253-286
 
- u.a.: Symbolic Representation of Upward-closed Sets. - Saarbrücken : Max-
Planck-Institut für Informatik, 1999, 24 S. - (Research Report ; MPI-I-1999-2-
007)
 
Egner, Sebastian
- u.a.: Fast Concurrent Access to Parallel Disks. - Saarbrücken : Max-Planck-
Institut für Informatik, 1999, 30 S. - (Research Report ; MPI-I-1999-1-003)
 
Eisenbrand, Friedrich
- u.a.: Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. - In: Proc.
7th Conf. on Integer Programming and Combinatorial Optimization (IPCO-99) /
Ed.: Cornuéjols, Gérard .. - Berlin : Springer, 1999, S. 137-150. - (Lect.
Notes Comput. Sci. ; 1610)
 
- u.a.: On Factor Refinement in Number Fields. - In: Mathematics of
Computation, 68 (1999), S. 345-350
 
- u.a.: On the Chvátal Rank of Polytopes in the 0/1 Cube. - In: Discrete
Applied Mathematics, 98 (1999), S. 21-27
 
- On the Membership Problem for the Elementary Closure of a Polyhedron. -
In: Combinatorica, 19 (1999), S. 297-300
 
Engel, Thorsten
- u.a.: System Description: SPASS Version 1.0.0. - In: Proc. 16th Int. Conf.
on Automated Deduction (CADE-16) / Ed.: Ganzinger, Harald. - Berlin :
Springer, 1999, S. 314-318. - (Lect. Notes Artif. Intell. ; 1632)
 
Ferragina, Paolo
- u.a.: A Theoretical and Experimental Study on the Construction of Suffix
Arrays in External Memory. - Saarbrücken : Max-Planck-Institut für Informatik,
1999, 40 S. - (Research Report ; MPI-I-1999-1-001)
 
Fleischer, Rudolf
- Decision trees: old and new results. - In: Information and computation,
152 (1999), S. 44-61
 
- u.a.: Efficient exact geometric computation made easy. - In: Proc. 15th
Annual Symp. on Computational Geometry (SCG-99). - New York : ACM, 1999, S.
341-350
 
- FUN with implementing algorithms. - In: Proc. Int. Conf. on FUN with
Algorithms (FUN-98) / Ed.: Lodi, Elena .. - Waterloo : Carleton Scientific,
1999, S. 88-98. - (Proceedings in Informatics ; 4)
 
Friedrich, Stephan
- u.a.: Modeling a Hardware Synthesis Methodology in Isabelle. - In: Formal
Methods in Systems Design, 15 (1999), S. 99-122
 
Funke, Stefan
- u.a.: Structural Filtering: a Paradigm for Efficient and Exact Geometric
Programs. - In: Abstracts for the 11th Canadian Conf. on Computational
Geometry (CCCG-99). - Vancouver : University of British Columbia, 1999, S. 39-
42
 
Garg, Naveen
- u.a.: On the single-source unsplittable flow problem. - In: Combinatorica,
19 (1999), S. 17-41
 
Gösele, Michael
- u.a.: Semantic Constraints for Scene Manipulation. - In: Proc. 15th Spring
Conf. on Computer Graphics (SCCG-99) / Ed.: Zára, Jirí. - Bratislava :
Comenius University, 1999, S. 140-146
 
Gupta, Prosenjit
- u.a.: Efficient algorithms for counting and reporting pairwise
intersections between convex polygons. - In: Information Processing Letters,
69 (1999), S. 7-13
 
Heidrich, Wolfgang
- u.a.: Adaptive Acquisition of Lumigraphs from Synthetic Scenes. - In:
Proc. 20th Annual Conf. ot the European Association of Computer Graphics
(Eurographics-99) / Ed.: Brunet, Pere .. - Oxford : Blackwell, 1999, C-151-C-
160. - (Computer Graphics Forum ; 18)
 
- u.a.: Applications of Pixel Textures in Visualization and Realistic Image
Synthesis. - In: Proc. 1999 ACM Symp. on Interactive 3D Graphics (I3DG-99) /
Ed.: Hodgins, Jessica .. - New York : ACM, 1999, S. 127-134
 
- u.a.: Image-Based BRDF Reconstruction. - In: Proc. 4th Conf. on Vision,
Modeling, and Visualization (VMV-99) / Ed.: Girod, Bernd .. - Sankt Augustin :
Infix, 1999, S. 285-292
 
- u.a.: Light Field Techniques for Reflections and Refractions. - In:
Rendering Techniques '99: Proc. 10th Eurographics Workshop on Rendering (EGRW-
99) / Ed.: Lischinski, Dani .. - Wien : Springer, 1999, S. 196-197
 
- u.a.: Realistic, Hardware-accelerated Shading and Lighting. - In: Computer
Graphics (SIGGRAPH-99) : Conf. proceedings / Ed.: Rockwood, Alyn. - New York :
ACM, 1999, S. 171-178
 
- u.a.: Texture Shaders. - In: Eurographics/SIGGRAPH Workshop on Graphics
Hardware / Ed.: Kaufman, Arie .. - New York : ACM, 1999, S. 117-126
 
- u.a.: A Warping-based Refinement of Lumigraphs. - In: Proc. 7th Int. Conf.
in Central Europe on Computer Graphics, Visualization and Interactive Digital
Media (WSCG-99) / Ed.: Skala, Vaclav. - Plzen : University of West Bohemia,
1999, S. 102-109
 
Henzinger, Thomas A.
- u.a.: Assume-Guarantee Refinement between Different Time Scales. - In:
Proc. 11th Int. Conf. on Computer Aided Verification (CAV-99) / Ed.:
Halbwachs, Nicolas .. - Berlin : Springer, 1999, S. 208-221. - (Lect. Notes
Comput. Sci. ; 1633)
 
- u.a.: Automating modular verification. - In: Proc. 10th Int. Conf. on
Concurrency Theory (CONCUR-99) / Ed.: Baeten, Jos C. M. .. - Berlin :
Springer, 1999, S. 82-97. - (Lect. Notes Comput. Sci. ; 1664)
 
- u.a.: Automating modular verification. - In: Proc. 10th Int. Conf. on
Concurrency Theory (CONCUR-99) / Ed.: Baeten, Jos C. M. .. - Berlin :
Springer, 1999, S. 82-97. - (Lect. Notes Comput. Sci. ; 1664)
 
- u.a.: Axioms for Real-Time Logics. - Saarbrücken : Max-Planck-Institut für
Informatik, 1999, 31 S. - (Research Report ; MPI-I-1999-3-005)
 
- u.a.: Discrete-time control for rectangular hybrid automata. - In:
Theoretical Computer Science, 221 (1999), S. 369-392
 
- u.a.: Event-clock automata: a determinizable class of timed automata. -
In: Theoretical Computer Science, 221 (1999), S. 253-273
 
- u.a.: Formal specification and verification of a dataflow processor array.
- In: Proc. IEEE/ACM Int. Conf. on Computer-aided Design (ICCAD-99). - Los
Alamitos : IEEE Computer Society, 1999, S. 494-499
 
- u.a.: Fully Decidable Logics, Automata and Classical Theories for Defining
Regular Real-Time Languages. - Saarbrücken : Max-Planck-Institut für
Informatik, 1999, 102 S. - (Research Report ; MPI-I-1999-3-003)
 
- u.a.: Rectangular hybrid games. - In: Proc. 10th Int. Conf. on Concurrency
Theory (CONCUR-99) / Ed.: Baeten, Jos C. M. .. - Berlin : Springer, 1999, S.
320-335. - (Lect. Notes Comput. Sci. ; 1664)
 
- u.a.: Verifying sequential consistency on shared-memory multiprocessor
systems. - In: Proc. 11th Int. Conf. on Computer Aided Verification (CAV-99) /
Ed.: Halbwachs, Nicolas .. - Berlin : Springer, 1999, S. 301-315. - (Lect.
Notes Comput. Sci. ; 1633)
 
Hert, Susan
- Motion Planning in R^3 for Multiple Tethered Robots. - In: IEEE
Transactions on Robotics and Automation, 15 (1999), S. 623-639
 
Horowitz, Benjamin
- u.a.: Automating modular verification. - In: Proc. 10th Int. Conf. on
Concurrency Theory (CONCUR-99) / Ed.: Baeten, Jos C. M. .. - Berlin :
Springer, 1999, S. 82-97. - (Lect. Notes Comput. Sci. ; 1664)
 
- u.a.: Rectangular hybrid games. - In: Proc. 10th Int. Conf. on Concurrency
Theory (CONCUR-99) / Ed.: Baeten, Jos C. M. .. - Berlin : Springer, 1999, S.
320-335. - (Lect. Notes Comput. Sci. ; 1664)
 
Hustadt, Ullrich
- u.a.: An Empirical Analysis of Modal Theorem Provers. - In: Journal of
Applied Non-Classical Logics, 9 (1999), S. 479-522
 
- u.a.: Maslov's Class K Revisited. - In: Proc. 16th Int. Conf. on Automated
Deduction (CADE-16) / Ed.: Ganzinger, Harald. - Berlin : Springer, 1999, S.
172-186. - (Lect. Notes Artif. Intell. ; 1632)
 
- u.a.: On the relation of resolution and tableaux proof systems for
description logics. - In: Proc. 16th Int. Joint Conf. on Artificial
Intelligence (IJCAI-99). - San Francisco : Morgan Kaufmann, 1 (1999), S. 110-
115
 
Jacquemard, Florent
- u.a.: Decidable fragments of simultaneous rigid reachability. -
Saarbrücken : Max-Planck-Institut für Informatik, 1999, 19 S. - (Research
Report ; MPI-I-1999-2-004)
 
- u.a.: Decidable fragments of simultaneous rigid reachability. - In: Proc.
26th Int. Colloquium on Automata, Languages and Programming (ICALP-99) / Ed.:
Wiedermann, Jiri .. - Berlin : Springer, 1999, S. 250-260. - (Lect. Notes
Comput. Sci. ; 1644)
 
Jaeger, Manfred
- Fairness, Computable Fairness and Randomness. - In: Proc. 2nd Int.
Workshop on Probabilistic Methods in Verification (PROBMIV-99) / Ed.:
Kwiatkowska, Marta. - Birmingham : School of Computer Science, University of
Birmingham, 1999, S. 57-66. - (Technical Report CSR-99-8)
 
Keen, Enno
- u.a.: System Description: SPASS Version 1.0.0. - In: Proc. 16th Int. Conf.
on Automated Deduction (CADE-16) / Ed.: Ganzinger, Harald. - Berlin :
Springer, 1999, S. 314-318. - (Lect. Notes Artif. Intell. ; 1632)
 
Klau, Gunnar W.
- u.a.: Combining Graph Labeling and Compaction. - In: Proc. 7th Int. Symp.
on Graph Drawing (GD-99) / Ed.: Kratochvíl, Jan. - Berlin : Springer, 1999, S.
27-37. - (Lect. Notes Comput. Sci. ; 1731)
 
- u.a.: Optimal Compaction of Orthogonal Grid Drawings. - In: Proc. 7th Int.
Conf. on Integer Programming and Combinatorial Optimization (IPCO-99) / Ed.:
Cornuéjols, Gérard .. - Berlin : Springer, 1999, S. 304-319. - (Lect. Notes
Comput. Sci. ; 1610)
 
Kobbelt, Leif
- u.a.: Approximation and Visualization of Discrete Curvature on
Triangulated Surfaces. - In: Proc. 4th Conf. on Vision, Modeling, and
Visualization (VMV-99) / Ed.: Girod, Bernd .. - Sankt Augustin : infix, 1999,
S. 339-346
 
- u.a.: Mesh Reduction and Interactive Multiresolution Modeling on Arbitrary
Triangle Meshes. - In: Proc. 15th Spring Conf. on Computer Graphics (SCCG-99)
/ Ed.: Zára, Jirí. - Bratislava : Comenius University, 1999, S. 34-44
 
- u.a.: Multiresolution hierarchies on unstructured triangle meshes. - In:
Computational Geometry, 14 (1999), S. 5-24
 
- u.a.: Real-time Exploration of Regular Volume Data by Adaptive
Reconstruction of Iso-Surfaces. - In: The Visual Computer, 15 (1999), S. 100-
111
 
- u.a.: Robust Multi-Band Detail Encoding for Triangular Meshes of Arbitrary
Connectivity. - In: Proc. 4th Conf. on Vision, Modeling, and Visualization
(VMV-99) / Ed.: Girod, Bernd .. - Sankt Augustin : infix, 1999, S. 245-252
 
- u.a.: A Shrink Wrapping Approach to Remeshing Polygonal Surfaces. - In:
Proc. 20th Annual Conf. ot the European Association of Computer Graphics
(Eurographics-99) / Ed.: Brunet, P. .. - Oxford : Blackwell, 1999, C-119-C-
129. - (Computer Graphics Forum ; 18)
 
- u.a.: sqrt(3)-Subdivision and Forward Adaptive Refinement. - In: Proc.
Israelian/Korean workshop on Geometric Modeling and Computer Graphics. 1999,
S. 245-252
 
Kohlbacher, Oliver
- u.a.: BALL: Biochemical Algorithms Library. - In: Proc. 3rd Int. Workshop
on Algorithm Engineering (WAE-99) / Ed.: Vitter, Jeffrey S. .. - Berlin :
Springer, 1999, S. 330-344. - (Lect. Notes Comput. Sci. ; 1668)
 
- u.a.: BALL: Biochemical Algorithms Library. - Saarbrücken : Max-Planck-
Institut für Informatik, 1999, 20 S. - (Research Report ; MPI-I-1999-1-002)
 
- u.a.: Rapid Software Prototyping in Computational Molecular Biology. - In:
Proc. German Conf. on Bioinformatics (GCB'99). - Braunschweig : GBF-
Braunschweig / Dep. of Bioinformatics, 1999, S. 81-92
 
Korst, Jan
- u.a.: Fast Concurrent Access to Parallel Disks. - Saarbrücken : Max-Planck-
Institut für Informatik, 1999, 30 S. - (Research Report ; MPI-I-1999-1-003)
 
Krieg-Brückner, Bernd
- u.a.: Formalization of the Development Process. - In: Algebraic
foundations of systems specification / Ed.: Astesiano, Egidio .. - Berlin :
Springer, 1999, S. 521-562
 
Krysta, Piotr
- u.a.: Approximation algorithms for bounded facility location. - In: Proc.
5th Annual Int. Conf. on Computing and Combinatorics (COCOON-99) / Ed.: Asano,
T. .. - Berlin : Springer, 1999, S. 241-250. - (Lect. Notes Comput. Sci. ;
1627)
 
- u.a.: Efficient approximation algorithms for the achromatic number. - In:
Proc. 7th Annual European Symp. on Algorithms (ESA-99) / Ed.: Nesetril,
Jaroslav. - Berlin : Springer, 1999, S. 402-413. - (Lect. Notes Comput. Sci. ;
1643)
 
- u.a.: The STO problem is NP-complete. - In: Journal of Symbolic
Computation, 27 (1999), S. 207-219
 
Kumar, V. S. Anil
- u.a.: Covering Rectilinear Polygons with Axis-Parallel Rectangles. - In:
Proc. 31st Annual ACM Symp. on Theory of Computing (STOC-99). - New York :
ACM, 1999, S. 445-454
 
- u.a.: Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. -
In: Proc. 40th Annual Symp. on Foundations of Computer Science (FOCS-99). -
Los Alamitos : IEEE Computer Society, 1999, S. 241-251
 
Kursawe, Klaus
- u.a.: Exploring unknown environments with obstacles. - In: Proc. 10th
Annual ACM-SIAM Symp. on Discrete Algorithms (SODA-99). - New York : ACM,
1999, S. 842-843
 
Lambert, Oliver
- u.a.: Parallel and External List Ranking and Connected Components on a
Cluster of Workstations. - In: Proc. 11th Int. Conf. on Parallel and
Distributed Computing and Systems (PDCS-99) / Ed.: Zheng, S. Q. - Anaheim :
IASTED, 1999, S. 454-460
 
Lenhof, Hans-Peter
- u.a.: BALL: Biochemical Algorithms Library. - In: Proc. 3rd Int. Workshop
on Algorithm Engineering (WAE-99) / Ed.: Vitter, Jeffrey S. .. - Berlin :
Springer, 1999, S. 330-344. - (Lect. Notes Comput. Sci. ; 1668)
 
- u.a.: BALL: Biochemical Algorithms Library. - Saarbrücken : Max-Planck-
Institut für Informatik, 1999, 20 S. - (Research Report ; MPI-I-1999-1-002)
 
- u.a.: An exact solution for the segment-to-segment multiple sequence
alignment problem. - In: Bioinformatics, 15 (1999), S. 203-210
 
- u.a.: q-gram Based Database Searching Using a Suffix Array (QUASAR). - In:
Proc. 3rd Annual Int. Conf. on Computational Molecular Biology (RECOMB-99) /
Ed.: Istrail, Sorin .. - New York : ACM, 1999, S. 77-83
 
- u.a.: Rapid Software Prototyping in Computational Molecular Biology. - In:
Proc. German Conf. on Bioinformatics (GCB'99). - Braunschweig : GBF-
Braunschweig / Dep. of Bioinformatics, 1999, S. 81-92
 
- u.a.: Simulating synthetic polymer chains in parallel. - In: Proc. 7th
Int. Conf. on High-Performance Computing and Networking Europe (HPCN Europe-
99) / Ed.: Sloot, Peter .. - Berlin : Springer, 1999, S. 13-22. - (Lect.
Notes Comput. Sci. ; 1593)
 
Lensch, Hendrik
- u.a.: Light Field Techniques for Reflections and Refractions. - In:
Rendering Techniques '99: Proc. 10th Eurographics Workshop on Rendering (EGRW-
99) / Ed.: Lischinski, Dani .. - Wien : Springer, 1999, S. 196-197
 
Liu, Xiaojun
- u.a.: Formal specification and verification of a dataflow processor array.
- In: Proc. IEEE/ACM Int. Conf. on Computer-aided Design (ICCAD-99). - Los
Alamitos : IEEE Computer Society, 1999, S. 494-499
 
Lorys, Krzysztof
- u.a.: Efficient approximation algorithms for the achromatic number. - In:
Proc. 7th Annual European Symp. on Algorithms (ESA-99) / Ed.: Nesetril,
Jaroslav. - Berlin : Springer, 1999, S. 402-413. - (Lect. Notes Comput. Sci. ;
1643)
 
Majumdar, Rupak
- u.a.: Automating modular verification. - In: Proc. 10th Int. Conf. on
Concurrency Theory (CONCUR-99) / Ed.: Baeten, Jos C. M. .. - Berlin :
Springer, 1999, S. 82-97. - (Lect. Notes Comput. Sci. ; 1664)
 
Mang, F.Y.C.
- u.a.: Automating modular verification. - In: Proc. 10th Int. Conf. on
Concurrency Theory (CONCUR-99) / Ed.: Baeten, Jos C. M. .. - Berlin :
Springer, 1999, S. 82-97. - (Lect. Notes Comput. Sci. ; 1664)
 
Meyer, Christoph
- u.a.: The Two-Variable Guarded Fragment with Transitive Relations. - In:
Proc. 14th Annual IEEE Symp. on Logic in Computer Science (LICS-99) / Ed.:
Longo, Giuseppe. - Los Alamitos : IEEE Computer Society, 1999, S. 24-34
 
Meyer, Ulrich
- u.a.: An Experimental Study of Priority Queues in External Memory. - In:
Proc. 3rd Int. Workshop on Algorithm Engineering (WAE-99) / Ed.: Vitter,
Jeffrey S. .. - Berlin : Springer, 1999, S. 345-359. - (Lect. Notes Comput.
Sci. ; 1668)
 
- u.a.: I/O-optimal computation of segment intersections. - In: Proc. DIMACS
Workshop on External Algorithms and Visualization / Ed.: Abello, James M. .. -
Providence : AMS, 1999, S. 131-138. - (DIMACS Series in Discrete Mathematics
and Theoretical Computer Science ; 50)
 
Müller, Peter
- u.a.: Simulating synthetic polymer chains in parallel. - In: Proc. 7th
Int. Conf. on High-Performance Computing and Networking Europe (HPCN Europe-
99) / Ed.: Sloot, Peter .. - Berlin : Springer, 1999, S. 13-22. - (Lect.
Notes Comput. Sci. ; 1593)
 
Mukhopadhyay, Supratik
- u.a.: Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata. -
In: Proc. 19th Conf. on Foundations of Software Technology and Theoretical
Computer Science (FST&TCS-99) / Ed.: Ramanujam, R .. - Berlin : Springer,
1999, S. 232-244. - (Lect. Notes Comput. Sci. ; 1738)
 
Mutzel, Petra
- u.a.: Combining Graph Labeling and Compaction. - In: Proc. 7th Int. Symp.
on Graph Drawing (GD-99) / Ed.: Kratochvíl, Jan. - Berlin : Springer, 1999, S.
27-37. - (Lect. Notes Comput. Sci. ; 1731)
 
- u.a.: The constrained crossing minimization problem: a first approach. -
In: Operations Research Proceedings 1998 / Ed.: Kall, Peter .. - Berlin :
Springer, 1999, S. 125-134
 
- u.a.: Graph Drawing Algorithms. - In: Algorithms & Theory of Computation
Handbook / Ed.: Atallah, Mikhail J. - Boca Raton : CRC, 1999, S. 9-1-9-26
 
- u.a.: Graph Drawing Contest Report. - In: Proc. 7th Int. Symp. on Graph
Drawing (GD-99) / Ed.: Kratochvíl, Jan. - Berlin : Springer, 1999, S. 400-409.
- (Lect. Notes Comput. Sci. ; 1731)
 
- u.a.: Optimal Compaction of Orthogonal Grid Drawings. - In: Proc. 7th Int.
Conf. on Integer Programming and Combinatorial Optimization (IPCO-99) / Ed.:
Cornuéjols, Gérard .. - Berlin : Springer, 1999, S. 304-319. - (Lect. Notes
Comput. Sci. ; 1610)
 
- u.a.: Optimizing Over All Combinatorial Embeddings of a Planar Graph. -
In: Proc. 7th Int. Conf. on Integer Programming and Combinatorial Optimization
(IPCO-99) / Ed.: Cornuéjols, Gérard .. - Berlin : Springer, 1999, S. 361-376. -
(Lect. Notes Comput. Sci. ; 1610)
 
Näher, Stefan
- u.a.: From Algorithms to Working Programs: On the Use of Program Checking
in LEDA. - In: Proc. 23rd Int. Symp. on Mathematical Foundations of Computer
Science (MFCS-98) / Ed.: Brim, Lubos .. - Berlin : Springer, 1999, S. 84-93. -
(Lect. Notes Comput. Sci. ; 1450)
 
Nissen, Marco
- u.a.: How generic language extensions enable "open-world" desing in Java. -
Saarbrücken : Max-Planck-Institut für Informatik, 1999, 40 S. - (Research
Report ; MPI-I-1999-1-004)
 
- Integration of Graph Iterators into LEDA. - Saarbrücken : Max-Planck-
Institut für Informatik, 1999, 39 S. - (Research Report ; MPI-I-1999-1-006)
 
Nonnengart, Andreas
- A Deductive Model Checking Approach for Hybrid Systems. - Saarbrücken :
Max-Planck-Institut für Informatik, 1999, 40 S. - (Research Report ; MPI-I-
1999-2-006)
 
- u.a.: A Fixpoint Approach to Second-Order Quantifier Elimination with
Applications to Correspondence Theory. - In: Logic at Work: Essays Dedicated
to the Memory of Helena Rasiowa / Ed.: Orlowska, Ewa. - Berlin : Springer,
1999, S. 18. - (Studies in Fuzziness and Soft Computing ; 24)
 
Nutov, Zeev
- u.a.: A 2-approximation algorithm for finding an optimum 3-vertex-
connected spanning subgraph. - In: Journal of Algorithms, 32 (1999), S. 21-30
 
- u.a.: A 3-approximation algorithm for finding optimum 4,5-vertex-connected
spanning subgraphs. - In: Journal of Algorithms, 32 (1999), S. 21-30
 
Podelski, Andreas
- u.a.: Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata. -
In: Proc. 19th Conf. on Foundations of Software Technology and Theoretical
Computer Science (FST&TCS-99) / Ed.: Ramanujam, R .. - Berlin : Springer,
1999, S. 232-244. - (Lect. Notes Comput. Sci. ; 1738)
 
- u.a.: Constraint-Based Analysis of Broadcast Protocols. - In: Proc. 13th
Int. Workshop on Computer Science Logic (CSL-99), 8th Annual Conf. on the
EACSL / Ed.: Flum, Jörg .. - Berlin : Springer, 1999, S. 50-66. - (Lect. Notes
Comput. Sci. ; 1683)
 
- u.a.: Model Checking in CLP. - In: Proc. 5th Int. Conf. on Tools and
Algorithms for Construction and Analysis of Systems (TACAS-99) / Ed.:
Cleaveland, Rance. - Berlin : Springer, 1999, S. 223-239. - (Lect. Notes
Comput. Sci. ; 1579)
 
- u.a.: Set-based Failure Analysis for Logic Programs and Concurrent
Constraint Programs. - In: Proceedings of ESOP'99, the European Symposium of
Programing / ED.: Swierstra, S. Doaitse. - Springer, 1999. - (LNCS)
 
- u.a.: Set-based Failure Analysis for Logic Programs and Concurrent
Constraint Programs. - In: Programming Languages and Systems: Proc. 8th
European Symp. on Programming (ESOP-99) / Ed.: Swierstra, S. Doaitse. - Berlin
: Springer, 1999, S. 177-192. - (Lect. Notes Comput. Sci. ; 1576)
 
Rajamani, Sriram K.
- u.a.: Formal specification and verification of a dataflow processor array.
- In: Proc. IEEE/ACM Int. Conf. on Computer-aided Design (ICCAD-99). - Los
Alamitos : IEEE Computer Society, 1999, S. 494-499
 
Ramos, Edgar
- u.a.: Curve reconstruction: Connecting dots with good reason. - In: Proc.
15th Annual Symp. on Computational Geometry (SCG-99). - New York : ACM, 1999,
S. 197-206
 
- u.a.: I/O-optimal computation of segment intersections. - In: Proc. DIMACS
Workshop on External Algorithms and Visualization / Ed.: Abello, James M. .. -
Providence : AMS, 1999, S. 131-138. - (DIMACS Series in Discrete Mathematics
and Theoretical Computer Science ; 50)
 
- On range reporting, ray shooting and k-level construction. - In: Proc.
15th Annual Symp. on Computational Geometry (SCG-99). - New York : ACM, 1999,
S. 390-399
 
Raskin, Jean-Francois
- u.a.: Axioms for Real-Time Logics. - Saarbrücken : Max-Planck-Institut für
Informatik, 1999, 31 S. - (Research Report ; MPI-I-1999-3-005)
 
- u.a.: Fully Decidable Logics, Automata and Classical Theories for Defining
Regular Real-Time Languages. - Saarbrücken : Max-Planck-Institut für
Informatik, 1999, 102 S. - (Research Report ; MPI-I-1999-3-003)
 
- u.a.: The Logic of Event Clocks. - Saarbrücken : Max-Planck-Institut für
Informatik, 1999, 41 S. - (Research Report ; MPI-I-1999-3-002)
 
- u.a.: Model-Generation of a Fictitious Clock Real-Time Logic Using Sharing
Trees. - In: Proc. 1st Int. Workshop on Symbolic Model Checking (SMC-99). -
Amsterdam : Elsevier, 1999, S. 19. - (Electronic Notes in Theoretical Computer
Science ; 23)
 
- u.a.: Proving a conjecture of Andreka on temporal logic. - Saarbrücken :
Max-Planck-Institut für Informatik, 1999, 13 S. - (Research Report ; MPI-I-
1999-3-004)
 
- u.a.: Symbolic Representation of Upward-closed Sets. - Saarbrücken : Max-
Planck-Institut für Informatik, 1999, 24 S. - (Research Report ; MPI-I-1999-2-
007)
 
Reinert, Knut
- u.a.: An exact solution for the segment-to-segment multiple sequence
alignment problem. - In: Bioinformatics, 15 (1999), S. 203-210
 
Rössl, Christian
- u.a.: Approximation and Visualization of Discrete Curvature on
Triangulated Surfaces. - In: Proc. 4th Conf. on Vision, Modeling, and
Visualization (VMV-99) / Ed.: Girod, Bernd .. - Sankt Augustin : infix, 1999,
S. 339-346
 
Rüb, Christine
- u.a.: Simulating synthetic polymer chains in parallel. - In: Proc. 7th
Int. Conf. on High-Performance Computing and Networking Europe (HPCN Europe-
99) / Ed.: Sloot, Peter .. - Berlin : Springer, 1999, S. 13-22. - (Lect.
Notes Comput. Sci. ; 1593)
 
Sanders, Peter
- Accessing Multiple Sequences Through Set Associative Caches. - In: Proc.
26th Int. Colloquium on Automata, Languages and Programming (ICALP-99) / Ed.:
Wiedermann, J. .. - Berlin : Springer, 1999, S. 655-664. - (Lect. Notes
Comput. Sci. ; 1644)
 
- Analysis of nearest neighbor load balancing algorithms for random loads. -
In: Parallel Computing, 25 (1999), S. 1013-1033
 
- Asynchronous Random Polling Dynamic Load Balancing. - In: Proc. 10th Int.
Symp. on Algorithms and Computation (ISAAC-99) / Ed.: Aggarwal, Alok .. -
Berlin : Springer, 1999, S. 37-48. - (Lect. Notes Comput. Sci. ; 1741)
 
- Berechnungen mit großen Datenmengen. - In: Jahrbuch der Max-Planck-
Gesellschaft 1999 / Ed.: Plehn, Gottfried .. - Göttingen : Vandenhoeck &
Ruprecht, 1999, S. 534-540
 
- u.a.: A case study in scalability: an ADI method for the two-dimensional
time- dependent Dirac equation. - In: Parallel Computing, 25 (1999), S. 525-
534
 
- u.a.: Fast Concurrent Access to Parallel Disks. - Saarbrücken : Max-Planck-
Institut für Informatik, 1999, 30 S. - (Research Report ; MPI-I-1999-1-003)
 
- Fast Priority Queues for Cached Memory. - In: Selected papers of the Int.
Workshop on Algorithm Engineering and Experimentation (ALENEX-99) / Ed.:
Goodrich, Michael T. .. - Berlin : Springer, 1999, S. 312-327. - (Lect. Notes
Comput. Sci. ; 1619)
 
- u.a.: High performance integer optimization for crew scheduling. - In:
Proc. 7th Int. Conf. on High-Performance Computing and Networking Europe (HPCN
Europe-99) / Ed.: Sloot, Peter .. - Berlin : Springer, 1999, S. 3-12. - (Lect.
Notes Comput. Sci. ; 1593)
 
Scheel, Annette
- u.a.: Efficient Glossy Global Illumination with Interactive Viewing. - In:
Graphics Interface '99 (GI-99) / Ed.: MacKenzie, I. Scott .. - San Francisco :
Morgan Kaufmann, 1999, S. 50-57
 
- u.a.: Perception-based Radiosity. - In: Proc. 4th Conf. on Vision,
Modeling, and Visualization (VMV-99) / Ed.: Girod, Bernd .. - Sankt Augustin :
infix, 1999, S. 293-300
 
Schilz, Thomas
- u.a.: Checking geometric programs or verification of geometric structures.
- In: Computational Geometry: Theory and Applications, 12 (1999), S. 85-104
 
Schirmacher, Hartmut
- u.a.: Adaptive Acquisition of Lumigraphs from Synthetic Scenes. - In:
Proc. 20th Annual Conf. ot the European Association of Computer Graphics
(Eurographics-99) / Ed.: Brunet, Pere .. - Oxford : Blackwell, 1999, C-151-C-
160. - (Computer Graphics Forum ; 18)
 
- u.a.: Image-Based BRDF Reconstruction. - In: Proc. 4th Conf. on Vision,
Modeling, and Visualization (VMV-99) / Ed.: Girod, Bernd .. - Sankt Augustin :
Infix, 1999, S. 285-292
 
- u.a.: A Warping-based Refinement of Lumigraphs. - In: Proc. 7th Int. Conf.
in Central Europe on Computer Graphics, Visualization and Interactive Digital
Media (WSCG-99) / Ed.: Skala, Vaclav. - Plzen : University of West Bohemia,
1999, S. 102-109
 
Schirra, Stefan
- A Case Study on the Cost of Geometric Computing. - In: Selected papers of
the Int. Workshop on Algorithm Engineering and Experimentation (ALENEX-99) /
Ed.: Goodrich, Michael T. .. - Berlin : Springer, 1999, S. 156-176. - (Lect.
Notes Comput. Sci. ; 1619)
 
- u.a.: Checking geometric programs or verification of geometric structures.
- In: Computational Geometry: Theory and Applications, 12 (1999), S. 85-104
 
- u.a.: Efficient exact geometric computation made easy. - In: Proc. 15th
Annual Symp. on Computational Geometry (SCG-99). - New York : ACM, 1999, S.
341-350
 
Schmidt, Renate A.
- Decidability by Resolution for Propositional Modal Logics. - In: Journal
of Automated Reasoning, 22 (1999), S. 379-396
 
- u.a.: An Empirical Analysis of Modal Theorem Provers. - In: Journal of
Applied Non-Classical Logics, 9 (1999), S. 479-522
 
- u.a.: Maslov's Class K Revisited. - In: Proc. 16th Int. Conf. on Automated
Deduction (CADE-16) / Ed.: Ganzinger, Harald. - Berlin : Springer, 1999, S.
172-186. - (Lect. Notes Artif. Intell. ; 1632)
 
- u.a.: On the relation of resolution and tableaux proof systems for
description logics. - In: Proc. 16th Int. Joint Conf. on Artificial
Intelligence (IJCAI-99). - San Francisco : Morgan Kaufmann, 1 (1999), S. 110-
115
 
Schneider, Robert
- u.a.: Mesh Reduction and Interactive Multiresolution Modeling on Arbitrary
Triangle Meshes. - In: Proc. 15th Spring Conf. on Computer Graphics (SCCG-99)
/ Ed.: Zára, Jirí. - Bratislava : Comenius University, 1999, S. 34-44
 
Schobbens, Pierre-Yves
- u.a.: Axioms for Real-Time Logics. - Saarbrücken : Max-Planck-Institut für
Informatik, 1999, 31 S. - (Research Report ; MPI-I-1999-3-005)
 
- u.a.: Fully Decidable Logics, Automata and Classical Theories for Defining
Regular Real-Time Languages. - Saarbrücken : Max-Planck-Institut für
Informatik, 1999, 102 S. - (Research Report ; MPI-I-1999-3-003)
 
- u.a.: The Logic of Event Clocks. - Saarbrücken : Max-Planck-Institut für
Informatik, 1999, 41 S. - (Research Report ; MPI-I-1999-3-002)
 
- u.a.: Model-Generation of a Fictitious Clock Real-Time Logic Using Sharing
Trees. - In: Proc. 1st Int. Workshop on Symbolic Model Checking (SMC-99). -
Amsterdam : Elsevier, 1999, S. 19. - (Electronic Notes in Theoretical Computer
Science ; 23)
 
- u.a.: Proving a conjecture of Andreka on temporal logic. - Saarbrücken :
Max-Planck-Institut für Informatik, 1999, 13 S. - (Research Report ; MPI-I-
1999-3-004)
 
Seel, Michael
- u.a.: Checking geometric programs or verification of geometric structures.
- In: Computational Geometry: Theory and Applications, 12 (1999), S. 85-104
 
- u.a.: A simple way to recognize a correct Voronoi diagram of line
segments. - Saarbrücken : Max-Planck-Institut für Informatik, 1999, 11 S. -
(Research Report ; MPI-I-1999-1-007)
 
Seidel, Hans-Peter
- u.a.: Adaptive Acquisition of Lumigraphs from Synthetic Scenes. - In:
Proc. 20th Annual Conf. ot the European Association of Computer Graphics
(Eurographics-99) / Ed.: Brunet, Pere .. - Oxford : Blackwell, 1999, C-151-C-
160. - (Computer Graphics Forum ; 18)
 
- u.a.: Applications of Pixel Textures in Visualization and Realistic Image
Synthesis. - In: Proc. 1999 ACM Symp. on Interactive 3D Graphics (I3DG-99) /
Ed.: Hodgins, Jessica .. - New York : ACM, 1999, S. 127-134
 
- u.a.: Image-Based BRDF Reconstruction. - In: Proc. 4th Conf. on Vision,
Modeling, and Visualization (VMV-99) / Ed.: Girod, Bernd .. - Sankt Augustin :
Infix, 1999, S. 285-292
 
- u.a.: Light Field Techniques for Reflections and Refractions. - In:
Rendering Techniques '99: Proc. 10th Eurographics Workshop on Rendering (EGRW-
99) / Ed.: Lischinski, Dani .. - Wien : Springer, 1999, S. 196-197
 
- u.a.: Mesh Reduction and Interactive Multiresolution Modeling on Arbitrary
Triangle Meshes. - In: Proc. 15th Spring Conf. on Computer Graphics (SCCG-99)
/ Ed.: Zára, Jirí. - Bratislava : Comenius University, 1999, S. 34-44
 
- u.a.: Perception-based Radiosity. - In: Proc. 4th Conf. on Vision,
Modeling, and Visualization (VMV-99) / Ed.: Girod, Bernd .. - Sankt Augustin :
infix, 1999, S. 293-300
 
- u.a.: Photon Tracing with RenderMan Light Source Shaders. - In: Proc. 4th
Conf. on Vision, Modeling, and Visualization (VMV-99) / Ed.: Girod, Bernd .. -
Sankt Augustin : infix, 1999, S. 277-284
 
- u.a.: Realistic, Hardware-accelerated Shading and Lighting. - In: Computer
Graphics (SIGGRAPH-99) : Conf. proceedings / Ed.: Rockwood, Alyn. - New York :
ACM, 1999, S. 171-178
 
- u.a.: A Shrink Wrapping Approach to Remeshing Polygonal Surfaces. - In:
Proc. 20th Annual Conf. ot the European Association of Computer Graphics
(Eurographics-99) / Ed.: Brunet, P. .. - Oxford : Blackwell, 1999, C-119-C-
129. - (Computer Graphics Forum ; 18)
 
- u.a.: sqrt(3)-Subdivision and Forward Adaptive Refinement. - In: Proc.
Israelian/Korean workshop on Geometric Modeling and Computer Graphics. 1999,
S. 245-252
 
- u.a.: A Warping-based Refinement of Lumigraphs. - In: Proc. 7th Int. Conf.
in Central Europe on Computer Graphics, Visualization and Interactive Digital
Media (WSCG-99) / Ed.: Skala, Vaclav. - Plzen : University of West Bohemia,
1999, S. 102-109
 
Seiden, Steve
- Randomized online scheduling with delivery times. - In: Journal of
Combinatorial Optimization, 3 (1999), S. 399-416
 
Sibeyn, Jop F.
- Better Deterministic Routing on Meshes. - In: Proc. 13th Int. Parallel
Processing Symp., and 10th Symposium on Parallel and Distributed Processing
(IPPS/SPDP-99). - Los Alamitos : IEEE Computer Society, 1999, S. 420-425
 
- External Selection. - In: Proc. 16th Annual Symp. on Theoretical Aspects
of Computer Science (STACS-99) / Ed.: Meinel, Christoph .. - Berlin :
Springer, 1999, S. 291-301. - (Lect. Notes Comput. Sci. ; 1563)
 
- u.a.: Parallel and External List Ranking and Connected Components on a
Cluster of Workstations. - In: Proc. 11th Int. Conf. on Parallel and
Distributed Computing and Systems (PDCS-99) / Ed.: Zheng, S. Q. - Anaheim :
IASTED, 1999, S. 454-460
 
- Power and Limitations of Optical Reconfigurable Arrays. - In: Proc. 6th
Int. Colloquium on Structural Information and Communication Complexity
(SIROCCO 6) / Ed.: Gavoille, Cyril .. - Waterloo : Carleton Scientific, 1999,
S. 249-263. - (Proceedings in Informatics ; 5)
 
- u.a.: Practical Parallel List Ranking. - In: Journal of Parallel and
Distributed Computing, 56 (1999), S. 156-180
 
- Row-Major Sorting on Meshes. - In: SIAM Journal on Computing, 28 (1999),
S. 847-863
 
- Ultimate Parallel List Ranking?. - In: Proc. 6th Int. Conf. on High
Performance Computing (HiPC-99) / Ed.: Banerjee, Prith .. - Berlin : Springer,
1999, S. 197-201. - (Lect. Notes Comput. Sci. ; 1745)
 
- Ultimate Parallel List Ranking ?. - Saarbrücken : Max-Planck-Institut für
Informatik, 1999, 20 S. - (Research Report ; MPI-I-1999-1-005)
 
Smid, Michiel
- u.a.: Efficient algorithms for counting and reporting pairwise
intersections between convex polygons. - In: Information Processing Letters,
69 (1999), S. 7-13
 
Sofronie-Stokkermans, Viorica
- u.a.: Modeling Interaction by Sheaves and Geometric Logic. - In: Proc.
12th Int. Symp. Fundamentals of Computation Theory (FCT-99) / Ed.: Ciobanu,
Gabriel .. - Berlin : Springer, 1999, S. 512-523. - (Lect. Notes Comput. Sci.
; 1684)
 
- On the Universal Theory of Varieties of Distributive Lattices with
Operators: Some Decidability and Complexity Results. - In: Proc. 16th Int.
Conf. on Automated Deduction (CADE-16) / Ed.: Ganzinger, Harald. - Berlin :
Springer, 1999, S. 157-171. - (Lect. Notes Artif. Intell. ; 1632)
 
- Priestley representation for distributive lattices with operators and
applications to automated theorem proving. - In: Dualities, Interpretability
and Ordered Structures / Ed.: Vaz de Carvalho, Júlia .. - Lisbon : Centro de
Algebra da Universidade de Lisboa, 1999, S. 43-54
 
- Representation Theorems and Automated Theorem Proving in Non-Classical
Logics. - In: Proc. 29th IEEE Int. Symp. on Multiple-Valued Logic (ISMVL-99). -
Los Alamitos : IEEE Computer Society, 1999, S. 242-247
 
- Resolution-based theorem proving for non-classical logics based on
distributive lattices with operators. - In: Proc. 11th Int. Congress of Logic,
Methodology and Philosophy of Science. Volume of abstracts / Ed.: Cachro,
Jacek .. - Cracow : The Faculty of Philosophy, Jagellonian University, 1999,
S. 481
 
Solis-Oba, Roberto
- u.a.: Approximation algorithms for bounded facility location. - In: Proc.
5th Annual Int. Conf. on Computing and Combinatorics (COCOON-99) / Ed.: Asano,
T. .. - Berlin : Springer, 1999, S. 241-250. - (Lect. Notes Comput. Sci. ;
1627)
 
- u.a.: A linear time approximation scheme for the job shop scheduling
problem. - In: Proc. 3rd Int. Workshop on Randomization and Approximation
Techniques in Computer Science, and 2nd International Workshop on
Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-
APPROX-99) / Ed.: Hochbaum, Dorit .. - Berlin : Springer, 1999, S. 177-188. -
(Lect. Notes Comput. Sci. ; 1671)
 
- u.a.: Makespan minimization in job shops: a polynomial time approximation
scheme. - In: Proc. 31st Annual ACM Symp. on Theory of Computing (STOC-99). -
New York : ACM, 1999, S. 394-399
 
Stamminger, Marc
- u.a.: Efficient Glossy Global Illumination with Interactive Viewing. - In:
Graphics Interface '99 (GI-99) / Ed.: MacKenzie, I. Scott .. - San Francisco :
Morgan Kaufmann, 1999, S. 50-57
 
- u.a.: Photon Tracing with RenderMan Light Source Shaders. - In: Proc. 4th
Conf. on Vision, Modeling, and Visualization (VMV-99) / Ed.: Girod, Bernd .. -
Sankt Augustin : infix, 1999, S. 277-284
 
Stuber, Jürgen
- Theory path orderings. - In: Proc. 10th Int. Conf. on Rewriting Techniques
and Applications (RTA-99) / Ed.: Narendran, Paliath .. - Berlin : Springer,
1999, S. 148-162. - (Lect. Notes Comput. Sci. ; 1631)
 
Subramanian, C. R.
- A Generalization of Janson inequalities and its application to finding
shortest paths. - In: Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms
(SODA-99). - New York : ACM, 1999, S. 795-804
 
- Minimum Coloring k-Colorable Graphs in Polynomial Average Time. - In:
Journal of Algorithms, 33 (1999), S. 112-123
 
Talbot, Jean-Marc
- u.a.: Entailment of Atomic Set Constraints is PSPACE-Complete. - In:
Fourteenth annual IEEE Symposium on Logic in Computer Science : LICS99. - IEEE
Press, 1999, S. 285-294
 
- u.a.: Entailment of Atomic Set Constraints is PSPACE-Complete. - In: Proc.
14th Annual IEEE Symp. on Logic in Computer Science (LICS-99) / Ed.: Longo,
Giuseppe. - Los Alamitos : IEEE Computer Society, 1999, S. 285-294
 
Theobalt, Christian
- u.a.: System Description: SPASS Version 1.0.0. - In: Proc. 16th Int. Conf.
on Automated Deduction (CADE-16) / Ed.: Ganzinger, Harald. - Berlin :
Springer, 1999, S. 314-318. - (Lect. Notes Artif. Intell. ; 1632)
 
Topic, Dalibor
- u.a.: System Description: SPASS Version 1.0.0. - In: Proc. 16th Int. Conf.
on Automated Deduction (CADE-16) / Ed.: Ganzinger, Harald. - Berlin :
Springer, 1999, S. 314-318. - (Lect. Notes Artif. Intell. ; 1632)
 
Tzakova, Miroslava
- u.a.: Hybrid Languages and Temporal Logic. - In: Logic Journal of the
IGPL, 7 (1999), S. 27-54
 
- Tableau Calculi for Hybrid Logics. - In: Proc. Int. Conf. TABLEAUX'99 -
Automated Reasoning with Analytic Tableaux and Related Methods / Ed.: Murray,
Neil V. - Berlin : Springer, 1999, S. 278-292. - (Lect. Notes Artif. Intell. ;
1617)
 
Uhrig, Christian
- u.a.: Checking geometric programs or verification of geometric structures.
- In: Computational Geometry: Theory and Applications, 12 (1999), S. 85-104
 
van der Torre, Leendert W. N.
- u.a.: Contextual Deontic Logic: violation contexts and factual
defeasibility. - In: Formal Aspects in Context / Ed.: Cavalcanti, Marcos. -
Dordrecht : Kluwer, 1999, S. 173-192. - (Applied Logic Series)
 
- Defeasible Goals. - In: Proc. 5th European Conf. on Symbolic and
Quantitative Approaches to Reasoning and Uncertainty (ECSQARU-99) / Ed.:
Hunter, Anthony .. - Berlin : Springer, 1999, S. 374-385. - (Lect. Notes
Artif. Intell. ; 1638)
 
- u.a.: Diagnosis and Decision Making in Normative Reasoning. - In: Journal
of Artificial Intelligence and Law, 7 (1999), S. 51-67
 
- u.a.: Rights, Duties and Commitments Between Agents. - In: Proc. 16th Int.
Joint Conf. on Artificial Intelligence (IJCAI-99). - San Francisco : Morgan
Kaufmann, 2 (1999), S. 1239-1244
 
- u.a.: An Update Semantics for Defeasible Obligations. - In: Proc. 15th
Conf. on Uncertainty in Artificial Intelligence (UAI-99) / Ed.: Laskey,
Kathryn B. .. - San Francisco : Morgan Kaufmann, 1999, S. 631-638
 
- u.a.: An update semantics for deontic reasoning. - In: Norms, Logics and
Information Systems: New Studies on Deontic Logic and Computer Science / Ed.:
McNamara, Paul .. - Amsterdam : IOS, 1999, S. 73-90. - (Frontiers in
Artificial Intelligence and Applications ; 49)
 
Veanes, Margus
- u.a.: Decidable fragments of simultaneous rigid reachability. -
Saarbrücken : Max-Planck-Institut für Informatik, 1999, 19 S. - (Research
Report ; MPI-I-1999-2-004)
 
- u.a.: Decidable fragments of simultaneous rigid reachability. - In: Proc.
26th Int. Colloquium on Automata, Languages and Programming (ICALP-99) / Ed.:
Wiedermann, Jiri .. - Berlin : Springer, 1999, S. 250-260. - (Lect. Notes
Comput. Sci. ; 1644)
 
- u.a.: Logic with Equality: Partisan Corroboration and Shifted Pairing. -
In: Information and Computation, 152 (1999), S. 205-235
 
- u.a.: The Two-Variable Guarded Fragment with Transitive Relations. - In:
Proc. 14th Annual IEEE Symp. on Logic in Computer Science (LICS-99) / Ed.:
Longo, Giuseppe. - Los Alamitos : IEEE Computer Society, 1999, S. 24-34
 
Vorobyov, Sergei
- New Lower Bounds for the Expressiveness and the Higher-Order Matching
Problem in the Simply Typed Lambda Calculus. - Saarbrücken : Max-Planck-
Institut für Informatik, 1999, 20 S. - (Research Report ; MPI-I-1999-3-001)
 
- Subtyping Functional+Nonempty Record Types. - In: Proc. 12th Int. Workshop
on Computer Science Logic (CSL-98), Annual Conf. on the EACSL / Ed.: Gottlob,
Georg .. - Berlin : Springer, 1999, S. 285-297. - (Lect. Notes Comput. Sci. ;
1584)
 
Voronkov, Andrei
- The ground-negative fragment of first-order logics is \pi^p2-complete. -
In: The Journal of Symbolic Logic, 64 (1999), S. 984-990
 
Vorsatz, Jens
- u.a.: Mesh Reduction and Interactive Multiresolution Modeling on Arbitrary
Triangle Meshes. - In: Proc. 15th Spring Conf. on Computer Graphics (SCCG-99)
/ Ed.: Zára, Jirí. - Bratislava : Comenius University, 1999, S. 34-44
 
- u.a.: Multiresolution hierarchies on unstructured triangle meshes. - In:
Computational Geometry, 14 (1999), S. 5-24
 
- u.a.: Robust Multi-Band Detail Encoding for Triangular Meshes of Arbitrary
Connectivity. - In: Proc. 4th Conf. on Vision, Modeling, and Visualization
(VMV-99) / Ed.: Girod, Bernd .. - Sankt Augustin : infix, 1999, S. 245-252
 
- u.a.: A Shrink Wrapping Approach to Remeshing Polygonal Surfaces. - In:
Proc. 20th Annual Conf. ot the European Association of Computer Graphics
(Eurographics-99) / Ed.: Brunet, P. .. - Oxford : Blackwell, 1999, C-119-C-
129. - (Computer Graphics Forum ; 18)
 
Waldmann, Uwe
- Cancellative Superposition Decides the Theory of Divisible Torsion-Free
Abelian Groups. - In: Proc. 6th Int. Conf. on Logic for Programming and
Automated Reasoning (LPAR-99) / Ed.: Ganzinger, Harald .. - Berlin : Springer,
1999, S. 131-147. - (Lect. Notes Artif. Intell. ; 1705)
 
- Cancellative Superposition Decides the Theory of Divisible Torsion-Free
Abelian Groups. - Saarbrücken : Max-Planck-Institut für Informatik, 1999, 23
S. - (Research Report ; MPI-I-1999-2-003)
 
Wang, Yongge
- Randomness, Stochasticity, and Approximation. - In: Theory of Computing
Systems, 32 (1999), S. 517-529
 
Weidenbach, Christoph
- SPASS V0.95TPTP. - In: Journal of Automated Reasoning, 23 (1999), S. 21-21
 
- u.a.: System Description: SPASS Version 1.0.0. - In: Proc. 16th Int. Conf.
on Automated Deduction (CADE-16) / Ed.: Ganzinger, Harald. - Berlin :
Springer, 1999, S. 314-318. - (Lect. Notes Artif. Intell. ; 1632)
 
- Towards an Automatic Analysis of Security Protocols in First-Order Logic. -
In: Proc. 16th Int. Conf. on Automated Deduction (CADE-16) / Ed.: Ganzinger,
Harald. - Berlin : Springer, 1999, S. 378-382. - (Lect. Notes Artif. Intell. ;
1632)
 
Weihe, Karsten
- u.a.: How generic language extensions enable "open-world" desing in Java. -
Saarbrücken : Max-Planck-Institut für Informatik, 1999, 40 S. - (Research
Report ; MPI-I-1999-1-004)
 
Weiskircher, René
- u.a.: Optimizing Over All Combinatorial Embeddings of a Planar Graph. -
In: Proc. 7th Int. Conf. on Integer Programming and Combinatorial Optimization
(IPCO-99) / Ed.: Cornuéjols, Gérard .. - Berlin : Springer, 1999, S. 361-376. -
(Lect. Notes Comput. Sci. ; 1610)
 
Weydert, Emil
- JZBR - Iterated Belief Change for Conditional Ranking Constraints. - In:
Spinning Ideas - Electronic Essays Dedicated to Peter Gaerdenfors on His
Fiftieth Birthday / Ed.: de Leon, David .. - Lund : Lund University Cognitive
Science, 1999, S. 1-11
 
- JZBR - Iterated Belief Change for Conditional Ranking Constraints. - In:
Proc. 4th Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their
Applications (DGNMR-99) / Ed.: Rott, Hans .. - Amsterdam : ILLC Scientific
Publications, 1999, S. 57-66
 
Wu, Jinzhao
- Symmetries in Logic Programs. - Saarbrücken : Max-Planck-Institut für
Informatik, 1999, 44 S. - (Research Report ; MPI-I-1999-2-005)
 
Zeilfelder, Frank
- u.a.: Interpolation by splines on triangulations. - In: New Developments
in Approximation Theory. 2nd Int. Dortmund Meeting (IDoMAT) &Alig;98 / Ed.: Müller,
M. W. .. - Basel : Birkhäuser, 1999, S. 49-70. - (International Series of
Numerical Mathematics ; 132)
 
- Strong unicity of best uniform approximation from periodic spline spaces. -
In: Journal of Approximation Theory, 99 (1999), S. 1-29
 
Ziegelmann, Mark
- u.a.: An Easy to Use Implementation of Linear Perturbations within CGAL. -
In: Proc. 3rd Int. Workshop on Algorithm Engineering (WAE-99) / Ed.: Vitter,
Jeffrey S. .. - Berlin : Springer, 1999, S. 169-182. - (Lect. Notes Comput.
Sci. ; 1668)
 
Ziegler, Thomas
- u.a.: The constrained crossing minimization problem: a first approach. -
In: Operations Research Proceedings 1998 / Ed.: Kall, Peter .. - Berlin :
Springer, 1999, S. 125-134