| # |  | Year | Title | |
|---|
| 1 |
 | Aït-Kaci, Hanus, Navarro |
| |
| | 1994 | Integration of declarative paradigms: Proceedings of the ICLP'94 Post-Conference Workshop, Santa Margherita Ligure, Italy | |
| 1 |
| Ajwani, Malinger, Meyer, Toledo |
| |
| | 2008 | Characterizing the performance of Flash memory storage devices and its impact on algorithm design | |
| 2 |
| Albers |
| |
| | 1997 | Better bounds for online scheduling | |
| | 1992 | The influence of lookahead in competitive on-line algorithms | |
| 1 |
| |
| | 1997 | Minimizing stall time in single and parallel disk systems | |
| 1 |
| |
| | 1994 | Improved parallel integer sorting without concurrent writing | |
| 1 |
| |
| | 1997 | Exploring unknown environments | |
| 1 |
| |
| | 1994 | New on-line algorithms for the page replication problem | |
| 1 |
| |
| | 1998 | Scheduling with unexpected machine breakdowns | |
| 1 |
| |
| | 1996 | A survey of self-organizing data structures | |
| 1 |
| Alberts, Gutwenger, Mutzel, Näher |
| |
| | 1997 | AGD-Library: A Library of Algorithms for Graph Drawing | |
| 1 |
| Albrecht, Kipp, Neff, Seidel |
| |
| | 2006 | Gesture modeling and animation by imitation | |
| 1 |
| |
| | 2007 | A Lagrangian relaxation approach for the multiple sequence alignment problem | |
| 1 |
| Althaus, Kohlbacher, Lenhof, Müller |
| |
| | 2000 | A branch and cut algorithm for the optimal solution of the side-chain placement problem | |
| 1 |
| |
| | 1997 | Maximum network flow with floating point arithmetic | |
| 1 |
| Althaus, Polzin, Daneshmand |
| |
| | 2003 | Improving linear programming approaches for the Steiner tree problem | |
| 1 |
| |
| | 1991 | A lower bound for the nondeterministic space complexity of contextfree recognition | |
| 1 |
| Alt, Guibas, Mehlhorn, Karp, Widgerson |
| |
| | 1992 | A method for obtaining randomized algorithms with small tail probalities | |
| 1 |
| |
| | 2012 | Building and maintaining halls of fame over a database | |
| 2 |
| Anand, Bedathur, Berberich, Schenkel |
| |
| | 2011 | Temporal index sharding for space-time efficiency in archive search | |
| | 2010 | Efficient temporal keyword queries over versioned text | |
| 1 |
| Anand, Mele, Bedathur, Berberich |
| |
| | 2014 | Phrase Query Optimization on Inverted Indexes | |
| 1 |
| Andersson, Nilsson, Hagerup, Raman |
| |
| | 1995 | Sorting in linear time? | |
| 1 |
| Angelova, Siersdorfer |
| |
| | 2006 | A neighborhood-based approach for clustering of linked document collections | |
| 1 |
| Antoy, Echahed, Hanus |
| |
| | 1993 | A needed narrowing strategy | |
| 1 |
| Arikati |
| |
| | 1994 | On the parallel complexity of degree sequence problems | |
| 1 |
| Arikati, Chaudhuri, Zaroliagis |
| |
| | 1996 | All-pairs min-cut in sparse networks | |
| 1 |
| Arikati, Maheshwari |
| |
| | 1994 | Realizing degree sequences in parallel | |
| 2 |
| Arikati, Maheshwari, Zaroliagis |
| |
| | 1995 | Efficient computation of implicit representations of sparse graphs (revised version) | |
| | 1994 | Efficient computation of compact representations of sparse graphs | |
| 1 |
| |
| | 1994 | Dynamic algorithms for geometric spanners of small diameter: randomized solutions | |
| 1 |
| |
| | 1994 | Efficient construction of a bounded degree spanner with low weight | |
| 1 |
| |
| | 1995 | A multi-dimensional terminological knowledge representation language | |
| 1 |
| |
| | 1991 | Associative-commutative reduction orderings | |
| 7 |
| |
| | 1997 | A theory of resolution | |
| | 1997 | Strict basic superposition and chaining | |
| | 1995 | Ordered chaining calculi for first-order theories of binary relations | |
| | 1993 | Associative-commutative superposition | |
| | 1993 | Ordered chaining for total orderings | |
| | 1993 | Rewrite techniques for transitive relations | |
| | 1991 | Rewrite-based equational theorem proving with selection and simplification | |
| 1 |
| Bachmair, Ganzinger, Lynch, Snyder |
| |
| | 1993 | Basic paramodulation | |
| 1 |
| Bachmair, Ganzinger, Voronkov |
| |
| | 1997 | Elimination of equality via transformation with ordering constraints | |
| 1 |
| |
| | 2007 | A nonlinear viseme model for triphone-based speech synthesis | |
| 1 |
| |
| | 1994 | A method for implementing lock-free shared data structures | |
| 1 |
| |
| | 1994 | Time-space lower bounds for directed s-t connectivity on JAG models | |
| 1 |
| |
| | 1994 | Short random walks on graphs | |
| 1 |
| |
| | 1992 | A recursion planning analysis of inductive completion | |
| 3 |
| |
| | 1995 | A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization | |
| | 1994 | Linear 0-1 inequalities and extended clauses | |
| | 1992 | CLP($\cal PB$): A Meta-Interpreter in CLP($\cal R$) | |
| 2 |
| |
| | 1995 | Modelling mixed-integer optimisation problems in constraint logic programming | |
| | 1994 | Finite domain and cutting plane techniques in CLP($\cal PB$) | |
| 1 |
| Basin |
| |
| | 1994 | Logic frameworks for logic programs | |
| 1 |
| Basin, Bundy, Kraan, Matthews |
| |
| | 1993 | A framework for program development based on schematic proof | |
| 1 |
| Basin, Constable |
| |
| | 1992 | Metalogical frameworks | |
| 1 |
| Basin, Ganzinger |
| |
| | 1995 | Automated complexity analysis based on ordered resolution | |
| 1 |
| Basin, Hähnle, Fronhöfer, Posegga, Schwind (ed.) |
| |
| | 1993 | Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993 | |
| 1 |
| Basin, Klarlund |
| |
| | 1996 | Beyond the finite in automatic hardware verification | |
| 1 |
| Basin, Kraan, Bundy |
| |
| | 1993 | Middle-out reasoning for logic program synthesis | |
| 1 |
| Basin, Matthews |
| |
| | 1993 | A conservative extension of first-order logic and its application to theorem proving | |
| 3 |
| Basin, Matthews, Viganò |
| |
| | 1997 | Labelled modal logics: quantifiers | |
| | 1996 | Labelled propositional modal logics: theory and practice | |
| | 1996 | Natural deduction for non-classical logics | |
| 3 |
| Basin, Walsh |
| |
| | 1994 | Termination orderings for rippling | |
| | 1992 | Difference matching | |
| | 1992 | Difference unification | |
| 1 |
| Bast, Hagerup |
| |
| | 1993 | Fast parallel space allocation, estimation and integer sorting (revised) | |
| 1 |
| Bast, Majumdar, Schenkel, Theobald, Weikum |
| |
| | 2006 | IO-Top-k: index-access optimized top-k query processing | |
| 1 |
| Bast, Weber, Mortensen |
| |
| | 2006 | Output-sensitive autocompletion search | |
| 1 |
| Baswana, Telikepalli |
| |
| | 2005 | Improved algorithms for all-pairs approximate shortest paths in weighted graphs | |
| 1 |
| Baumeister |
| |
| | 1996 | Using algebraic specification languages for model-oriented specifications | |
| 1 |
| Baumgarten, Jung, Mehlhorn |
| |
| | 1992 | Dynamic point location in general subdivisions | |
| 1 |
| Baumgartner, Waldmann |
| |
| | 2013 | Hierarchic superposition with weak abstraction | |
| 1 |
| Bedathur, Berberich, Dittrich, Mamoulis, Weikum |
| |
| | 2009 | Scalable phrase mining for ad-hoc text analytics | |
| 1 |
| Beier, Sibeyn |
| |
| | 2000 | A powerful heuristic for telephone gossiping | |
| 1 |
| Beier, Vöcking |
| |
| | 2003 | Random knapsack in expected polynomial time | |
| 1 |
| Bekaert, Slusallek, Cools, Havran, Seidel |
| |
| | 2003 | A custom designed density estimation method for light transport | |
| 1 |
| Beldiceanu, Katriel, Thiel |
| |
| | 2004 | Filtering algorithms for the Same and UsedBy constraints | |
| 1 |
| Belyaev, Langer, Seidel |
| |
| | 2006 | Mean value coordinates for arbitrary spherical polygons and
polyhedra in $\mathbbR^3$ | |
| 1 |
| Belyaev, Seidel, Yoshizawa |
| |
| | 2006 | Skeleton-driven Laplacian mesh deformations | |
| 1 |
| Bender, Michel, Weikum, Triantafilou |
| |
| | 2006 | Overlap-aware global df estimation in distributed information retrieval systems | |
| 1 |
| Berberich, Bedathur |
| |
| | 2012 | Computing n-gram statistics in MapReduce | |
| 1 |
| Berberich, Bedathur, Alonso, Weikum |
| |
| | 2010 | A language modeling approach for temporal information needs | |
| 2 |
| Berberich, Bedathur, Neumann, Weikum |
| |
| | 2007 | A time machine for text search | |
| | 2007 | A Time Machine for Text Search | |
| 1 |
| |
| | 2007 | Linear-time reordering in a sweep-line algorithm for algebraic curves intersecting in a common point | |
| 1 |
| Berner, Bokeloh, Wand, Schilling, Seidel |
| |
| | 2009 | Generalized intrinsic symmetry detection | |
| 1 |
| Berner, Burghard, Wand, Mitra, Klein, Seidel |
| |
| | 2011 | A morphable part model for shape manipulation | |
| 1 |
| Bilardi, Chaudhuri, Dubhashi, Mehlhorn |
| |
| | 1993 | A lower bound for area-universal graphs | |
| 1 |
| Björklund, Petersson, Vorobyov |
| |
| | 2001 | Experiments with iterative improvement algorithms on completely unimodel hypercubes | |
| 2 |
| |
| | 1998 | Hybrid languages and temporal logic | |
| | 1997 | Two hybrid logics | |
| 1 |
| Blanchet |
| |
| | 2004 | Automatic proof of strong secrecy for security protocols | |
| 2 |
| Bockmayr |
| |
| | 1994 | Cutting planes in constraint logic programming | |
| | 1991 | Logic programming with pseudo-Boolean constraints | |
| 2 |
| |
| | 1999 | Cutting planes and the elementary closure in fixed dimension | |
| | 1997 | On the Chvátal rank of polytopes in the 0/1 cube | |
| 1 |
| Bockmayr, Kasper |
| |
| | 1997 | A unifying framework for integer and finite domain constraint programming | |
| 1 |
| Bockmayr, Krischer, Werner |
| |
| | 1993 | Narrowing strategies for arbitrary canonical rewrite systems | |
| 1 |
| Bockmayr, Radermacher |
| |
| | 1993 | Künstliche Intelligenz und Operations Research | |
| 1 |
| Bodlaender, Hagerup |
| |
| | 1995 | Parallel algorithms with optimal speedup for bounded treewidth | |
| 1 |
| Boghossian, Kohlbacher, Lenhof |
| |
| | 1999 | BALL: Biochemical Algorithms Library | |
| 1 |
| Borchert, Ranjan |
| |
| | 1993 | The circuit subfunction relations are $sum^P_2$-complete | |
| 1 |
| Bradford |
| |
| | 1995 | Matching nuts and bolts optimally | |
| 1 |
| Bradford, Capoyleas |
| |
| | 1995 | Weak epsilon-nets for points on a hypersphere | |
| 1 |
| Bradford, Fleischer |
| |
| | 1995 | Matching nuts and bolts faster | |
| 1 |
| Bradford, Fleischer, Smid |
| |
| | 1995 | A polylog-time and $O(n\sqrt\lg n)$-work parallel algorithm for finding the row minima in totally monotone matrices | |
| 1 |
| Bradford, Reinert |
| |
| | 1996 | Lower bounds for row minima searching | |
| 1 |
| Brandenburg, Jünger, Mutzel |
| |
| | 1997 | Algorithmen zum automatischen Zeichnen von Graphen | |
| 1 |
| Breslauer, Jiang, Jiang |
| |
| | 1996 | Rotations of periodic strings and short superstrings | |
| 1 |
| Brink, Britz, Schmidt |
| |
| | 1992 | Peirce algebras | |
| 1 |
| Brink, Gabbay, Ohlbach |
| |
| | 1993 | Towards automating duality | |
| 1 |
| Brodal |
| |
| | 1997 | Finger search trees with constant insertion time | |
| 1 |
| Brodal, Chaudhuri, Radhakrishnan |
| |
| | 1996 | The randomized complexity of maintaining the minimum | |
| 1 |
| Brodal, Pinotti |
| |
| | 1998 | Comparator networks for binary heap construction | |
| 1 |
| Brodal, Träff, Zaroliagis |
| |
| | 1997 | A parallel priority queue with constant time operations | |
| 1 |
| Brönniman, Kettner, Schirra, Veltkamp |
| |
| | 1998 | Applications of the generic programming paradigm in the design of CGAL | |
| 1 |
| Broschart, Schenkel |
| |
| | 2010 | Real-time text queries with tunable term pair indexes | |
| 1 |
| Burkhardt, Crauser, Ferragina, Lenhof, Rivals, Vingron |
| |
| | 1998 | $q$-gram based database searching using a suffix array (QUASAR) | |
| 2 |
| Burnikel |
| |
| | 1998 | Delaunay graphs by divide and conquer | |
| | 1998 | Rational points on circles | |
| 1 |
| |
| | 1996 | High-precision floating point numbers in LEDA | |
| 1 |
| Burnikel, Mehlhorn, Schirra |
| |
| | 1996 | The LEDA class real number | |
| 1 |
| |
| | 1999 | A simple way to recognize a correct Voronoi diagram of line segments | |
| 1 |
| |
| | 1998 | Fast recursive division | |
| 1 |
| |
| | 2004 | On the Hadwiger's conjecture for graph products | |
| 1 |
| |
| | 2003 | Girth and treewidth | |
| 1 |
| |
| | 1999 | Automata on DAG representations of finite trees | |
| 1 |
| |
| | 2002 | Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi | |
| 1 |
| |
| | 1993 | Negativ set constraints: an easy proof of decidability | |
| 1 |
| |
| | 1997 | Solving set constraints for greatest models | |
| 1 |
| |
| | 2002 | Atomic set constraints with projection | |
| 1 |
| |
| | 1994 | On the intellectual terrain around NP | |
| 2 |
| |
| | 1993 | A lower bound for linear approximate compaction | |
| | 1993 | Sensitive functions and approximate problems | |
| 1 |
| Chaudhuri, Hagerup |
| |
| | 1994 | Prefix graphs and their applications | |
| 1 |
| Chaudhuri, Hagerup, Raman |
| |
| | 1993 | Approximate and exact deterministic parallel selection | |
| 1 |
| Chaudhuri, Radhakrishnan |
| |
| | 1993 | The complexity of parallel prefix problems on small domains | |
| 2 |
| Chaudhuri, Zaroliagis |
| |
| | 1995 | Shortest paths in digraphs of small treewidth part II: optimal parallel algirithms | |
| | 1995 | Shortest paths in digraphs of small treewidth sequential algorithms | |
| 1 |
| Cheriyan, Hagerup, Mehlhorn |
| |
| | 1991 | An $O(n^3)$-time maximum-flow algorithm | |
| 1 |
| |
| | 1991 | Algorithms for dense graphs and networks | |
| 1 |
| |
| | 1994 | On characteristic points and approximate decision algorithms for the minimum Hausdorff distance | |
| 2 |
| |
| | 2001 | Linear one-sided stability of MAT for weakly injective domain | |
| | 2000 | Hyperbolic Hausdorff distance for medial axis transform | |
| 1 |
| Christof, Jünger, Kececioglou, Mutzel, Reinelt |
| |
| | 1996 | A branch-and-cut approach to physical mapping with end-probes | |
| 1 |
| Clarkson, Mehlhorn, Seidel |
| |
| | 1992 | Four results on randomized incremental constructions | |
| 1 |
| Cortier, Ganzinger, Jacquemard, Veanes |
| |
| | 1999 | Decidable fragments of simultaneous rigid reachability | |
| 1 |
| Crauser, Ferragina |
| |
| | 1999 | A theoretical and experimental study on the construction of suffix arrays in external memory | |
| 1 |
| Crauser, Ferragina, Mehlhorn, Meyer, Ramos |
| |
| | 1998 | Randomized external-memory algorithms for some geometric problems | |
| 1 |
| Crauser, Mehlhorn, Althaus, Brengel, Buchheit, Keller, Krone, Lambert, Schulte, Thiel, Westphal, Wirth |
| |
| | 1998 | On the performance of LEDA-SM | |
| 1 |
| Csaba |
| |
| | 2003 | On the Bollob\'as -- Eldridge conjecture for bipartite graphs | |
| 1 |
| Cunningham, Wang |
| |
| | 1997 | Restricted 2-factor polytopes | |
| 1 |
| Cvetkovic |
| |
| | 1993 | The logic of preference and decision supporting systems | |
| 1 |
| Das, Kapoor, Smid |
| |
| | 1996 | On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees | |
| 1 |
| Daubert, Heidrich, Kautz, Dischler, Seidel |
| |
| | 2001 | Efficient light transport using precomputed visibility | |
| 1 |
| De Aguiar, Theobalt |
| |
| | 2007 | ? | |
| 1 |
| de Aguiar, Zayer, Theobalt, Magnor, Seidel |
| |
| | 2006 | A framework for natural animation of digitized models | |
| 1 |
| de Melo, Suchanek, Pease |
| |
| | 2008 | Integrating Yago into the suggested upper merged ontology | |
| 1 |
| de Melo, Weikum |
| |
| | 2009 | Towards a Universal Wordnet by learning from combined evidenc | |
| 1 |
| de Nivelle, Kazakov |
| |
| | 2004 | Resolution decision procedures for the guarded fragment with transitive guards | |
| 1 |
| de Nivelle, Schulz |
| |
| | 2001 | Proceeding of the Second International Workshop of the Implementation of Logics | |
| 1 |
| De Simone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi |
| |
| | 1996 | Exact ground states of two-dimensional $\pm J$ Ising Spin Glasses | |
| 1 |
| Degtyarev, Voronkov |
| |
| | 1998 | Equality reasoning in sequent-based calculi | |
| 1 |
| Delzanno, Podelski |
| |
| | 1998 | Model checking infinite-state systems in CLP | |
| 1 |
| Delzanno, Raskin |
| |
| | 1999 | Symbolic representation of upward-closed sets | |
| 1 |
| Devillers, Golin, Schirra, Kedem |
| |
| | 1994 | Revenge of the dog: queries on Voronoi diagrams of moving points | |
| 1 |
| Diehl, De Simone, Jünger, Mutzel, Reinelt, Rinaldi |
| |
| | 1995 | Exact ground states of Ising spin classes: new experimental results with a branch and cut algorithm | |
| 1 |
| Dietzfelbinger, Tamaki |
| |
| | 2003 | On the probability of rendezvous in graphs | |
| 1 |
| Dietzfelbinger, Woelfel |
| |
| | 2003 | Almost random graphs with simple hash functions | |
| 1 |
| Diks, Hagerup |
| |
| | 1996 | More geneal parallel tree contraction: Register allocation and broadcasting in a tree | |
| 1 |
| Dimopoulos |
| |
| | 1994 | Classical methods in nonmonotonic reasoning | |
| 1 |
| Dimopoulos, Magirou, Papadimitriou |
| |
| | 1993 | On kernels, defaults and even graphs | |
| 1 |
| Dimopoulos, Torres |
| |
| | 1993 | Graph theoretical structures in logic programs and default theories | |
| 2 |
| Djidjev, Pantziou, Zaroliagis |
| |
| | 1994 | On-line and dynamic algorithms for shortest path problems | |
| | 1994 | On-line and Dynamic Shortest Paths through Graph Decompositions (Preliminary Version) | |
| 1 |
| |
| | 2004 | Faster ray tracing with SIMD shaft culling | |
| 1 |
| Dobrindt, Mehlhorn, Yvinec |
| |
| | 1993 | A complete and efficient algorithm for the intersection of a general convex polyhedron | |
| 1 |
| Drago, Martens, Myszkowski, Seidel |
| |
| | 2002 | Perceptual evaluation of tone mapping operators with regard to similarity and preference | |
| 1 |
| |
| | 1993 | Quantifier elimination in p-adic fields | |
| 1 |
| Dubhashi, Mehlhorn, Ranjan, Thiel |
| |
| | 1993 | Searching, sorting and randomised algorithms for central elements and ideal counting in posets | |
| 1 |
| |
| | 1994 | Near-optimal distributed edge | |
| 1 |
| Dubhashi, Pantziou, Spirakis, Zaroliagis |
| |
| | 1995 | The fourth moment in Luby`s distribution | |
| 1 |
| |
| | 1996 | Negative dependence through the FKG Inequality | |
| 3 |
| |
| | 1998 | On positive influence and negative dependence | |
| | 1994 | Some correlation inequalities for probabilistic analysis of algorithms | |
| | 1994 | Stochastic majorisation: exploding some myths | |
| 1 |
| Dyken, Ziegler, Theobalt, Seidel |
| |
| | 2007 | HistoPyramids in Iso-Surface Extraction | |
| 1 |
| Dylla, Miliaraki, Theobald |
| |
| | 2012 | Top-k query processing in probabilistic databases with non-materialized views | |
| 1 |
| |
| | 2014 | Learning Tuple Probabilities in Probabilistic Databases | |
| 1 |
| Efremov, Mantiuk, Myszkowski, Seidel |
| |
| | 2006 | Design and evaluation of backward compatible high dynamic range video compression | |
| 1 |
| Eigenwillig, Kettner, Wolpert |
| |
| | 2006 | Snap rounding of Bézier curves | |
| 3 |
| |
| | 2003 | Fast integer programming in fixed dimension | |
| | 2000 | Short vectors of planar lattices via continued fractions | |
| | 1998 | A note on the membership problem for the first elementary closure of a polyhedron | |
| 1 |
| |
| | 1991 | Deduction systems based on resolution | |
| 1 |
| Elbassuoni, Ramanath, Weikum |
| |
| | 2010 | Query relaxation for entity-relationship search | |
| 1 |
| Fabri, Giezeman, Kettner, Schirra, Schönherr |
| |
| | 1998 | On the Design of CGAL, the Computational Geometry Algorithms Library | |
| 1 |
| |
| | 2000 | Low-contention depth-first scheduling of parallel computations with synchronization variables | |
| 1 |
| |
| | 1997 | On-line network routing - a survey | |
| 1 |
| Fietzke, Kruglov, Weidenbach |
| |
| | 2012 | Automatic generation of inductive invariants by SUP(LA) | |
| 1 |
| |
| | 2008 | Labelled splitting | |
| 1 |
| |
| | 1996 | Runtime prediction of real programs on real machines | |
| 5 |
| |
| | 1997 | On the Bahncard problem | |
| | 1994 | Komplexitätstheorie und effiziente Algorithmen | |
| | 1992 | A new lower bound technique for decision trees | |
| | 1992 | A simple balanced search tree with 0(1) worst-case update time | |
| | 1991 | A tight lower bound for the worst case of bottom-up-heapsort | |
| 1 |
| Fleischer, Mehlhorn, Rote, Welzl |
| |
| | 1991 | Simultaneous inner and outer aproximation of shapes | |
| 1 |
| |
| | 1998 | Robustness analysis in combinatorial optimization | |
| 1 |
| Frigioni, Marchetti-Spaccamela, Nanni |
| |
| | 1998 | Fully dynamic shortest paths and negative cycle detection on diagraphs with Arbitrary Arc Weights | |
| 1 |
| Fuchs, Blanz, Lensch, Seidel |
| |
| | 2005 | Reflectance from images: a model-based approach for human faces | |
| 1 |
| Fuchs, Chen, Wang, Raskar, Lensch, Seidel |
| |
| | 2009 | A shaped temporal filter camera | |
| 1 |
| Fuchs, Goesele, Chen, Seidel |
| |
| | 2005 | An emperical model for heterogeneous translucent objects | |
| 1 |
| Funke, Laue, Naujoks, Zvi |
| |
| | 2007 | Power assignment problems in wireless communication | |
| 3 |
| |
| | 1994 | LDS - Labelled Deductive Systems: Volume 1 - Foundations | |
| | 1993 | Classical vs non-classical logics: the universality of classical logic | |
| | 1992 | Temporal logic: Mathematical foundations | |
| 1 |
| Gabbay, Hodkinson, Reynolds |
| |
| | 1992 | Temporal logic: Mathematical foundations, part 2 | |
| 1 |
| |
| | 1992 | Quantifier elimination in second-order predicate logic | |
| 1 |
| Gall, Brox, Rosenhahn, Seidel |
| |
| | 2007 | Global stochastic optimization for robust and accurate human motion capture | |
| 1 |
| Gall, Potthoff, Rosenhahn, Schnoerr, Seidel |
| |
| | 2006 | Interacting and annealing particle filters: mathematics and a recipe for applications | |
| 1 |
| |
| | 2007 | Clustered stochastic optimization for object recognition and pose estimation | |
| 2 |
| Ganzinger, Bachmair, Waldmann |
| |
| | 1993 | Superposition with simplification as a decision procedure for the monadic class with equality | |
| | 1992 | Set constraints are the Monadic class | |
| 1 |
| Ganzinger, Jacquemard, Veanes |
| |
| | 1998 | Rigid reachability | |
| 1 |
| Ganzinger, Waldmann |
| |
| | 1996 | Theorem proving in cancellative abelian monoids | |
| 1 |
| Garg |
| |
| | 1997 | Approximating sparsest cuts | |
| 1 |
| Garg, Chaudhuri, Ravi |
| |
| | 1996 | Generalized $k$-Center Problems | |
| 1 |
| Garg, Könemann |
| |
| | 1997 | Faster and simpler algorithms for multicommodity flow and other fractional packing problems | |
| 1 |
| Garg, Konjevod, Ravi |
| |
| | 1997 | A polylogarithmic approximation algorithm for group Steiner tree problem | |
| 1 |
| Garg, Manss |
| |
| | 1997 | Evaluating a 2-approximation algorithm for edge-separators in planar graphs | |
| 1 |
| Garg, Papatriantafilou, Tsigas |
| |
| | 1996 | Distributed list coloring: how to dynamically allocate frequencies to mobile base stations | |
| 1 |
| Gasieniec, Indyk, Krysta |
| |
| | 1996 | External inverse pattern matching | |
| 1 |
| Gasieniec, Jansson, Lingas, Östlin |
| |
| | 1996 | On the complexity of computing evolutionary trees | |
| 1 |
| Gidenstam, Papatriantafilou |
| |
| | 2007 | LFthreads: a lock-free thread library | |
| 1 |
| Goesele, Kautz, Lang, Lensch, Seidel |
| |
| | 2002 | Tutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models | |
| 2 |
| Golin, Raman, Schwarz, Smid |
| |
| | 1993 | Randomized Data Structures for the Dynamic Closest-Pair Problem | |
| | 1992 | Simple randomized algorithms for closest pair problems | |
| 1 |
| Gotsman, Kaligosi, Mehlhorn, Michail, Pyrga |
| |
| | 2005 | Cycle bases of graphs and sampled manifolds | |
| 3 |
| |
| | 1994 | Substitution tree indexing | |
| | 1992 | Path indexing for term retrieval | |
| | 1992 | Path Indexing for Term Retrieval | |
| 2 |
| |
| | 1993 | Extended path-indexing | |
| | 1993 | Extended path-Indexing | |
| 1 |
| Granados, Kim, Theobalt |
| |
| | 2013 | HDR reconstruction of cluttered dynamic scenes | |
| 1 |
| Granados, Tompkin, In Kim, Grau, Kautz, Theobalt |
| |
| | 2011 | How not to be seen – inpainting dynamic objects in crowded scenes | |
| 1 |
| Grandoni |
| |
| | 2002 | Incrementally maintaining the number of l-cliques | |
| 6 |
| Grolmusz |
| |
| | 1993 | Harmonic analysis, real approximation, and the communication complexity of Boolean functions | |
| | 1993 | MOD m gates do not help on the ground floor | |
| | 1993 | Multi-party protocols and spectral norms | |
| | 1993 | On multi-party communication complexity of random functions | |
| | 1992 | Circuits and multi-party protocols | |
| | 1992 | Separating the communication complexities of MOD m and MOD p circuits | |
| 1 |
| Gunopulos, Mannila, Saluja |
| |
| | 1996 | Discovering all most specific sentences by randomized algorithms | |
| 1 |
| |
| | 2016 | Diversifying Search Results Using Time | |
| 5 |
| |
| | 1996 | A technique for adding range restrictions to generalized searching problems | |
| | 1996 | Efficient algorithms for counting and reporting pairwise intersections between convex polygons | |
| | 1994 | Fast algorithms for collision and proximity problems involving moving geometric objects | |
| |  1993 | Algorithms for some intersection searching problems involving curved objects | |
| | | | |
| | 1993 | Effizient algorithms for generalized intersection searching on non-iso-oriented objects | |
| 1 |
| Gupta, Janardan, Smid, Dasgupta |
| |
| | 1994 | The rectangle enclosure and point-dominance problems revisited | |
| 1 |
| Gurevich, Veanes |
| |
| | 1998 | Partisan corroboration, and shifted pairing | |
| 1 |
| Haber, Schmitt, Koster, Seidel |
| |
| | 2004 | Modeling hair using a wisp hair model | |
| 1 |
| Haber, Seidel |
| |
| | 1999 | A framework for evaluating the quality of lossy image compression | |
| 7 |
| Hagerup |
| |
| | 1998 | Simpler and faster static AC$^0$ dictionaries | |
| | 1997 | Datenstrukturen und Algorithmen | |
| | 1996 | Vorlesungsskript Komplexitätstheorie | |
| | 1993 | Optimal parallel string algorithms: sorting, merching and computing the minimum | |
| | 1992 | Fast deterministic processor allocation | |
| | 1991 | Fast parallel space allocation, estimation an integer sorting | |
| | 1991 | On a compaction theorem of ragde | |
| 1 |
| Hagerup, Kutylowski |
| |
| | 1992 | Fast integer merging on the EREW PRAM | |
| 1 |
| Hagerup, Maas |
| |
| | 1993 | Generalized topological sorting in linear time | |
| 1 |
| Hagerup, Mehlhorn, Munro |
| |
| | 1992 | not published | |
| 1 |
| Hagerup, Raman |
| |
| | 1992 | Waste makes haste: tight bounds for loose parallel sorting | |
| 1 |
| Hangelbroek, Nürnberger, Roessl, Seidel, Zeilfelder |
| |
| | 2003 | The dimension of $C^1$ splines of arbitrary degree on a tetrahedral partition | |
| 5 |
| Hanus |
| |
| | 1994 | On extra variables in (Equational) logic programming | |
| | 1994 | The integration of functions into logic programming: a survey | |
| | 1993 | Lazy unification with inductive simplification | |
| | 1992 | An abstract interpretation algorithm for residuating logic programs | |
| | 1992 | Analysis of nonlinear constraints in CLP(R) | |
| 1 |
| Hanus, Josephs |
| |
| | 1993 | A debugging model for functional logic programs | |
| 1 |
| Havran, Herzog, Seidel |
| |
| | 2006 | On fast construction of spatial hierarchies for ray tracing | |
| 1 |
| Havran, Zajac, Drahokoupil, Seidel |
| |
| | 2009 | MPI Informatics building model as data for your research | |
| 1 |
| Heffernan, Schirra |
| |
| | 1991 | Approximate decision algorithms for point set congruence | |
| 1 |
| Henzinger, Leonardi |
| |
| | 1998 | Scheduling multicasts on unit-capacity trees and meshes | |
| 2 |
| Henzinger, Raskin, Schobbens |
| |
| | 1999 | Axioms for real-time logics | |
| | 1999 | Fully decidable logics, automata and classical theories for defining regular real-time languages | |
| 1 |
| Hert, Hoffmann, Kettner, Pion, Seel |
| |
| | 2001 | An adaptable and extensible geometry kernel | |
| 1 |
| Hert, Polzin, Kettner, Schäfer |
| |
| | 2002 | Exp Lab: a tool set for computational experiments | |
| 1 |
| |
| | 1996 | SCAN and systems of conditional logic | |
| 1 |
| Herzog, Havran, Myszkowski, Seidel |
| |
| | 2007 | Global illumination using photon ray splatting | |
| 2 |
| |
| | 2007 | Superposition for finite domains | |
| | 2007 | Superpositon for Finite Domains | |
| 1 |
| Hoefer |
| |
| | 2002 | Performance of heuristic and approximation algorithms for the uncapacitated facility location problem | |
| 1 |
| Hoepmann, Papatriantafilou, Tsigas |
| |
| | 1995 | Towards self-stabilizing wait-free shared memory objects | |
| 1 |
| Hoffart, Suchanek, Berberich, Weikum |
| |
| | 2010 | YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia | |
| 1 |
| Hoffmann, Gomes, Selman |
| |
| | 2005 | Bottleneck behavior in CNF formulas | |
| 1 |
| Hopf (ed.) |
| |
| | 1994 | Genetic algorithms within the framework of evolutionary computation: Proceedings of the KI-94 Workshop | |
| 3 |
| Horbach, Weidenbach |
| |
| | 2010 | Decidability results for saturation-based model building | |
| | 2009 | Deciding the inductive validity of $\forall\exists^*$ queries | |
| | 2009 | Superposition for fixed domains | |
| 1 |
| Hromkovic, Müller, Sýkora, Vrto |
| |
| | 1991 | On embeddings in cycles | |
| 1 |
| Huang, Kavitha |
| |
| | 2010 | Maximum cardinality popular matchings in strict two-sided preference lists | |
| 1 |
| Hullin, Ajdin, Hanika, Seidel, Kautz, Lensch |
| |
| | 2009 | Acquisition and analysis of bispectral bidirectional reflectance distribution functions | |
| 2 |
| Hustadt |
| |
| | 1992 | Unification and matching in Church's Original Lambda Calculus | |
| | 1991 | A complete transformation system for polymorphic higher-order unification | |
| 3 |
| Hustadt, Nonnengart, Schmidt, Timm |
| |
| | 1992 | Motel user manual | |
| | 1992 | Motel User Manual | |
| | 1992 | Motel User Manual | |
| 1 |
| |
| | 1997 | On evaluating decision procedures for modal logic | |
| 1 |
| Ivrissimtzis, Jeong, Lee, Lee, Seidel |
| |
| | 2004 | Neural meshes: surface reconstruction with a learning algorithm | |
| 1 |
| Ivrissimtzis, Jeong, Seidel |
| |
| | 2003 | Neural meshes: statistical learning methods in surface reconstruction | |
| 1 |
| Jacquemard, Meyer, Weidenbach |
| |
| | 1998 | Unification in extensions of shallow equational theories | |
| 2 |
| |
| | 2003 | A representation theorem and applications to measure selection and noninformative priors | |
| | 1994 | A probabilistic extension of terminological logics | |
| 2 |
| Jansen |
| |
| | 1998 | A new characterization for parity graphs and a coloring problem with costs | |
| | 1998 | The mutual exclusion scheduling problem for permutation and comparability graphs | |
| 2 |
| |
| | 1998 | Improved approximation schemes for scheduling unrelated parallel machines | |
| | 1998 | Linear-time approximation schemes for scheduling malleable parallel tasks | |
| 1 |
| Johann, Socher-Ambrosius |
| |
| | 1993 | Solving simplifications ordering constraints | |
| 2 |
| Jünger, Leipert, Mutzel |
| |
| | 1998 | A note on computing a maximal planar subgraph using PQ-trees | |
| | 1997 | Pitfalls of using PQ--Trees in automatic graph drawing | |
| 2 |
| |
| | 1996 | 2-Layer straigthline crossing minimization: performance of exact and heuristic algorithms | |
| | 1995 | Exact and heuristic algorithms for 2-layer straightline crossing minimization | |
| 1 |
| Jünger, Mutzel, Odenthal, Scharbrodt |
| |
| | 1995 | The thickness of a minor-excluded class of graphs | |
| 1 |
| Jung, Lenhof, Müller, Rüb |
| |
| | 1997 | Parallel algorithms for MD-simulations of synthetic polymers | |
| 1 |
| Kapoor |
| |
| | 1995 | Dynamic maintenance of 2-d convex hulls and order decomposable problems | |
| 1 |
| Kapoor, Smid |
| |
| | 1993 | New techniques for exact and approximate dynamic closest-point problems | |
| 1 |
| Kargaris, Pantziou, Tragoudas, Zaroliagis |
| |
| | 1994 | Quickest paths: faster algorithms and dynamization | |
| 1 |
| Karpinksi, Zelikovsky |
| |
| | 1994 | Further improvements of Steiner tree approximations | |
| 1 |
| Kasneci, Ramanath, Sozio, Suchanek, Weikum |
| |
| | 2008 | STAR: Steiner tree approximation in relationship-graphs | |
| 1 |
| Kasneci, Suchanek, Ifrim, Ramanath, Weikum |
| |
| | 2007 | NAGA: searching and ranking knowledge | |
| 1 |
| Kasneci, Weikum, Elbassuoni |
| |
| | 2009 | MING: Mining Informative Entity-Relationship Subgraphs | |
| 1 |
| Kasnec, Suchanek, Weikum |
| |
| | 2006 | Yago - a core of semantic knowledge | |
| 1 |
| Katriel |
| |
| | 2004 | On algorithms for online topological ordering and sorting | |
| 1 |
| Katriel, Kutz |
| |
| | 2005 | A faster algorithm for computing a longest common increasing
subsequence | |
| 1 |
| Katriel, Kutz, Skutella |
| |
| | 2005 | Reachability substitutes for planar digraphs | |
| 1 |
| Katriel, Sanders, Träff |
| |
| | 2002 | A practical minimum spanning tree algorithm using the cycle property | |
| 1 |
| Katriel, Thiel |
| |
| | 2003 | Fast bound consistency for the global cardinality constraint | |
| 1 |
| Kaufmann, Meyer, Sibeyn |
| |
| | 1994 | Towards practical permutation routing on meshes | |
| 1 |
| Kautz, Heidrich, Daubert |
| |
| | 2000 | Bump map shadows for openGL rendering | |
| 1 |
| Kavvadias, Pantziou, Spirakis, Zaroliagis |
| |
| | 1994 | Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems | |
| 1 |
| Kazakov |
| |
| | 2005 | A Framework of refutational theorem proving for saturation-based decision procedures | |
| 1 |
| Kazakov, de Nivelle |
| |
| | 2003 | Subsumption of concepts in $DL$ $\cal FL_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete | |
| 1 |
| Kerber |
| |
| | 2006 | Division-free computation of subresultants using bezout matrices | |
| 1 |
| Kerber, Bokeloh, Wand, Seidel |
| |
| | 2012 | Symmetry detection in large scale city scans | |
| 1 |
| Kim, Kwon, Kim, Theobalt |
| |
| | 2011 | Efficient learning-based image enhancement : application to
compression artifact removal and super-resolution | |
| 1 |
| Kim, Tompkin, Theobalt |
| |
| | 2014 | Local high-order regularization on data manifolds | |
| 2 |
| Klau, Mutzel |
| |
| | 1998 | Optimal compaction of orthogonal grid drawings | |
| | 1998 | Quasi-orthogonal drawing of planar graphs | |
| 1 |
| |
| | 1993 | Randomized incremental construction of abstract Voronoi diagrams | |
| 1 |
| Kobbelt, Bischoff, Kähler, Schneider, Botsch, Rössl, Vorsatz |
| |
| | 2000 | Geometric modeling based on polygonal meshes | |
| 1 |
| Könemann, Schmitz, Schwarz |
| |
| | 1995 | Radix heaps an efficient implementation for priority queues | |
| 1 |
| |
| | 2003 | Sum-Multicoloring on paths | |
| 1 |
| |
| | 1992 | Logic program synthesis via proof planning | |
| 1 |
| Krawczyk, Goesele, Seidel |
| |
| | 2005 | Photometric calibration of high dynamic range cameras
| |
| 1 |
| Krithivasan, Vanisree, Datta |
| |
| | 1992 | The largest hyper-rectangle in a three dimensional orthogonal polyhedron | |
| 1 |
| |
| | 2001 | Approximating minimum size 1,2-connected networks | |
| 1 |
| |
| | 2003 | Selfish traffic allocation for server farms | |
| 1 |
| |
| 1 |
| '{s} |
| |
| | 1998 | New approximation algorithms for the achromatic number | |
| 1 |
| Krysta, Sanders, Vöcking |
| |
| | 2003 | Scheduling and traffic allocation for tasks with bounded splittability | |
| 3 |
| Kucera |
| |
| | 1993 | Broadcasting through a noisy one-dimensional network | |
| | 1993 | Coloring k-colorable graphs in expected parallel time | |
| | 1993 | Expected complexity of graph partitioning problems | |
| 1 |
| Langer, Belyaev, Seidel |
| |
| | 2005 | Analysis and design of discrete normals and curvatures | |
| 1 |
| Langer, Seidel |
| |
| | 2007 | Construction of smooth maps with mean value coordinates | |
| 2 |
| Lenhof |
| |
| | 1997 | New contact measures for the protein docking problem | |
| | 1995 | An algorithm for the protein docking problem | |
| 3 |
| |
| | 1992 | Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity | |
| | 1992 | Sequential and parallel algorithms for the k closest pairs problem | |
| | 1991 | An optimal construction method for generalized convex layers | |
| 1 |
| |
| | 2001 | A framework for the acquisition, processing and interactive display of high quality 3D models | |
| 1 |
| Lensch, Kautz, Goesele, Heidrich, Seidel |
| |
| | 2001 | Image-based reconstruction of spatially varying materials | |
| 1 |
| Lensch, Kautz, Goesele, Seidel |
| |
| | 2001 | A framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the Web | |
| 1 |
| Leonardi, Marchetti-Spaccamela |
| |
| | 1997 | Randomized on-line call control revisited | |
| 1 |
| |
| | 1997 | The practical use of the $\calA^*$ algorithm for exact multiple sequence alignment | |
| 1 |
| |
| | 2011 | Towards verification of the pastry protocol using TLA+ | |
| 3 |
| |
| | 1994 | A survey of program transformation with special reference to unfold/fold style program development | |
| | 1994 | Formal methods of automated program improvement | |
| | 1994 | Recursive program optimization through inductive synthesis proof transformation | |
| 1 |
| |
| | 1994 | A general technique for automatically optimizing programs through the use of proof plans | |
| 1 |
| |
| | 2004 | Axisymmetric reconstruction and 3D visualization of bipolar planetary nebulae | |
| 1 |
| |
| | 1996 | Derandomizing semidefinite programming based approximation algorithms | |
| 1 |
| Mahajan, Ramos, Subrahmanyam |
| |
| | 1998 | Solving some discrepancy problems in NC* | |
| 2 |
| |
| | 2004 | Intuitionistic LTL and a new characterization of safety and liveness | |
| | 2003 | Compositional circular assume-guarantee rules cannot be sound and complete | |
| 1 |
| Maier, Charatonik, Georgieva |
| |
| | 2005 | Bounded model checking of pointer programs | |
| 1 |
| Makari, Gemulla, Khandekar, Mestre, Sozio |
| |
| | 2013 | A distributed algorithm for large-scale generalized matching | |
| 2 |
| Matthews |
| |
| | 1993 | A theory and its metatheory in FS 0 | |
| | 1992 | Reflection in logical systems | |
| 1 |
| |
| | 1994 | Reflection using the derivability conditions | |
| | 1993 | *No Title | |
| 1 |
| Matthews, Smaill, Basin |
| |
| | 1992 | Experience with FS0 as a framework theory | |
| 1 |
| Mavronicolas, Papatriantafilou, Tsigas |
| |
| | 1996 | The impact of timing on linearizability in counting networks | |
| 1 |
| Mehlhorn |
| |
| | 1993 | An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm | |
| 1 |
| Mehlhorn (ed.) |
| |
| | 1998 | 2nd Workshop on Algorithm Engineering WAE '98 - Proceedings | |
| 1 |
| Mehlhorn, Meiser, Rasch |
| |
| | 1992 | Furthest site abstract Voronoi diagrams | |
| 1 |
| Mehlhorn, Mutzel |
| |
| | 1994 | On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm | |
| 1 |
| Mehlhorn, Näher |
| |
| | 1994 | Implementation of a sweep line algorithm for the Straight \& Line Segment Intersection Problem | |
| 1 |
| Mehlhorn, Näher, Schirra, Seel, Uhrig |
| |
| | 1996 | A computational basis for higher-dimensional computational geometry | |
| 1 |
| Mehlhorn, Schirra |
| |
| | 2000 | Generalized and improved constructive separation bound for real algebraic expressions | |
| 2 |
| Mehlhorn, Sharir, Welzl |
| |
| | 1993 | Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection | |
| | 1991 | Tail estimates for the space complexity of randomized incremantal algorithms | |
| 1 |
| |
| | 1993 | Maintaining dynamic sequences under equality-tests in polylogorithmic time | |
| 1 |
| |
| | 1992 | A lower bound for set intersection queries | |
| 1 |
| |
| | 2001 | Directed single-source shortest-paths in linear average-case time | |
| 1 |
| |
| | 1998 | Time-independent gossiping on full-port tori | |
| 1 |
| |
| | 2005 | Rank-maximal through maximum weight matchings | |
| 1 |
| |
| | 1991 | Natural semantics and some of its meta-theory in Elf | |
| 1 |
| |
| | 2012 | MDL4BMF: Minimum Description Length for Boolean Matrix Factorization | |
| 1 |
| |
| | 2015 | ? | |
| 1 |
| |
| | 2016 | ? | |
| 1 |
| |
| | 1994 | An implementation of a Convex Hull Algorithm, Version 1.0 | |
| 3 |
| |
| | 1997 | An alternative method to crossing minimization on hierarchical graphs | |
| | 1995 | A polyhedral approach to planar augmentation and related problems | |
| | 1995 | Automatisiertes Zeichnen von Diagrammen | |
| 1 |
| Mutzel, Odenthal, Scharbrodt |
| |
| | 1996 | The thickness of graphs: a survey | |
| 1 |
| |
| | 1998 | Optimizing over all combinatorial embeddings of a planar graph | |
| 1 |
| |
| | 1993 | LEDA-Manual Version 3.0 | |
| 1 |
| |
| | 1995 | LEDA user manual (version R 3.2) | |
| 1 |
| |
| | 2008 | Single phase construction of optimal DAG-structured QEPs | |
| 2 |
| |
| | 2009 | The RDF-3X engine for scalable management of RDF data | |
| | 2009 | The RDF-3X engine for scalable management of RDF data | |
| 1 |
| Nieuwenhuis |
| |
| | 1992 | A new ordering constraint solving method and its applications | |
| 1 |
| Nissen |
| |
| | 1999 | Integration of graph iterators into LEDA | |
| 1 |
| Nissen, Weihe |
| |
| | 1999 | How generic language extensions enable ''open-world'' design in Java | |
| 1 |
| Nivelle |
| |
| | 2005 | Using resolution as a decision procedure | |
| 4 |
| Nonnengart |
| |
| | 1999 | A deductive model checking approach for hybrid systems | |
| | 1996 | Auxiliary modal operators and the characterization of modal frames | |
| | 1996 | Strong skolemization | |
| | 1992 | First-order modal logic theorem proving and standard PROLOG | |
| 1 |
| |
| | 1995 | A fixpoint approach to second-order quantifier elimination with applications to correspondence theory | |
| 4 |
| |
| | 1994 | Computer support for the development and investigation of logics | |
| | 1994 | Synthesizing semantics for extensions of propositional logic | |
| | 1993 | Translation methods for non-classical logics: an overview | |
| | 1992 | Preprints of Proceedings of GWAI-92 | |
| 1 |
| Ohlbach (ed.) |
| |
| | 1994 | Temporal logic: Proceedings of the ICTL Workshop | |
| 1 |
| Ohlbach, Baader |
| |
| | 1993 | A multi-dimensional terminological knowledge representation language - preliminary version | |
| 1 |
| Ohlbach, Gabbay, Plaisted |
| |
| | 1994 | Killer transformations | |
| 1 |
| Ohlbach, Schmidt |
| |
| | 1995 | Functional translation and second-order frame properties of modal logics | |
| 1 |
| Ohlbach, Schmidt, Hustadt |
| |
| | 1995 | Translating graded modalities into predicate logic | |
| 2 |
| Ohtake, Belyaev, Seidel |
| |
| | 2004 | 3D scattered data interpolation and approximation with multilevel compactly supported RBFs | |
| | 2004 | Quadric-based mesh reconstruction from scattered data | |
| 1 |
| |
| | 2013 | New results for non-preemptive speed scaling | |
| 1 |
| |
| | 2007 | A New Approximation Algorithm for thr Maximum Traveling Salesman Problem | |
| 1 |
| |
| | 1995 | Wait-free consensus in "in-phase" multiprocessor systems | |
| 1 |
| Paterson, Schröder, Sýkora, Vrto |
| |
| | 1991 | Optimal embedding of a toroidal mesh in a path | |
| 1 |
| |
| | 1995 | New deterministic algorithms for counting pairs of intersecting segments and off-line triangle range searching | |
| 4 |
| |
| | 1995 | Special cases and substitutes for rigid $E$-unification | |
| | 1994 | An abstract program generation logic | |
| | 1994 | Ordered semantic hyper-linking | |
| | 1994 | The search efficiency of theorem proving strategies: an analytical comparison | |
| 1 |
| Podelski, Rybalchenko |
| |
| | 2003 | Software model checking of liveness properties via transition invariants | |
| 1 |
| Podelski, Wagner |
| |
| | 2007 | A method and a tool for automatic veriication of region stability for hybrid systems | |
| 4 |
| Polzin, Vahdati |
| |
| | 2002 | Using (sub)graphs of small width for solving the Steiner problem | |
| | 2001 | Extending reduction techniques for the Steiner tree problem: a combination of alternative-and bound-based approaches | |
| | 2001 | On Steiner trees and minimum spanning trees in hypergraphs | |
| | 2001 | Partitioning techniques for the Steiner problem | |
| 1 |
| Preda, Suchanek, Kasneci, Neumann, Weikum |
| |
| | 2009 | Coupling knowledge bases and web services for active knowledge | |
| 1 |
| Preda, Suchanek, Yuan, Weikum |
| |
| | 2011 | Query evaluation with asymmetric web services | |
| 1 |
| |
| | 1995 | Interactive Proof Systems | |
| 1 |
| |
| | 2009 | Generating concise and readable summaries of XML documents | |
| 1 |
| |
| | 1998 | Strategies for conformance testing | |
| 2 |
| |
| | 1999 | Proving a conjecture of Andreka on temporal logic | |
| | 1999 | The logic of event clocks | |
| 1 |
| Reinert, Lenhof, Mutzel, Mehlhorn, Kececioglou |
| |
| | 1996 | A branch-and-cut algorithm for multiple sequence alignment | |
| 1 |
| Rieger |
| |
| | 1996 | Proximity in arrangements of algebraic sets | |
| 1 |
| Roessl, Zeilfelder, Nürnberger, Seidel |
| |
| | 2003 | Visualization of volume data with quadratic super splines | |
| 5 |
| Rüb |
| |
| | 1998 | On Wallace's method for the generation of normal variates | |
| | 1997 | On Batcher's Merge Sorts as Parallel Sorting Algorithms | |
| | 1995 | On the average running time of odd-even merge sort | |
| | 1993 | Lower bounds for merging on the hypercube | |
| | 1992 | Computing intersections and arrangements for red-blue curve segments in parallel | |
| 1 |
| Saluja, Gupta |
| |
| | 1996 | Optimal algorithms for some proximity problems on the Gaussian sphere with applications | |
| 1 |
| Sanders |
| |
| | 2003 | Polynomial time algorithms for network information flow | |
| 1 |
| Sanders, Dementiev |
| |
| | 2003 | Asynchronous parallel disk sorting | |
| 1 |
| Sanders, Egner, Korst |
| |
| | 1999 | Fast concurrent access to parallel disks | |
| 1 |
| Sanders, Pettie |
| |
| | 2004 | A simpler linear time 2/3 - epsilon approximation for maximum weight matching | |
| 1 |
| Sanders, Träff |
| |
| | 2002 | The factor algorithm for all-to-all communication on clusters of SMP nodes | |
| 1 |
| Schaefer |
| |
| | 2003 | A note on the smoothed complexity of the single-source shortest path problem | |
| 1 |
| Schäfer, Becchetti, Leonardi, Marchetti-Spaccamela, Vredeveld |
| |
| | 2003 | Average case and smoothed competitive analysis of the multi-level feedback algorithm | |
| 1 |
| Schäfer, Leonardi |
| |
| | 2003 | Cross-monotonic cost sharing methods for connected facility location games | |
| 1 |
| Schäfer, Sivadasan |
| |
| | 2003 | Topology matters: smoothed competitive analysis of metrical task systems | |
| 2 |
| Schall, Belyaev, Seidel |
| |
| | 2006 | Feature-preserving non-local denoising of static and time-varying
range data | |
| | 2005 | Sparse meshing of uncertain and noisy surface scattered data
| |
| 3 |
| |
| | 1998 | Parameterized implementations of classical planar convex hull algorithms and extreme point compuations | |
| | 1998 | Robustness and precision issues in geometric computation | |
| | 1997 | Designing a Computational Geometry Algorithms Library | |
| 4 |
| |
| | 1998 | E-unification for subsystems of S4 | |
| | 1997 | Resolution is a decision procedure for many propositional modal logics | |
| | 1992 | Terminological representation, natural language & relation algebra | |
| | 1991 | Algebraic terminological representation | |
| 1 |
| Schmitt, Fousse |
| |
| | 2004 | A comparison of polynomial evaluation schemes | |
| 1 |
| Scholz, Magnor |
| |
| | 2006 | Garment texture editing in monocular video sequences based on
color-coded printing patterns | |
| 1 |
| Schömer, Thiel |
| |
| | 1994 | Efficient collision detection for moving polyhedra | |
| 1 |
| Schultz, Theisel, Seidel |
| |
| | 2008 | Crease surfaces: from theory to extraction and application to diffusion tensor MRI | |
| 2 |
| Schultz, Weickert, Seidel |
| |
| | 2007 | A higher-order structure tensor | |
| | 2007 | A Higher-Order Structure Tensor | |
| 1 |
| |
| | 1992 | Semi-dynamic maintenance of the width of a planar point set | |
| 1 |
| |
| | 1991 | An O(n log n log log n) algorithm for the on-line closes pair problem | |
| 1 |
| |
| | 1991 | An optimal algorithm for the on-line closest-pair problem | |
| 2 |
| |
| | 2001 | Implementation of planar Nef polyhedra | |
| | 1996 | A runtime test of integer arithmetic and linear algebra in LEDA | |
| 1 |
| Seel, Mehlhorn |
| |
| | 2000 | Infimaximal frames: a technique for making lines look like segments | |
| 1 |
| Sen |
| |
| | 1993 | Tight bounds for some problems in computational geometry: the complete sub-logarithmic parallel time range | |
| 1 |
| Seufert, Bedathur, Mestre, Weikum |
| |
| | 2010 | Bonsai: Growing Interesting Small Trees | |
| 6 |
| Sibeyn |
| |
| | 1999 | Ultimate parallel list ranking? | |
| | 1997 | From parallel to external list ranking | |
| | 1995 | Overview of mesh results | |
| | 1995 | Sample sort on meshes | |
| | 1994 | Desnakification of mesh sorting algorithms | |
| | 1993 | Routing and sorting on circular arrays | |
| 2 |
| |
| | 1997 | BSP-like external-memory computation | |
| | 1993 | Deterministic 1-k routing on meshes with applications to worm-hole routing | |
| 1 |
| Sibeyn, Rao, Juurlink |
| |
| | 1996 | Gossiping on meshes and tori | |
| 1 |
| Siersdorfer, Sizov, Weikum |
| |
| | 2004 | Goal-oriented methods and meta methods for document classification and their parameter tuning | |
| 1 |
| Siersdorfer, Weikum |
| |
| | 2005 | Automated retraining methods for document classification and their parameter tuning | |
| 1 |
| Sivadasan, Sanders, Skutella |
| |
| | 2004 | Online scheduling with bounded migration | |
| 7 |
| Smid |
| |
| | 1995 | Closest point problems in computational geometry | |
| | 1994 | Lecture notes selected topics in data structures | |
| | 1993 | Finding k points with a smallest enclosing square | |
| | 1992 | Finding k points with a smallest enclosing square | |
| | 1991 | Dynamic rectangular point location, with an application to the closest pair problem | |
| | 1991 | Maintaining the minimal distance of a point set in polylogarithmic time (revised version) | |
| | 1991 | Range trees with slack parameter | |
| 1 |
| Smid, Datta, Lenhof, Schwarz |
| |
| | 1993 | Static and dynamic algorithms for k-point clustering problems | |
| 1 |
| Smid, Gupta, Janardan |
| |
| | 1992 | Further results on generalized intersection searching problems: counting, reporting, and dynamization | |
| 1 |
| Smid, Janardan |
| |
| | 1994 | On the width and roundness of a set of points in the plane | |
| 1 |
| Smid, Lenhof |
| |
| | 1992 | Enumerating the k closest pairs mechanically | |
| 1 |
| Smid, Thiel, Follert, Schömer, Sellen |
| |
| | 1995 | Computing a largest empty anchored cylinder, and related problems | |
| 5 |
| Socher-Ambrosius |
| |
| | 1993 | A refined version of general E-unification | |
| | 1993 | Unification of terms with exponents | |
| | 1992 | A goal oriented strategy based on completion | |
| | 1992 | Completeness of resolution and superposition calculi | |
| | 1992 | Semi-unification | |
| 1 |
| Sofronie-Stokkermans |
| |
| | 2001 | Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators | |
| 1 |
| Sogomonjan, Goessel |
| |
| | 1992 | Self-testing and self-checking combinational circuits with weakly independent outputs | |
| 1 |
| Solis-Oba |
| |
| | 1998 | 2-Approximation algorithm for finding a spanning tree with maximum number of leaves | |
| 1 |
| Sridhar |
| |
| | 2016 | ? | |
| 1 |
| Sridhar, Oulasvirta, Theobalt |
| |
| | 2014 | Fast Tracking of Hand and Finger Articulations Using a Single Depth Camera | |
| 1 |
| Stoll |
| |
| | 2009 | Optical reconstruction of detailed animatable human body models | |
| 1 |
| Stoll, de Aguiar, Theobalt, Seidel |
| |
| | 2007 | A volumetric approach to interactive shape editing | |
| 1 |
| Struth |
| |
| | 1996 | Non-symmetric rewriting | |
| 1 |
| Stuber |
| |
| | 1993 | Computing stable models by program transformation | |
| 1 |
| Suchanek, Ifrim, Weikum |
| |
| | 2006 | Combining linguistic and statistical analysis to extract relations from web documents | |
| 1 |
| Suchanek, Kasneci, Weikum |
| |
| | 2007 | Yago : a large ontology from Wikipedia and WordNet | |
| 1 |
| Suchanek, Sozio, Weikum |
| |
| | 2008 | SOFIE: a self-organizing framework for information extraction | |
| 1 |
| Suda, Weidenbach |
| |
| | 2012 | Labelled superposition for PLTL | |
| 1 |
| Suda, Weidenbach, Wischnewski |
| |
| | 2010 | On the saturation of YAGO | |
| 2 |
| Sýkora, Vrto |
| |
| | 1991 | Edge separators for graphs of bounded genus with applications | |
| | 1991 | On crossing numbers of hypercubes and cube connected cycles | |
| 2 |
| |
| | 1992 | On correspondence between modal and classical logic: automated approach | |
| | 1992 | On natural deduction in fixpoint logics | |
| 2 |
| Tamaki |
| |
| | 2003 | A linear time heuristic for the branch-decomposition of planar graphs | |
| | 2003 | Alternating cycles contribution: a strategy of tour-merging for the traveling salesman problem | |
| 1 |
| |
| | 2011 | Finding images of rare and ambiguous entities | |
| 1 |
| Tarini, Lensch, Goesele, Seidel |
| |
| | 2003 | 3D acquisition of mirroring objects | |
| 1 |
| Tevs, Wand, Ihrke, Seidel |
| |
| | 2010 | A Bayesian approach to manifold topology reconstruction | |
| 1 |
| Theobald, Sozio, Suchanek, Nakashole |
| |
| | 2010 | URDF: Efficient Reasoning in Uncertain RDF Knowledge Bases with Soft and Hard Rules | |
| 1 |
| Theobalt, Ahmed, De Aguiar, Ziegler, Lensch, Magnor, Seidel |
| |
| | 2005 | Joint motion and reflectance capture for creating relightable 3D videos | |
| 1 |
| Theobalt, Ahmed, Lensch, Magnor, Seidel |
| |
| | 2006 | Enhanced dynamic reflectometry for relightable free-viewpoint video | |
| 1 |
 | Theobalt, Li, Magnor, Seidel |
| |
