| BibTeX cite key | Name(s) | Year | Title |
|---|
 AitKaciHanusMorenoNavarro-94-mpii224 | Aït-Kaci, Hanus, Navarro | 1994 | Integration of declarative paradigms: Proceedings of the ICLP'94 Post-Conference Workshop, Santa Margherita Ligure, Italy |
| AjwaniMalingerMeyerToledo2008 | Ajwani, Malinger, Meyer, Toledo | 2008 | Characterizing the performance of Flash memory storage devices and its impact on algorithm design |
| Albers92 | Albers | 1992 | The influence of lookahead in competitive on-line algorithms |
| Albers97 | Albers | 1997 | Better bounds for online scheduling |
| AlbersGargLeonardi97 | Albers, Garg, Leonardi | 1997 | Minimizing stall time in single and parallel disk systems |
| AlbersHagerup94 | Albers, Hagerup | 1994 | Improved parallel integer sorting without concurrent writing |
| AlbersHenzinger97 | Albers, Henzinger | 1997 | Exploring unknown environments |
| AlbersKoga94 | Albers, Koga | 1994 | New on-line algorithms for the page replication problem |
| AlbersSchmidt98 | Albers, Schmidt | 1998 | Scheduling with unexpected machine breakdowns |
| AlbersWestbrook96 | Albers, Westbrook | 1996 | A survey of self-organizing data structures |
| AlbertsGutwengerMutzelNáher | Alberts, Gutwenger, Mutzel, Näher | 1997 | AGD-Library: A Library of Algorithms for Graph Drawing |
| AlbrechtKippNeffSeidel2006 | Albrecht, Kipp, Neff, Seidel | 2006 | Gesture modeling and animation by imitation |
| AltGeffertMehlhorn91 | Alt, Geffert, Mehlhorn | 1991 | A lower bound for the nondeterministic space complexity of contextfree recognition |
| AltGuibasMehlhornKarpWidgerson92 | Alt, Guibas, Mehlhorn, Karp, Widgerson | 1992 | A method for obtaining randomized algorithms with small tail probalities |
| AlthausCanzer2007 | Althaus, Canzar | 2007 | A Lagrangian relaxation approach for the multiple sequence alignment problem |
| AlthausKohlbacherLenhofMüller2000 | Althaus, Kohlbacher, Lenhof, Müller | 2000 | A branch and cut algorithm for the optimal solution of the side-chain placement problem |
| AlthausMehlhorn97 | Althaus, Mehlhorn | 1997 | Maximum network flow with floating point arithmetic |
| AlthausPolzinDaneshmand2003 | Althaus, Polzin, Daneshmand | 2003 | Improving linear programming approaches for the Steiner tree problem |
| AlvanakiMichelStupar2012 | Alvanaki, Michel, Stupar | 2012 | Building and maintaining halls of fame over a database |
| Anand2011 | Anand, Bedathur, Berberich, Schenkel | 2011 | Temporal index sharding for space-time efficiency in archive search |
| AnandBedathurBerberichSchenkel2010 | Anand, Bedathur, Berberich, Schenkel | 2010 | Efficient temporal keyword queries over versioned text |
| AnandMeleBedathurBerberich2014 | Anand, Mele, Bedathur, Berberich | 2014 | Phrase Query Optimization on Inverted Indexes |
| AnderssonNilssonHagerupRaman95 | Andersson, Nilsson, Hagerup, Raman | 1995 | Sorting in linear time? |
| AngelovaSiersdorfer2006 | Angelova, Siersdorfer | 2006 | A neighborhood-based approach for clustering of linked document collections |
| AntoyEchahedHanus93 | Antoy, Echahed, Hanus | 1993 | A needed narrowing strategy |
| Arikati94MPII94-162 | Arikati | 1994 | On the parallel complexity of degree sequence problems |
| ArikatiChaudhuriZaroliagis96 | Arikati, Chaudhuri, Zaroliagis | 1996 | All-pairs min-cut in sparse networks |
| ArikatiMaheshwari94 | Arikati, Maheshwari | 1994 | Realizing degree sequences in parallel |
| ArikatiMaheshwariZaroliagis | Arikati, Maheshwari, Zaroliagis | 1994 | Efficient computation of compact representations of sparse graphs |
| ArikatiMaheshwariZaroliagis95 | Arikati, Maheshwari, Zaroliagis | 1995 | Efficient computation of implicit representations of sparse graphs (revised version) |
| AryaMountSmid94 | Arya, Mount, Smid | 1994 | Dynamic algorithms for geometric spanners of small diameter: randomized solutions |
| AryaSmid94 | Arya, Smid | 1994 | Efficient construction of a bounded degree spanner with low weight |
| BaaderOhlbach95 | Baader, Ohlbach | 1995 | A multi-dimensional terminological knowledge representation language |
| Bachmair-et-el-93-mpii236 | Bachmair, Ganzinger, Lynch, Snyder | 1993 | Basic paramodulation |
| Bachmair91 | Bachmair | 1991 | Associative-commutative reduction orderings |
| BachmairGanzinger-91-mpii208 | Bachmair, Ganzinger | 1991 | Rewrite-based equational theorem proving with selection and simplification |
| BachmairGanzinger-93-mpii249 | Bachmair, Ganzinger | 1993 | Rewrite techniques for transitive relations |
| BachmairGanzinger-93-mpii250 | Bachmair, Ganzinger | 1993 | Ordered chaining for total orderings |
| BachmairGanzinger-93-mpii267 | Bachmair, Ganzinger | 1993 | Associative-commutative superposition |
| BachmairGanzinger-95-mpii2-009 | Bachmair, Ganzinger | 1995 | Ordered chaining calculi for first-order theories of binary relations |
| BachmairGanzinger-97-mpii2-005 | Bachmair, Ganzinger | 1997 | A theory of resolution |
| BachmairGanzinger97 | Bachmair, Ganzinger | 1997 | Strict basic superposition and chaining |
| BachmairGanzingerVoronkov97 | Bachmair, Ganzinger, Voronkov | 1997 | Elimination of equality via transformation with ordering constraints |
| BargmannBlanzSeidel2007 | Bargmann, Blanz, Seidel | 2007 | A nonlinear viseme model for triphone-based speech synthesis |
| Barnes94 | Barnes | 1994 | A method for implementing lock-free shared data structures |
| BarnesEdmonds94 | Barnes, Edmonds | 1994 | Time-space lower bounds for directed s-t connectivity on JAG models |
| BarnesFeige94 | Barnes, Feige | 1994 | Short random walks on graphs |
| BarnettBasinHesketh92 | Barnett, Basin, Hesketh | 1992 | A recursion planning analysis of inductive completion |
| barth-92-mpii233 | Barth | 1992 | CLP($\cal PB$): A Meta-Interpreter in CLP($\cal R$) |
| Barth-94-mpii216 | Barth | 1994 | Linear 0-1 inequalities and extended clauses |
| Barth-95-mpii2003 | Barth | 1995 | A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization |
| BarthBockmayr-94-mpii261 | Barth, Bockmayr | 1994 | Finite domain and cutting plane techniques in CLP($\cal PB$) |
| Basin-94-mpii218 | Basin | 1994 | Logic frameworks for logic programs |
| BasinBundyKraanMatthews93 | Basin, Bundy, Kraan, Matthews | 1993 | A framework for program development based on schematic proof |
| BasinConstable92 | Basin, Constable | 1992 | Metalogical frameworks |
| BasinGanzinger95 | Basin, Ganzinger | 1995 | Automated complexity analysis based on ordered resolution |
| BasinHähnleFronhöferPoseggaSchwind93 | Basin, Hähnle, Fronhöfer, Posegga, Schwind (ed.) | 1993 | Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993 |
| BasinKlarlund | Basin, Klarlund | 1996 | Beyond the finite in automatic hardware verification |
| BasinKraanBundy93 | Basin, Kraan, Bundy | 1993 | Middle-out reasoning for logic program synthesis |
| BasinMatthews93 | Basin, Matthews | 1993 | A conservative extension of first-order logic and its application to theorem proving |
| BasinMatthewsViganò | Basin, Matthews, Viganò | 1996 | Labelled propositional modal logics: theory and practice |
| BasinMatthewsVigano96 | Basin, Matthews, Viganò | 1996 | Natural deduction for non-classical logics |
| BasinMatthewsVigano97 | Basin, Matthews, Viganò | 1997 | Labelled modal logics: quantifiers |
| BasinWalsh-94-mpii209 | Basin, Walsh | 1994 | Termination orderings for rippling |
| BasinWalsh92a | Basin, Walsh | 1992 | Difference matching |
| BasinWalsh92b | Basin, Walsh | 1992 | Difference unification |
| BastHagerup93 | Bast, Hagerup | 1993 | Fast parallel space allocation, estimation and integer sorting (revised) |
| BastMajumdarSchenkelTheobaldWeikum2006 | Bast, Majumdar, Schenkel, Theobald, Weikum | 2006 | IO-Top-k: index-access optimized top-k query processing |
| BastWeberMortensen2006 | Bast, Weber, Mortensen | 2006 | Output-sensitive autocompletion search |
| BaswanaTelikepalli2005 | Baswana, Telikepalli | 2005 | Improved algorithms for all-pairs approximate shortest paths in weighted graphs |
| Baumeister96 | Baumeister | 1996 | Using algebraic specification languages for model-oriented specifications |
| BaumgartenJungMehlhorn92 | Baumgarten, Jung, Mehlhorn | 1992 | Dynamic point location in general subdivisions |
| BedathurBerberichDittrichMamoulisWeikum2009 | Bedathur, Berberich, Dittrich, Mamoulis, Weikum | 2009 | Scalable phrase mining for ad-hoc text analytics |
| BeierSibeyn | Beier, Sibeyn | 2000 | A powerful heuristic for telephone gossiping |
| BeierVöcking2003 | Beier, Vöcking | 2003 | Random knapsack in expected polynomial time |
| BekaertSlusallekCoolsHavranSeidel | Bekaert, Slusallek, Cools, Havran, Seidel | 2003 | A custom designed density estimation method for light transport |
| BeldiceanuKatrielThiel2004 | Beldiceanu, Katriel, Thiel | 2004 | Filtering algorithms for the Same and UsedBy constraints |
| BelyaevLangerSeidel2006 | Belyaev, Langer, Seidel | 2006 | Mean value coordinates for arbitrary spherical polygons and
polyhedra in $\mathbbR^3$ |
| BelyaevSeidelShin2006 | Belyaev, Seidel, Yoshizawa | 2006 | Skeleton-driven Laplacian mesh deformations |
| BenderMichelWeikumTriantafilou2006 | Bender, Michel, Weikum, Triantafilou | 2006 | Overlap-aware global df estimation in distributed information retrieval systems |
| BerberichBedathur2012 | Berberich, Bedathur | 2012 | Computing n-gram statistics in MapReduce |
| BerberichBedathurAlonsoWeikum2010 | Berberich, Bedathur, Alonso, Weikum | 2010 | A language modeling approach for temporal information needs |
| BerberichBedathurNeumannWeikum2007 | Berberich, Bedathur, Neumann, Weikum | 2007 | A time machine for text search |
| BerberichBedathurNeumannWeikum2007 | Berberich, Bedathur, Neumann, Weikum | 2007 | A Time Machine for Text Search |
| BerberichKettner2007 | Berberich, Kettner | 2007 | Linear-time reordering in a sweep-line algorithm for algebraic curves intersecting in a common point |
| BernerBokelohWandSchillingSeidel2009 | Berner, Bokeloh, Wand, Schilling, Seidel | 2009 | Generalized intrinsic symmetry detection |
| BernerBurghardWandMitraKleinSeidel2011 | Berner, Burghard, Wand, Mitra, Klein, Seidel | 2011 | A morphable part model for shape manipulation |
| BilardiChaudhuriDubhashiMehlhorn93 | Bilardi, Chaudhuri, Dubhashi, Mehlhorn | 1993 | A lower bound for area-universal graphs |
| BischoffKählerSchneiderBotschRösslVorsatz2000 | Kobbelt, Bischoff, Kähler, Schneider, Botsch, Rössl, Vorsatz | 2000 | Geometric modeling based on polygonal meshes |
| BjörklundPeterssonVorobyov2001 | Björklund, Petersson, Vorobyov | 2001 | Experiments with iterative improvement algorithms on completely unimodel hypercubes |
| BlackburnTzakova | Blackburn, Tzakova | 1998 | Hybrid languages and temporal logic |
| BlackburnTzakova97 | Blackburn, Tzakova | 1997 | Two hybrid logics |
| Blanchet2004 | Blanchet | 2004 | Automatic proof of strong secrecy for security protocols |
| Bockmayr-94-mpii207 | Bockmayr | 1994 | Cutting planes in constraint logic programming |
| Bockmayr91 | Bockmayr | 1991 | Logic programming with pseudo-Boolean constraints |
BockmayrBarth95
| Barth, Bockmayr | 1995 | Modelling mixed-integer optimisation problems in constraint logic programming |
| BockmayrEisenbrand97 | Bockmayr, Eisenbrand | 1997 | On the Chvátal rank of polytopes in the 0/1 cube |
| BockmayrEisenbrandMPI-I-1999-2-008 | Bockmayr, Eisenbrand | 1999 | Cutting planes and the elementary closure in fixed dimension |
| BockmayrKasper97 | Bockmayr, Kasper | 1997 | A unifying framework for integer and finite domain constraint programming |
| BockmayrKrischerWerner93 | Bockmayr, Krischer, Werner | 1993 | Narrowing strategies for arbitrary canonical rewrite systems |
| BockmayrRadermacher93 | Bockmayr, Radermacher | 1993 | Künstliche Intelligenz und Operations Research |
| BodlaenderHagerup95 | Bodlaender, Hagerup | 1995 | Parallel algorithms with optimal speedup for bounded treewidth |
| BoghossianKohlbacherLenhof99 | Boghossian, Kohlbacher, Lenhof | 1999 | BALL: Biochemical Algorithms Library |
| BorchertRanjan93 | Borchert, Ranjan | 1993 | The circuit subfunction relations are $sum^P_2$-complete |
| Bradford95 | Bradford | 1995 | Matching nuts and bolts optimally |
| BradfordCapoyleas95 | Bradford, Capoyleas | 1995 | Weak epsilon-nets for points on a hypersphere |
| BradfordFleischer | Bradford, Fleischer | 1995 | Matching nuts and bolts faster |
| BradfordFleischerSmid95 | Bradford, Fleischer, Smid | 1995 | A polylog-time and $O(n\sqrt\lg n)$-work parallel algorithm for finding the row minima in totally monotone matrices |
| BradfordReinert96 | Bradford, Reinert | 1996 | Lower bounds for row minima searching |
| BrandenburgJuengerMutzel97 | Brandenburg, Jünger, Mutzel | 1997 | Algorithmen zum automatischen Zeichnen von Graphen |
| BreslauerJiangZhigen97 | Breslauer, Jiang, Jiang | 1996 | Rotations of periodic strings and short superstrings |
| BrinkBritzSchmidt92 | Brink, Britz, Schmidt | 1992 | Peirce algebras |
| BrinkGabbayOhlbach93 | Brink, Gabbay, Ohlbach | 1993 | Towards automating duality |
| Brodal97 | Brodal | 1997 | Finger search trees with constant insertion time |
| BrodalChaudhuriRadhakrishnan96 | Brodal, Chaudhuri, Radhakrishnan | 1996 | The randomized complexity of maintaining the minimum |
| BrodalPinotti98 | Brodal, Pinotti | 1998 | Comparator networks for binary heap construction |
| BrodalTráffZaroliagis97 | Brodal, Träff, Zaroliagis | 1997 | A parallel priority queue with constant time operations |
| BrönnimanKettnerSchirraVeltkamp98 | Brönniman, Kettner, Schirra, Veltkamp | 1998 | Applications of the generic programming paradigm in the design of CGAL |
| BroschartSchenkel2010 | Broschart, Schenkel | 2010 | Real-time text queries with tunable term pair indexes |
| BurkhardtCrauserFerraginaLenhofRivalsVingron98 | Burkhardt, Crauser, Ferragina, Lenhof, Rivals, Vingron | 1998 | $q$-gram based database searching using a suffix array (QUASAR) |
| Burnikel98-1-023 | Burnikel | 1998 | Rational points on circles |
| Burnikel98-1-027 | Burnikel | 1998 | Delaunay graphs by divide and conquer |
| BurnikelKoenemann96 | Burnikel, Könemann | 1996 | High-precision floating point numbers in LEDA |
| BurnikelMehlhornSchirra96 | Burnikel, Mehlhorn, Schirra | 1996 | The LEDA class real number |
| BurnikelMehlhornSeel99 | Burnikel, Mehlhorn, Seel | 1999 | A simple way to recognize a correct Voronoi diagram of line segments |
| BurnikelZiegler98 | Burnikel, Ziegler | 1998 | Fast recursive division |
| ChandranSivadasan2004 | Chandran, Sivadasan | 2004 | On the Hadwiger's conjecture for graph products |
| ChandranSubramanian2003 | Chandran, Subramanian | 2003 | Girth and treewidth |
| CharatonikGanzinger2002 | Charatonik, Ganzinger | 2002 | Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi |
| CharatonikMPI-I-1999-2-001 | Charatonik | 1999 | Automata on DAG representations of finite trees |
| CharatonikPacholski93 | Charatonik, Pacholski | 1993 | Negativ set constraints: an easy proof of decidability |
| CharatonikPodelski97 | Charatonik, Podelski | 1997 | Solving set constraints for greatest models |
| CharatonikTalbot2002 | Charatonik, Talbot | 2002 | Atomic set constraints with projection |
| ChariHartmanis94 | Chari, Hartmanis | 1994 | On the intellectual terrain around NP |
| Chaudhuri93a | Chaudhuri | 1993 | Sensitive functions and approximate problems |
| Chaudhuri93b | Chaudhuri | 1993 | A lower bound for linear approximate compaction |
| ChaudhuriHagerup94 | Chaudhuri, Hagerup | 1994 | Prefix graphs and their applications |
| ChaudhuriHagerupRaman93 | Chaudhuri, Hagerup, Raman | 1993 | Approximate and exact deterministic parallel selection |
| ChaudhuriRadhakrishnan93 | Chaudhuri, Radhakrishnan | 1993 | The complexity of parallel prefix problems on small domains |
| ChaudhuriZaroliagis95a | Chaudhuri, Zaroliagis | 1995 | Shortest paths in digraphs of small treewidth sequential algorithms |
| ChaudhuriZaroliagis95b | Chaudhuri, Zaroliagis | 1995 | Shortest paths in digraphs of small treewidth part II: optimal parallel algirithms |
| CheriyanHagerupMehlhorn91 | Cheriyan, Hagerup, Mehlhorn | 1991 | An $O(n^3)$-time maximum-flow algorithm |
| CheriyanMehlhorn91 | Cheriyan, Mehlhorn | 1991 | Algorithms for dense graphs and networks |
| ChewKedernSchirra94 | Chew, Kedem, Schirra | 1994 | On characteristic points and approximate decision algorithms for the minimum Hausdorff distance |
| ChoiSeidel2000 | Choi, Seidel | 2000 | Hyperbolic Hausdorff distance for medial axis transform |
| ChoiSeidel2001 | Choi, Seidel | 2001 | Linear one-sided stability of MAT for weakly injective domain |
| ChristofJüngerKececioglouMutzelReinelt96 | Christof, Jünger, Kececioglou, Mutzel, Reinelt | 1996 | A branch-and-cut approach to physical mapping with end-probes |
| ClarksonMehlhornSeidel92 | Clarkson, Mehlhorn, Seidel | 1992 | Four results on randomized incremental constructions |
| CortierGanzingerJacquemardVeanesMPI-I-1999-2-004 | Cortier, Ganzinger, Jacquemard, Veanes | 1999 | Decidable fragments of simultaneous rigid reachability |
| CrauserFerragina99 | Crauser, Ferragina | 1999 | A theoretical and experimental study on the construction of suffix arrays in external memory |
| CrauserFerraginaMehlhornMeyerRamos98 | Crauser, Ferragina, Mehlhorn, Meyer, Ramos | 1998 | Randomized external-memory algorithms for some geometric problems |
| CrauserMehlhornAlthausetal98 | Crauser, Mehlhorn, Althaus, Brengel, Buchheit, Keller, Krone, Lambert, Schulte, Thiel, Westphal, Wirth | 1998 | On the performance of LEDA-SM |
| Csaba2003 | Csaba | 2003 | On the Bollob\'as -- Eldridge conjecture for bipartite graphs |
| CunninghamWang97 | Cunningham, Wang | 1997 | Restricted 2-factor polytopes |
| Cvetkovic93 | Cvetkovic | 1993 | The logic of preference and decision supporting systems |
| DasKapoorSmid96 | Das, Kapoor, Smid | 1996 | On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees |
| DaubertHeidrichKautzDischlerSeidel2001 | Daubert, Heidrich, Kautz, Dischler, Seidel | 2001 | Efficient light transport using precomputed visibility |
| deAguiarZayerTheobaltMagnorSeidel2006 | de Aguiar, Zayer, Theobalt, Magnor, Seidel | 2006 | A framework for natural animation of digitized models |
| DegtyarevVoronkov98 | Degtyarev, Voronkov | 1998 | Equality reasoning in sequent-based calculi |
| DelzannoPodelski98 | Delzanno, Podelski | 1998 | Model checking infinite-state systems in CLP |
| DelzannoRaskinMPI-I-1999-2-007 | Delzanno, Raskin | 1999 | Symbolic representation of upward-closed sets |
| deMeloSuchanekPease2008 | de Melo, Suchanek, Pease | 2008 | Integrating Yago into the suggested upper merged ontology |
| deMeloWeikum2009 | de Melo, Weikum | 2009 | Towards a Universal Wordnet by learning from combined evidenc |
| DeSimoneDiehlJuengerMutzelReineltRinaldi96a | De Simone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi | 1996 | Exact ground states of two-dimensional $\pm J$ Ising Spin Glasses |
| DevillersGolinSchirraKedern94 | Devillers, Golin, Schirra, Kedem | 1994 | Revenge of the dog: queries on Voronoi diagrams of moving points |
| DiehlDeSimoneJuengerMutzelReineltRinaldi | Diehl, De Simone, Jünger, Mutzel, Reinelt, Rinaldi | 1995 | Exact ground states of Ising spin classes: new experimental results with a branch and cut algorithm |
| DietzfelbingerWoelfel2003 | Dietzfelbinger, Woelfel | 2003 | Almost random graphs with simple hash functions |
| DiksHagerup96 | Diks, Hagerup | 1996 | More geneal parallel tree contraction: Register allocation and broadcasting in a tree |
| dim94b | Dimopoulos | 1994 | Classical methods in nonmonotonic reasoning |
| Dimopoulos-93-mpii226 | Dimopoulos, Magirou, Papadimitriou | 1993 | On kernels, defaults and even graphs |
| Dimopoulos-93-mpii264 | Dimopoulos, Torres | 1993 | Graph theoretical structures in logic programs and default theories |
| DjidjevPantziouZaroliagis94a | Djidjev, Pantziou, Zaroliagis | 1994 | On-line and Dynamic Shortest Paths through Graph Decompositions (Preliminary Version) |
| DjidjevPantziouZaroliagis94b | Djidjev, Pantziou, Zaroliagis | 1994 | On-line and dynamic algorithms for shortest path problems |
| DmitrievHavranSeidel2004 | Dmitriev, Havran, Seidel | 2004 | Faster ray tracing with SIMD shaft culling |
| DobrindtMehlhornYvinec93 | Dobrindt, Mehlhorn, Yvinec | 1993 | A complete and efficient algorithm for the intersection of a general convex polyhedron |
| DragoMartensMyszkowskiSeidel2002 | Drago, Martens, Myszkowski, Seidel | 2002 | Perceptual evaluation of tone mapping operators with regard to similarity and preference |
| Dubhashi93 | Dubhashi | 1993 | Quantifier elimination in p-adic fields |
| DubhashiMehlhornRanjanThiel93 | Dubhashi, Mehlhorn, Ranjan, Thiel | 1993 | Searching, sorting and randomised algorithms for central elements and ideal counting in posets |
| DubhashiPanconesi94 | Dubhashi, Panconesi | 1994 | Near-optimal distributed edge |
| DubhashiPantziouSpirakisZaroliagis95 | Dubhashi, Pantziou, Spirakis, Zaroliagis | 1995 | The fourth moment in Luby`s distribution |
| DubhashiPriebeRanjan96 | Dubhashi, Priebe, Ranjan | 1996 | Negative dependence through the FKG Inequality |
| DubhashiRanjan94a | Dubhashi, Ranjan | 1994 | Some correlation inequalities for probabilistic analysis of algorithms |
| DubhashiRanjan94b | Dubhashi, Ranjan | 1994 | Stochastic majorisation: exploding some myths |
| DubhashiRanjan98 | Dubhashi, Ranjan | 1998 | On positive influence and negative dependence |
| DykenZieglerTheobaltSeidel2007 | Dyken, Ziegler, Theobalt, Seidel | 2007 | HistoPyramids in Iso-Surface Extraction |
| DyllaMiliarakiTheobald2012 | Dylla, Miliaraki, Theobald | 2012 | Top-k query processing in probabilistic databases with non-materialized views |
| DyllaTheobald2014 | Dylla, Theobald | 2014 | Learning Tuple Probabilities in Probabilistic Databases |
| EfremovMantiukMyszkowskiSeidel | Efremov, Mantiuk, Myszkowski, Seidel | 2006 | Design and evaluation of backward compatible high dynamic range video compression |
| EigenwilligKettnerWolpert2006 | Eigenwillig, Kettner, Wolpert | 2006 | Snap rounding of Bézier curves |
| Eisenbrand2003 | Eisenbrand | 2003 | Fast integer programming in fixed dimension |
| EisenbrandMPI-I-2000-2-001 | Eisenbrand | 2000 | Short vectors of planar lattices via continued fractions |
| EisingerOhlbach91 | Eisinger, Ohlbach | 1991 | Deduction systems based on resolution |
| Elbassuoni2010 | Elbassuoni, Ramanath, Weikum | 2010 | Query relaxation for entity-relationship search |
| FabriGiezemanKettnerSchirraSch'onherr | Fabri, Giezeman, Kettner, Schirra, Schönherr | 1998 | On the Design of CGAL, the Computational Geometry Algorithms Library |
| Fatourou2000 | Fatourou | 2000 | Low-contention depth-first scheduling of parallel computations with synchronization variables |
| fiatLeonardi97 | Fiat, Leonardi | 1997 | On-line network routing - a survey |
| FietzkeKruglovWeidenbach2012 | Fietzke, Kruglov, Weidenbach | 2012 | Automatic generation of inductive invariants by SUP(LA) |
| FietzkeWeidenbach2008 | Fietzke, Weidenbach | 2008 | Labelled splitting |
| FinklerMehlhorn96 | Finkler, Mehlhorn | 1996 | Runtime prediction of real programs on real machines |
| Fleischer91 | Fleischer | 1991 | A tight lower bound for the worst case of bottom-up-heapsort |
| Fleischer92a | Fleischer | 1992 | A simple balanced search tree with 0(1) worst-case update time |
| Fleischer92b | Fleischer | 1992 | A new lower bound technique for decision trees |
| Fleischer94 | Fleischer | 1994 | Komplexitätstheorie und effiziente Algorithmen |
| Fleischer97 | Fleischer | 1997 | On the Bahncard problem |
| FleischerMehlhornRoteWelzl91 | Fleischer, Mehlhorn, Rote, Welzl | 1991 | Simultaneous inner and outer aproximation of shapes |
| FredericksonSolis-Oba98 | Frederickson, Solis-Oba | 1998 | Robustness analysis in combinatorial optimization |
| FrigioniMarchetti-SpaccamelaNanni98 | Frigioni, Marchetti-Spaccamela, Nanni | 1998 | Fully dynamic shortest paths and negative cycle detection on diagraphs with Arbitrary Arc Weights |
| FuchsBlanzLenschSeidel2005 | Fuchs, Blanz, Lensch, Seidel | 2005 | Reflectance from images: a model-based approach for human faces |
| FuchsChenWangRaskarLenschSeidel2009 | Fuchs, Chen, Wang, Raskar, Lensch, Seidel | 2009 | A shaped temporal filter camera |
| FuchsGoeseleChenSeidel | Fuchs, Goesele, Chen, Seidel | 2005 | An emperical model for heterogeneous translucent objects |
| FunkeLaueNaujoksZvi2006 | Funke, Laue, Naujoks, Zvi | 2007 | Power assignment problems in wireless communication |
| Gabbay93 | Gabbay | 1993 | Classical vs non-classical logics: the universality of classical logic |
| GabbayLDS | Gabbay | 1994 | LDS - Labelled Deductive Systems: Volume 1 - Foundations |
| GabbayOhlbach92 | Gabbay, Ohlbach | 1992 | Quantifier elimination in second-order predicate logic |
| GallBroxRosenhahnSeidel2008 | Gall, Brox, Rosenhahn, Seidel | 2007 | Global stochastic optimization for robust and accurate human motion capture |
| GallPotthoffRosenhahnSchnoerrSeidel2006 | Gall, Potthoff, Rosenhahn, Schnoerr, Seidel | 2006 | Interacting and annealing particle filters: mathematics and a recipe for applications |
| GallRosenhahnSeidel2007 | Gall, Rosenhahn, Seidel | 2007 | Clustered stochastic optimization for object recognition and pose estimation |
| GanzingerBachmairWaldmann92 | Ganzinger, Bachmair, Waldmann | 1992 | Set constraints are the Monadic class |
| GanzingerBachmairWaldmann93 | Ganzinger, Bachmair, Waldmann | 1993 | Superposition with simplification as a decision procedure for the monadic class with equality |
| GanzingerJacquemardVeanes98 | Ganzinger, Jacquemard, Veanes | 1998 | Rigid reachability |
| GanzingerWaldmann96 | Ganzinger, Waldmann | 1996 | Theorem proving in cancellative abelian monoids |
| Garg97 | Garg | 1997 | Approximating sparsest cuts |
| GargChaudhuriRavi96 | Garg, Chaudhuri, Ravi | 1996 | Generalized $k$-Center Problems |
| GargKoenemann97 | Garg, Könemann | 1997 | Faster and simpler algorithms for multicommodity flow and other fractional packing problems |
| GargKonjevodRavi97 | Garg, Konjevod, Ravi | 1997 | A polylogarithmic approximation algorithm for group Steiner tree problem |
| GargManss97 | Garg, Manss | 1997 | Evaluating a 2-approximation algorithm for edge-separators in planar graphs |
| GargPapatriantafilouTsigas96 | Garg, Papatriantafilou, Tsigas | 1996 | Distributed list coloring: how to dynamically allocate frequencies to mobile base stations |
| GasieniecIndykKrysta96 | Gasieniec, Indyk, Krysta | 1996 | External inverse pattern matching |
| GasieniecJanssonLingasÖstlin96 | Gasieniec, Jansson, Lingas, Östlin | 1996 | On the complexity of computing evolutionary trees |
| GidenstamPapatriantafilou2007 | Gidenstam, Papatriantafilou | 2007 | LFthreads: a lock-free thread library |
| GjergjiSuchanekWeikum2006 | Kasnec, Suchanek, Weikum | 2006 | Yago - a core of semantic knowledge |
| GoeseleKautzLangLenschSeidel2002 | Goesele, Kautz, Lang, Lensch, Seidel | 2002 | Tutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models |
| GolinRamanSchwarzSmid92 | Golin, Raman, Schwarz, Smid | 1992 | Simple randomized algorithms for closest pair problems |
| GolinRamanSchwarzSmid93 | Golin, Raman, Schwarz, Smid | 1993 | Randomized Data Structures for the Dynamic Closest-Pair Problem |
| GotsmanKaligosiMehlhornMichailPyrga | Gotsman, Kaligosi, Mehlhorn, Michail, Pyrga | 2005 | Cycle bases of graphs and sampled manifolds |
| Graf-94-mpii251 | Graf | 1994 | Substitution tree indexing |
| Graf92 | Graf | 1992 | Path indexing for term retrieval |
| Graf92 | Graf | 1992 | Path Indexing for Term Retrieval |
| GrafMeyer93 | Graf, Meyer | 1993 | Extended path-indexing |
| GrafMeyer93 | Graf, Meyer | 1993 | Extended path-Indexing |
| GranadosTompkinInKimGrauKautzTheobalt2011 | Granados, Tompkin, In Kim, Grau, Kautz, Theobalt | 2011 | How not to be seen – inpainting dynamic objects in crowded scenes |
| Grandoni2002 | Grandoni | 2002 | Incrementally maintaining the number of l-cliques |
| Grolmusz92a | Grolmusz | 1992 | Circuits and multi-party protocols |
| Grolmusz92b | Grolmusz | 1992 | Separating the communication complexities of MOD m and MOD p circuits |
| Grolmusz93a | Grolmusz | 1993 | Multi-party protocols and spectral norms |
| Grolmusz93b | Grolmusz | 1993 | MOD m gates do not help on the ground floor |
| Grolmusz93c | Grolmusz | 1993 | Harmonic analysis, real approximation, and the communication complexity of Boolean functions |
| Grolmusz93d | Grolmusz | 1993 | On multi-party communication complexity of random functions |
| GunopulosMannilaSaluja96 | Gunopulos, Mannila, Saluja | 1996 | Discovering all most specific sentences by randomized algorithms |
 GuptaJanardanSmid93a | Gupta, Janardan, Smid | 1993 | Algorithms for some intersection searching problems involving curved objects |
| GuptaJanardanSmid93b | Gupta, Janardan, Smid | 1993 | Effizient algorithms for generalized intersection searching on non-iso-oriented objects |
| GuptaJanardanSmid94 | Gupta, Janardan, Smid | 1994 | Fast algorithms for collision and proximity problems involving moving geometric objects |
| GuptaJanardanSmid96a | Gupta, Janardan, Smid | 1996 | Efficient algorithms for counting and reporting pairwise intersections between convex polygons |
| GuptaJanardanSmid96b | Gupta, Janardan, Smid | 1996 | A technique for adding range restrictions to generalized searching problems |
| GuptaJanardanSmidDasgupta94 | Gupta, Janardan, Smid, Dasgupta | 1994 | The rectangle enclosure and point-dominance problems revisited |
| GuptaReport2015 | Gupta, Berberich | 2016 | Diversifying Search Results Using Time |
| GurevichVeanes98 | Gurevich, Veanes | 1998 | Partisan corroboration, and shifted pairing |
| HaberSchmittKosterSeidel2004 | Haber, Schmitt, Koster, Seidel | 2004 | Modeling hair using a wisp hair model |
| HaberSeidel1999 | Haber, Seidel | 1999 | A framework for evaluating the quality of lossy image compression |
| Hagerup91a | Hagerup | 1991 | Fast parallel space allocation, estimation an integer sorting |
| Hagerup91b | Hagerup | 1991 | On a compaction theorem of ragde |
| Hagerup92 | Hagerup | 1992 | Fast deterministic processor allocation |
| Hagerup93 | Hagerup | 1993 | Optimal parallel string algorithms: sorting, merching and computing the minimum |
| Hagerup96 | Hagerup | 1996 | Vorlesungsskript Komplexitätstheorie |
| HagerupKutylowski92 | Hagerup, Kutylowski | 1992 | Fast integer merging on the EREW PRAM |
| HagerupMaas93 | Hagerup, Maas | 1993 | Generalized topological sorting in linear time |
| HagerupRaman92 | Hagerup, Raman | 1992 | Waste makes haste: tight bounds for loose parallel sorting |
| HangelbroekNürnbergerRoesslSeidelZeilfelder2003 | Hangelbroek, Nürnberger, Roessl, Seidel, Zeilfelder | 2003 | The dimension of $C^1$ splines of arbitrary degree on a tetrahedral partition |
| Hanus92a | Hanus | 1992 | An abstract interpretation algorithm for residuating logic programs |
| Hanus92b | Hanus | 1992 | Analysis of nonlinear constraints in CLP(R) |
| Hanus93b | Hanus | 1993 | Lazy unification with inductive simplification |
| Hanus94ExtraReport | Hanus | 1994 | On extra variables in (Equational) logic programming |
| Hanus94wieJLP | Hanus | 1994 | The integration of functions into logic programming: a survey |
| HanusJosephs93 | Hanus, Josephs | 1993 | A debugging model for functional logic programs |
| HavranHerzogSeidel2006 | Havran, Herzog, Seidel | 2006 | On fast construction of spatial hierarchies for ray tracing |
| HavranZajacDrahokoupilSeidel2009 | Havran, Zajac, Drahokoupil, Seidel | 2009 | MPI Informatics building model as data for your research |
| HeffernanSchirra91 | Heffernan, Schirra | 1991 | Approximate decision algorithms for point set congruence |
| HenzingerLeonardi98 | Henzinger, Leonardi | 1998 | Scheduling multicasts on unit-capacity trees and meshes |
| HenzingerRaskinSchobbens99 | Henzinger, Raskin, Schobbens | 1999 | Axioms for real-time logics |
| HenzingerRaskinSchobbens99 | Henzinger, Raskin, Schobbens | 1999 | Fully decidable logics, automata and classical theories for defining regular real-time languages |
| HertHoffmannKettnerPionSeel | Hert, Hoffmann, Kettner, Pion, Seel | 2001 | An adaptable and extensible geometry kernel |
| HertPolzinKettnerSchäfer2002 | Hert, Polzin, Kettner, Schäfer | 2002 | Exp Lab: a tool set for computational experiments |
| Herzig96 | Herzig | 1996 | SCAN and systems of conditional logic |
| HerzogHavranMyszkowskiSeidel2007 | Herzog, Havran, Myszkowski, Seidel | 2007 | Global illumination using photon ray splatting |
| HillenbrandWeidenbach2007 | Hillenbrand, Weidenbach | 2007 | Superposition for finite domains |
| HillenbrandWeidenbach2007 | Hillenbrand, Weidenbach | 2007 | Superpositon for Finite Domains |
| Hisao2003 | Tamaki | 2003 | Alternating cycles contribution: a strategy of tour-merging for the traveling salesman problem |
| HisaoDietzfelbinger2003 | Dietzfelbinger, Tamaki | 2003 | On the probability of rendezvous in graphs |
| Hoefer2002 | Hoefer | 2002 | Performance of heuristic and approximation algorithms for the uncapacitated facility location problem |
| HoepmannPapatriantafilouTsigas95 | Hoepmann, Papatriantafilou, Tsigas | 1995 | Towards self-stabilizing wait-free shared memory objects |
| HoffartSuchanekBerberichWeikum2010 | Hoffart, Suchanek, Berberich, Weikum | 2010 | YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia |
| HoffmannGomesSelman2005 | Hoffmann, Gomes, Selman | 2005 | Bottleneck behavior in CNF formulas |
| Horbach2009 | Horbach, Weidenbach | 2009 | Superposition for fixed domains |
| HorbachWeidenbach2009 | Horbach, Weidenbach | 2009 | Deciding the inductive validity of $\forall\exists^*$ queries |
| HorbachWeidenbach2010 | Horbach, Weidenbach | 2010 | Decidability results for saturation-based model building |
| HromkovicMuellerSykoraVrto91 | Hromkovic, Müller, Sýkora, Vrto | 1991 | On embeddings in cycles |
| HuangKavitha2010 | Huang, Kavitha | 2010 | Maximum cardinality popular matchings in strict two-sided preference lists |
| HuangOtt2013 | Ott | 2013 | New results for non-preemptive speed scaling |
| HullinAjdinHanikaSeidelKautzLensch2009 | Hullin, Ajdin, Hanika, Seidel, Kautz, Lensch | 2009 | Acquisition and analysis of bispectral bidirectional reflectance distribution functions |
| Hustadt91 | Hustadt | 1991 | A complete transformation system for polymorphic higher-order unification |
| Hustadt92 | Hustadt | 1992 | Unification and matching in Church's Original Lambda Calculus |
| HustadtNonnengartSchmidtTimm92 | Hustadt, Nonnengart, Schmidt, Timm | 1992 | Motel user manual |
| HustadtNonnengartSchmidtTimm92 | Hustadt, Nonnengart, Schmidt, Timm | 1992 | Motel User Manual |
| HustadtNonnengartSchmidtTimm92 | Hustadt, Nonnengart, Schmidt, Timm | 1992 | Motel User Manual |
| HustadtSchmidt97 | Hustadt, Schmidt | 1997 | On evaluating decision procedures for modal logic |
| IvrissimtzisJeongLeeLeeSeidel2004 | Ivrissimtzis, Jeong, Lee, Lee, Seidel | 2004 | Neural meshes: surface reconstruction with a learning algorithm |
| IvrissimtzisJeongSeidel2003 | Ivrissimtzis, Jeong, Seidel | 2003 | Neural meshes: statistical learning methods in surface reconstruction |
| J'ungerLeipertMutzel98 | Jünger, Leipert, Mutzel | 1998 | A note on computing a maximal planar subgraph using PQ-trees |
| JacquemardMeyerWeidenbach98 | Jacquemard, Meyer, Weidenbach | 1998 | Unification in extensions of shallow equational theories |
| Jaeger2003 | Jaeger | 2003 | A representation theorem and applications to measure selection and noninformative priors |
| Jaeger94b | Jaeger | 1994 | A probabilistic extension of terminological logics |
| Jansen98-1-005 | Jansen | 1998 | The mutual exclusion scheduling problem for permutation and comparability graphs |
| Jansen98-1-006 | Jansen | 1998 | A new characterization for parity graphs and a coloring problem with costs |
| JansenPorkolab98-1-025 | Jansen, Porkolab | 1998 | Linear-time approximation schemes for scheduling malleable parallel tasks |
| JansenPorkolab98-1-026 | Jansen, Porkolab | 1998 | Improved approximation schemes for scheduling unrelated parallel machines |
| JohannSocher-Ambrosius93 | Johann, Socher-Ambrosius | 1993 | Solving simplifications ordering constraints |
| JuengerMutzel95 | Jünger, Mutzel | 1995 | Exact and heuristic algorithms for 2-layer straightline crossing minimization |
| JuengerMutzelOdenthalScharbrodt95 | Jünger, Mutzel, Odenthal, Scharbrodt | 1995 | The thickness of a minor-excluded class of graphs |
| JúngerLeipertMutzel97 | Jünger, Leipert, Mutzel | 1997 | Pitfalls of using PQ--Trees in automatic graph drawing |
| JüngerMutzel96 | Jünger, Mutzel | 1996 | 2-Layer straigthline crossing minimization: performance of exact and heuristic algorithms |
| JungLenhofMüllerRüb97 | Jung, Lenhof, Müller, Rüb | 1997 | Parallel algorithms for MD-simulations of synthetic polymers |
| Kapoor95 | Kapoor | 1995 | Dynamic maintenance of 2-d convex hulls and order decomposable problems |
| KapoorSmid93 | Kapoor, Smid | 1993 | New techniques for exact and approximate dynamic closest-point problems |
| KargarisPantziouTragoudasZaroliagis94 | Kargaris, Pantziou, Tragoudas, Zaroliagis | 1994 | Quickest paths: faster algorithms and dynamization |
| KarpinksiZelikovsky94 | Karpinksi, Zelikovsky | 1994 | Further improvements of Steiner tree approximations |
| KasneciRamanathSozioSuchanekWeikum2008 | Kasneci, Ramanath, Sozio, Suchanek, Weikum | 2008 | STAR: Steiner tree approximation in relationship-graphs |
| KasneciSuchanekIfrimRamanathWeikum2007 | Kasneci, Suchanek, Ifrim, Ramanath, Weikum | 2007 | NAGA: searching and ranking knowledge |
| KasneciWeikumElbassuoni2009 | Kasneci, Weikum, Elbassuoni | 2009 | MING: Mining Informative Entity-Relationship Subgraphs |
| Katriel2004 | Katriel | 2004 | On algorithms for online topological ordering and sorting |
| KatrielKutz2005 | Katriel, Kutz | 2005 | A faster algorithm for computing a longest common increasing
subsequence |
| KatrielKutzSkutella2005 | Katriel, Kutz, Skutella | 2005 | Reachability substitutes for planar digraphs |
| KatrielSandersTräff2002 | Katriel, Sanders, Träff | 2002 | A practical minimum spanning tree algorithm using the cycle property |
| KatrielThiel2003 | Katriel, Thiel | 2003 | Fast bound consistency for the global cardinality constraint |
| KaufmannMeyerSibeyn94 | Kaufmann, Meyer, Sibeyn | 1994 | Towards practical permutation routing on meshes |
| KautzHeidrichDaubert2000 | Kautz, Heidrich, Daubert | 2000 | Bump map shadows for openGL rendering |
| KavvadiasPantziouSpirakisZaroliagis94 | Kavvadias, Pantziou, Spirakis, Zaroliagis | 1994 | Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems |
| KazakovNivelle2003 | Kazakov, de Nivelle | 2003 | Subsumption of concepts in $DL$ $\cal FL_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete |
| Kerber2006 | Kerber | 2006 | Division-free computation of subresultants using bezout matrices |
| KerberBokelohWandSeidel2012 | Kerber, Bokeloh, Wand, Seidel | 2012 | Symmetry detection in large scale city scans |
| KimKwonKimTheobalt2011 | Kim, Kwon, Kim, Theobalt | 2011 | Efficient learning-based image enhancement : application to
compression artifact removal and super-resolution |
| KimTompkinTheobalt2014 | Kim, Tompkin, Theobalt | 2014 | Local high-order regularization on data manifolds |
| KlauMutzel98-1-013 | Klau, Mutzel | 1998 | Quasi-orthogonal drawing of planar graphs |
| KlauMutzel98-1-031 | Klau, Mutzel | 1998 | Optimal compaction of orthogonal grid drawings |
| KleinMehlhornMeiser93 | Klein, Mehlhorn, Meiser | 1993 | Randomized incremental construction of abstract Voronoi diagrams |
| KoenemannSchmitzSchwarz95 | Könemann, Schmitz, Schwarz | 1995 | Radix heaps an efficient implementation for priority queues |
| Kovács2003 | Kovács | 2003 | Sum-Multicoloring on paths |
| KraanBasinBundy92 | Kraan, Basin, Bundy | 1992 | Logic program synthesis via proof planning |
| KrawczykGoeseleSeidel2005 | Krawczyk, Goesele, Seidel | 2005 | Photometric calibration of high dynamic range cameras
|
| KrithivasanVanisreeDatta92 | Krithivasan, Vanisree, Datta | 1992 | The largest hyper-rectangle in a three dimensional orthogonal polyhedron |
| Krysta2001 | Krysta | 2001 | Approximating minimum size 1,2-connected networks |
| KrystaCzumajVoecking2003 | Krysta, Czumaj, Voecking | 2003 | Selfish traffic allocation for server farms |
| KrystaLorys98-1-016 | Krysta, Lory\'{s} | 1998 | New approximation algorithms for the achromatic number |
| KrystaSandersVöcking2003 | Krysta, Sanders, Vöcking | 2003 | Scheduling and traffic allocation for tasks with bounded splittability |
| Kucera93a | Kucera | 1993 | Broadcasting through a noisy one-dimensional network |
| Kucera93b | Kucera | 1993 | Coloring k-colorable graphs in expected parallel time |
| Kucera93c | Kucera | 1993 | Expected complexity of graph partitioning problems |
| LangerBelyaevSeidel2005 | Langer, Belyaev, Seidel | 2005 | Analysis and design of discrete normals and curvatures |
| LangerSeidel2007 | Langer, Seidel | 2007 | Construction of smooth maps with mean value coordinates |
| Lenhof95 | Lenhof | 1995 | An algorithm for the protein docking problem |
| Lenhof97 | Lenhof | 1997 | New contact measures for the protein docking problem |
| LenhofSmid91 | Lenhof, Smid | 1991 | An optimal construction method for generalized convex layers |
| LenhofSmid92a | Lenhof, Smid | 1992 | Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity |
| LenhofSmid92b | Lenhof, Smid | 1992 | Sequential and parallel algorithms for the k closest pairs problem |
| LenschGoeseleSeidel2001 | Lensch, Goesele, Seidel | 2001 | A framework for the acquisition, processing and interactive display of high quality 3D models |
| LenschKautzGoeseleHeidrichSeidel2001 | Lensch, Kautz, Goesele, Heidrich, Seidel | 2001 | Image-based reconstruction of spatially varying materials |
| LenschKautzGoeseleSeidel2001 | Lensch, Kautz, Goesele, Seidel | 2001 | A framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the Web |
| LeonardiMarchetti-SpaccamelaPresciuttiRostèn | Leonardi, Marchetti-Spaccamela | 1997 | Randomized on-line call control revisited |
| LermenReinert97 | Lermen, Reinert | 1997 | The practical use of the $\calA^*$ algorithm for exact multiple sequence alignment |
| LuMerzWeidenbach2011 | Lu, Merz, Weidenbach | 2011 | Towards verification of the pastry protocol using TLA+ |
| Madden94-238 | Madden | 1994 | Formal methods of automated program improvement |
| Madden94a | Madden | 1994 | Recursive program optimization through inductive synthesis proof transformation |
| Madden94b | Madden | 1994 | A survey of program transformation with special reference to unfold/fold style program development |
| MaddenGreen94 | Madden, Green | 1994 | A general technique for automatically optimizing programs through the use of proof plans |
| Magnor2004 | Magnor | 2004 | Axisymmetric reconstruction and 3D visualization of bipolar planetary nebulae |
| MahajanRamesh96 | Mahajan, Ramesh | 1996 | Derandomizing semidefinite programming based approximation algorithms |
| MahajanRamosSubrahmanyam98 | Mahajan, Ramos, Subrahmanyam | 1998 | Solving some discrepancy problems in NC* |
| Maier2003 | Maier | 2003 | Compositional circular assume-guarantee rules cannot be sound and complete |
| Maier2004 | Maier | 2004 | Intuitionistic LTL and a new characterization of safety and liveness |
| MaierCharatonikGeorgieva2005 | Maier, Charatonik, Georgieva | 2005 | Bounded model checking of pointer programs |
| MakariAwerbuchGemullaKhandekarMestreSozio2013 | Makari, Gemulla, Khandekar, Mestre, Sozio | 2013 | A distributed algorithm for large-scale generalized matching |
| Matthews92 | Matthews | 1992 | Reflection in logical systems |
| Matthews93 | Matthews | 1993 | A theory and its metatheory in FS 0 |
| MatthewsSimpson94 | Matthews, Simpson | 1994 | Reflection using the derivability conditions |
| MatthewsSmaillBasin92 | Matthews, Smaill, Basin | 1992 | Experience with FS0 as a framework theory |
| MavronicolasPapatriantafilouTsigas96 | Mavronicolas, Papatriantafilou, Tsigas | 1996 | The impact of timing on linearizability in counting networks |
| Mehlhorn93 | Mehlhorn | 1993 | An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm |
| MehlhornMeiserRasch | Mehlhorn, Meiser, Rasch | 1992 | Furthest site abstract Voronoi diagrams |
| MehlhornMutzel94 | Mehlhorn, Mutzel | 1994 | On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm |
| MehlhornNaeher94 | Mehlhorn, Näher | 1994 | Implementation of a sweep line algorithm for the Straight \& Line Segment Intersection Problem |
| MehlhornNäherSchirraSeelUhrig96 | Mehlhorn, Näher, Schirra, Seel, Uhrig | 1996 | A computational basis for higher-dimensional computational geometry |
| MehlhornSchirra | Mehlhorn, Schirra | 2000 | Generalized and improved constructive separation bound for real algebraic expressions |
| MehlhornSharirWelzl | Mehlhorn, Sharir, Welzl | 1993 | Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection |
| MehlhornSharirWelzl91 | Mehlhorn, Sharir, Welzl | 1991 | Tail estimates for the space complexity of randomized incremantal algorithms |
| MehlhornUhrig93 | Mehlhorn, Uhrig | 1993 | Maintaining dynamic sequences under equality-tests in polylogorithmic time |
| MehlhornUhrigRaman92 | Mehlhorn, Uhrig, Raman | 1992 | A lower bound for set intersection queries |
| MehlhornWAE98 | Mehlhorn (ed.) | 1998 | 2nd Workshop on Algorithm Engineering WAE '98 - Proceedings |
| Michail2005 | Michail | 2005 | Rank-maximal through maximum weight matchings |
| MichaylovPfenning91 | Michaylov, Pfenning | 1991 | Natural semantics and some of its meta-theory in Elf |
| MiettinenVreeken | Miettinen, Vreeken | 2012 | MDL4BMF: Minimum Description Length for Boolean Matrix Factorization |
| Mikkel97 | Thorup | 1997 | Faster deterministic sorting and priority queues in linear space |
| Mishra2015 | Mishra | 2015 | ? |
| MuellerZiegler94 | Müller, Ziegler | 1994 | An implementation of a Convex Hull Algorithm, Version 1.0 |
| Müller2016 | Müller | 2016 | ? |
| Mutzel95a | Mutzel | 1995 | Automatisiertes Zeichnen von Diagrammen |
| Mutzel95b | Mutzel | 1995 | A polyhedral approach to planar augmentation and related problems |
| Mutzel97 | Mutzel | 1997 | An alternative method to crossing minimization on hierarchical graphs |
| MutzelOdenthalScharbrodt96 | Mutzel, Odenthal, Scharbrodt | 1996 | The thickness of graphs: a survey |
| MutzelWeiskircher98 | Mutzel, Weiskircher | 1998 | Optimizing over all combinatorial embeddings of a planar graph |
| NaeherMehlhorn93 | Näher, Mehlhorn | 1993 | LEDA-Manual Version 3.0 |
NaeherUhrig95
| Näher, Uhrig | 1995 | LEDA user manual (version R 3.2) |
| NeumannMoerkotte2008 | Neumann, Moerkotte | 2008 | Single phase construction of optimal DAG-structured QEPs |
| NeumannWeikum2009 | Neumann, Weikum | 2009 | The RDF-3X engine for scalable management of RDF data |
| Nieuwenhuis92a | Nieuwenhuis | 1992 | A new ordering constraint solving method and its applications |
| Nissen1999 | Nissen, Weihe | 1999 | How generic language extensions enable ''open-world'' design in Java |
| Nissen99 | Nissen | 1999 | Integration of graph iterators into LEDA |
| Nivelle2005 | Nivelle | 2005 | Using resolution as a decision procedure |
| NivelleSchulz2001 | de Nivelle, Schulz | 2001 | Proceeding of the Second International Workshop of the Implementation of Logics |
| NivelleYevgeny2004 | de Nivelle, Kazakov | 2004 | Resolution decision procedures for the guarded fragment with transitive guards |
| Nonnengart92 | Nonnengart | 1992 | First-order modal logic theorem proving and standard PROLOG |
| Nonnengart96a | Nonnengart | 1996 | Auxiliary modal operators and the characterization of modal frames |
| Nonnengart96b | Nonnengart | 1996 | Strong skolemization |
| NonnengartMPI-I-1999-2-006 | Nonnengart | 1999 | A deductive model checking approach for hybrid systems |
| NonnengartSzalas95 | Nonnengart, Szalas | 1995 | A fixpoint approach to second-order quantifier elimination with applications to correspondence theory |
| Ohlbach92 | Ohlbach | 1992 | Preprints of Proceedings of GWAI-92 |
| Ohlbach93 | Ohlbach | 1993 | Translation methods for non-classical logics: an overview |
| Ohlbach94 | Ohlbach | 1994 | Synthesizing semantics for extensions of propositional logic |
| Ohlbach94a | Ohlbach | 1994 | Computer support for the development and investigation of logics |
| Ohlbach94c | Ohlbach (ed.) | 1994 | Temporal logic: Proceedings of the ICTL Workshop |
| OhlbachBaader93 | Ohlbach, Baader | 1993 | A multi-dimensional terminological knowledge representation language - preliminary version |
| OhlbachGabbayPlaisted94 | Ohlbach, Gabbay, Plaisted | 1994 | Killer transformations |
| OhlbachSchmidt95 | Ohlbach, Schmidt | 1995 | Functional translation and second-order frame properties of modal logics |
| OhlbachSchmidtHustadt95a | Ohlbach, Schmidt, Hustadt | 1995 | Translating graded modalities into predicate logic |
| PapatriantafilouTsigas95 | Papatriantafilou, Tsigas | 1995 | Wait-free consensus in "in-phase" multiprocessor systems |
| PatersonSchroederSykoraVrto91 | Paterson, Schröder, Sýkora, Vrto | 1991 | Optimal embedding of a toroidal mesh in a path |
| Pellegrini95 | Pellegrini | 1995 | New deterministic algorithms for counting pairs of intersecting segments and off-line triangle range searching |
| Plaisted94a | Plaisted | 1994 | An abstract program generation logic |
| Plaisted94b | Plaisted | 1994 | The search efficiency of theorem proving strategies: an analytical comparison |
| Plaisted94c | Plaisted | 1994 | Ordered semantic hyper-linking |
| Plaisted95 | Plaisted | 1995 | Special cases and substitutes for rigid $E$-unification |
| PodelskiRybalchenko2003 | Podelski, Rybalchenko | 2003 | Software model checking of liveness properties via transition invariants |
| PodelskiSchaeferWagner2004 | Wagner | 2004 | Summaries for while programs with recursion |
| PodelskiWagner2007 | Podelski, Wagner | 2007 | A method and a tool for automatic veriication of region stability for hybrid systems |
| PolzinVahdati2001a | Polzin, Vahdati | 2001 | On Steiner trees and minimum spanning trees in hypergraphs |
| PolzinVahdati2001b | Polzin, Vahdati | 2001 | Partitioning techniques for the Steiner problem |
| PolzinVahdati2001c | Polzin, Vahdati | 2001 | Extending reduction techniques for the Steiner tree problem: a combination of alternative-and bound-based approaches |
| PolzinVahdati2002 | Polzin, Vahdati | 2002 | Using (sub)graphs of small width for solving the Steiner problem |
| PredaSuchanekKasneciNeumannWeikum2009 | Preda, Suchanek, Kasneci, Neumann, Weikum | 2009 | Coupling knowledge bases and web services for active knowledge |
| PredaSuchanekYuanWeikum2011 | Preda, Suchanek, Yuan, Weikum | 2011 | Query evaluation with asymmetric web services |
| RadhakrishnanSaluja95 | Radhakrishnan, Saluja | 1995 | Interactive Proof Systems |
| Ramanath2008 | Ramanath, Kumar, Ifrim | 2009 | Generating concise and readable summaries of XML documents |
| Ramangalahy98 | Ramangalahy | 1998 | Strategies for conformance testing |
| RaskinSchobbens99 | Raskin, Schobbens | 1999 | Proving a conjecture of Andreka on temporal logic |
| RaskinSchobbens99 | Raskin, Schobbens | 1999 | The logic of event clocks |
| ReinertLenhofMutzelMehlhornKececioglou96 | Reinert, Lenhof, Mutzel, Mehlhorn, Kececioglou | 1996 | A branch-and-cut algorithm for multiple sequence alignment |
| Rhaleb2004 | Zayer, Rössl, Seidel | 2004 | r-adaptive parameterization of surfaces |
| Rieger93 | Rieger | 1996 | Proximity in arrangements of algebraic sets |
| RoesslZeilfelderNürnbergerSeidel2003 | Roessl, Zeilfelder, Nürnberger, Seidel | 2003 | Visualization of volume data with quadratic super splines |
| Rüb97 | Rüb | 1997 | On Batcher's Merge Sorts as Parallel Sorting Algorithms |
| Rüb98 | Rüb | 1998 | On Wallace's method for the generation of normal variates |
| Rueb92 | Rüb | 1992 | Computing intersections and arrangements for red-blue curve segments in parallel |
| Rueb93 | Rüb | 1993 | Lower bounds for merging on the hypercube |
| Rueb95 | Rüb | 1995 | On the average running time of odd-even merge sort |
| SalujaGupta96 | Saluja, Gupta | 1996 | Optimal algorithms for some proximity problems on the Gaussian sphere with applications |
| Sandeep93 | Sen | 1993 | Tight bounds for some problems in computational geometry: the complete sub-logarithmic parallel time range |
| Sanders2003 | Sanders | 2003 | Polynomial time algorithms for network information flow |
| SandersDementiev2003 | Sanders, Dementiev | 2003 | Asynchronous parallel disk sorting |
| SandersEgnerKorst99 | Sanders, Egner, Korst | 1999 | Fast concurrent access to parallel disks |
| SandersPettie2004 | Sanders, Pettie | 2004 | A simpler linear time 2/3 - epsilon approximation for maximum weight matching |
| SandersTräff2002 | Sanders, Träff | 2002 | The factor algorithm for all-to-all communication on clusters of SMP nodes |
| Schaefer2003 | Schaefer | 2003 | A note on the smoothed complexity of the single-source shortest path problem |
| Schäfer2003 | Schäfer, Sivadasan | 2003 | Topology matters: smoothed competitive analysis of metrical task systems |
| SchäferBecchettiLeonardiMarchetti-SpaccamelaVredeveld2003 | Schäfer, Becchetti, Leonardi, Marchetti-Spaccamela, Vredeveld | 2003 | Average case and smoothed competitive analysis of the multi-level feedback algorithm |
| SchäferLeonardi2003 | Schäfer, Leonardi | 2003 | Cross-monotonic cost sharing methods for connected facility location games |
| SchallBelyaevSeidel2005 | Schall, Belyaev, Seidel | 2005 | Sparse meshing of uncertain and noisy surface scattered data
|
| SchallBelyaevSeidel2006 | Schall, Belyaev, Seidel | 2006 | Feature-preserving non-local denoising of static and time-varying
range data |
| Schirra1998-1-003 | Schirra | 1998 | Parameterized implementations of classical planar convex hull algorithms and extreme point compuations |
| Schirra97 | Schirra | 1997 | Designing a Computational Geometry Algorithms Library |
| Schirra98-1-004 | Schirra | 1998 | Robustness and precision issues in geometric computation |
| Schmidt91 | Schmidt | 1991 | Algebraic terminological representation |
| Schmidt92 | Schmidt | 1992 | Terminological representation, natural language & relation algebra |
| Schmidt97 | Schmidt | 1997 | Resolution is a decision procedure for many propositional modal logics |
| Schmidt98 | Schmidt | 1998 | E-unification for subsystems of S4 |
| SchmittFoussee2004 | Schmitt, Fousse | 2004 | A comparison of polynomial evaluation schemes |
| SchoernerThiel94 | Schömer, Thiel | 1994 | Efficient collision detection for moving polyhedra |
| Scholz2006 | Scholz, Magnor | 2006 | Garment texture editing in monocular video sequences based on
color-coded printing patterns |
| SchultzlWeickertSeidel2007 | Schultz, Weickert, Seidel | 2007 | A higher-order structure tensor |
| SchultzTheiselSeidel2008 | Schultz, Theisel, Seidel | 2008 | Crease surfaces: from theory to extraction and application to diffusion tensor MRI |
| Schwarz92 | Schwarz | 1992 | Semi-dynamic maintenance of the width of a planar point set |
| SchwarzSmid91 | Schwarz, Smid | 1991 | An O(n log n log log n) algorithm for the on-line closes pair problem |
| SchwarzSmidSnoeyink91 | Schwarz, Smid, Snoeyink | 1991 | An optimal algorithm for the on-line closest-pair problem |
| Seel2001 | Seel | 2001 | Implementation of planar Nef polyhedra |
| Seel97 | Seel | 1996 | A runtime test of integer arithmetic and linear algebra in LEDA |
| SeelMehlhorn00 | Seel, Mehlhorn | 2000 | Infimaximal frames: a technique for making lines look like segments |
| SeufertBedathurMestreWeikum2010 | Seufert, Bedathur, Mestre, Weikum | 2010 | Bonsai: Growing Interesting Small Trees |
| Sibeyn1999 | Sibeyn | 1999 | Ultimate parallel list ranking? |
| Sibeyn93 | Sibeyn | 1993 | Routing and sorting on circular arrays |
| Sibeyn94 | Sibeyn | 1994 | Desnakification of mesh sorting algorithms |
| Sibeyn95a | Sibeyn | 1995 | Sample sort on meshes |
| Sibeyn95b | Sibeyn | 1995 | Overview of mesh results |
| Sibeyn97 | Sibeyn | 1997 | From parallel to external list ranking |
| SibeynKaufmann93 | Sibeyn, Kaufmann | 1993 | Deterministic 1-k routing on meshes with applications to worm-hole routing |
| SibeynKaufmann97 | Sibeyn, Kaufmann | 1997 | BSP-like external-memory computation |
| SibeynRaoJuurlink96 | Sibeyn, Rao, Juurlink | 1996 | Gossiping on meshes and tori |
| SiersdorferSizovWeikum2004 | Siersdorfer, Sizov, Weikum | 2004 | Goal-oriented methods and meta methods for document classification and their parameter tuning |
| SiersdorferWeikum2005 | Siersdorfer, Weikum | 2005 | Automated retraining methods for document classification and their parameter tuning |
| SivadasanSandersSkutella2004 | Sivadasan, Sanders, Skutella | 2004 | Online scheduling with bounded migration |
| Smid91a | Smid | 1991 | Dynamic rectangular point location, with an application to the closest pair problem |
| Smid91b | Smid | 1991 | Range trees with slack parameter |
| Smid91c | Smid | 1991 | Maintaining the minimal distance of a point set in polylogarithmic time (revised version) |
| Smid92 | Smid | 1992 | Finding k points with a smallest enclosing square |
Smid93
| Smid | 1993 | Finding k points with a smallest enclosing square |
| Smid94 | Smid | 1994 | Lecture notes selected topics in data structures |
| Smid95 | Smid | 1995 | Closest point problems in computational geometry |
| SmidDattaLenhofSchwarz93 | Smid, Datta, Lenhof, Schwarz | 1993 | Static and dynamic algorithms for k-point clustering problems |
| SmidGuptaJanardan92 | Smid, Gupta, Janardan | 1992 | Further results on generalized intersection searching problems: counting, reporting, and dynamization |
| SmidLenhof92 | Smid, Lenhof | 1992 | Enumerating the k closest pairs mechanically |
| SmidRavi94 | Smid, Janardan | 1994 | On the width and roundness of a set of points in the plane |
| SmidThielFollertSchoemerSellen95 | Smid, Thiel, Follert, Schömer, Sellen | 1995 | Computing a largest empty anchored cylinder, and related problems |
| Socher-Ambrosius92a | Socher-Ambrosius | 1992 | A goal oriented strategy based on completion |
| Socher-Ambrosius92b | Socher-Ambrosius | 1992 | Semi-unification |
| Socher-Ambrosius92c | Socher-Ambrosius | 1992 | Completeness of resolution and superposition calculi |
| Socher-Ambrosius93a | Socher-Ambrosius | 1993 | Unification of terms with exponents |
| Socher-Ambrosius93b | Socher-Ambrosius | 1993 | A refined version of general E-unification |
| Sofronie-Stokkermans2001 | Sofronie-Stokkermans | 2001 | Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators |
| SogomonjanGoessl92 | Sogomonjan, Goessel | 1992 | Self-testing and self-checking combinational circuits with weakly independent outputs |
| Solis-Oba98 | Solis-Oba | 1998 | 2-Approximation algorithm for finding a spanning tree with maximum number of leaves |
| Sridhar2014 | Sridhar, Oulasvirta, Theobalt | 2014 | Fast Tracking of Hand and Finger Articulations Using a Single Depth Camera |
| Sridhar2016 | Sridhar | 2016 | ? |
| Stoll2007 | Stoll, de Aguiar, Theobalt, Seidel | 2007 | A volumetric approach to interactive shape editing |
| Stoll2009 | Stoll | 2009 | Optical reconstruction of detailed animatable human body models |
| Struth-MPI-I-96-2-004 | Struth | 1996 | Non-symmetric rewriting |
| Stuber93 | Stuber | 1993 | Computing stable models by program transformation |
| Suchanek2006 | Suchanek, Ifrim, Weikum | 2006 | Combining linguistic and statistical analysis to extract relations from web documents |
| Suchanek2007 | Suchanek, Kasneci, Weikum | 2007 | Yago : a large ontology from Wikipedia and WordNet |
| SuchanekMauroWeikum2008 | Suchanek, Sozio, Weikum | 2008 | SOFIE: a self-organizing framework for information extraction |
| SudaWeidenbach2012 | Suda, Weidenbach | 2012 | Labelled superposition for PLTL |
| SudaWischnewski2010 | Suda, Weidenbach, Wischnewski | 2010 | On the saturation of YAGO |
| SykoraVrto91a | Sýkora, Vrto | 1991 | On crossing numbers of hypercubes and cube connected cycles |
SykoraVrto91b
| Sýkora, Vrto | 1991 | Edge separators for graphs of bounded genus with applications |
| Szalas92a | Szalas | 1992 | On natural deduction in fixpoint logics |
| Szalas92b | Szalas | 1992 | On correspondence between modal and classical logic: automated approach |
| Tamaki2003 | Tamaki | 2003 | A linear time heuristic for the branch-decomposition of planar graphs |
| TanevaKacimiWeikum2011 | Taneva, Kacimi, Weikum | 2011 | Finding images of rare and ambiguous entities |
| TariniLenschGoeseleSeidel2003 | Tarini, Lensch, Goesele, Seidel | 2003 | 3D acquisition of mirroring objects |
| TevsWandIhrkeSeidel2010 | Tevs, Wand, Ihrke, Seidel | 2010 | A Bayesian approach to manifold topology reconstruction |
| Theobald2010 | Theobald, Sozio, Suchanek, Nakashole | 2010 | URDF: Efficient Reasoning in Uncertain RDF Knowledge Bases with Soft and Hard Rules |
| TheobaltAhmedDeAguiarZieglerLenschMagnorSeidel2005 | Theobalt, Ahmed, De Aguiar, Ziegler, Lensch, Magnor, Seidel | 2005 | Joint motion and reflectance capture for creating relightable 3D videos |
| TheobaltAhmedLenschMagnorSeidel2006 | Theobalt, Ahmed, Lensch, Magnor, Seidel | 2006 | Enhanced dynamic reflectometry for relightable free-viewpoint video |
| TheobaltMingMagnorSeidel2003 | Theobalt, Li, Magnor, Seidel | 2003 | A flexible and versatile studio for synchronized multi-view video recording |
| TompkinKimKautzTheobalt2011 | Tompkin, Kim, Kautz, Theobalt | 2011 | Videoscapes: exploring unstructured video collections |
| Torben98 | Hagerup | 1998 | Simpler and faster static AC$^0$ dictionaries |
| tr241 | Hopf (ed.) | 1994 | Genetic algorithms within the framework of evolutionary computation: Proceedings of the KI-94 Workshop |
| TräffZaroliagis96 | Träff, Zaroliagis | 1996 | A simple parallel algorithm for the single-source shortest path problem on planar diagraphs |
| TzakovaBlackburn98 | Tzakova, Blackburn | 1998 | Hybridizing concept languages |
| Ulrich2001 | Meyer | 2001 | Directed single-source shortest-paths in linear average-case time |
| UlrichSibeyn98 | Meyer, Sibeyn | 1998 | Time-independent gossiping on full-port tori |
| Veanes98-2-005 | Veanes | 1998 | The relation between second-order unification and simultaneous rigid \sl E-unification |
| VingronLenhofMutzel96 | Vingron, Lenhof, Mutzel | 1996 | Computational Molecular Biology |
| Vorobyov94h | Vorobyov | 1994 | Structural decidable extensions of bounded quantification |
| Vorobyov95-RR-2-001 | Vorobyov | 1995 | Proof normalization and subject reduction in extensions of Fsub |
| Vorobyov96-RR-008 | Vorobyov | 1996 | On the decision complexity of the bounded theories of trees |
| Vorobyov97-2-006 | Vorobyov | 1997 | Third-order matching in $\lambda\rightarrow$-Curry is undecidable |
| Vorobyov98-2-004 | Vorobyov | 1998 | Satisfiability of Functional+Record Subtype Constraints is NP-Hard |
| Vorobyov98-2-007 | Vorobyov | 1998 | The most nonelementary theory (a direct lower bound proof) |
| Vorobyov98-2-008 | Vorobyov | 1998 | AE-Equational theory of context unification is Co-RE-Hard |
| Vorobyov98-2-009 | Vorobyov | 1998 | The undecidability of the first-order theories of one step rewriting in linear canonical systems |
| Vorobyov99 | Vorobyov | 1999 | New lower bounds for the expressiveness and the higher-order Matching problem in the simply typed lambda calculus |
| VorobyovVoronkov97 | Vorobyov, Voronkov | 1997 | Complexity of nonrecursive logic programs with complex values |
| Waldmann2013 | Baumgartner, Waldmann | 2013 | Hierarchic superposition with weak abstraction |
| WaldmannMPI-I-1999-2-003 | Waldmann | 1999 | Cancellative superposition decides the theory of divisible torsion-free abelian groups |
| WaldmannMPI-I-2001-2-001 | Waldmann | 2001 | Superposition and chaining for totally ordered divisible abelian groups |
| Wang1997 | Wang | 1997 | Bicriteria job sequencing with release dates |
| WangBelyaevSaleemSeidel2008 | Wang, Belyaev, Saleem, Seidel | 2008 | Shape complexity from image similarity |
| Weidenbach-91-mpii218 | Weidenbach | 1991 | A sorted logic using dynamic sorts |
| Weidenbach-93-mpii211 | Weidenbach | 1993 | Unification in sort theories and its applications |
| Weidenbach94b | Weidenbach | 1994 | Minimal resolution |
| Wertz-92-mpii216 | Wertz | 1992 | First-order theorem proving modulo equations |
| WiesKuncakZeePodelskiRinard2006 | Wies, Kuncak, Zee, Podelski, Rinard | 2006 | On verifying complex properties using symbolic shape analysis |
| WischnewskiWeidenbach2009 | Wischnewski, Weidenbach | 2009 | Contextual rewriting |
| WuMPI-I-1999-2-005 | Wu | 1999 | Symmetries in logic programs |
| Zakaria2003 | Zakaria | 2003 | FaceSketch: an interface for sketching and coloring cartoon faces |
| ZayerRoesslSeidel2003 | Zayer, Roessl, Seidel | 2003 | Convex boundary angle based flattening |
| Zelikovsky92a | Zelikovsky | 1992 | Minimum base of weighted k polymatroid and Steiner tree problem |
| Zelikovsky92b | Zelikovsky | 1992 | A faster 11/6-approximation algorithm for the Steiner tree problem in graphs |
| Ziegler2006 | Ziegler, Tevs, Theobalt, Seidel | 2006 | GPU point list generation through histogram pyramids |
