| # |  | Year | | Title | Pages | |
|---|
| | 1993 |  | A framework for program development based on schematic proof | 12 | |
| | 1993 | | A theory and its metatheory in FS 0 | 22 | |
| | 1992 | | Reflection in logical systems | 14 | |
| | 1992 | | Experience with FS0 as a framework theory | 25 | |
| 1 |
 | Mavronicolas, Marios |
| |
| | 1996 | | The impact of timing on linearizability in counting networks | 19 | |
| 32 |
| Mehlhorn, Kurt |
| |
| | 2005 | | Cycle bases of graphs and sampled manifolds | 30 | |
| | 2000 | | Infimaximal frames: a technique for making lines look like segments | 16 | |
| | 2000 | | Generalized and improved constructive separation bound for real algebraic expressions | 12 | |
| | 1999 | | A simple way to recognize a correct Voronoi diagram of line segments | 11 | |
| | 1998 | | On the performance of LEDA-SM | 26 | |
| | 1998 | | Randomized external-memory algorithms for some geometric problems | 27 | |
| | 1997 | | Maximum network flow with floating point arithmetic | 5 | |
| | 1996 | | Runtime prediction of real programs on real machines | 10 | |
| | 1996 | | A branch-and-cut algorithm for multiple sequence alignment | 15 | |
| | 1996 | | A computational basis for higher-dimensional computational geometry | 120 | |
| | 1996 | | The LEDA class real number | 52 | |
| | 1994 | | Implementation of a sweep line algorithm for the Straight \& Line Segment Intersection Problem | 41 | |
| | 1994 | | On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm | 8 | |
| | 1993 | | Searching, sorting and randomised algorithms for central elements and ideal counting in posets | 8 | |
| | 1993 | | An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm | 20 | |
| | 1993 | | A lower bound for area-universal graphs | 7 | |
| | 1993 | | A complete and efficient algorithm for the intersection of a general convex polyhedron | 14 | |
| | 1993 | | Maintaining dynamic sequences under equality-tests in polylogorithmic time | 17 | |
| | 1993 | | LEDA-Manual Version 3.0 | 140 | |
| | 1993 | | Randomized incremental construction of abstract Voronoi diagrams | 29 | |
| | 1993 | | Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection | 12 | |
| | 1992 | | not published | | |
| | 1992 | | Furthest site abstract Voronoi diagrams | 25 | |
| | 1992 | | A lower bound for set intersection queries | 14 | |
| | 1992 | | Dynamic point location in general subdivisions | 30 | |
| | 1992 | | Four results on randomized incremental constructions | 21 | |
| | 1992 | | A method for obtaining randomized algorithms with small tail probalities | 5 | |
| | 1991 | | An $O(n^3)$-time maximum-flow algorithm | 30 | |
| | 1991 | | A lower bound for the nondeterministic space complexity of contextfree recognition | 4 | |
| | 1991 | | Algorithms for dense graphs and networks | 29 | |
| | 1991 | | Tail estimates for the space complexity of randomized incremantal algorithms | 8 | |
| | 1991 | | Simultaneous inner and outer aproximation of shapes | 24 | |
| 1 |
| |
| | 1998 | | 2nd Workshop on Algorithm Engineering WAE '98 - Proceedings | 213 | |
| 2 |
| |
| | 1993 | | Randomized incremental construction of abstract Voronoi diagrams | 29 | |
| | 1992 | | Furthest site abstract Voronoi diagrams | 25 | |
| 1 |
| Mele, Ida |
| |
| | 2014 | | Phrase Query Optimization on Inverted Indexes | 20 | |
| 1 |
| Merz, Stephan |
| |
| | 2011 | | Towards verification of the pastry protocol using TLA+ | 51 | |
| 2 |
| Mestre, Julian |
| |
| | 2013 | | A distributed algorithm for large-scale generalized matching | 39 | |
| | 2010 | | Bonsai: Growing Interesting Small Trees | 27 | |
| 3 |
| |
| | 1998 | | Unification in extensions of shallow equational theories | 31 | |
| | 1993 | | Extended path-indexing | ? | |
| | 1993 | | Extended path-Indexing | ? | |
| 5 |
| |
| | 2008 | | Characterizing the performance of Flash memory storage devices and its impact on algorithm design | 36 | |
| | 2001 | | Directed single-source shortest-paths in linear average-case time | 32 | |
| | 1998 | | Randomized external-memory algorithms for some geometric problems | 27 | |
| | 1998 | | Time-independent gossiping on full-port tori | 20 | |
| | 1994 | | Towards practical permutation routing on meshes | 11 | |
| 2 |
| |
| | 2005 | | Cycle bases of graphs and sampled manifolds | 30 | |
| | 2005 | | Rank-maximal through maximum weight matchings | 22 | |
| 1 |
| Michaylov, Spiro |
| |
| | 1991 | | Natural semantics and some of its meta-theory in Elf | 26 | |
| 2 |
| Michel, Sebastian |
| |
| | 2012 | | Building and maintaining halls of fame over a database | 36 | |
| | 2006 | | Overlap-aware global df estimation in distributed information retrieval systems | 25 | |
| 1 |
| |
| | 2012 | | MDL4BMF: Minimum Description Length for Boolean Matrix Factorization | 48 | |
| 1 |
| |
| | 2012 | | Top-k query processing in probabilistic databases with non-materialized views | 59 | |
| 1 |
| |
| | 2015 | | ? | ? | |
| 1 |
| |
| | 2011 | | A morphable part model for shape manipulation | 33 | |
| 1 |
| |
| | 2008 | | Single phase construction of optimal DAG-structured QEPs | 73 | |
| 1 |
| |
| | 2006 | | Output-sensitive autocompletion search | 17 | |
| 1 |
| |
| | 1994 | | Dynamic algorithms for geometric spanners of small diameter: randomized solutions | ? | |
| 1 |
| |
| | 2016 | | ? | ? | |
| 1 |
| |
| | 1994 | | An implementation of a Convex Hull Algorithm, Version 1.0 | 63 | |
| 2 |
| |
| | 2000 | | A branch and cut algorithm for the optimal solution of the side-chain placement problem | 26 | |
| | 1997 | | Parallel algorithms for MD-simulations of synthetic polymers | 32 | |
| 1 |
| Müller, Vladimír |
| |
| | 1991 | | On embeddings in cycles | 22 | |
| 1 |
| Munro, Ian |
| |
| | 1992 | | not published | | |
| 20 |
| Mutzel, Petra |
| |
| | 1998 | | Optimal compaction of orthogonal grid drawings | 20 | |
| | 1998 | | Optimizing over all combinatorial embeddings of a planar graph | 23 | |
| | 1998 | | Quasi-orthogonal drawing of planar graphs | 15 | |
| | 1998 | | A note on computing a maximal planar subgraph using PQ-trees | 5 | |
| | 1997 | | AGD-Library: A Library of Algorithms for Graph Drawing | 13 | |
| | 1997 | | Pitfalls of using PQ--Trees in automatic graph drawing | 12 | |
| | 1997 | | An alternative method to crossing minimization on hierarchical graphs | 15 | |
| | 1997 | | Algorithmen zum automatischen Zeichnen von Graphen | 9 | |
| | 1996 | | A branch-and-cut algorithm for multiple sequence alignment | 15 | |
| | 1996 | | A branch-and-cut approach to physical mapping with end-probes | 10 | |
| | 1996 | | 2-Layer straigthline crossing minimization: performance of exact and heuristic algorithms | 14 | |
| | 1996 | | Computational Molecular Biology | 26 | |
| | 1996 | | The thickness of graphs: a survey | 18 | |
| | 1996 | | Exact ground states of two-dimensional $\pm J$ Ising Spin Glasses | 10 | |
| | 1995 | | Exact and heuristic algorithms for 2-layer straightline crossing minimization | 12 | |
| | 1995 | | The thickness of a minor-excluded class of graphs | 9 | |
| | 1995 | | A polyhedral approach to planar augmentation and related problems | 14 | |
| | 1995 | | Automatisiertes Zeichnen von Diagrammen | 5 | |
| | 1995 | | Exact ground states of Ising spin classes: new experimental results with a branch and cut algorithm | 17 | |
| | 1994 | | On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm | 8 | |
| 3 |
| |
| | 2007 | | Global illumination using photon ray splatting | 65 | |
| | 2006 | | Design and evaluation of backward compatible high dynamic range video compression | 50 | |
| | 2002 | | Perceptual evaluation of tone mapping operators with regard to similarity and preference | 30 | |
| 5 |
| |
| | 1997 | | AGD-Library: A Library of Algorithms for Graph Drawing | 13 | |
| | 1996 | | A computational basis for higher-dimensional computational geometry | 120 | |
| | 1995 | | LEDA user manual (version R 3.2) | 184 | |
| | 1994 | | Implementation of a sweep line algorithm for the Straight \& Line Segment Intersection Problem | 41 | |
| | 1993 | | LEDA-Manual Version 3.0 | 140 | |
| 1 |
| |
| | 2010 | | URDF: Efficient Reasoning in Uncertain RDF Knowledge Bases with Soft and Hard Rules | 45 | |
| 1 |
| |
| | 1998 | | Fully dynamic shortest paths and negative cycle detection on diagraphs with Arbitrary Arc Weights | 18 | |
| 1 |
| |
| | 2007 | | Power assignment problems in wireless communication | 25 | |
| 1 |
| Navarro, Juan José Moreno |
| |
| | 1994 | | Integration of declarative paradigms: Proceedings of the ICLP'94 Post-Conference Workshop, Santa Margherita Ligure, Italy | 149 | |
| 1 |
| |
| | 2006 | | Gesture modeling and animation by imitation | 62 | |
| 6 |
| |
| | 2009 | | Coupling knowledge bases and web services for active knowledge | 24 | |
| | 2009 | | The RDF-3X engine for scalable management of RDF data | 53 | |
| | 2009 | | The RDF-3X engine for scalable management of RDF data | 53 S. | |
| | 2008 | | Single phase construction of optimal DAG-structured QEPs | 73 | |
| | 2007 | | A time machine for text search | 39 | |
| | 2007 | | A Time Machine for Text Search | 0 | |
| 1 |
| Nieuwenhuis, Robert |
| |
| | 1992 | | A new ordering constraint solving method and its applications | 12 | |
| 1 |
| Nilsson, S. |
| |
| | 1995 | | Sorting in linear time? | 32 | |
| 2 |
| Nissen, Marco |
| |
| | 1999 | | Integration of graph iterators into LEDA | 39 | |
| | 1999 | | How generic language extensions enable ''open-world'' design in Java | 40 | |
| 1 |
| |
| | 2005 | | Using resolution as a decision procedure | 53 | |
| 8 |
| |
| | 1999 | | A deductive model checking approach for hybrid systems | 40 | |
| | 1996 | | Strong skolemization | 16 | |
| | 1996 | | Auxiliary modal operators and the characterization of modal frames | 37 | |
| | 1995 | | A fixpoint approach to second-order quantifier elimination with applications to correspondence theory | 16 | |
| | 1992 | | Motel user manual | 45 | |
| | 1992 | | Motel User Manual | | |
| | 1992 | | Motel User Manual | | |
| | 1992 | | First-order modal logic theorem proving and standard PROLOG | 48 | |
| 2 |
| Nürnberger, Günther |
| |
| | 2003 | | Visualization of volume data with quadratic super splines | 15 | |
| | 2003 | | The dimension of $C^1$ splines of arbitrary degree on a tetrahedral partition | 39 | |
| 2 |
| |
| | 1996 | | The thickness of graphs: a survey | 18 | |
| | 1995 | | The thickness of a minor-excluded class of graphs | 9 | |
| 12 |
| Ohlbach, Hans Jürgen |
| |
| | 1995 | | Translating graded modalities into predicate logic | 37 | |
| | 1995 | | A multi-dimensional terminological knowledge representation language | 32 | |
| | 1995 | | Functional translation and second-order frame properties of modal logics | 27 | |
| | 1994 | | Computer support for the development and investigation of logics | 24 | |
| | 1994 | | Killer transformations | 45 | |
| | 1994 | | Synthesizing semantics for extensions of propositional logic | 45 | |
| | 1993 | | Translation methods for non-classical logics: an overview | 18 | |
| | 1993 | | Towards automating duality | 50 | |
| | 1993 | | A multi-dimensional terminological knowledge representation language - preliminary version | 17 | |
| | 1992 | | Preprints of Proceedings of GWAI-92 | 47 | |
| | 1992 | | Quantifier elimination in second-order predicate logic | 18 | |
| | 1991 | | Deduction systems based on resolution | 68 | |
| 1 |
| Ohlbach, Hans Jürgen (ed.) |
| |
| | 1994 | | Temporal logic: Proceedings of the ICTL Workshop | 116 | |
| 2 |
| |
| | 2004 | | 3D scattered data interpolation and approximation with multilevel compactly supported RBFs | ? | |
| | 2004 | | Quadric-based mesh reconstruction from scattered data | ? | |
| 1 |
| Östlin, Anna |
| |
| | 1996 | | On the complexity of computing evolutionary trees | 14 | |
| 1 |
| Ott, Sebastian |
| |
| | 2013 | | New results for non-preemptive speed scaling | 32 | |
| 1 |
| Oulasvirta, Antti |
| |
| | 2014 | | Fast Tracking of Hand and Finger Articulations Using a Single Depth Camera | 14 | |
| 1 |
| Pacholski, Leszek |
| |
| | 1993 | | Negativ set constraints: an easy proof of decidability | 11 | |
| 1 |
| Paluch, Katarzyna |
| |
| | 2007 | | A New Approximation Algorithm for thr Maximum Traveling Salesman Problem | ? | |
| 1 |
| Panconesi, Alessandro |
| |
| | 1994 | | Near-optimal distributed edge | 12 | |
| 5 |
| Pantziou, Grammati E. |
| |
| | 1995 | | The fourth moment in Luby`s distribution | 10 | |
| | 1994 | | Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems | 38 | |
| | 1994 | | On-line and dynamic algorithms for shortest path problems | 20 | |
| | 1994 | | On-line and Dynamic Shortest Paths through Graph Decompositions (Preliminary Version) | 14 | |
| | 1994 | | Quickest paths: faster algorithms and dynamization | 15 | |
| 1 |
| Papadimitriou, Christos |
| |
| | 1993 | | On kernels, defaults and even graphs | 11 | |
| 5 |
| Papatriantafilou, Marina |
| |
| | 2007 | | LFthreads: a lock-free thread library | 36 | |
| | 1996 | | The impact of timing on linearizability in counting networks | 19 | |
| | 1996 | | Distributed list coloring: how to dynamically allocate frequencies to mobile base stations | 15 | |
| | 1995 | | Wait-free consensus in "in-phase" multiprocessor systems | 12 | |
| | 1995 | | Towards self-stabilizing wait-free shared memory objects | 15 | |
| 1 |
| Paterson, Michael S. |
| |
| | 1991 | | Optimal embedding of a toroidal mesh in a path | 6 | |
| 1 |
| Pease, Adam |
| |
| | 2008 | | Integrating Yago into the suggested upper merged ontology | 31 | |
| 1 |
| Pellegrini, M. |
| |
| | 1995 | | New deterministic algorithms for counting pairs of intersecting segments and off-line triangle range searching | 12 | |
| 1 |
| Petersson, Viktor |
| |
| | 2001 | | Experiments with iterative improvement algorithms on completely unimodel hypercubes | 25 | |
| 1 |
| Pettie, Seth |
| |
| | 2004 | | A simpler linear time 2/3 - epsilon approximation for maximum weight matching | 10 | |
| 1 |
| Pfenning, Frank |
| |
| | 1991 | | Natural semantics and some of its meta-theory in Elf | 26 | |
| 1 |
| Pinotti, M. Cristina |
| |
| | 1998 | | Comparator networks for binary heap construction | 11 | |
| 1 |
| Pion, Sylvain |
| |
| | 2001 | | An adaptable and extensible geometry kernel | 27 | |
| 5 |
| Plaisted, David A. |
| |
| | 1995 | | Special cases and substitutes for rigid $E$-unification | 46 | |
| | 1994 | | Ordered semantic hyper-linking | 22 | |
| | 1994 | | The search efficiency of theorem proving strategies: an analytical comparison | 40 | |
| | 1994 | | An abstract program generation logic | 58 | |
| | 1994 | | Killer transformations | 45 | |
| 5 |
| Podelski, Andreas |
| |
| | 2007 | | A method and a tool for automatic veriication of region stability for hybrid systems | 46 | |
| | 2006 | | On verifying complex properties using symbolic shape analysis | 32 | |
| | 2003 | | Software model checking of liveness properties via transition invariants | 29 | |
| | 1998 | | Model checking infinite-state systems in CLP | 44 | |
| | 1997 | | Solving set constraints for greatest models | 12 | |
| 6 |
| Polzin, Tobias |
| |
| | 2003 | | Improving linear programming approaches for the Steiner tree problem | 19 | |
| | 2002 | | Exp Lab: a tool set for computational experiments | 59 | |
| | 2002 | | Using (sub)graphs of small width for solving the Steiner problem | 9 | |
| | 2001 | | Extending reduction techniques for the Steiner tree problem: a combination of alternative-and bound-based approaches | 24 | |
| | 2001 | | Partitioning techniques for the Steiner problem | 21 | |
| | 2001 | | On Steiner trees and minimum spanning trees in hypergraphs | 15 | |
| 2 |
| |
| | 1998 | | Improved approximation schemes for scheduling unrelated parallel machines | 14 | |
| | 1998 | | Linear-time approximation schemes for scheduling malleable parallel tasks | 15 | |
| 1 |
| Posegga, J. (ed.) |
| |
| | 1993 | | Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993 | ? | |
| 1 |
| Potthoff, Jürgen |
| |
| | 2006 | | Interacting and annealing particle filters: mathematics and a recipe for applications | 44 | |
| 1 |
| Preda, Nicoleta |
| |
| | 2009 | | Coupling knowledge bases and web services for active knowledge | 24 | |
| 1 |
| Preda, Nicoletta |
| |
| | 2011 | | Query evaluation with asymmetric web services | 31 | |
| 1 |
| Priebe, Volker |
| |
| | 1996 | | Negative dependence through the FKG Inequality | 10 | |
| 1 |
| Pyrga, Evangelia |
| |
| | 2005 | | Cycle bases of graphs and sampled manifolds | 30 | |
| 1 |
| Radermacher, F. J. |
| |
| | 1993 | | Künstliche Intelligenz und Operations Research | 36 | |
| 3 |
| Radhakrishnan, Jaikumar |
| |
| | 1996 | | The randomized complexity of maintaining the minimum | 12 | |
| | 1995 | | Interactive Proof Systems | 121 | |
| | 1993 | | The complexity of parallel prefix problems on small domains | 17 | |
| 4 |
| Ramanath, Maya |
| |
| | 2010 | | Query relaxation for entity-relationship search | 40 | |
| | 2009 | | Generating concise and readable summaries of XML documents | 30 | |
| | 2008 | | STAR: Steiner tree approximation in relationship-graphs | 37 | |
| | 2007 | | NAGA: searching and ranking knowledge | 42 | |
| 1 |
| |
| | 1998 | | Strategies for conformance testing | 24 | |
| 6 |
| |
| | 1995 | | Sorting in linear time? | 32 | |
| | 1993 | | Approximate and exact deterministic parallel selection | 10 | |
| | 1993 | | Randomized Data Structures for the Dynamic Closest-Pair Problem | 32 | |
| | 1992 | | Simple randomized algorithms for closest pair problems | 14 | |
| | 1992 | | Waste makes haste: tight bounds for loose parallel sorting | 185 | |
| | 1992 | | A lower bound for set intersection queries | 14 | |
| 1 |
| Ramesh, H. |
| |
| | 1996 | | Derandomizing semidefinite programming based approximation algorithms | 22 | |
| 1 |
| Ramos, Edgar |
| |
| | 1998 | | Randomized external-memory algorithms for some geometric problems | 27 | |
| 1 |
| Ramos, Edgar A. |
| |
| | 1998 | | Solving some discrepancy problems in NC* | 21 | |
| 6 |
| Ranjan, Desh |
| |
| | 1998 | | On positive influence and negative dependence | 12 | |
| | 1996 | | Negative dependence through the FKG Inequality | 10 | |
| | 1994 | | Stochastic majorisation: exploding some myths | 5 | |
| | 1994 | | Some correlation inequalities for probabilistic analysis of algorithms | 16 | |
| | 1993 | | Searching, sorting and randomised algorithms for central elements and ideal counting in posets | 8 | |
| | 1993 | | The circuit subfunction relations are $sum^P_2$-complete | 14 | |
| 1 |
| |
| | 1996 | | Gossiping on meshes and tori | 19 | |
| 1 |
| |
| | 1992 | | Furthest site abstract Voronoi diagrams | 25 | |
| 1 |
| |
| | 2009 | | A shaped temporal filter camera | 25 | |
| 5 |
| |
| | 1999 | | Axioms for real-time logics | 31 | |
| | 1999 | | Proving a conjecture of Andreka on temporal logic | 13 | |
| | 1999 | | Fully decidable logics, automata and classical theories for defining regular real-time languages | 102 | |
| | 1999 | | The logic of event clocks | 41 | |
| | 1999 | | Symbolic representation of upward-closed sets | 24 | |
| 2 |
| |
| | 1997 | | A polylogarithmic approximation algorithm for group Steiner tree problem | 7 | |
| | 1996 | | Generalized $k$-Center Problems | 9 | |
| 3 |
| Reinelt, Gerhard |
| |
| | 1996 | | A branch-and-cut approach to physical mapping with end-probes | 10 | |
| | 1996 | | Exact ground states of two-dimensional $\pm J$ Ising Spin Glasses | 10 | |
| | 1995 | | Exact ground states of Ising spin classes: new experimental results with a branch and cut algorithm | 17 | |
| 3 |
| Reinert, Knut |
| |
| | 1997 | | The practical use of the $\calA^*$ algorithm for exact multiple sequence alignment | 16 | |
| | 1996 | | Lower bounds for row minima searching | 12 | |
| | 1996 | | A branch-and-cut algorithm for multiple sequence alignment | 15 | |
| 1 |
| Reynolds, Mark A. |
| |
| | 1992 | | Temporal logic: Mathematical foundations, part 2 | 30 | |
| 1 |
| Rieger, Joachim |
| |
| | 1996 | | Proximity in arrangements of algebraic sets | 25 | |
| 2 |
| Rinaldi, G. |
| |
| | 1996 | | Exact ground states of two-dimensional $\pm J$ Ising Spin Glasses | 10 | |
| | 1995 | | Exact ground states of Ising spin classes: new experimental results with a branch and cut algorithm | 17 | |
| 1 |
| |
| | 2006 | | On verifying complex properties using symbolic shape analysis | 32 | |
| 1 |
| |
| | 1998 | | $q$-gram based database searching using a suffix array (QUASAR) | 11 | |
| 3 |
| |
| | 2003 | | Visualization of volume data with quadratic super splines | 15 | |
| | 2003 | | The dimension of $C^1$ splines of arbitrary degree on a tetrahedral partition | 39 | |
| | 2003 | | Convex boundary angle based flattening | 16 | |
| 3 |
| |
| | 2007 | | Global stochastic optimization for robust and accurate human motion capture | 28 | |
| | 2007 | | Clustered stochastic optimization for object recognition and pose estimation | 23 | |
| | 2006 | | Interacting and annealing particle filters: mathematics and a recipe for applications | 44 | |
| 2 |
| |
| | 2004 | | r-adaptive parameterization of surfaces | 16 | |
| | 2000 | | Geometric modeling based on polygonal meshes | 52 | |
| 1 |
| Rote, Günter |
| |
| | 1991 | | Simultaneous inner and outer aproximation of shapes | 24 | |
| 6 |
| Rüb, Christine |
| |
| | 1998 | | On Wallace's method for the generation of normal variates | 17 | |
| | 1997 | | On Batcher's Merge Sorts as Parallel Sorting Algorithms | 23 | |
| | 1997 | | Parallel algorithms for MD-simulations of synthetic polymers | 32 | |
| | 1995 | | On the average running time of odd-even merge sort | 16 | |
| | 1993 | | Lower bounds for merging on the hypercube | 10 | |
| | 1992 | | Computing intersections and arrangements for red-blue curve segments in parallel | 30 | |
| 1 |
| |
| | 2003 | | Software model checking of liveness properties via transition invariants | 29 | |
| 1 |
| |
| | 2008 | | Shape complexity from image similarity | 28 | |
| 3 |
| |
| | 1996 | | Discovering all most specific sentences by randomized algorithms | 23 | |
| | 1996 | | Optimal algorithms for some proximity problems on the Gaussian sphere with applications | 8 | |
| | 1995 | | Interactive Proof Systems | 121 | |
| 8 |
| |
| | 2004 | | Online scheduling with bounded migration | 21 | |
| | 2004 | | A simpler linear time 2/3 - epsilon approximation for maximum weight matching | 10 | |
| | 2003 | | Polynomial time algorithms for network information flow | 15 | |
| | 2003 | | Scheduling and traffic allocation for tasks with bounded splittability | 15 | |
| | 2003 | | Asynchronous parallel disk sorting | 22 | |
| | 2002 | | The factor algorithm for all-to-all communication on clusters of SMP nodes | 8 | |
| | 2002 | | A practical minimum spanning tree algorithm using the cycle property | 21 | |
| | 1999 | | Fast concurrent access to parallel disks | 30 | |
| 1 |
| Schaefer, Guido |
| |
| | 2003 | | A note on the smoothed complexity of the single-source shortest path problem | 8 | |
| 4 |
| Schäfer, Guido |
| |
| | 2003 | | Cross-monotonic cost sharing methods for connected facility location games | 10 | |
| | 2003 | | Topology matters: smoothed competitive analysis of metrical task systems | 28 | |
| | 2003 | | Average case and smoothed competitive analysis of the multi-level feedback algorithm | 31 | |
| | 2002 | | Exp Lab: a tool set for computational experiments | 59 | |
| 2 |
| |
| | 2006 | | Feature-preserving non-local denoising of static and time-varying
range data | 22 | |
| | 2005 | | Sparse meshing of uncertain and noisy surface scattered data
| 20 | |
| 2 |
| Scharbrodt, Mark |
| |
| | 1996 | | The thickness of graphs: a survey | 18 | |
| | 1995 | | The thickness of a minor-excluded class of graphs | 9 | |
| 4 |
| |
| | 2011 | | Temporal index sharding for space-time efficiency in archive search | 32 | |
| | 2010 | | Real-time text queries with tunable term pair indexes | 41 | |
| | 2010 | | Efficient temporal keyword queries over versioned text | 39 | |
| | 2006 | | IO-Top-k: index-access optimized top-k query processing | 49 | |
| 1 |
| Schilling, Andreas |
| |
| | 2009 | | Generalized intrinsic symmetry detection | 33 | |
| 11 |
| Schirra, Stefan |
| |
| | 2000 | | Generalized and improved constructive separation bound for real algebraic expressions | 12 | |
| | 1998 | | Applications of the generic programming paradigm in the design of CGAL | 12 | |
| | 1998 | | On the Design of CGAL, the Computational Geometry Algorithms Library | 31 | |
| | 1998 | | Robustness and precision issues in geometric computation | 34 | |
| | 1998 | | Parameterized implementations of classical planar convex hull algorithms and extreme point compuations | 93 | |
| | 1997 | | Designing a Computational Geometry Algorithms Library | 8 | |
| | 1996 | | A computational basis for higher-dimensional computational geometry | 120 | |
| | 1996 | | The LEDA class real number | 52 | |
| | 1994 | | On characteristic points and approximate decision algorithms for the minimum Hausdorff distance | 10 | |
| | 1994 | | Revenge of the dog: queries on Voronoi diagrams of moving points | 14 | |
| | 1991 | | Approximate decision algorithms for point set congruence | 25 | |
| 1 |
| Schmidt, Günter |
| |
| | 1998 | | Scheduling with unexpected machine breakdowns | 15 | |
| 11 |
| Schmidt, Renate A. |
| |
| | 1998 | | E-unification for subsystems of S4 | 30 | |
| | 1997 | | On evaluating decision procedures for modal logic | 50 | |
| | 1997 | | Resolution is a decision procedure for many propositional modal logics | 60 | |
| | 1995 | | Translating graded modalities into predicate logic | 37 | |
| | 1995 | | Functional translation and second-order frame properties of modal logics | 27 | |
| | 1992 | | Terminological representation, natural language & relation algebra | 13 | |
| | 1992 | | Motel user manual | 45 | |
| | 1992 | | Motel User Manual | | |
| | 1992 | | Motel User Manual | | |
| | 1992 | | Peirce algebras | 22 | |
| | 1991 | | Algebraic terminological representation | 113 | |
| 1 |
| Schmitt, Carina |
| |
| | 2004 | | Modeling hair using a wisp hair model | 40 | |
| 1 |
| Schmitt, Susanne |
| |
| | 2004 | | A comparison of polynomial evaluation schemes | 19 | |
| 1 |
| Schmitz, Christoph |
| |
| | 1995 | | Radix heaps an efficient implementation for priority queues | 27 | |
| 1 |
| Schneider, Robert |
| |
| | 2000 | | Geometric modeling based on polygonal meshes | 52 | |
| 1 |
| Schnoerr, Christoph |
| |
| | 2006 | | Interacting and annealing particle filters: mathematics and a recipe for applications | 44 | |
| 4 |
| Schobbens, Pierre-Yves |
| |
| | 1999 | | Axioms for real-time logics | 31 | |
| | 1999 | | Proving a conjecture of Andreka on temporal logic | 13 | |
| | 1999 | | Fully decidable logics, automata and classical theories for defining regular real-time languages | 102 | |
| | 1999 | | The logic of event clocks | 41 | |
| 1 |
| |
| | 2006 | | Garment texture editing in monocular video sequences based on
color-coded printing patterns | 24 | |
| 2 |
| |
| | 1995 | | Computing a largest empty anchored cylinder, and related problems | 17 | |
| | 1994 | | Efficient collision detection for moving polyhedra | 24 | |
| 1 |
| Schönherr, Sven |
| |
| | 1998 | | On the Design of CGAL, the Computational Geometry Algorithms Library | 31 | |
| 1 |
| Schröder, Heiko |
| |
| | 1991 | | Optimal embedding of a toroidal mesh in a path | 6 | |
| 1 |
| Schulte, Ralph |
| |
| | 1998 | | On the performance of LEDA-SM | 26 | |
| 3 |
| Schultz, Thomas |
| |
| | 2008 | | Crease surfaces: from theory to extraction and application to diffusion tensor MRI | 33 | |
| | 2007 | | A higher-order structure tensor | 29 | |
| | 2007 | | A Higher-Order Structure Tensor | ? | |
| 1 |
| Schulz, Stephan |
| |
| | 2001 | | Proceeding of the Second International Workshop of the Implementation of Logics | ? 102 | |
| 7 |
| Schwarz, Christian |
| |
| | 1995 | | Radix heaps an efficient implementation for priority queues | 27 | |
| | 1993 | | Static and dynamic algorithms for k-point clustering problems | 20 | |
| | 1993 | | Randomized Data Structures for the Dynamic Closest-Pair Problem | 32 | |
| | 1992 | | Simple randomized algorithms for closest pair problems | 14 | |
| | 1992 | | Semi-dynamic maintenance of the width of a planar point set | 14 | |
| | 1991 | | An optimal algorithm for the on-line closest-pair problem | 11 | |
| | 1991 | | An O(n log n log log n) algorithm for the on-line closes pair problem | 21 | |
| 1 |
| Schwind, C. (ed.) |
| |
| | 1993 | | Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993 | ? | |
| 6 |
| Seel, Michael |
| |
| | 2001 | | An adaptable and extensible geometry kernel | 27 | |
| | 2001 | | Implementation of planar Nef polyhedra | 345 | |
| | 2000 | | Infimaximal frames: a technique for making lines look like segments | 16 | |
| | 1999 | | A simple way to recognize a correct Voronoi diagram of line segments | 11 | |
| | 1996 | | A runtime test of integer arithmetic and linear algebra in LEDA | 10 | |
| | 1996 | | A computational basis for higher-dimensional computational geometry | 120 | |
| 54 |
| |
| | 2012 | | Symmetry detection in large scale city scans | 32 | |
| | 2011 | | A morphable part model for shape manipulation | 33 | |
| | 2009 | | Generalized intrinsic symmetry detection | 33 | |
| | 2009 | | MPI Informatics building model as data for your research | 113 | |
| | 2009 | | A shaped temporal filter camera | 25 | |
| | 2010 | | A Bayesian approach to manifold topology reconstruction | 23 | |
| | 2009 | | Acquisition and analysis of bispectral bidirectional reflectance distribution functions | 25 | |
| | 2008 | | Crease surfaces: from theory to extraction and application to diffusion tensor MRI | 33 | |
| | 2008 | | Shape complexity from image similarity | 28 | |
| | 2007 | | Global stochastic optimization for robust and accurate human motion capture | 28 | |
| | 2007 | | Global illumination using photon ray splatting | 65 | |
| | 2007 | | HistoPyramids in Iso-Surface Extraction | 16 | |
| | 2007 | | A higher-order structure tensor | 29 | |
| | 2007 | | A volumetric approach to interactive shape editing | 28 | |
| | 2007 | | A nonlinear viseme model for triphone-based speech synthesis | 28 | |
| | 2007 | | A Higher-Order Structure Tensor | ? | |
| | 2007 | | Construction of smooth maps with mean value coordinates | 22 | |
| | 2007 | | Clustered stochastic optimization for object recognition and pose estimation | 23 | |
| | 2006 | | Mean value coordinates for arbitrary spherical polygons and
polyhedra in $\mathbbR^3$ | 19 | |
| | 2006 | | Interacting and annealing particle filters: mathematics and a recipe for applications | 44 | |
| | 2006 | | Gesture modeling and animation by imitation | 62 | |
| | 2006 | | Feature-preserving non-local denoising of static and time-varying
range data | 22 | |
| | 2006 | | Enhanced dynamic reflectometry for relightable free-viewpoint video | 37 | |
| | 2006 | | Skeleton-driven Laplacian mesh deformations | 36 | |
| | 2006 | | On fast construction of spatial hierarchies for ray tracing | 40 | |
| | 2006 | | A framework for natural animation of digitized models | 27 | |
| | 2006 | | GPU point list generation through histogram pyramids | 13 | |
| | 2006 | | Design and evaluation of backward compatible high dynamic range video compression | 50 | |
| | 2005 | | An emperical model for heterogeneous translucent objects | 20 | |
| | 2005 | | Photometric calibration of high dynamic range cameras
| 21 | |
| | 2005 | | Joint motion and reflectance capture for creating relightable 3D videos | 18 | |
| | 2005 | | Analysis and design of discrete normals and curvatures | 42 | |
| | 2005 | | Sparse meshing of uncertain and noisy surface scattered data
| 20 | |
| | 2005 | | Reflectance from images: a model-based approach for human faces | 33 | |
| | 2004 | | Faster ray tracing with SIMD shaft culling | 13 | |
| | 2004 | | r-adaptive parameterization of surfaces | 16 | |
| | 2004 | | 3D scattered data interpolation and approximation with multilevel compactly supported RBFs | ? | |
| | 2004 | | Quadric-based mesh reconstruction from scattered data | ? | |
| | 2004 | | Modeling hair using a wisp hair model | 40 | |
| | 2003 | | Neural meshes: statistical learning methods in surface reconstruction | 23 | |
| | 2003 | | Visualization of volume data with quadratic super splines | 15 | |
| | 2003 | | A custom designed density estimation method for light transport | 28 | |
| | 2003 | | Convex boundary angle based flattening | 16 | |
| | 2003 | | A flexible and versatile studio for synchronized multi-view video recording | 18 | |
| | 2003 | | 3D acquisition of mirroring objects | 37 | |
| | 2002 | | Perceptual evaluation of tone mapping operators with regard to similarity and preference | 30 | |
| | 2002 | | Tutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models | 50 | |
| | 2001 | | A framework for the acquisition, processing and interactive display of high quality 3D models | 39 | |
| | 2001 | | Linear one-sided stability of MAT for weakly injective domain | 18 | |
| | 2001 | | Efficient light transport using precomputed visibility | 32 | |
| | 2001 | | A framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the Web | 20 | |
| | 2001 | | Image-based reconstruction of spatially varying materials | 20 | |
| | 2000 | | Hyperbolic Hausdorff distance for medial axis transform | 30 | |
| | 1999 | | A framework for evaluating the quality of lossy image compression | 20 | |
| 1 |
| Seidel, Hans-Peter Seidel |
| |
| | 2003 | | The dimension of $C^1$ splines of arbitrary degree on a tetrahedral partition | 39 | |
| 1 |
| Seidel, H.-P. |
| |
| | 2004 | | Neural meshes: surface reconstruction with a learning algorithm | 22 | |
| 1 |
| Seidel, Raimund |
| |
| | 1992 | | Four results on randomized incremental constructions | 21 | |
| 1 |
| Sellen, J. |
| |
| | 1995 | | Computing a largest empty anchored cylinder, and related problems | 17 | |
| 1 |
| Selman, Bart |
| |
| | 2005 | | Bottleneck behavior in CNF formulas | 35 | |
| 1 |
| Sen, Sandeep |
| |
| | 1993 | | Tight bounds for some problems in computational geometry: the complete sub-logarithmic parallel time range | 12 | |
| 1 |
| Seufert, Stephan |
| |
| | 2010 | | Bonsai: Growing Interesting Small Trees | 27 | |
| 2 |
| Sharir, Micha |
| |
| | 1993 | | Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection | 12 | |
| | 1991 | | Tail estimates for the space complexity of randomized incremantal algorithms | 8 | |
| 1 |
| |
| | 2000 | | A powerful heuristic for telephone gossiping | 23 | |
| 11 |
| |
| | 1999 | | Ultimate parallel list ranking? | 20 | |
| | 1998 | | Time-independent gossiping on full-port tori | 20 | |
| | 1997 | | From parallel to external list ranking | 15 | |
| | 1997 | | BSP-like external-memory computation | 14 | |
| | 1996 | | Gossiping on meshes and tori | 19 | |
| | 1995 | | Overview of mesh results | 22 | |
| | 1995 | | Sample sort on meshes | 14 | |
| | 1994 | | Towards practical permutation routing on meshes | 11 | |
| | 1994 | | Desnakification of mesh sorting algorithms | 21 | |
| | 1993 | | Deterministic 1-k routing on meshes with applications to worm-hole routing | 13 | |
| | 1993 | | Routing and sorting on circular arrays | 20 | |
| 3 |
| |
| | 2006 | | A neighborhood-based approach for clustering of linked document collections | 32 | |
| | 2005 | | Automated retraining methods for document classification and their parameter tuning | 23 | |
| | 2004 | | Goal-oriented methods and meta methods for document classification and their parameter tuning | 32 | |
| 1 |
| |
| | 1994 | | Reflection using the derivability conditions | 14 | |
| | 1993 | | *No Title | | |
| 3 |
| Sivadasan, Naveen |
| |
| | 2004 | | On the Hadwiger's conjecture for graph products | 12 | |
| | 2004 | | Online scheduling with bounded migration | 21 | |
| | 2003 | | Topology matters: smoothed competitive analysis of metrical task systems | 28 | |
| 1 |
| Sizov, Sergej |
| |
| | 2004 | | Goal-oriented methods and meta methods for document classification and their parameter tuning | 32 | |
| 2 |
| Skutella, Martin |
| |
| | 2005 | | Reachability substitutes for planar digraphs | 24 | |
| | 2004 | | Online scheduling with bounded migration | 21 | |
| 1 |
| |
| | 2003 | | A custom designed density estimation method for light transport | 28 | |
| 1 |
| |
| | 1992 | | Experience with FS0 as a framework theory | 25 | |
| 30 |
| |
| | 1996 | | A technique for adding range restrictions to generalized searching problems | 9 | |
| | 1996 | | Efficient algorithms for counting and reporting pairwise intersections between convex polygons | 11 | |
| | 1996 | | On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees | 14 | |
| | 1995 | | Closest point problems in computational geometry | 62 | |
| | 1995 | | A polylog-time and $O(n\sqrt\lg n)$-work parallel algorithm for finding the row minima in totally monotone matrices | 12 | |
| | 1995 | | Computing a largest empty anchored cylinder, and related problems | 17 | |
| | 1994 | | Dynamic algorithms for geometric spanners of small diameter: randomized solutions | ? | |
| | 1994 | | Lecture notes selected topics in data structures | 76 | |
| | 1994 | | The rectangle enclosure and point-dominance problems revisited | 16 | |
| | 1994 | | Efficient construction of a bounded degree spanner with low weight | 25 | |
| | 1994 | | Fast algorithms for collision and proximity problems involving moving geometric objects | 22 | |
| | 1994 | | On the width and roundness of a set of points in the plane | 14 | |
| | 1993 | | Effizient algorithms for generalized intersection searching on non-iso-oriented objects | 32 | |
| | 1993 | | New techniques for exact and approximate dynamic closest-point problems | 29 | |
| |  1993 | | Algorithms for some intersection searching problems involving curved objects | 43 | |
| | | | | | |
| | 1993 | | Finding k points with a smallest enclosing square | 17 | |
| | 1993 | | Static and dynamic algorithms for k-point clustering problems | 20 | |
| | 1993 | | Randomized Data Structures for the Dynamic Closest-Pair Problem | 32 | |
| | 1992 | | Simple randomized algorithms for closest pair problems | 14 | |
| | 1992 | | Further results on generalized intersection searching problems: counting, reporting, and dynamization | 41 | |
| | 1992 | | Finding k points with a smallest enclosing square | 8 | |
| | 1992 | | Sequential and parallel algorithms for the k closest pairs problem | 18 | |
| | 1992 | | Enumerating the k closest pairs mechanically | 12 | |
| | 1992 | | Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity | 16 | |
| | 1991 | | An optimal algorithm for the on-line closest-pair problem | 11 | |
| | 1991 | | An optimal construction method for generalized convex layers | 25 | |
| | 1991 | | An O(n log n log log n) algorithm for the on-line closes pair problem | 21 | |
| | 1991 | | Maintaining the minimal distance of a point set in polylogarithmic time (revised version) | 17 | |
| | 1991 | | Range trees with slack parameter | 11 | |
| | 1991 | | Dynamic rectangular point location, with an application to the closest pair problem | 28 | |
| 1 |
| |
| | 1991 | | An optimal algorithm for the on-line closest-pair problem | 11 | |
| 1 |
| |
| | 1993 | | Basic paramodulation | 36 | |
| 6 |
| |
| | 1993 | | Solving simplifications ordering constraints | 16 | |
| | 1993 | | A refined version of general E-unification | 12 | |
| | 1993 | | Unification of terms with exponents | 21 | |
| | 1992 | | Completeness of resolution and superposition calculi | 9 | |
| | 1992 | | Semi-unification | 10 | |
| | 1992 | | A goal oriented strategy based on completion | 14 | |
| 1 |
| Sofronie-Stokkermans, Viorica |
| |
| | 2001 | | Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators | 41 | |
| 1 |
| Sogomonjan, E. S. |
| |
| | 1992 | | Self-testing and self-checking combinational circuits with weakly independent outputs | 18 | |
| 2 |
| Solis-Oba, Roberto |
| |
| | 1998 | | Robustness analysis in combinatorial optimization | 66 | |
| | 1998 | | 2-Approximation algorithm for finding a spanning tree with maximum number of leaves | 16 | |
| 4 |
| |
| | 2013 | | A distributed algorithm for large-scale generalized matching | 39 | |
| | 2010 | | URDF: Efficient Reasoning in Uncertain RDF Knowledge Bases with Soft and Hard Rules | 45 | |
| | 2008 | | SOFIE: a self-organizing framework for information extraction | 49 | |
| | 2008 | | STAR: Steiner tree approximation in relationship-graphs | 37 | |
| 2 |
| Spirakis, P. G. |
| |
| | 1995 | | The fourth moment in Luby`s distribution | 10 | |
| | 1994 | | Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems | 38 | |
| 1 |
| |
| | 2014 | | Fast Tracking of Hand and Finger Articulations Using a Single Depth Camera | 14 | |
| 1 |
| |
| | 2016 | | ? | ? | |
| 2 |
| |
| | 2009 | | Optical reconstruction of detailed animatable human body models | 37 | |
| | 2007 | | A volumetric approach to interactive shape editing | 28 | |
| 1 |
| Struth, Georg |
| |
| | 1996 | | Non-symmetric rewriting | 20 | |
| 1 |
| Stuber, Jürgen |
| |
| | 1993 | | Computing stable models by program transformation | 15 | |
| 1 |
| Stupar, Aleksandar |
| |
| | 2012 | | Building and maintaining halls of fame over a database | 36 | |
| 1 |
| Subrahmanyam, K.V. |
| |
| | 1998 | | Solving some discrepancy problems in NC* | 21 | |
| 1 |
| Subramanian, C.R. |
| |
| | 2003 | | Girth and treewidth | 11 | |
| 4 |
| Suchanek, Fabian |
| |
| | 2011 | | Query evaluation with asymmetric web services | 31 | |
| | 2010 | | URDF: Efficient Reasoning in Uncertain RDF Knowledge Bases with Soft and Hard Rules | 45 | |
| | 2008 | | SOFIE: a self-organizing framework for information extraction | 49 | |
| | 2006 | | Combining linguistic and statistical analysis to extract relations from web documents | 37 | |
| 6 |
| |
| | 2010 | | YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia | 50 | |
| | 2008 | | Integrating Yago into the suggested upper merged ontology | 31 | |
| | 2008 | | STAR: Steiner tree approximation in relationship-graphs | 37 | |
| | 2007 | | Yago : a large ontology from Wikipedia and WordNet | 67 | |
| | 2007 | | NAGA: searching and ranking knowledge | 42 | |
| | 2006 | | Yago - a core of semantic knowledge | 39 | |
| 1 |
| Suchanek, Fabiuan M. |
| |
| | 2009 | | Coupling knowledge bases and web services for active knowledge | 24 | |
| 2 |
| Suda, Martin |
| |
| | 2012 | | Labelled superposition for PLTL | 42 | |
| | 2010 | | On the saturation of YAGO | 50 | |
| 4 |
| |
| | 1991 | | Optimal embedding of a toroidal mesh in a path | 6 | |
| | 1991 | | Edge separators for graphs of bounded genus with applications | 10 | |
| | 1991 | | On crossing numbers of hypercubes and cube connected cycles | 6 | |
| | 1991 | | On embeddings in cycles | 22 | |
| 3 |
| Szalas, Andrzej |
| |
| | 1995 | | A fixpoint approach to second-order quantifier elimination with applications to correspondence theory | 16 | |
| | 1992 | | On correspondence between modal and classical logic: automated approach | 17 | |
| | 1992 | | On natural deduction in fixpoint logics | 18 | |
| 1 |
| Talbot, Jean-Marc |
| |
| | 2002 | | Atomic set constraints with projection | 20 | |
| 3 |
| Tamaki, Hisao |
| |
| | 2003 | | A linear time heuristic for the branch-decomposition of planar graphs | 18 | |
| | 2003 | | Alternating cycles contribution: a strategy of tour-merging for the traveling salesman problem | 22 | |
| | 2003 | | On the probability of rendezvous in graphs | 30 | |
| 1 |
| Taneva, Bilyana |
| |
| | 2011 | | Finding images of rare and ambiguous entities | 30 | |
| 1 |
| Tarini, Marco |
| |
| | 2003 | | 3D acquisition of mirroring objects | 37 | |
| 1 |
| Telikepalli, Kavitha |
| |
| | 2005 | | Improved algorithms for all-pairs approximate shortest paths in weighted graphs | 26 | |
| 2 |
| Tevs, Art |
| |
| | 2010 | | A Bayesian approach to manifold topology reconstruction | 23 | |
| | 2006 | | GPU point list generation through histogram pyramids | 13 | |
| 1 |
| |
| | 2008 | | Crease surfaces: from theory to extraction and application to diffusion tensor MRI | 33 | |
| 4 |
| |
| | 2014 | | Learning Tuple Probabilities in Probabilistic Databases | 51 | |
| | 2012 | | Top-k query processing in probabilistic databases with non-materialized views | 59 | |
| | 2010 | | URDF: Efficient Reasoning in Uncertain RDF Knowledge Bases with Soft and Hard Rules | 45 | |
| | 2006 | | IO-Top-k: index-access optimized top-k query processing | 49 | |
| 14 |
| Theobalt, Christian |
| |
| | 2014 | | Fast Tracking of Hand and Finger Articulations Using a Single Depth Camera | 14 | |
| | 2014 | | Local high-order regularization on data manifolds | ? | |
| | 2013 | | HDR reconstruction of cluttered dynamic scenes | ? | |
| | 2011 | | Videoscapes: exploring unstructured video collections | 32 | |
| | 2011 | | Efficient learning-based image enhancement : application to
compression artifact removal and super-resolution | 28 | |
| | 2011 | | How not to be seen – inpainting dynamic objects in crowded scenes | 35 | |
| | 2007 | | HistoPyramids in Iso-Surface Extraction | 16 | |
| | 2007 | | A volumetric approach to interactive shape editing | 28 | |
| | 2007 | | ? | ? | |
| | 2006 | | Enhanced dynamic reflectometry for relightable free-viewpoint video | 37 | |
| | 2006 | | A framework for natural animation of digitized models | 27 | |
| | 2006 | | GPU point list generation through histogram pyramids | 13 | |
| | 2005 | | Joint motion and reflectance capture for creating relightable 3D videos | 18 | |
| | 2003 | | A flexible and versatile studio for synchronized multi-view video recording | 18 | |
| 3 |
| |
| | 1995 | | Computing a largest empty anchored cylinder, and related problems | 17 | |
| | 1994 | | Efficient collision detection for moving polyhedra | 24 | |
| | 1993 | | Searching, sorting and randomised algorithms for central elements and ideal counting in posets | 8 | |
| 3 |
| |
| | 2004 | | Filtering algorithms for the Same and UsedBy constraints | 36 | |
| | 2003 | | Fast bound consistency for the global cardinality constraint | 30 | |
| | 1998 | | On the performance of LEDA-SM | 26 | |
| 1 |
| |
| | 1997 | | Faster deterministic sorting and priority queues in linear space | 9 | |
| 3 |
| |
| | 1992 | | Motel user manual | 45 | |
| | 1992 | | Motel User Manual | | |
| | 1992 | | Motel User Manual | | |
| 1 |
| |
| | 2008 | | Characterizing the performance of Flash memory storage devices and its impact on algorithm design | 36 | |
| 3 |
| |
| | 2014 | | Local high-order regularization on data manifolds | ? | |
| | 2011 | | Videoscapes: exploring unstructured video collections | 32 | |
| | 2011 | | How not to be seen – inpainting dynamic objects in crowded scenes | 35 | |
| 2 |
| |
| | 1993 | | Linear logic meets the Lambda Calculus, part I | ? | |
| | 1992 | | not published | | |
| 1 |
| Torres, Alberto |
| |
| | 1993 | | Graph theoretical structures in logic programs and default theories | 28 | |
| 2 |
| Träff, Jesper Larsson |
| |
| | 2002 | | The factor algorithm for all-to-all communication on clusters of SMP nodes | 8 | |
| | 2002 | | A practical minimum spanning tree algorithm using the cycle property | 21 | |
| 2 |
| |
| | 1997 | | A parallel priority queue with constant time operations | 19 | |
| | 1996 | | A simple parallel algorithm for the single-source shortest path problem on planar diagraphs | 17 | |
| 1 |
| Tragoudas, Spyros |
| |
| | 1994 | | Quickest paths: faster algorithms and dynamization | 15 | |
| 1 |
| Triantafilou, Peter |
| |
| | 2006 | | Overlap-aware global df estimation in distributed information retrieval systems | 25 | |
| 4 |
| Tsigas, Philippas |
| |
| | 1996 | | The impact of timing on linearizability in counting networks | 19 | |
| | 1996 | | Distributed list coloring: how to dynamically allocate frequencies to mobile base stations | 15 | |
| | 1995 | | Wait-free consensus in "in-phase" multiprocessor systems | 12 | |
| | 1995 | | Towards self-stabilizing wait-free shared memory objects | 15 | |
| 3 |
| |
| | 1998 | | Hybridizing concept languages | 33 | |
| | 1998 | | Hybrid languages and temporal logic | 29 | |
| | 1997 | | Two hybrid logics | 33 | |
| 4 |
| |
| | 1996 | | A computational basis for higher-dimensional computational geometry | 120 | |
| | 1995 | | LEDA user manual (version R 3.2) | 184 | |
| | 1993 | | Maintaining dynamic sequences under equality-tests in polylogorithmic time | 17 | |
| | 1992 | | A lower bound for set intersection queries | 14 | |
| 4 |
| Vahdati, Siavash |
| |
| | 2002 | | Using (sub)graphs of small width for solving the Steiner problem | 9 | |
| | 2001 | | Extending reduction techniques for the Steiner tree problem: a combination of alternative-and bound-based approaches | 24 | |
| | 2001 | | Partitioning techniques for the Steiner problem | 21 | |
| | 2001 | | On Steiner trees and minimum spanning trees in hypergraphs | 15 | |
| 1 |
| |
| | 1992 | | The largest hyper-rectangle in a three dimensional orthogonal polyhedron | 7 | |
| 4 |
| |
| | 1999 | | Decidable fragments of simultaneous rigid reachability | 19 | |
| | 1998 | | Partisan corroboration, and shifted pairing | 35 | |
| | 1998 | | Rigid reachability | 24 | |
| | 1998 | | The relation between second-order unification and simultaneous rigid \sl E-unification | 26 | |
| 1 |
| Veltkamp, Remco |
| |
| | 1998 | | Applications of the generic programming paradigm in the design of CGAL | 12 | |
| 3 |
| Viganò, Luca |
| |
| | 1997 | | Labelled modal logics: quantifiers | 31 | |
| | 1996 | | Natural deduction for non-classical logics | 44 | |
| | 1996 | | Labelled propositional modal logics: theory and practice | 46 | |
| 2 |
| Vingron, Martin |
| |
| | 1998 | | $q$-gram based database searching using a suffix array (QUASAR) | 11 | |
| | 1996 | | Computational Molecular Biology | 26 | |
| 2 |
| |
| | 2003 | | Random knapsack in expected polynomial time | 22 | |
| | 2003 | | Scheduling and traffic allocation for tasks with bounded splittability | 15 | |
| 1 |
| Voecking, Berthold |
| |
| | 2003 | | Selfish traffic allocation for server farms | 43 | |
| 11 |
| Vorobyov, Sergei |
| |
| | 2001 | | Experiments with iterative improvement algorithms on completely unimodel hypercubes | 25 | |
| | 1999 | | New lower bounds for the expressiveness and the higher-order Matching problem in the simply typed lambda calculus | 20 | |
| | 1998 | | The undecidability of the first-order theories of one step rewriting in linear canonical systems | 59 | |
| | 1998 | | AE-Equational theory of context unification is Co-RE-Hard | 20 | |
| | 1998 | | The most nonelementary theory (a direct lower bound proof) | 36 | |
| | 1998 | | Satisfiability of Functional+Record Subtype Constraints is NP-Hard | 16 | |
| | 1997 | | Complexity of nonrecursive logic programs with complex values | 46 | |
| | 1997 | | Third-order matching in $\lambda\rightarrow$-Curry is undecidable | 17 | |
| | 1996 | | On the decision complexity of the bounded theories of trees | 26 | |
| | 1995 | | Proof normalization and subject reduction in extensions of Fsub | 18 | |
| | 1994 | | Structural decidable extensions of bounded quantification | 12 | |
| 3 |
| Voronkov, Andrei |
| |
| | 1998 | | Equality reasoning in sequent-based calculi | 128 | |
| | 1997 | | Elimination of equality via transformation with ordering constraints | 18 | |
| | 1997 | | Complexity of nonrecursive logic programs with complex values | 46 | |
| 1 |
| Vorsatz, Jens |
| |
| | 2000 | | Geometric modeling based on polygonal meshes | 52 | |
| 1 |
| Vredeveld, Tjark |
| |
| | 2003 | | Average case and smoothed competitive analysis of the multi-level feedback algorithm | 31 | |
| 1 |
| Vreeken, Jilles |
| |
| | 2012 | | MDL4BMF: Minimum Description Length for Boolean Matrix Factorization | 48 | |
| 4 |
| Vrto, Imrich |
| |
| | 1991 | | Optimal embedding of a toroidal mesh in a path | 6 | |
| | 1991 | | Edge separators for graphs of bounded genus with applications | 10 | |
| | 1991 | | On crossing numbers of hypercubes and cube connected cycles | 6 | |
| | 1991 | | On embeddings in cycles | 22 | |
| 2 |
| |
| | 2007 | | A method and a tool for automatic veriication of region stability for hybrid systems | 46 | |
| | 2004 | | Summaries for while programs with recursion | 22 | |
| 6 |
| Waldmann, Uwe |
| |
| | 2013 | | Hierarchic superposition with weak abstraction | 45 | |
| | 2001 | | Superposition and chaining for totally ordered divisible abelian groups | 40 | |
| | 1999 | | Cancellative superposition decides the theory of divisible torsion-free abelian groups | 23 | |
| | 1996 | | Theorem proving in cancellative abelian monoids | 52 | |
| | 1993 | | Superposition with simplification as a decision procedure for the monadic class with equality | 14 | |
| | 1992 | | Set constraints are the Monadic class | 13 | |
| 3 |
| |
| | 1994 | | Termination orderings for rippling | 15 | |
| | 1992 | | Difference unification | 15 | |
| | 1992 | | Difference matching | 12 | |
| 4 |
| |
| | 2012 | | Symmetry detection in large scale city scans | 32 | |
| | 2011 | | A morphable part model for shape manipulation | 33 | |
| | 2009 | | Generalized intrinsic symmetry detection | 33 | |
| | 2010 | | A Bayesian approach to manifold topology reconstruction | 23 | |
| 1 |
| Wang, Danyi |
| |
| | 2008 | | Shape complexity from image similarity | 28 | |
| 1 |
| Wang, Oliver |
| |
| | 2009 | | A shaped temporal filter camera | 25 | |
| 2 |
| Wang, Yaoguang |
| |
| | 1997 | | Restricted 2-factor polytopes | 30 | |
| | 1997 | | Bicriteria job sequencing with release dates | 18 | |
| 1 |
| |
| | 2006 | | Output-sensitive autocompletion search | 17 | |
| 2 |
| |
| | 2007 | | A higher-order structure tensor | 29 | |
| | 2007 | | A Higher-Order Structure Tensor | ? | |
| 15 |
| Weidenbach, Christoph |
| |
| | 2012 | | Automatic generation of inductive invariants by SUP(LA) | 26 | |
| | 2012 | | Labelled superposition for PLTL | 42 | |
| | 2011 | | Towards verification of the pastry protocol using TLA+ | 51 | |
| | 2010 | | On the saturation of YAGO | 50 | |
| | 2009 | | Superposition for fixed domains | 49 | |
| | 2010 | | Decidability results for saturation-based model building | 38 | |
| | 2009 | | Contextual rewriting | 28 | |
| | 2009 | | Deciding the inductive validity of $\forall\exists^*$ queries | 43 | |
| | 2008 | | Labelled splitting | 45 | |
| | 2007 | | Superposition for finite domains | 29 | |
| | 2007 | | Superpositon for Finite Domains | 29 | |
| | 1998 | | Unification in extensions of shallow equational theories | 31 | |
| | 1994 | | Minimal resolution | 20 | |
| | 1993 | | Unification in sort theories and its applications | 36 | |
| | 1991 | | A sorted logic using dynamic sorts | 71 | |
| 1 |
| Weihe, Karsten |
| |
| | 1999 | | How generic language extensions enable ''open-world'' design in Java | 40 | |
| 24 |
| Weikum, Gerhard |
| |
| | 2011 | | Finding images of rare and ambiguous entities | 30 | |
| | 2010 | | Query relaxation for entity-relationship search | 40 | |
| | 2010 | | YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia | 50 | |
| | 2010 | | Bonsai: Growing Interesting Small Trees | 27 | |
| | 2011 | | Query evaluation with asymmetric web services | 31 | |
| | 2010 | | A language modeling approach for temporal information needs | 29 | |
| | 2009 | | MING: Mining Informative Entity-Relationship Subgraphs | 32 | |
| | 2009 | | Scalable phrase mining for ad-hoc text analytics | 41 | |
| | 2009 | | Towards a Universal Wordnet by learning from combined evidenc | 32 | |
| | 2009 | | Coupling knowledge bases and web services for active knowledge | 24 | |
| | 2009 | | The RDF-3X engine for scalable management of RDF data | 53 | |
| | 2009 | | The RDF-3X engine for scalable management of RDF data | 53 S. | |
| | 2008 | | SOFIE: a self-organizing framework for information extraction | 49 | |
| | 2008 | | STAR: Steiner tree approximation in relationship-graphs | 37 | |
| | 2007 | | Yago : a large ontology from Wikipedia and WordNet | 67 | |
| | 2007 | | A time machine for text search | 39 | |
| | 2007 | | A Time Machine for Text Search | 0 | |
| | 2007 | | NAGA: searching and ranking knowledge | 42 | |
| | 2006 | | Yago - a core of semantic knowledge | 39 | |
| | 2006 | | Combining linguistic and statistical analysis to extract relations from web documents | 37 | |
| | 2006 | | IO-Top-k: index-access optimized top-k query processing | 49 | |
| | 2006 | | Overlap-aware global df estimation in distributed information retrieval systems | 25 | |
| | 2005 | | Automated retraining methods for document classification and their parameter tuning | 23 | |
| | 2004 | | Goal-oriented methods and meta methods for document classification and their parameter tuning | 32 | |
| 1 |
| |
| | 1998 | | Optimizing over all combinatorial embeddings of a planar graph | 23 | |
| 3 |
| |
| | 1993 | | Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection | 12 | |
| | 1991 | | Tail estimates for the space complexity of randomized incremantal algorithms | 8 | |
| | 1991 | | Simultaneous inner and outer aproximation of shapes | 24 | |
| 1 |
| |
| | 1993 | | Narrowing strategies for arbitrary canonical rewrite systems | 29 | |
| 1 |
| |
| | 1992 | | First-order theorem proving modulo equations | 108 | |
| 1 |
| |
| | 1996 | | A survey of self-organizing data structures | 39 | |
| 1 |
| |
| | 1998 | | On the performance of LEDA-SM | 26 | |
| 1 |
| |
| | 1992 | | A method for obtaining randomized algorithms with small tail probalities | 5 | |
| 1 |
| |
| | 2006 | | On verifying complex properties using symbolic shape analysis | 32 | |
| 1 |
| |
| | 1998 | | On the performance of LEDA-SM | 26 | |
| 2 |
| |
| | 2010 | | On the saturation of YAGO | 50 | |
| | 2009 | | Contextual rewriting | 28 | |
| 1 |
| Woelfel, Philipp |
| |
| | 2003 | | Almost random graphs with simple hash functions | 23 | |
| 1 |
| Wolpert, Nicola |
| |
| | 2006 | | Snap rounding of Bézier curves | 39 | |
| 1 |
| Wu, Jinzhao |
| |
| | 1999 | | Symmetries in logic programs | 44 | |
| 1 |
| Yoshizawa,Shin |
| |
| | 2006 | | Skeleton-driven Laplacian mesh deformations | 36 | |
| 1 |
| Yuan, Wenjun |
| |
| | 2011 | | Query evaluation with asymmetric web services | 31 | |
| 1 |
| Yvinec, M. |
| |
| | 1993 | | A complete and efficient algorithm for the intersection of a general convex polyhedron | 14 | |
| 1 |
| Zajac, Jozef |
| |
| | 2009 | | MPI Informatics building model as data for your research | 113 | |
| 1 |
| Zakaria, Nordin |
| |
| | 2003 | | FaceSketch: an interface for sketching and coloring cartoon faces | 30 | |
| 12 |
| Zaroliagis, Christos D. |
| |
| | 1997 | | A parallel priority queue with constant time operations | 19 | |
| | 1996 | | A simple parallel algorithm for the single-source shortest path problem on planar diagraphs | 17 | |
| | 1996 | | All-pairs min-cut in sparse networks | 27 | |
| | 1995 | | Shortest paths in digraphs of small treewidth part II: optimal parallel algirithms | 20 | |
| | 1995 | | Shortest paths in digraphs of small treewidth sequential algorithms | 17 | |
| | 1995 | | The fourth moment in Luby`s distribution | 10 | |
| | 1995 | | Efficient computation of implicit representations of sparse graphs (revised version) | 16 | |
| | 1994 | | Efficient computation of compact representations of sparse graphs | 10 | |
| | 1994 | | Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems | 38 | |
| | 1994 | | On-line and dynamic algorithms for shortest path problems | 20 | |
| | 1994 | | On-line and Dynamic Shortest Paths through Graph Decompositions (Preliminary Version) | 14 | |
| | 1994 | | Quickest paths: faster algorithms and dynamization | 15 | |
| 3 |
| |
| | 2006 | | A framework for natural animation of digitized models | 27 | |
| | 2004 | | r-adaptive parameterization of surfaces | 16 | |
| | 2003 | | Convex boundary angle based flattening | 16 | |
| 1 |
| |
| | 2006 | | On verifying complex properties using symbolic shape analysis | 32 | |
| 2 |
| |
| | 2003 | | Visualization of volume data with quadratic super splines | 15 | |
| | 2003 | | The dimension of $C^1$ splines of arbitrary degree on a tetrahedral partition | 39 | |
| 3 |
| Zelikovsky, Alexander |
| |
| | 1994 | | Further improvements of Steiner tree approximations | 10 | |
| | 1992 | | A faster 11/6-approximation algorithm for the Steiner tree problem in graphs | 8 | |
| | 1992 | | Minimum base of weighted k polymatroid and Steiner tree problem | 9 | |
| 3 |
| Ziegler, Gernot |
| |
| | 2007 | | HistoPyramids in Iso-Surface Extraction | 16 | |
| | 2006 | | GPU point list generation through histogram pyramids | 13 | |
| | 2005 | | Joint motion and reflectance capture for creating relightable 3D videos | 18 | |
| 2 |
| Ziegler, Joachim |
| |
| | 1998 | | Fast recursive division | 29 | |
| | 1994 | | An implementation of a Convex Hull Algorithm, Version 1.0 | 63 | |
| 1 |
| |
| | 2007 | | Power assignment problems in wireless communication | 25 | |
| 1394 |
| |
