| # |  | Year | | Title | Pages | |
|---|
| 2 |
 | Ahmed, Naveed |
| |
| | 2006 |  | Enhanced dynamic reflectometry for relightable free-viewpoint video | 37 | |
| | 2005 | | Joint motion and reflectance capture for creating relightable 3D videos | 18 | |
| 1 |
| |
| | 1994 | | Integration of declarative paradigms: Proceedings of the ICLP'94 Post-Conference Workshop, Santa Margherita Ligure, Italy | 149 | |
| 1 |
| |
| | 2009 | | Acquisition and analysis of bispectral bidirectional reflectance distribution functions | 25 | |
| 1 |
| |
| | 2008 | | Characterizing the performance of Flash memory storage devices and its impact on algorithm design | 36 | |
| 8 |
| |
| | 1998 | | Scheduling with unexpected machine breakdowns | 15 | |
| | 1997 | | Minimizing stall time in single and parallel disk systems | 16 | |
| | 1997 | | Exploring unknown environments | 23 | |
| | 1997 | | Better bounds for online scheduling | 16 | |
| | 1996 | | A survey of self-organizing data structures | 39 | |
| | 1994 | | Improved parallel integer sorting without concurrent writing | ? | |
| | 1994 | | New on-line algorithms for the page replication problem | 18 | |
| | 1992 | | The influence of lookahead in competitive on-line algorithms | 56 | |
| 1 |
| Alberts, David |
| |
| | 1997 | | AGD-Library: A Library of Algorithms for Graph Drawing | 13 | |
| 1 |
| Albrecht, Irene |
| |
| | 2006 | | Gesture modeling and animation by imitation | 62 | |
| 1 |
| Alonso, Omar |
| |
| | 2010 | | A language modeling approach for temporal information needs | 29 | |
| 5 |
| Althaus, Ernst |
| |
| | 2007 | | A Lagrangian relaxation approach for the multiple sequence alignment problem | 41 | |
| | 2003 | | Improving linear programming approaches for the Steiner tree problem | 19 | |
| | 2000 | | A branch and cut algorithm for the optimal solution of the side-chain placement problem | 26 | |
| | 1998 | | On the performance of LEDA-SM | 26 | |
| | 1997 | | Maximum network flow with floating point arithmetic | 5 | |
| 2 |
| Alt, Helmut |
| |
| | 1992 | | A method for obtaining randomized algorithms with small tail probalities | 5 | |
| | 1991 | | A lower bound for the nondeterministic space complexity of contextfree recognition | 4 | |
| 1 |
| |
| | 2012 | | Building and maintaining halls of fame over a database | 36 | |
| 3 |
| |
| | 2014 | | Phrase Query Optimization on Inverted Indexes | 20 | |
| | 2011 | | Temporal index sharding for space-time efficiency in archive search | 32 | |
| | 2010 | | Efficient temporal keyword queries over versioned text | 39 | |
| 1 |
| |
| | 1995 | | Sorting in linear time? | 32 | |
| 1 |
| |
| | 2006 | | A neighborhood-based approach for clustering of linked document collections | 32 | |
| 1 |
| |
| | 1993 | | A needed narrowing strategy | 28 | |
| 5 |
| |
| | 1996 | | All-pairs min-cut in sparse networks | 27 | |
| | 1995 | | Efficient computation of implicit representations of sparse graphs (revised version) | 16 | |
| | 1994 | | On the parallel complexity of degree sequence problems | 12 | |
| | 1994 | | Efficient computation of compact representations of sparse graphs | 10 | |
| | 1994 | | Realizing degree sequences in parallel | 27 | |
| 2 |
| |
| | 1994 | | Dynamic algorithms for geometric spanners of small diameter: randomized solutions | ? | |
| | 1994 | | Efficient construction of a bounded degree spanner with low weight | 25 | |
| 2 |
| Baader, Franz |
| |
| | 1995 | | A multi-dimensional terminological knowledge representation language | 32 | |
| | 1993 | | A multi-dimensional terminological knowledge representation language - preliminary version | 17 | |
| 12 |
| |
| | 1997 | | Elimination of equality via transformation with ordering constraints | 18 | |
| | 1997 | | Strict basic superposition and chaining | 22 | |
| | 1997 | | A theory of resolution | 79 | |
| | 1995 | | Ordered chaining calculi for first-order theories of binary relations | 42 | |
| | 1993 | | Associative-commutative superposition | ? | |
| | 1993 | | Ordered chaining for total orderings | 20 | |
| | 1993 | | Rewrite techniques for transitive relations | 19 | |
| | 1993 | | Basic paramodulation | 36 | |
| | 1993 | | Superposition with simplification as a decision procedure for the monadic class with equality | 14 | |
| | 1992 | | Set constraints are the Monadic class | 13 | |
| | 1991 | | Associative-commutative reduction orderings | 7 | |
| | 1991 | | Rewrite-based equational theorem proving with selection and simplification | 24 | |
| 1 |
| Bargmann, Robert |
| |
| | 2007 | | A nonlinear viseme model for triphone-based speech synthesis | 28 | |
| 3 |
| Barnes, Greg |
| |
| | 1994 | | Short random walks on graphs | 14 | |
| | 1994 | | A method for implementing lock-free shared data structures | 15 | |
| | 1994 | | Time-space lower bounds for directed s-t connectivity on JAG models | ? | |
| 1 |
| Barnett, Richard |
| |
| | 1992 | | A recursion planning analysis of inductive completion | 14 | |
| 5 |
| Barth, Peter |
| |
| | 1995 | | Modelling mixed-integer optimisation problems in constraint logic programming | 22 | |
| | 1995 | | A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization | 13 | |
| | 1994 | | Finite domain and cutting plane techniques in CLP($\cal PB$) | 16 | |
| | 1994 | | Linear 0-1 inequalities and extended clauses | 53 | |
| | 1992 | | CLP($\cal PB$): A Meta-Interpreter in CLP($\cal R$) | 18 | |
| 16 |
| Basin, David A. |
| |
| | 1997 | | Labelled modal logics: quantifiers | 31 | |
| | 1996 | | Beyond the finite in automatic hardware verification | 51 | |
| | 1996 | | Natural deduction for non-classical logics | 44 | |
| | 1996 | | Labelled propositional modal logics: theory and practice | 46 | |
| | 1995 | | Automated complexity analysis based on ordered resolution | 33 | |
| | 1994 | | Logic frameworks for logic programs | 13 | |
| | 1994 | | Termination orderings for rippling | 15 | |
| | 1993 | | A conservative extension of first-order logic and its application to theorem proving | 11 | |
| | 1993 | | A framework for program development based on schematic proof | 12 | |
| | 1993 | | Middle-out reasoning for logic program synthesis | 12 | |
| | 1992 | | Difference unification | 15 | |
| | 1992 | | Logic program synthesis via proof planning | 14 | |
| | 1992 | | A recursion planning analysis of inductive completion | 14 | |
| | 1992 | | Experience with FS0 as a framework theory | 25 | |
| | 1992 | | Difference matching | 12 | |
| | 1992 | | Metalogical frameworks | 20 | |
| 1 |
| |
| | 1993 | | Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993 | ? | |
| 3 |
| |
| | 2006 | | IO-Top-k: index-access optimized top-k query processing | 49 | |
| | 2006 | | Output-sensitive autocompletion search | 17 | |
| | 1993 | | Fast parallel space allocation, estimation and integer sorting (revised) | 85 | |
| 1 |
| |
| | 2005 | | Improved algorithms for all-pairs approximate shortest paths in weighted graphs | 26 | |
| 1 |
| |
| | 1996 | | Using algebraic specification languages for model-oriented specifications | 17 | |
| 1 |
| |
| | 1992 | | Dynamic point location in general subdivisions | 30 | |
| 1 |
| |
| | 2013 | | Hierarchic superposition with weak abstraction | 45 | |
| 1 |
| |
| | 2003 | | Average case and smoothed competitive analysis of the multi-level feedback algorithm | 31 | |
| 9 |
| |
| | 2014 | | Phrase Query Optimization on Inverted Indexes | 20 | |
| | 2012 | | Computing n-gram statistics in MapReduce | 39 | |
| | 2011 | | Temporal index sharding for space-time efficiency in archive search | 32 | |
| | 2010 | | Bonsai: Growing Interesting Small Trees | 27 | |
| | 2010 | | Efficient temporal keyword queries over versioned text | 39 | |
| | 2010 | | A language modeling approach for temporal information needs | 29 | |
| | 2009 | | Scalable phrase mining for ad-hoc text analytics | 41 | |
| | 2007 | | A time machine for text search | 39 | |
| | 2007 | | A Time Machine for Text Search | 0 | |
| 2 |
| |
| | 2003 | | Random knapsack in expected polynomial time | 22 | |
| | 2000 | | A powerful heuristic for telephone gossiping | 23 | |
| 1 |
| Bekaert, Philippe |
| |
| | 2003 | | A custom designed density estimation method for light transport | 28 | |
| 1 |
| Beldiceanu, Nicolas |
| |
| | 2004 | | Filtering algorithms for the Same and UsedBy constraints | 36 | |
| 7 |
| Belyaev, Alexander |
| |
| | 2008 | | Shape complexity from image similarity | 28 | |
| | 2006 | | Mean value coordinates for arbitrary spherical polygons and
polyhedra in $\mathbbR^3$ | 19 | |
| | 2006 | | Feature-preserving non-local denoising of static and time-varying
range data | 22 | |
| | 2006 | | Skeleton-driven Laplacian mesh deformations | 36 | |
| | 2005 | | Sparse meshing of uncertain and noisy surface scattered data
| 20 | |
| | 2004 | | 3D scattered data interpolation and approximation with multilevel compactly supported RBFs | ? | |
| | 2004 | | Quadric-based mesh reconstruction from scattered data | ? | |
| 1 |
| Belyaev, Alexander G. |
| |
| | 2005 | | Analysis and design of discrete normals and curvatures | 42 | |
| 1 |
| Bender, Matthias |
| |
| | 2006 | | Overlap-aware global df estimation in distributed information retrieval systems | 25 | |
| 1 |
| Berberich, Eric |
| |
| | 2007 | | Linear-time reordering in a sweep-line algorithm for algebraic curves intersecting in a common point | 20 | |
| 10 |
| Berberich, Klaus |
| |
| | 2016 | | Diversifying Search Results Using Time | ? | |
| | 2014 | | Phrase Query Optimization on Inverted Indexes | 20 | |
| | 2012 | | Computing n-gram statistics in MapReduce | 39 | |
| | 2011 | | Temporal index sharding for space-time efficiency in archive search | 32 | |
| | 2010 | | YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia | 50 | |
| | 2010 | | Efficient temporal keyword queries over versioned text | 39 | |
| | 2010 | | A language modeling approach for temporal information needs | 29 | |
| | 2009 | | Scalable phrase mining for ad-hoc text analytics | 41 | |
| | 2007 | | A time machine for text search | 39 | |
| | 2007 | | A Time Machine for Text Search | 0 | |
| 2 |
| |
| | 2011 | | A morphable part model for shape manipulation | 33 | |
| | 2009 | | Generalized intrinsic symmetry detection | 33 | |
| 1 |
| Bilardi, G. |
| |
| | 1993 | | A lower bound for area-universal graphs | 7 | |
| 1 |
| Bischoff, Stephan |
| |
| | 2000 | | Geometric modeling based on polygonal meshes | 52 | |
| 1 |
| Björklund, Henrik |
| |
| | 2001 | | Experiments with iterative improvement algorithms on completely unimodel hypercubes | 25 | |
| 3 |
| Blackburn, Patrick |
| |
| | 1998 | | Hybridizing concept languages | 33 | |
| | 1998 | | Hybrid languages and temporal logic | 29 | |
| | 1997 | | Two hybrid logics | 33 | |
| 1 |
| Blanchet, Bruno |
| |
| | 2004 | | Automatic proof of strong secrecy for security protocols | 78 | |
| 2 |
| Blanz, Volker |
| |
| | 2007 | | A nonlinear viseme model for triphone-based speech synthesis | 28 | |
| | 2005 | | Reflectance from images: a model-based approach for human faces | 33 | |
| 9 |
| |
| | 1999 | | Cutting planes and the elementary closure in fixed dimension | 12 | |
| | 1997 | | On the Chvátal rank of polytopes in the 0/1 cube | 12 | |
| | 1997 | | A unifying framework for integer and finite domain constraint programming | 24 | |
| | 1995 | | Modelling mixed-integer optimisation problems in constraint logic programming | 22 | |
| | 1994 | | Finite domain and cutting plane techniques in CLP($\cal PB$) | 16 | |
| | 1994 | | Cutting planes in constraint logic programming | 23 | |
| | 1993 | | Künstliche Intelligenz und Operations Research | 36 | |
| | 1993 | | Narrowing strategies for arbitrary canonical rewrite systems | 29 | |
| | 1991 | | Logic programming with pseudo-Boolean constraints | 20 | |
| 1 |
| |
| | 1995 | | Parallel algorithms with optimal speedup for bounded treewidth | 27 | |
| 1 |
| |
| | 1999 | | BALL: Biochemical Algorithms Library | 20 | |
| 2 |
| |
| | 2012 | | Symmetry detection in large scale city scans | 32 | |
| | 2009 | | Generalized intrinsic symmetry detection | 33 | |
| 1 |
| Borchert, Bernd |
| |
| | 1993 | | The circuit subfunction relations are $sum^P_2$-complete | 14 | |
| 1 |
| Botsch, Mario |
| |
| | 2000 | | Geometric modeling based on polygonal meshes | 52 | |
| 5 |
| Bradford, Phillip G. |
| |
| | 1996 | | Lower bounds for row minima searching | 12 | |
| | 1995 | | Weak epsilon-nets for points on a hypersphere | 8 | |
| | 1995 | | Matching nuts and bolts optimally | 24 | |
| | 1995 | | A polylog-time and $O(n\sqrt\lg n)$-work parallel algorithm for finding the row minima in totally monotone matrices | 12 | |
| | 1995 | | Matching nuts and bolts faster | 7 | |
| 1 |
| Brandenburg, Franz J. |
| |
| | 1997 | | Algorithmen zum automatischen Zeichnen von Graphen | 9 | |
| 1 |
| Brengel, Klaus |
| |
| | 1998 | | On the performance of LEDA-SM | 26 | |
| 1 |
| Breslauer, Dany |
| |
| | 1996 | | Rotations of periodic strings and short superstrings | 13 | |
| 2 |
| Brink, Chris |
| |
| | 1993 | | Towards automating duality | 50 | |
| | 1992 | | Peirce algebras | 22 | |
| 1 |
| |
| | 1992 | | Peirce algebras | 22 | |
| 4 |
| |
| | 1998 | | Comparator networks for binary heap construction | 11 | |
| | 1997 | | Finger search trees with constant insertion time | 17 | |
| | 1997 | | A parallel priority queue with constant time operations | 19 | |
| | 1996 | | The randomized complexity of maintaining the minimum | 12 | |
| 1 |
| Brönniman, Hervè |
| |
| | 1998 | | Applications of the generic programming paradigm in the design of CGAL | 12 | |
| 1 |
| Broschart, Andreas |
| |
| | 2010 | | Real-time text queries with tunable term pair indexes | 41 | |
| 1 |
| Brox, Thomas |
| |
| | 2007 | | Global stochastic optimization for robust and accurate human motion capture | 28 | |
| 1 |
| Buchheit, Thomas |
| |
| | 1998 | | On the performance of LEDA-SM | 26 | |
| 3 |
| Bundy, Alan |
| |
| | 1993 | | A framework for program development based on schematic proof | 12 | |
| | 1993 | | Middle-out reasoning for logic program synthesis | 12 | |
| | 1992 | | Logic program synthesis via proof planning | 14 | |
| 1 |
| Burghard, Oliver |
| |
| | 2011 | | A morphable part model for shape manipulation | 33 | |
| 1 |
| Burkhardt, Stefan |
| |
| | 1998 | | $q$-gram based database searching using a suffix array (QUASAR) | 11 | |
| 6 |
| Burnikel, Christoph |
| |
| | 1999 | | A simple way to recognize a correct Voronoi diagram of line segments | 11 | |
| | 1998 | | Delaunay graphs by divide and conquer | 24 | |
| | 1998 | | Rational points on circles | 14 | |
| | 1998 | | Fast recursive division | 29 | |
| | 1996 | | High-precision floating point numbers in LEDA | 47 | |
| | 1996 | | The LEDA class real number | 52 | |
| 1 |
| |
| | 2007 | | A Lagrangian relaxation approach for the multiple sequence alignment problem | 41 | |
| 1 |
| |
| | 1995 | | Weak epsilon-nets for points on a hypersphere | 8 | |
| 2 |
| |
| | 2004 | | On the Hadwiger's conjecture for graph products | 12 | |
| | 2003 | | Girth and treewidth | 11 | |
| 6 |
| Charatonik, Witold |
| |
| | 2005 | | Bounded model checking of pointer programs | 34 | |
| | 2002 | | Atomic set constraints with projection | 20 | |
| | 2002 | | Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi | 64 | |
| | 1999 | | Automata on DAG representations of finite trees | 30 | |
| | 1997 | | Solving set constraints for greatest models | 12 | |
| | 1993 | | Negativ set constraints: an easy proof of decidability | 11 | |
| 1 |
| |
| | 1994 | | On the intellectual terrain around NP | 11 | |
| 11 |
| |
| | 1996 | | Generalized $k$-Center Problems | 9 | |
| | 1996 | | The randomized complexity of maintaining the minimum | 12 | |
| | 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 | |
| | 1994 | | Prefix graphs and their applications | 13 | |
| | 1993 | | The complexity of parallel prefix problems on small domains | 17 | |
| | 1993 | | A lower bound for linear approximate compaction | 12 | |
| | 1993 | | Sensitive functions and approximate problems | 8 | |
| | 1993 | | A lower bound for area-universal graphs | 7 | |
| | 1993 | | Approximate and exact deterministic parallel selection | 10 | |
| 2 |
| |
| | 2009 | | A shaped temporal filter camera | 25 | |
| | 2005 | | An emperical model for heterogeneous translucent objects | 20 | |
| 2 |
| Cheriyan, Joseph |
| |
| | 1991 | | An $O(n^3)$-time maximum-flow algorithm | 30 | |
| | 1991 | | Algorithms for dense graphs and networks | 29 | |
| 1 |
| |
| | 1994 | | On characteristic points and approximate decision algorithms for the minimum Hausdorff distance | 10 | |
| 2 |
| |
| | 2001 | | Linear one-sided stability of MAT for weakly injective domain | 18 | |
| | 2000 | | Hyperbolic Hausdorff distance for medial axis transform | 30 | |
| 1 |
| Christof, Thomas |
| |
| | 1996 | | A branch-and-cut approach to physical mapping with end-probes | 10 | |
| 1 |
| Clarkson, K. L. |
| |
| | 1992 | | Four results on randomized incremental constructions | 21 | |
| 1 |
| Constable, Robert L. |
| |
| | 1992 | | Metalogical frameworks | 20 | |
| 1 |
| Cools, Ronald |
| |
| | 2003 | | A custom designed density estimation method for light transport | 28 | |
| 1 |
| Cortier, Veronique |
| |
| | 1999 | | Decidable fragments of simultaneous rigid reachability | 19 | |
| 4 |
| Crauser, Andreas |
| |
| | 1999 | | A theoretical and experimental study on the construction of suffix arrays in external memory | 40 | |
| | 1998 | | On the performance of LEDA-SM | 26 | |
| | 1998 | | $q$-gram based database searching using a suffix array (QUASAR) | 11 | |
| | 1998 | | Randomized external-memory algorithms for some geometric problems | 27 | |
| 1 |
| |
| | 2003 | | On the Bollob\'as -- Eldridge conjecture for bipartite graphs | 29 | |
| 1 |
| |
| | 1997 | | Restricted 2-factor polytopes | 30 | |
| 1 |
| |
| | 1993 | | The logic of preference and decision supporting systems | 71 | |
| 1 |
| |
| | 2003 | | Selfish traffic allocation for server farms | 43 | |
| 1 |
| Daneshmand, Siavash Vahdati |
| |
| | 2003 | | Improving linear programming approaches for the Steiner tree problem | 19 | |
| 1 |
| |
| | 1994 | | The rectangle enclosure and point-dominance problems revisited | 16 | |
| 1 |
| |
| | 1996 | | On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees | 14 | |
| 2 |
| |
| | 1993 | | Static and dynamic algorithms for k-point clustering problems | 20 | |
| | 1992 | | The largest hyper-rectangle in a three dimensional orthogonal polyhedron | 7 | |
| 2 |
| Daubert, Katja |
| |
| | 2001 | | Efficient light transport using precomputed visibility | 32 | |
| | 2000 | | Bump map shadows for openGL rendering | 18 | |
| 4 |
| |
| | 2007 | | A volumetric approach to interactive shape editing | 28 | |
| | 2007 | | ? | ? | |
| | 2006 | | A framework for natural animation of digitized models | 27 | |
| | 2005 | | Joint motion and reflectance capture for creating relightable 3D videos | 18 | |
| 2 |
| de Melo, Gerard |
| |
| | 2009 | | Towards a Universal Wordnet by learning from combined evidenc | 32 | |
| | 2008 | | Integrating Yago into the suggested upper merged ontology | 31 | |
| 3 |
| |
| | 2004 | | Resolution decision procedures for the guarded fragment with transitive guards | 32 | |
| | 2003 | | Subsumption of concepts in $DL$ $\cal FL_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete | 12 | |
| | 2001 | | Proceeding of the Second International Workshop of the Implementation of Logics | ? 102 | |
| 2 |
| |
| | 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 |
| Degtyarev, Anatoli |
| |
| | 1998 | | Equality reasoning in sequent-based calculi | 128 | |
| 2 |
| Delzanno, Giorgio |
| |
| | 1999 | | Symbolic representation of upward-closed sets | 24 | |
| | 1998 | | Model checking infinite-state systems in CLP | 44 | |
| 1 |
| |
| | 2003 | | Asynchronous parallel disk sorting | 22 | |
| 1 |
| |
| | 1994 | | Revenge of the dog: queries on Voronoi diagrams of moving points | 14 | |
| 2 |
| |
| | 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 | |
| 2 |
| Dietzfelbinger, Martin |
| |
| | 2003 | | On the probability of rendezvous in graphs | 30 | |
| | 2003 | | Almost random graphs with simple hash functions | 23 | |
| 1 |
| |
| | 1996 | | More geneal parallel tree contraction: Register allocation and broadcasting in a tree | 24 | |
| 3 |
| |
| | 1994 | | Classical methods in nonmonotonic reasoning | 26 | |
| | 1993 | | Graph theoretical structures in logic programs and default theories | 28 | |
| | 1993 | | On kernels, defaults and even graphs | 11 | |
| 1 |
| |
| | 2001 | | Efficient light transport using precomputed visibility | 32 | |
| 1 |
| |
| | 2009 | | Scalable phrase mining for ad-hoc text analytics | 41 | |
| 2 |
| |
| | 1994 | | On-line and dynamic algorithms for shortest path problems | 20 | |
| | 1994 | | On-line and Dynamic Shortest Paths through Graph Decompositions (Preliminary Version) | 14 | |
| 1 |
| Dmitriev, Kirill |
| |
| | 2004 | | Faster ray tracing with SIMD shaft culling | 13 | |
| 1 |
| Dobrindt, K. |
| |
| | 1993 | | A complete and efficient algorithm for the intersection of a general convex polyhedron | 14 | |
| 1 |
| Drago, Frederic |
| |
| | 2002 | | Perceptual evaluation of tone mapping operators with regard to similarity and preference | 30 | |
| 1 |
| Drahokoupil, Jiri |
| |
| | 2009 | | MPI Informatics building model as data for your research | 113 | |
| 1 |
| Dubhashi, Devdatt |
| |
| | 1998 | | On positive influence and negative dependence | 12 | |
| 8 |
| Dubhashi, Devdatt P. |
| |
| | 1996 | | Negative dependence through the FKG Inequality | 10 | |
| | 1995 | | The fourth moment in Luby`s distribution | 10 | |
| | 1994 | | Stochastic majorisation: exploding some myths | 5 | |
| | 1994 | | Some correlation inequalities for probabilistic analysis of algorithms | 16 | |
| | 1994 | | Near-optimal distributed edge | 12 | |
| | 1993 | | Quantifier elimination in p-adic fields | 21 | |
| | 1993 | | Searching, sorting and randomised algorithms for central elements and ideal counting in posets | 8 | |
| | 1993 | | A lower bound for area-universal graphs | 7 | |
| 1 |
| |
| | 2007 | | HistoPyramids in Iso-Surface Extraction | 16 | |
| 2 |
| |
| | 2014 | | Learning Tuple Probabilities in Probabilistic Databases | 51 | |
| | 2012 | | Top-k query processing in probabilistic databases with non-materialized views | 59 | |
| 1 |
| Echahed, Rachid |
| |
| | 1993 | | A needed narrowing strategy | 28 | |
| 1 |
| Edmonds, J. A. |
| |
| | 1994 | | Time-space lower bounds for directed s-t connectivity on JAG models | ? | |
| 1 |
| Efremov, Alexander |
| |
| | 2006 | | Design and evaluation of backward compatible high dynamic range video compression | 50 | |
| 1 |
| Egner, Sebastian |
| |
| | 1999 | | Fast concurrent access to parallel disks | 30 | |
| 1 |
| Eigenwillig, Arno |
| |
| | 2006 | | Snap rounding of Bézier curves | 39 | |
| 4 |
| Eisenbrand, Friedrich |
| |
| | 2003 | | Fast integer programming in fixed dimension | 14 | |
| | 1999 | | Cutting planes and the elementary closure in fixed dimension | 12 | |
| | 1998 | | A note on the membership problem for the first elementary closure of a polyhedron | 3 | |
| | 1997 | | On the Chvátal rank of polytopes in the 0/1 cube | 12 | |
| 1 |
| |
| | 2000 | | Short vectors of planar lattices via continued fractions | 10 | |
| 1 |
| |
| | 1991 | | Deduction systems based on resolution | 68 | |
| 2 |
| |
| | 2010 | | Query relaxation for entity-relationship search | 40 | |
| | 2009 | | MING: Mining Informative Entity-Relationship Subgraphs | 32 | |
| 1 |
| Fabri, Andreas |
| |
| | 1998 | | On the Design of CGAL, the Computational Geometry Algorithms Library | 31 | |
| 1 |
| Fatourou, Panagiota |
| |
| | 2000 | | Low-contention depth-first scheduling of parallel computations with synchronization variables | 56 | |
| 1 |
| Feige, Uriel |
| |
| | 1994 | | Short random walks on graphs | 14 | |
| 3 |
| Ferragina, Paolo |
| |
| | 1999 | | A theoretical and experimental study on the construction of suffix arrays in external memory | 40 | |
| | 1998 | | $q$-gram based database searching using a suffix array (QUASAR) | 11 | |
| | 1998 | | Randomized external-memory algorithms for some geometric problems | 27 | |
| 1 |
| Fiat, Amos |
| |
| | 1997 | | On-line network routing - a survey | 19 | |
| 2 |
| Fietzke, Arnaud |
| |
| | 2012 | | Automatic generation of inductive invariants by SUP(LA) | 26 | |
| | 2008 | | Labelled splitting | 45 | |
| 1 |
| |
| | 1996 | | Runtime prediction of real programs on real machines | 10 | |
| 8 |
| |
| | 1997 | | On the Bahncard problem | 16 | |
| | 1995 | | A polylog-time and $O(n\sqrt\lg n)$-work parallel algorithm for finding the row minima in totally monotone matrices | 12 | |
| | 1995 | | Matching nuts and bolts faster | 7 | |
| | 1994 | | Komplexitätstheorie und effiziente Algorithmen | 30 | |
| | 1992 | | A new lower bound technique for decision trees | 21 | |
| | 1992 | | A simple balanced search tree with 0(1) worst-case update time | 10 | |
| | 1991 | | Simultaneous inner and outer aproximation of shapes | 24 | |
| | 1991 | | A tight lower bound for the worst case of bottom-up-heapsort | 13 | |
| 1 |
| Follert, F. |
| |
| | 1995 | | Computing a largest empty anchored cylinder, and related problems | 17 | |
| 1 |
| Fousse, Laurent |
| |
| | 2004 | | A comparison of polynomial evaluation schemes | 19 | |
| 1 |
| Frederickson, Greg N. |
| |
| | 1998 | | Robustness analysis in combinatorial optimization | 66 | |
| 1 |
| Frigioni, D. |
| |
| | 1998 | | Fully dynamic shortest paths and negative cycle detection on diagraphs with Arbitrary Arc Weights | 18 | |
| 1 |
| Fronhöfer, B. (ed.) |
| |
| | 1993 | | Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993 | ? | |
| 1 |
| Fuchs, Christian |
| |
| | 2005 | | An emperical model for heterogeneous translucent objects | 20 | |
| 2 |
| Fuchs, Martin |
| |
| | 2009 | | A shaped temporal filter camera | 25 | |
| | 2005 | | Reflectance from images: a model-based approach for human faces | 33 | |
| 1 |
| |
| | 2007 | | Power assignment problems in wireless communication | 25 | |
| 7 |
| |
| | 1994 | | Killer transformations | 45 | |
| | 1994 | | LDS - Labelled Deductive Systems: Volume 1 - Foundations | 465 | |
| | 1993 | | Classical vs non-classical logics: the universality of classical logic | 101 | |
| | 1993 | | Towards automating duality | 50 | |
| | 1992 | | Temporal logic: Mathematical foundations, part 2 | 30 | |
| | 1992 | | Quantifier elimination in second-order predicate logic | 18 | |
| | 1992 | | Temporal logic: Mathematical foundations | 166 | |
| 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 | |
| 16 |
| |
| | 2002 | | Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi | 64 | |
| | 1999 | | Decidable fragments of simultaneous rigid reachability | 19 | |
| | 1998 | | Rigid reachability | 24 | |
| | 1997 | | Elimination of equality via transformation with ordering constraints | 18 | |
| | 1997 | | Strict basic superposition and chaining | 22 | |
| | 1997 | | A theory of resolution | 79 | |
| | 1996 | | Theorem proving in cancellative abelian monoids | 52 | |
| | 1995 | | Ordered chaining calculi for first-order theories of binary relations | 42 | |
| | 1995 | | Automated complexity analysis based on ordered resolution | 33 | |
| | 1993 | | Associative-commutative superposition | ? | |
| | 1993 | | Ordered chaining for total orderings | 20 | |
| | 1993 | | Rewrite techniques for transitive relations | 19 | |
| | 1993 | | Basic paramodulation | 36 | |
| | 1993 | | Superposition with simplification as a decision procedure for the monadic class with equality | 14 | |
| | 1992 | | Set constraints are the Monadic class | 13 | |
| | 1991 | | Rewrite-based equational theorem proving with selection and simplification | 24 | |
| 7 |
| Garg, Naveen |
| |
| | 1997 | | A polylogarithmic approximation algorithm for group Steiner tree problem | 7 | |
| | 1997 | | Faster and simpler algorithms for multicommodity flow and other fractional packing problems | 13 | |
| | 1997 | | Minimizing stall time in single and parallel disk systems | 16 | |
| | 1997 | | Evaluating a 2-approximation algorithm for edge-separators in planar graphs | 9 | |
| | 1997 | | Approximating sparsest cuts | 9 | |
| | 1996 | | Generalized $k$-Center Problems | 9 | |
| | 1996 | | Distributed list coloring: how to dynamically allocate frequencies to mobile base stations | 15 | |
| 2 |
| Gasieniec, Leszek |
| |
| | 1996 | | On the complexity of computing evolutionary trees | 14 | |
| | 1996 | | External inverse pattern matching | 12 | |
| 1 |
| |
| | 1991 | | A lower bound for the nondeterministic space complexity of contextfree recognition | 4 | |
| 1 |
| |
| | 2013 | | A distributed algorithm for large-scale generalized matching | 39 | |
| 1 |
| |
| | 2005 | | Bounded model checking of pointer programs | 34 | |
| 1 |
| |
| | 2007 | | LFthreads: a lock-free thread library | 36 | |
| 1 |
| |
| | 1998 | | On the Design of CGAL, the Computational Geometry Algorithms Library | 31 | |
| 7 |
| |
| | 2005 | | An emperical model for heterogeneous translucent objects | 20 | |
| | 2005 | | Photometric calibration of high dynamic range cameras
| 21 | |
| | 2003 | | 3D acquisition of mirroring objects | 37 | |
| | 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 | | 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 | |
| 1 |
| |
| | 1992 | | Self-testing and self-checking combinational circuits with weakly independent outputs | 18 | |
| 3 |
| |
| | 1994 | | Revenge of the dog: queries on Voronoi diagrams of moving points | 14 | |
| | 1993 | | Randomized Data Structures for the Dynamic Closest-Pair Problem | 32 | |
| | 1992 | | Simple randomized algorithms for closest pair problems | 14 | |
| 1 |
| |
| | 2005 | | Bottleneck behavior in CNF formulas | 35 | |
| 1 |
| |
| | 2005 | | Cycle bases of graphs and sampled manifolds | 30 | |
| 5 |
| |
| | 1994 | | Substitution tree indexing | 34 | |
| | 1993 | | Extended path-indexing | ? | |
| | 1993 | | Extended path-Indexing | ? | |
| | 1992 | | Path indexing for term retrieval | 12 | |
| | 1992 | | Path Indexing for Term Retrieval | 12 | |
| 2 |
| |
| | 2013 | | HDR reconstruction of cluttered dynamic scenes | ? | |
| | 2011 | | How not to be seen – inpainting dynamic objects in crowded scenes | 35 | |
| 1 |
| Grandoni, Fabrizio |
| |
| | 2002 | | Incrementally maintaining the number of l-cliques | 10 | |
| 1 |
| Grau, Oliver |
| |
| | 2011 | | How not to be seen – inpainting dynamic objects in crowded scenes | 35 | |
| 1 |
| Green, Ian |
| |
| | 1994 | | A general technique for automatically optimizing programs through the use of proof plans | 16 | |
| 6 |
| Grolmusz, Vince |
| |
| | 1993 | | On multi-party communication complexity of random functions | 10 | |
| | 1993 | | Harmonic analysis, real approximation, and the communication complexity of Boolean functions | 15 | |
| | 1993 | | MOD m gates do not help on the ground floor | 13 | |
| | 1993 | | Multi-party protocols and spectral norms | 11 | |
| | 1992 | | Separating the communication complexities of MOD m and MOD p circuits | 16 | |
| | 1992 | | Circuits and multi-party protocols | 16 | |
| 1 |
| |
| | 1992 | | A method for obtaining randomized algorithms with small tail probalities | 5 | |
| 1 |
| |
| | 1996 | | Discovering all most specific sentences by randomized algorithms | 23 | |
| 1 |
| |
| | 2016 | | Diversifying Search Results Using Time | ? | |
| 8 |
| |
| | 1996 | | Optimal algorithms for some proximity problems on the Gaussian sphere with applications | 8 | |
| | 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 | |
| | 1994 | | The rectangle enclosure and point-dominance problems revisited | 16 | |
| | 1994 | | Fast algorithms for collision and proximity problems involving moving geometric objects | 22 | |
| | 1993 | | Effizient algorithms for generalized intersection searching on non-iso-oriented objects | 32 | |
| |  1993 | | Algorithms for some intersection searching problems involving curved objects | 43 | |
| | | | | | |
| | 1992 | | Further results on generalized intersection searching problems: counting, reporting, and dynamization | 41 | |
| 1 |
| |
| | 1998 | | Partisan corroboration, and shifted pairing | 35 | |
| 1 |
| |
| | 1997 | | AGD-Library: A Library of Algorithms for Graph Drawing | 13 | |
| 2 |
| |
| | 2004 | | Modeling hair using a wisp hair model | 40 | |
| | 1999 | | A framework for evaluating the quality of lossy image compression | 20 | |
| 19 |
| Hagerup, Torben |
| |
| | 1998 | | Simpler and faster static AC$^0$ dictionaries | 13 | |
| | 1997 | | Datenstrukturen und Algorithmen | 223 | |
| | 1996 | | More geneal parallel tree contraction: Register allocation and broadcasting in a tree | 24 | |
| | 1996 | | Vorlesungsskript Komplexitätstheorie | 150 | |
| | 1995 | | Sorting in linear time? | 32 | |
| | 1995 | | Parallel algorithms with optimal speedup for bounded treewidth | 27 | |
| | 1994 | | Prefix graphs and their applications | 13 | |
| | 1994 | | Improved parallel integer sorting without concurrent writing | ? | |
| | 1993 | | Optimal parallel string algorithms: sorting, merching and computing the minimum | 25 | |
| | 1993 | | Fast parallel space allocation, estimation and integer sorting (revised) | 85 | |
| | 1993 | | Generalized topological sorting in linear time | 10 | |
| | 1993 | | Approximate and exact deterministic parallel selection | 10 | |
| | 1992 | | Fast deterministic processor allocation | 11 | |
| | 1992 | | not published | | |
| | 1992 | | Waste makes haste: tight bounds for loose parallel sorting | 185 | |
| | 1992 | | Fast integer merging on the EREW PRAM | 12 | |
| | 1991 | | On a compaction theorem of ragde | 6 | |
| | 1991 | | An $O(n^3)$-time maximum-flow algorithm | 30 | |
| | 1991 | | Fast parallel space allocation, estimation an integer sorting | 28 | |
| 1 |
| Hähnle, R. (ed.) |
| |
| | 1993 | | Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993 | ? | |
| 1 |
| Hangelbroek, Thomas |
| |
| | 2003 | | The dimension of $C^1$ splines of arbitrary degree on a tetrahedral partition | 39 | |
| 1 |
| Hanika, Johannes |
| |
| | 2009 | | Acquisition and analysis of bispectral bidirectional reflectance distribution functions | 25 | |
| 8 |
| Hanus, Michael |
| |
| | 1994 | | On extra variables in (Equational) logic programming | 33 | |
| | 1994 | | Integration of declarative paradigms: Proceedings of the ICLP'94 Post-Conference Workshop, Santa Margherita Ligure, Italy | 149 | |
| | 1994 | | The integration of functions into logic programming: a survey | 48 | |
| | 1993 | | A needed narrowing strategy | 28 | |
| | 1993 | | A debugging model for functional logic programs | 14 | |
| | 1993 | | Lazy unification with inductive simplification | 20 | |
| | 1992 | | Analysis of nonlinear constraints in CLP(R) | 31 | |
| | 1992 | | An abstract interpretation algorithm for residuating logic programs | 20 | |
| 1 |
| |
| | 1994 | | On the intellectual terrain around NP | 11 | |
| 5 |
| |
| | 2009 | | MPI Informatics building model as data for your research | 113 | |
| | 2007 | | Global illumination using photon ray splatting | 65 | |
| | 2006 | | On fast construction of spatial hierarchies for ray tracing | 40 | |
| | 2004 | | Faster ray tracing with SIMD shaft culling | 13 | |
| | 2003 | | A custom designed density estimation method for light transport | 28 | |
| 1 |
| |
| | 1991 | | Approximate decision algorithms for point set congruence | 25 | |
| 3 |
| |
| | 2001 | | Efficient light transport using precomputed visibility | 32 | |
| | 2001 | | Image-based reconstruction of spatially varying materials | 20 | |
| | 2000 | | Bump map shadows for openGL rendering | 18 | |
| 2 |
| |
| | 1998 | | Scheduling multicasts on unit-capacity trees and meshes | 38 | |
| | 1997 | | Exploring unknown environments | 23 | |
| 2 |
| Henzinger, Thomas A. |
| |
| | 1999 | | Axioms for real-time logics | 31 | |
| | 1999 | | Fully decidable logics, automata and classical theories for defining regular real-time languages | 102 | |
| 2 |
| |
| | 2002 | | Exp Lab: a tool set for computational experiments | 59 | |
| | 2001 | | An adaptable and extensible geometry kernel | 27 | |
| 1 |
| Herzig, Andreas |
| |
| | 1996 | | SCAN and systems of conditional logic | 33 | |
| 2 |
| Herzog, Robert |
| |
| | 2007 | | Global illumination using photon ray splatting | 65 | |
| | 2006 | | On fast construction of spatial hierarchies for ray tracing | 40 | |
| 1 |
| |
| | 1992 | | A recursion planning analysis of inductive completion | 14 | |
| 2 |
| |
| | 2007 | | Superposition for finite domains | 29 | |
| | 2007 | | Superpositon for Finite Domains | 29 | |
| 1 |
| Hodkinson, Ian M. |
| |
| | 1992 | | Temporal logic: Mathematical foundations, part 2 | 30 | |
| 1 |
| Hoefer, Martin |
| |
| | 2002 | | Performance of heuristic and approximation algorithms for the uncapacitated facility location problem | 27 | |
| 1 |
| Hoepmann, J.-H. |
| |
| | 1995 | | Towards self-stabilizing wait-free shared memory objects | 15 | |
| 1 |
| Hoffart, Johannes |
| |
| | 2010 | | YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia | 50 | |
| 1 |
| Hoffmann, Jörg |
| |
| | 2005 | | Bottleneck behavior in CNF formulas | 35 | |
| 1 |
| Hoffmann, Michael |
| |
| | 2001 | | An adaptable and extensible geometry kernel | 27 | |
| 1 |
| Hopf, Jörn (ed.) |
| |
| | 1994 | | Genetic algorithms within the framework of evolutionary computation: Proceedings of the KI-94 Workshop | 161 | |
| 3 |
| Horbach, Matthias |
| |
| | 2009 | | Superposition for fixed domains | 49 | |
| | 2010 | | Decidability results for saturation-based model building | 38 | |
| | 2009 | | Deciding the inductive validity of $\forall\exists^*$ queries | 43 | |
| 1 |
| Hromkovic, Juraj |
| |
| | 1991 | | On embeddings in cycles | 22 | |
| 1 |
| Huang, Chien-Chung |
| |
| | 2010 | | Maximum cardinality popular matchings in strict two-sided preference lists | 17 | |
| 1 |
| Hullin, Matthias B. |
| |
| | 2009 | | Acquisition and analysis of bispectral bidirectional reflectance distribution functions | 25 | |
| 7 |
| Hustadt, Ullrich |
| |
| | 1997 | | On evaluating decision procedures for modal logic | 50 | |
| | 1995 | | Translating graded modalities into predicate logic | 37 | |
| | 1992 | | Motel user manual | 45 | |
| | 1992 | | Motel User Manual | | |
| | 1992 | | Motel User Manual | | |
| | 1992 | | Unification and matching in Church's Original Lambda Calculus | 16 | |
| | 1991 | | A complete transformation system for polymorphic higher-order unification | 22 | |
| 3 |
| Ifrim, Georgiana |
| |
| | 2009 | | Generating concise and readable summaries of XML documents | 30 | |
| | 2007 | | NAGA: searching and ranking knowledge | 42 | |
| | 2006 | | Combining linguistic and statistical analysis to extract relations from web documents | 37 | |
| 1 |
| Ihrke, Ivo |
| |
| | 2010 | | A Bayesian approach to manifold topology reconstruction | 23 | |
| 1 |
| In Kim, Kwang |
| |
| | 2011 | | How not to be seen – inpainting dynamic objects in crowded scenes | 35 | |
| 1 |
| Indyk, Piotr |
| |
| | 1996 | | External inverse pattern matching | 12 | |
| 1 |
| Ivrissimtzis, Ioannis |
| |
| | 2003 | | Neural meshes: statistical learning methods in surface reconstruction | 23 | |
| 1 |
| Ivrissimtzis, I.P. |
| |
| | 2004 | | Neural meshes: surface reconstruction with a learning algorithm | 22 | |
| 3 |
| Jacquemard, Florent |
| |
| | 1999 | | Decidable fragments of simultaneous rigid reachability | 19 | |
| | 1998 | | Rigid reachability | 24 | |
| | 1998 | | Unification in extensions of shallow equational theories | 31 | |
| 2 |
| Jaeger, Manfred |
| |
| | 2003 | | A representation theorem and applications to measure selection and noninformative priors | 35 | |
| | 1994 | | A probabilistic extension of terminological logics | 64 | |
| 1 |
| |
| | 1994 | | Fast algorithms for collision and proximity problems involving moving geometric objects | 22 | |
| 7 |
| |
| | 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 | |
| | 1994 | | The rectangle enclosure and point-dominance problems revisited | 16 | |
| | 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 | | Algorithms for some intersection searching problems involving curved objects | 43 | |
| | | | | | |
| | 1992 | | Further results on generalized intersection searching problems: counting, reporting, and dynamization | 41 | |
| 4 |
| Jansen, Klaus |
| |
| | 1998 | | Improved approximation schemes for scheduling unrelated parallel machines | 14 | |
| | 1998 | | Linear-time approximation schemes for scheduling malleable parallel tasks | 15 | |
| | 1998 | | A new characterization for parity graphs and a coloring problem with costs | 16 | |
| | 1998 | | The mutual exclusion scheduling problem for permutation and comparability graphs | 12 | |
| 1 |
| |
| | 1996 | | On the complexity of computing evolutionary trees | 14 | |
| 1 |
| |
| | 2003 | | Neural meshes: statistical learning methods in surface reconstruction | 23 | |
| 1 |
| |
| | 2004 | | Neural meshes: surface reconstruction with a learning algorithm | 22 | |
| 1 |
| |
| | 1996 | | Rotations of periodic strings and short superstrings | 13 | |
| 1 |
| |
| | 1996 | | Rotations of periodic strings and short superstrings | 13 | |
| 1 |
| |
| | 1993 | | Solving simplifications ordering constraints | 16 | |
| 1 |
| |
| | 1993 | | A debugging model for functional logic programs | 14 | |
| 9 |
| |
| | 1998 | | A note on computing a maximal planar subgraph using PQ-trees | 5 | |
| | 1997 | | Pitfalls of using PQ--Trees in automatic graph drawing | 12 | |
| | 1997 | | Algorithmen zum automatischen Zeichnen von Graphen | 9 | |
| | 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 | | 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 | | Exact ground states of Ising spin classes: new experimental results with a branch and cut algorithm | 17 | |
| 1 |
| |
| | 1997 | | Parallel algorithms for MD-simulations of synthetic polymers | 32 | |
| 1 |
| |
| | 1992 | | Dynamic point location in general subdivisions | 30 | |
| 1 |
| |
| | 1996 | | Gossiping on meshes and tori | 19 | |
| 1 |
| |
| | 2011 | | Finding images of rare and ambiguous entities | 30 | |
| 1 |
| |
| | 2000 | | Geometric modeling based on polygonal meshes | 52 | |
| 1 |
| |
| | 2005 | | Cycle bases of graphs and sampled manifolds | 30 | |
| 3 |
| |
| | 1996 | | On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees | 14 | |
| | 1995 | | Dynamic maintenance of 2-d convex hulls and order decomposable problems | 22 | |
| | 1993 | | New techniques for exact and approximate dynamic closest-point problems | 29 | |
| 1 |
| |
| | 1994 | | Quickest paths: faster algorithms and dynamization | 15 | |
| 1 |
| |
| | 1994 | | Further improvements of Steiner tree approximations | 10 | |
| 1 |
| |
| | 1992 | | A method for obtaining randomized algorithms with small tail probalities | 5 | |
| 5 |
| |
| | 2009 | | MING: Mining Informative Entity-Relationship Subgraphs | 32 | |
| | 2009 | | Coupling knowledge bases and web services for active knowledge | 24 | |
| | 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 | |
| 1 |
| |
| | 2006 | | Yago - a core of semantic knowledge | 39 | |
| 1 |
| |
| | 1997 | | A unifying framework for integer and finite domain constraint programming | 24 | |
| 6 |
| |
| | 2005 | | A faster algorithm for computing a longest common increasing
subsequence | 13 | |
| | 2005 | | Reachability substitutes for planar digraphs | 24 | |
| | 2004 | | On algorithms for online topological ordering and sorting | 15 | |
| | 2004 | | Filtering algorithms for the Same and UsedBy constraints | 36 | |
| | 2003 | | Fast bound consistency for the global cardinality constraint | 30 | |
| | 2002 | | A practical minimum spanning tree algorithm using the cycle property | 21 | |
| 3 |
| Kaufmann, Michael |
| |
| | 1997 | | BSP-like external-memory computation | 14 | |
| | 1994 | | Towards practical permutation routing on meshes | 11 | |
| | 1993 | | Deterministic 1-k routing on meshes with applications to worm-hole routing | 13 | |
| 8 |
| Kautz, Jan |
| |
| | 2011 | | Videoscapes: exploring unstructured video collections | 32 | |
| | 2011 | | How not to be seen – inpainting dynamic objects in crowded scenes | 35 | |
| | 2009 | | Acquisition and analysis of bispectral bidirectional reflectance distribution functions | 25 | |
| | 2002 | | Tutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models | 50 | |
| | 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 | | Bump map shadows for openGL rendering | 18 | |
| 1 |
| |
| | 2010 | | Maximum cardinality popular matchings in strict two-sided preference lists | 17 | |
| 1 |
| |
| | 1994 | | Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems | 38 | |
| 3 |
| |
| | 2005 | | A Framework of refutational theorem proving for saturation-based decision procedures | ? | |
| | 2004 | | Resolution decision procedures for the guarded fragment with transitive guards | 32 | |
| | 2003 | | Subsumption of concepts in $DL$ $\cal FL_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete | 12 | |
| 2 |
| |
| | 1996 | | A branch-and-cut algorithm for multiple sequence alignment | 15 | |
| | 1996 | | A branch-and-cut approach to physical mapping with end-probes | 10 | |
| 2 |
| Kedem, K. |
| |
| | 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 | |
| 1 |
| |
| | 1998 | | On the performance of LEDA-SM | 26 | |
| 1 |
| |
| | 2012 | | Symmetry detection in large scale city scans | 32 | |
| 1 |
| |
| | 2006 | | Division-free computation of subresultants using bezout matrices | 20 | |
| 6 |
| |
| | 2007 | | Linear-time reordering in a sweep-line algorithm for algebraic curves intersecting in a common point | 20 | |
| | 2006 | | Snap rounding of Bézier curves | 39 | |
| | 2002 | | Exp Lab: a tool set for computational experiments | 59 | |
| | 2001 | | An adaptable and extensible geometry kernel | 27 | |
| | 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 | |
| 1 |
| Khandekar, Rohit |
| |
| | 2013 | | A distributed algorithm for large-scale generalized matching | 39 | |
| 1 |
| Kim, Jin Hyung |
| |
| | 2011 | | Efficient learning-based image enhancement : application to
compression artifact removal and super-resolution | 28 | |
| 4 |
| Kim, Kwang In |
| |
| | 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 | |
| 1 |
| |
| | 2006 | | Gesture modeling and animation by imitation | 62 | |
| 1 |
| |
| | 1996 | | Beyond the finite in automatic hardware verification | 51 | |
| 2 |
| |
| | 1998 | | Optimal compaction of orthogonal grid drawings | 20 | |
| | 1998 | | Quasi-orthogonal drawing of planar graphs | 15 | |
| 1 |
| Klein, Reinhard |
| |
| | 2011 | | A morphable part model for shape manipulation | 33 | |
| 1 |
| Klein, Rolf |
| |
| | 1993 | | Randomized incremental construction of abstract Voronoi diagrams | 29 | |
| 1 |
| Kobbelt, Leif P. |
| |
| | 2000 | | Geometric modeling based on polygonal meshes | 52 | |
| 1 |
| Koga, Joachim |
| |
| | 1994 | | New on-line algorithms for the page replication problem | 18 | |
| 1 |
| Kohlbacher, Oliver |
| |
| | 2000 | | A branch and cut algorithm for the optimal solution of the side-chain placement problem | 26 | |
| 1 |
| Kohlbacher, O. |
| |
| | 1999 | | BALL: Biochemical Algorithms Library | 20 | |
| 3 |
| Könemann, Jochen |
| |
| | 1997 | | Faster and simpler algorithms for multicommodity flow and other fractional packing problems | 13 | |
| | 1996 | | High-precision floating point numbers in LEDA | 47 | |
| | 1995 | | Radix heaps an efficient implementation for priority queues | 27 | |
| 1 |
| Konjevod, Goran |
| |
| | 1997 | | A polylogarithmic approximation algorithm for group Steiner tree problem | 7 | |
| 1 |
| Korst, Jan |
| |
| | 1999 | | Fast concurrent access to parallel disks | 30 | |
| 1 |
| Koster, Martin |
| |
| | 2004 | | Modeling hair using a wisp hair model | 40 | |
| 1 |
| Kovács, Annamaria |
| |
| | 2003 | | Sum-Multicoloring on paths | 20 | |
| 3 |
| Kraan, Ina |
| |
| | 1993 | | A framework for program development based on schematic proof | 12 | |
| | 1993 | | Middle-out reasoning for logic program synthesis | 12 | |
| | 1992 | | Logic program synthesis via proof planning | 14 | |
| 1 |
| Krawczyk, Grzegorz |
| |
| | 2005 | | Photometric calibration of high dynamic range cameras
| 21 | |
| 1 |
| Krischer, Stefan |
| |
| | 1993 | | Narrowing strategies for arbitrary canonical rewrite systems | 29 | |
| 1 |
| Krithivasan, Kamala |
| |
| | 1992 | | The largest hyper-rectangle in a three dimensional orthogonal polyhedron | 7 | |
| 1 |
| Krone, Henning |
| |
| | 1998 | | On the performance of LEDA-SM | 26 | |
| 1 |
| Kruglov, Evgeny |
| |
| | 2012 | | Automatic generation of inductive invariants by SUP(LA) | 26 | |
| 5 |
| Krysta, Piotr |
| |
| | 2003 | | Selfish traffic allocation for server farms | 43 | |
| | 2003 | | Scheduling and traffic allocation for tasks with bounded splittability | 15 | |
| | 2001 | | Approximating minimum size 1,2-connected networks | 22 | |
| | 1998 | | New approximation algorithms for the achromatic number | 26 | |
| | 1996 | | External inverse pattern matching | 12 | |
| 3 |
| Kucera, Ludek |
| |
| | 1993 | | Coloring k-colorable graphs in expected parallel time | 14 | |
| | 1993 | | Expected complexity of graph partitioning problems | 16 | |
| | 1993 | | Broadcasting through a noisy one-dimensional network | 14 | |
| 1 |
| Kumar, Kondreddi Sarath |
| |
| | 2009 | | Generating concise and readable summaries of XML documents | 30 | |
| 1 |
| Kuncak, Viktor |
| |
| | 2006 | | On verifying complex properties using symbolic shape analysis | 32 | |
| 1 |
| Kutylowski, Miroslaw |
| |
| | 1992 | | Fast integer merging on the EREW PRAM | 12 | |
| 2 |
| Kutz, Martin |
| |
| | 2005 | | A faster algorithm for computing a longest common increasing
subsequence | 13 | |
| | 2005 | | Reachability substitutes for planar digraphs | 24 | |
| 1 |
| |
| | 2011 | | Efficient learning-based image enhancement : application to
compression artifact removal and super-resolution | 28 | |
| 1 |
| |
| | 1998 | | On the performance of LEDA-SM | 26 | |
| 3 |
| |
| | 2007 | | Construction of smooth maps with mean value coordinates | 22 | |
| | 2006 | | Mean value coordinates for arbitrary spherical polygons and
polyhedra in $\mathbbR^3$ | 19 | |
| | 2005 | | Analysis and design of discrete normals and curvatures | 42 | |
| 1 |
| |
| | 2002 | | Tutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models | 50 | |
| 1 |
| |
| | 2007 | | Power assignment problems in wireless communication | 25 | |
| 1 |
| |
| | 2004 | | Neural meshes: surface reconstruction with a learning algorithm | 22 | |
| 1 |
| |
| | 2004 | | Neural meshes: surface reconstruction with a learning algorithm | 22 | |
| 2 |
| |
| | 1998 | | A note on computing a maximal planar subgraph using PQ-trees | 5 | |
| | 1997 | | Pitfalls of using PQ--Trees in automatic graph drawing | 12 | |
| 12 |
| Lenhof, Hans-Peter |
| |
| | 2000 | | A branch and cut algorithm for the optimal solution of the side-chain placement problem | 26 | |
| | 1998 | | $q$-gram based database searching using a suffix array (QUASAR) | 11 | |
| | 1997 | | New contact measures for the protein docking problem | 10 | |
| | 1997 | | Parallel algorithms for MD-simulations of synthetic polymers | 32 | |
| | 1996 | | A branch-and-cut algorithm for multiple sequence alignment | 15 | |
| | 1996 | | Computational Molecular Biology | 26 | |
| | 1995 | | An algorithm for the protein docking problem | 11 | |
| | 1993 | | Static and dynamic algorithms for k-point clustering problems | 20 | |
| | 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 construction method for generalized convex layers | 25 | |
| 1 |
| |
| | 1999 | | BALL: Biochemical Algorithms Library | 20 | |
| 3 |
| |
| | 2006 | | Enhanced dynamic reflectometry for relightable free-viewpoint video | 37 | |
| | 2005 | | Joint motion and reflectance capture for creating relightable 3D videos | 18 | |
| | 2005 | | Reflectance from images: a model-based approach for human faces | 33 | |
| 7 |
| |
| | 2009 | | A shaped temporal filter camera | 25 | |
| | 2009 | | Acquisition and analysis of bispectral bidirectional reflectance distribution functions | 25 | |
| | 2003 | | 3D acquisition of mirroring objects | 37 | |
| | 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 | | 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 | |
| 5 |
| |
| | 2003 | | Cross-monotonic cost sharing methods for connected facility location games | 10 | |
| | 2003 | | Average case and smoothed competitive analysis of the multi-level feedback algorithm | 31 | |
| | 1998 | | Scheduling multicasts on unit-capacity trees and meshes | 38 | |
| | 1997 | | On-line network routing - a survey | 19 | |
| | 1997 | | Minimizing stall time in single and parallel disk systems | 16 | |
| 1 |
| Leonardi, Stefano Alberto |
| |
| | 1997 | | Randomized on-line call control revisited | 19 | |
| 1 |
| |
| | 1997 | | The practical use of the $\calA^*$ algorithm for exact multiple sequence alignment | 16 | |
| 1 |
| |
| | 1996 | | On the complexity of computing evolutionary trees | 14 | |
| 1 |
| |
| | 2003 | | A flexible and versatile studio for synchronized multi-view video recording | 18 | |
| 1 |
| |
| 1 |
| '{s}, Krzysztof |
| |
| | 1998 | | New approximation algorithms for the achromatic number | 26 | |
| 1 |
| Lu, Tianxiang |
| |
| | 2011 | | Towards verification of the pastry protocol using TLA+ | 51 | |
| 1 |
| Lynch, Christopher |
| |
| | 1993 | | Basic paramodulation | 36 | |
| 1 |
| Maas, Martin |
| |
| | 1993 | | Generalized topological sorting in linear time | 10 | |
| 4 |
| Madden, Peter |
| |
| | 1994 | | A survey of program transformation with special reference to unfold/fold style program development | 36 | |
| | 1994 | | Recursive program optimization through inductive synthesis proof transformation | 44 | |
| | 1994 | | A general technique for automatically optimizing programs through the use of proof plans | 16 | |
| | 1994 | | Formal methods of automated program improvement | 12 | |
| 1 |
| |
| | 1993 | | On kernels, defaults and even graphs | 11 | |
| 5 |
| |
| | 2006 | | Garment texture editing in monocular video sequences based on
color-coded printing patterns | 24 | |
| | 2006 | | Enhanced dynamic reflectometry for relightable free-viewpoint video | 37 | |
| | 2006 | | A framework for natural animation of digitized models | 27 | |
| | 2004 | | Axisymmetric reconstruction and 3D visualization of bipolar planetary nebulae | 20 | |
| | 2003 | | A flexible and versatile studio for synchronized multi-view video recording | 18 | |
| 1 |
| |
| | 2005 | | Joint motion and reflectance capture for creating relightable 3D videos | 18 | |
| 2 |
| |
| | 1998 | | Solving some discrepancy problems in NC* | 21 | |
| | 1996 | | Derandomizing semidefinite programming based approximation algorithms | 22 | |
| 3 |
| Maheshwari, Anil |
| |
| | 1995 | | Efficient computation of implicit representations of sparse graphs (revised version) | 16 | |
| | 1994 | | Efficient computation of compact representations of sparse graphs | 10 | |
| | 1994 | | Realizing degree sequences in parallel | 27 | |
| 3 |
| Maier, Patrick |
| |
| | 2005 | | Bounded model checking of pointer programs | 34 | |
| | 2004 | | Intuitionistic LTL and a new characterization of safety and liveness | 20 | |
| | 2003 | | Compositional circular assume-guarantee rules cannot be sound and complete | 22 | |
| 1 |
| Majumdar, Debapriyo |
| |
| | 2006 | | IO-Top-k: index-access optimized top-k query processing | 49 | |
| 1 |
| Makari, Faraz |
| |
| | 2013 | | A distributed algorithm for large-scale generalized matching | 39 | |
| 1 |
| Malinger, Itay |
| |
| | 2008 | | Characterizing the performance of Flash memory storage devices and its impact on algorithm design | 36 | |
| 1 |
| Mamoulis, Nikos |
| |
| | 2009 | | Scalable phrase mining for ad-hoc text analytics | 41 | |
| 1 |
| Mannila, Heikki |
| |
| | 1996 | | Discovering all most specific sentences by randomized algorithms | 23 | |
| 1 |
| Manss, Christian |
| |
| | 1997 | | Evaluating a 2-approximation algorithm for edge-separators in planar graphs | 9 | |
| 1 |
| Mantiuk, Rafal |
| |
| | 2006 | | Design and evaluation of backward compatible high dynamic range video compression | 50 | |
| 1 |
| Marchetti-Spaccamela, Alberto |
| |
| | 2003 | | Average case and smoothed competitive analysis of the multi-level feedback algorithm | 31 | |
| 1 |
| Marchetti-Spaccamela, Alessio Presciutti |
| |
| | 1997 | | Randomized on-line call control revisited | 19 | |
| 1 |
| Marchetti-Spaccamela, A. |
| |
| | 1998 | | Fully dynamic shortest paths and negative cycle detection on diagraphs with Arbitrary Arc Weights | 18 | |
| 1 |
| Martens, William |
| |
| | 2002 | | Perceptual evaluation of tone mapping operators with regard to similarity and preference | 30 | |
| 9 |
| Matthews, Seán |
| |
| | 1997 | | Labelled modal logics: quantifiers | 31 | |
| | 1996 | | Natural deduction for non-classical logics | 44 | |
| | 1996 | | Labelled propositional modal logics: theory and practice | 46 | |
| | 1994 | | Reflection using the derivability conditions | 14 | |
| | 1993 | | *No Title | | |
| | 1993 | | A conservative extension of first-order logic and its application to theorem proving | 11 | |
| | 1993 | | A framework for program development based on schematic proof | 12 | |
