MPI-INF Logo
MPI-INF/SWS Research Reports 1991-2017

1. Author,Editor - 3. with BibTeX cite keys - MPI-INF/SWS Research Reports 1991-2017

BibTeX cite keyName(s)YearTitle
AitKaciHanusMorenoNavarro-94-mpii224Aït-Kaci, Hanus, Navarro1994Integration of declarative paradigms: Proceedings of the ICLP'94 Post-Conference Workshop, Santa Margherita Ligure, Italy
AjwaniMalingerMeyerToledo2008Ajwani, Malinger, Meyer, Toledo2008Characterizing the performance of Flash memory storage devices and its impact on algorithm design
Albers92Albers1992The influence of lookahead in competitive on-line algorithms
Albers97Albers1997Better bounds for online scheduling
AlbersGargLeonardi97Albers, Garg, Leonardi1997Minimizing stall time in single and parallel disk systems
AlbersHagerup94Albers, Hagerup1994Improved parallel integer sorting without concurrent writing
AlbersHenzinger97Albers, Henzinger1997Exploring unknown environments
AlbersKoga94Albers, Koga1994New on-line algorithms for the page replication problem
AlbersSchmidt98Albers, Schmidt1998Scheduling with unexpected machine breakdowns
AlbersWestbrook96Albers, Westbrook1996A survey of self-organizing data structures
AlbertsGutwengerMutzelNáherAlberts, Gutwenger, Mutzel, Näher1997AGD-Library: A Library of Algorithms for Graph Drawing
AlbrechtKippNeffSeidel2006Albrecht, Kipp, Neff, Seidel2006Gesture modeling and animation by imitation
AltGeffertMehlhorn91Alt, Geffert, Mehlhorn1991A lower bound for the nondeterministic space complexity of contextfree recognition
AltGuibasMehlhornKarpWidgerson92Alt, Guibas, Mehlhorn, Karp, Widgerson1992A method for obtaining randomized algorithms with small tail probalities
AlthausCanzer2007Althaus, Canzar2007A Lagrangian relaxation approach for the multiple sequence alignment problem
AlthausKohlbacherLenhofMüller2000Althaus, Kohlbacher, Lenhof, Müller2000A branch and cut algorithm for the optimal solution of the side-chain placement problem
AlthausMehlhorn97Althaus, Mehlhorn1997Maximum network flow with floating point arithmetic
AlthausPolzinDaneshmand2003Althaus, Polzin, Daneshmand2003Improving linear programming approaches for the Steiner tree problem
AlvanakiMichelStupar2012Alvanaki, Michel, Stupar2012Building and maintaining halls of fame over a database
Anand2011Anand, Bedathur, Berberich, Schenkel2011Temporal index sharding for space-time efficiency in archive search
AnandBedathurBerberichSchenkel2010Anand, Bedathur, Berberich, Schenkel2010Efficient temporal keyword queries over versioned text
AnandMeleBedathurBerberich2014Anand, Mele, Bedathur, Berberich2014Phrase Query Optimization on Inverted Indexes
AnderssonNilssonHagerupRaman95Andersson, Nilsson, Hagerup, Raman1995Sorting in linear time?
AngelovaSiersdorfer2006Angelova, Siersdorfer2006A neighborhood-based approach for clustering of linked document collections
AntoyEchahedHanus93Antoy, Echahed, Hanus1993A needed narrowing strategy
Arikati94MPII94-162Arikati1994On the parallel complexity of degree sequence problems
ArikatiChaudhuriZaroliagis96Arikati, Chaudhuri, Zaroliagis1996All-pairs min-cut in sparse networks
ArikatiMaheshwari94Arikati, Maheshwari1994Realizing degree sequences in parallel
ArikatiMaheshwariZaroliagisArikati, Maheshwari, Zaroliagis1994Efficient computation of compact representations of sparse graphs
ArikatiMaheshwariZaroliagis95Arikati, Maheshwari, Zaroliagis1995Efficient computation of implicit representations of sparse graphs (revised version)
AryaMountSmid94Arya, Mount, Smid1994Dynamic algorithms for geometric spanners of small diameter: randomized solutions
AryaSmid94Arya, Smid1994Efficient construction of a bounded degree spanner with low weight
BaaderOhlbach95Baader, Ohlbach1995A multi-dimensional terminological knowledge representation language
Bachmair-et-el-93-mpii236Bachmair, Ganzinger, Lynch, Snyder1993Basic paramodulation
Bachmair91Bachmair1991Associative-commutative reduction orderings
BachmairGanzinger-91-mpii208Bachmair, Ganzinger1991Rewrite-based equational theorem proving with selection and simplification
BachmairGanzinger-93-mpii249Bachmair, Ganzinger1993Rewrite techniques for transitive relations
BachmairGanzinger-93-mpii250Bachmair, Ganzinger1993Ordered chaining for total orderings
BachmairGanzinger-93-mpii267Bachmair, Ganzinger1993Associative-commutative superposition
BachmairGanzinger-95-mpii2-009Bachmair, Ganzinger1995Ordered chaining calculi for first-order theories of binary relations
BachmairGanzinger-97-mpii2-005Bachmair, Ganzinger1997A theory of resolution
BachmairGanzinger97Bachmair, Ganzinger1997Strict basic superposition and chaining
BachmairGanzingerVoronkov97Bachmair, Ganzinger, Voronkov1997Elimination of equality via transformation with ordering constraints
BargmannBlanzSeidel2007Bargmann, Blanz, Seidel2007A nonlinear viseme model for triphone-based speech synthesis
Barnes94Barnes1994A method for implementing lock-free shared data structures
BarnesEdmonds94Barnes, Edmonds1994Time-space lower bounds for directed s-t connectivity on JAG models
BarnesFeige94Barnes, Feige1994Short random walks on graphs
BarnettBasinHesketh92Barnett, Basin, Hesketh1992A recursion planning analysis of inductive completion
barth-92-mpii233Barth1992CLP($\cal PB$): A Meta-Interpreter in CLP($\cal R$)
Barth-94-mpii216Barth1994Linear 0-1 inequalities and extended clauses
Barth-95-mpii2003Barth1995A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization
BarthBockmayr-94-mpii261Barth, Bockmayr1994Finite domain and cutting plane techniques in CLP($\cal PB$)
Basin-94-mpii218Basin1994Logic frameworks for logic programs
BasinBundyKraanMatthews93Basin, Bundy, Kraan, Matthews1993A framework for program development based on schematic proof
BasinConstable92Basin, Constable1992Metalogical frameworks
BasinGanzinger95Basin, Ganzinger1995Automated complexity analysis based on ordered resolution
BasinHähnleFronhöferPoseggaSchwind93Basin, Hähnle, Fronhöfer, Posegga, Schwind (ed.)1993Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993
BasinKlarlundBasin, Klarlund1996Beyond the finite in automatic hardware verification
BasinKraanBundy93Basin, Kraan, Bundy1993Middle-out reasoning for logic program synthesis
BasinMatthews93Basin, Matthews1993A conservative extension of first-order logic and its application to theorem proving
BasinMatthewsViganòBasin, Matthews, Viganò1996Labelled propositional modal logics: theory and practice
BasinMatthewsVigano96Basin, Matthews, Viganò1996Natural deduction for non-classical logics
BasinMatthewsVigano97Basin, Matthews, Viganò1997Labelled modal logics: quantifiers
BasinWalsh-94-mpii209Basin, Walsh1994Termination orderings for rippling
BasinWalsh92aBasin, Walsh1992Difference matching
BasinWalsh92bBasin, Walsh1992Difference unification
BastHagerup93Bast, Hagerup1993Fast parallel space allocation, estimation and integer sorting (revised)
BastMajumdarSchenkelTheobaldWeikum2006Bast, Majumdar, Schenkel, Theobald, Weikum2006IO-Top-k: index-access optimized top-k query processing
BastWeberMortensen2006Bast, Weber, Mortensen2006Output-sensitive autocompletion search
BaswanaTelikepalli2005Baswana, Telikepalli2005Improved algorithms for all-pairs approximate shortest paths in weighted graphs
Baumeister96Baumeister1996Using algebraic specification languages for model-oriented specifications
BaumgartenJungMehlhorn92Baumgarten, Jung, Mehlhorn1992Dynamic point location in general subdivisions
BedathurBerberichDittrichMamoulisWeikum2009Bedathur, Berberich, Dittrich, Mamoulis, Weikum2009Scalable phrase mining for ad-hoc text analytics
BeierSibeynBeier, Sibeyn2000A powerful heuristic for telephone gossiping
BeierVöcking2003Beier, Vöcking2003Random knapsack in expected polynomial time
BekaertSlusallekCoolsHavranSeidelBekaert, Slusallek, Cools, Havran, Seidel2003A custom designed density estimation method for light transport
BeldiceanuKatrielThiel2004Beldiceanu, Katriel, Thiel2004Filtering algorithms for the Same and UsedBy constraints
BelyaevLangerSeidel2006Belyaev, Langer, Seidel2006Mean value coordinates for arbitrary spherical polygons and
polyhedra in $\mathbbR^3$
BelyaevSeidelShin2006Belyaev, Seidel, Yoshizawa2006Skeleton-driven Laplacian mesh deformations
BenderMichelWeikumTriantafilou2006Bender, Michel, Weikum, Triantafilou2006Overlap-aware global df estimation in distributed information retrieval systems
BerberichBedathur2012Berberich, Bedathur2012Computing n-gram statistics in MapReduce
BerberichBedathurAlonsoWeikum2010Berberich, Bedathur, Alonso, Weikum2010A language modeling approach for temporal information needs
BerberichBedathurNeumannWeikum2007Berberich, Bedathur, Neumann, Weikum2007A time machine for text search
BerberichBedathurNeumannWeikum2007Berberich, Bedathur, Neumann, Weikum2007A Time Machine for Text Search
BerberichKettner2007Berberich, Kettner2007Linear-time reordering in a sweep-line algorithm for algebraic curves intersecting in a common point
BernerBokelohWandSchillingSeidel2009Berner, Bokeloh, Wand, Schilling, Seidel2009Generalized intrinsic symmetry detection
BernerBurghardWandMitraKleinSeidel2011Berner, Burghard, Wand, Mitra, Klein, Seidel2011A morphable part model for shape manipulation
BilardiChaudhuriDubhashiMehlhorn93Bilardi, Chaudhuri, Dubhashi, Mehlhorn1993A lower bound for area-universal graphs
BischoffKählerSchneiderBotschRösslVorsatz2000Kobbelt, Bischoff, Kähler, Schneider, Botsch, Rössl, Vorsatz2000Geometric modeling based on polygonal meshes
BjörklundPeterssonVorobyov2001Björklund, Petersson, Vorobyov2001Experiments with iterative improvement algorithms on completely unimodel hypercubes
BlackburnTzakovaBlackburn, Tzakova1998Hybrid languages and temporal logic
BlackburnTzakova97Blackburn, Tzakova1997Two hybrid logics
Blanchet2004Blanchet2004Automatic proof of strong secrecy for security protocols
Bockmayr-94-mpii207Bockmayr1994Cutting planes in constraint logic programming
Bockmayr91Bockmayr1991Logic programming with pseudo-Boolean constraints
BockmayrBarth95
Barth, Bockmayr1995Modelling mixed-integer optimisation problems in constraint logic programming
BockmayrEisenbrand97Bockmayr, Eisenbrand1997On the Chvátal rank of polytopes in the 0/1 cube
BockmayrEisenbrandMPI-I-1999-2-008Bockmayr, Eisenbrand1999Cutting planes and the elementary closure in fixed dimension
BockmayrKasper97Bockmayr, Kasper1997A unifying framework for integer and finite domain constraint programming
BockmayrKrischerWerner93Bockmayr, Krischer, Werner1993Narrowing strategies for arbitrary canonical rewrite systems
BockmayrRadermacher93Bockmayr, Radermacher1993Künstliche Intelligenz und Operations Research
BodlaenderHagerup95Bodlaender, Hagerup1995Parallel algorithms with optimal speedup for bounded treewidth
BoghossianKohlbacherLenhof99Boghossian, Kohlbacher, Lenhof1999BALL: Biochemical Algorithms Library
BorchertRanjan93Borchert, Ranjan1993The circuit subfunction relations are $sum^P_2$-complete
Bradford95Bradford1995Matching nuts and bolts optimally
BradfordCapoyleas95Bradford, Capoyleas1995Weak epsilon-nets for points on a hypersphere
BradfordFleischerBradford, Fleischer1995Matching nuts and bolts faster
BradfordFleischerSmid95Bradford, Fleischer, Smid1995A polylog-time and $O(n\sqrt\lg n)$-work parallel algorithm for finding the row minima in totally monotone matrices
BradfordReinert96Bradford, Reinert1996Lower bounds for row minima searching
BrandenburgJuengerMutzel97Brandenburg, Jünger, Mutzel1997Algorithmen zum automatischen Zeichnen von Graphen
BreslauerJiangZhigen97Breslauer, Jiang, Jiang1996Rotations of periodic strings and short superstrings
BrinkBritzSchmidt92Brink, Britz, Schmidt1992Peirce algebras
BrinkGabbayOhlbach93Brink, Gabbay, Ohlbach1993Towards automating duality
Brodal97Brodal1997Finger search trees with constant insertion time
BrodalChaudhuriRadhakrishnan96Brodal, Chaudhuri, Radhakrishnan1996The randomized complexity of maintaining the minimum
BrodalPinotti98Brodal, Pinotti1998Comparator networks for binary heap construction
BrodalTráffZaroliagis97Brodal, Träff, Zaroliagis1997A parallel priority queue with constant time operations
BrönnimanKettnerSchirraVeltkamp98Brönniman, Kettner, Schirra, Veltkamp1998Applications of the generic programming paradigm in the design of CGAL
BroschartSchenkel2010Broschart, Schenkel2010Real-time text queries with tunable term pair indexes
BurkhardtCrauserFerraginaLenhofRivalsVingron98Burkhardt, Crauser, Ferragina, Lenhof, Rivals, Vingron1998$q$-gram based database searching using a suffix array (QUASAR)
Burnikel98-1-023Burnikel1998Rational points on circles
Burnikel98-1-027Burnikel1998Delaunay graphs by divide and conquer
BurnikelKoenemann96Burnikel, Könemann1996High-precision floating point numbers in LEDA
BurnikelMehlhornSchirra96Burnikel, Mehlhorn, Schirra1996The LEDA class real number
BurnikelMehlhornSeel99Burnikel, Mehlhorn, Seel1999A simple way to recognize a correct Voronoi diagram of line segments
BurnikelZiegler98Burnikel, Ziegler1998Fast recursive division
ChandranSivadasan2004Chandran, Sivadasan2004On the Hadwiger's conjecture for graph products
ChandranSubramanian2003Chandran, Subramanian2003Girth and treewidth
CharatonikGanzinger2002Charatonik, Ganzinger2002Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi
CharatonikMPI-I-1999-2-001Charatonik1999Automata on DAG representations of finite trees
CharatonikPacholski93Charatonik, Pacholski1993Negativ set constraints: an easy proof of decidability
CharatonikPodelski97Charatonik, Podelski1997Solving set constraints for greatest models
CharatonikTalbot2002Charatonik, Talbot2002Atomic set constraints with projection
ChariHartmanis94Chari, Hartmanis1994On the intellectual terrain around NP
Chaudhuri93aChaudhuri1993Sensitive functions and approximate problems
Chaudhuri93bChaudhuri1993A lower bound for linear approximate compaction
ChaudhuriHagerup94Chaudhuri, Hagerup1994Prefix graphs and their applications
ChaudhuriHagerupRaman93Chaudhuri, Hagerup, Raman1993Approximate and exact deterministic parallel selection
ChaudhuriRadhakrishnan93Chaudhuri, Radhakrishnan1993The complexity of parallel prefix problems on small domains
ChaudhuriZaroliagis95aChaudhuri, Zaroliagis1995Shortest paths in digraphs of small treewidth sequential algorithms
ChaudhuriZaroliagis95bChaudhuri, Zaroliagis1995Shortest paths in digraphs of small treewidth part II: optimal parallel algirithms
CheriyanHagerupMehlhorn91Cheriyan, Hagerup, Mehlhorn1991An $O(n^3)$-time maximum-flow algorithm
CheriyanMehlhorn91Cheriyan, Mehlhorn1991Algorithms for dense graphs and networks
ChewKedernSchirra94Chew, Kedem, Schirra1994On characteristic points and approximate decision algorithms for the minimum Hausdorff distance
ChoiSeidel2000Choi, Seidel2000Hyperbolic Hausdorff distance for medial axis transform
ChoiSeidel2001Choi, Seidel2001Linear one-sided stability of MAT for weakly injective domain
ChristofJüngerKececioglouMutzelReinelt96Christof, Jünger, Kececioglou, Mutzel, Reinelt1996A branch-and-cut approach to physical mapping with end-probes
ClarksonMehlhornSeidel92Clarkson, Mehlhorn, Seidel1992Four results on randomized incremental constructions
CortierGanzingerJacquemardVeanesMPI-I-1999-2-004Cortier, Ganzinger, Jacquemard, Veanes1999Decidable fragments of simultaneous rigid reachability
CrauserFerragina99Crauser, Ferragina1999A theoretical and experimental study on the construction of suffix arrays in external memory
CrauserFerraginaMehlhornMeyerRamos98Crauser, Ferragina, Mehlhorn, Meyer, Ramos1998Randomized external-memory algorithms for some geometric problems
CrauserMehlhornAlthausetal98Crauser, Mehlhorn, Althaus, Brengel, Buchheit, Keller, Krone, Lambert, Schulte, Thiel, Westphal, Wirth1998On the performance of LEDA-SM
Csaba2003Csaba2003On the Bollob\'as -- Eldridge conjecture for bipartite graphs
CunninghamWang97Cunningham, Wang1997Restricted 2-factor polytopes
Cvetkovic93Cvetkovic1993The logic of preference and decision supporting systems
DasKapoorSmid96Das, Kapoor, Smid1996On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
DaubertHeidrichKautzDischlerSeidel2001Daubert, Heidrich, Kautz, Dischler, Seidel2001Efficient light transport using precomputed visibility
deAguiarZayerTheobaltMagnorSeidel2006de Aguiar, Zayer, Theobalt, Magnor, Seidel2006A framework for natural animation of digitized models
DegtyarevVoronkov98Degtyarev, Voronkov1998Equality reasoning in sequent-based calculi
DelzannoPodelski98Delzanno, Podelski1998Model checking infinite-state systems in CLP
DelzannoRaskinMPI-I-1999-2-007Delzanno, Raskin1999Symbolic representation of upward-closed sets
deMeloSuchanekPease2008de Melo, Suchanek, Pease2008Integrating Yago into the suggested upper merged ontology
deMeloWeikum2009de Melo, Weikum2009Towards a Universal Wordnet by learning from combined evidenc
DeSimoneDiehlJuengerMutzelReineltRinaldi96aDe Simone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi1996Exact ground states of two-dimensional $\pm J$ Ising Spin Glasses
DevillersGolinSchirraKedern94Devillers, Golin, Schirra, Kedem1994Revenge of the dog: queries on Voronoi diagrams of moving points
DiehlDeSimoneJuengerMutzelReineltRinaldiDiehl, De Simone, Jünger, Mutzel, Reinelt, Rinaldi1995Exact ground states of Ising spin classes: new experimental results with a branch and cut algorithm
DietzfelbingerWoelfel2003Dietzfelbinger, Woelfel2003Almost random graphs with simple hash functions
DiksHagerup96Diks, Hagerup1996More geneal parallel tree contraction: Register allocation and broadcasting in a tree
dim94bDimopoulos1994Classical methods in nonmonotonic reasoning
Dimopoulos-93-mpii226Dimopoulos, Magirou, Papadimitriou1993On kernels, defaults and even graphs
Dimopoulos-93-mpii264Dimopoulos, Torres1993Graph theoretical structures in logic programs and default theories
DjidjevPantziouZaroliagis94aDjidjev, Pantziou, Zaroliagis1994On-line and Dynamic Shortest Paths through Graph Decompositions (Preliminary Version)
DjidjevPantziouZaroliagis94bDjidjev, Pantziou, Zaroliagis1994On-line and dynamic algorithms for shortest path problems
DmitrievHavranSeidel2004Dmitriev, Havran, Seidel2004Faster ray tracing with SIMD shaft culling
DobrindtMehlhornYvinec93Dobrindt, Mehlhorn, Yvinec1993A complete and efficient algorithm for the intersection of a general convex polyhedron
DragoMartensMyszkowskiSeidel2002Drago, Martens, Myszkowski, Seidel2002Perceptual evaluation of tone mapping operators with regard to similarity and preference
Dubhashi93Dubhashi1993Quantifier elimination in p-adic fields
DubhashiMehlhornRanjanThiel93Dubhashi, Mehlhorn, Ranjan, Thiel1993Searching, sorting and randomised algorithms for central elements and ideal counting in posets
DubhashiPanconesi94Dubhashi, Panconesi1994Near-optimal distributed edge
DubhashiPantziouSpirakisZaroliagis95Dubhashi, Pantziou, Spirakis, Zaroliagis1995The fourth moment in Luby`s distribution
DubhashiPriebeRanjan96Dubhashi, Priebe, Ranjan1996Negative dependence through the FKG Inequality
DubhashiRanjan94aDubhashi, Ranjan1994Some correlation inequalities for probabilistic analysis of algorithms
DubhashiRanjan94bDubhashi, Ranjan1994Stochastic majorisation: exploding some myths
DubhashiRanjan98Dubhashi, Ranjan1998On positive influence and negative dependence
DykenZieglerTheobaltSeidel2007Dyken, Ziegler, Theobalt, Seidel2007HistoPyramids in Iso-Surface Extraction
DyllaMiliarakiTheobald2012Dylla, Miliaraki, Theobald2012Top-k query processing in probabilistic databases with non-materialized views
DyllaTheobald2014Dylla, Theobald2014Learning Tuple Probabilities in Probabilistic Databases
EfremovMantiukMyszkowskiSeidelEfremov, Mantiuk, Myszkowski, Seidel2006Design and evaluation of backward compatible high dynamic range video compression
EigenwilligKettnerWolpert2006Eigenwillig, Kettner, Wolpert2006Snap rounding of Bézier curves
Eisenbrand2003Eisenbrand2003Fast integer programming in fixed dimension
EisenbrandMPI-I-2000-2-001Eisenbrand2000Short vectors of planar lattices via continued fractions
EisingerOhlbach91Eisinger, Ohlbach1991Deduction systems based on resolution
Elbassuoni2010Elbassuoni, Ramanath, Weikum2010Query relaxation for entity-relationship search
FabriGiezemanKettnerSchirraSch'onherrFabri, Giezeman, Kettner, Schirra, Schönherr1998On the Design of CGAL, the Computational Geometry Algorithms Library
Fatourou2000Fatourou2000Low-contention depth-first scheduling of parallel computations with synchronization variables
fiatLeonardi97Fiat, Leonardi1997On-line network routing - a survey
FietzkeKruglovWeidenbach2012Fietzke, Kruglov, Weidenbach2012Automatic generation of inductive invariants by SUP(LA)
FietzkeWeidenbach2008Fietzke, Weidenbach2008Labelled splitting
FinklerMehlhorn96Finkler, Mehlhorn1996Runtime prediction of real programs on real machines
Fleischer91Fleischer1991A tight lower bound for the worst case of bottom-up-heapsort
Fleischer92aFleischer1992A simple balanced search tree with 0(1) worst-case update time
Fleischer92bFleischer1992A new lower bound technique for decision trees
Fleischer94Fleischer1994Komplexitätstheorie und effiziente Algorithmen
Fleischer97Fleischer1997On the Bahncard problem
FleischerMehlhornRoteWelzl91Fleischer, Mehlhorn, Rote, Welzl1991Simultaneous inner and outer aproximation of shapes
FredericksonSolis-Oba98Frederickson, Solis-Oba1998Robustness analysis in combinatorial optimization
FrigioniMarchetti-SpaccamelaNanni98Frigioni, Marchetti-Spaccamela, Nanni1998Fully dynamic shortest paths and negative cycle detection on diagraphs with Arbitrary Arc Weights
FuchsBlanzLenschSeidel2005Fuchs, Blanz, Lensch, Seidel2005Reflectance from images: a model-based approach for human faces
FuchsChenWangRaskarLenschSeidel2009Fuchs, Chen, Wang, Raskar, Lensch, Seidel2009A shaped temporal filter camera
FuchsGoeseleChenSeidelFuchs, Goesele, Chen, Seidel2005An emperical model for heterogeneous translucent objects
FunkeLaueNaujoksZvi2006Funke, Laue, Naujoks, Zvi2007Power assignment problems in wireless communication
Gabbay93Gabbay1993Classical vs non-classical logics: the universality of classical logic
GabbayLDSGabbay1994LDS - Labelled Deductive Systems: Volume 1 - Foundations
GabbayOhlbach92Gabbay, Ohlbach1992Quantifier elimination in second-order predicate logic
GallBroxRosenhahnSeidel2008Gall, Brox, Rosenhahn, Seidel2007Global stochastic optimization for robust and accurate human motion capture
GallPotthoffRosenhahnSchnoerrSeidel2006Gall, Potthoff, Rosenhahn, Schnoerr, Seidel2006Interacting and annealing particle filters: mathematics and a recipe for applications
GallRosenhahnSeidel2007Gall, Rosenhahn, Seidel2007Clustered stochastic optimization for object recognition and pose estimation
GanzingerBachmairWaldmann92Ganzinger, Bachmair, Waldmann1992Set constraints are the Monadic class
GanzingerBachmairWaldmann93Ganzinger, Bachmair, Waldmann1993Superposition with simplification as a decision procedure for the monadic class with equality
GanzingerJacquemardVeanes98Ganzinger, Jacquemard, Veanes1998Rigid reachability
GanzingerWaldmann96Ganzinger, Waldmann1996Theorem proving in cancellative abelian monoids
Garg97Garg1997Approximating sparsest cuts
GargChaudhuriRavi96Garg, Chaudhuri, Ravi1996Generalized $k$-Center Problems
GargKoenemann97Garg, Könemann1997Faster and simpler algorithms for multicommodity flow and other fractional packing problems
GargKonjevodRavi97Garg, Konjevod, Ravi1997A polylogarithmic approximation algorithm for group Steiner tree problem
GargManss97Garg, Manss1997Evaluating a 2-approximation algorithm for edge-separators in planar graphs
GargPapatriantafilouTsigas96Garg, Papatriantafilou, Tsigas1996Distributed list coloring: how to dynamically allocate frequencies to mobile base stations
GasieniecIndykKrysta96Gasieniec, Indyk, Krysta1996External inverse pattern matching
GasieniecJanssonLingasÖstlin96Gasieniec, Jansson, Lingas, Östlin1996On the complexity of computing evolutionary trees
GidenstamPapatriantafilou2007Gidenstam, Papatriantafilou2007LFthreads: a lock-free thread library
GjergjiSuchanekWeikum2006Kasnec, Suchanek, Weikum2006Yago - a core of semantic knowledge
GoeseleKautzLangLenschSeidel2002Goesele, Kautz, Lang, Lensch, Seidel2002Tutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models
GolinRamanSchwarzSmid92Golin, Raman, Schwarz, Smid1992Simple randomized algorithms for closest pair problems
GolinRamanSchwarzSmid93Golin, Raman, Schwarz, Smid1993Randomized Data Structures for the Dynamic Closest-Pair Problem
GotsmanKaligosiMehlhornMichailPyrgaGotsman, Kaligosi, Mehlhorn, Michail, Pyrga2005Cycle bases of graphs and sampled manifolds
Graf-94-mpii251Graf1994Substitution tree indexing
Graf92Graf1992Path indexing for term retrieval
Graf92Graf1992Path Indexing for Term Retrieval
GrafMeyer93Graf, Meyer1993Extended path-indexing
GrafMeyer93Graf, Meyer1993Extended path-Indexing
GranadosTompkinInKimGrauKautzTheobalt2011Granados, Tompkin, In Kim, Grau, Kautz, Theobalt2011How not to be seen – inpainting dynamic objects in crowded scenes
Grandoni2002Grandoni2002Incrementally maintaining the number of l-cliques
Grolmusz92aGrolmusz1992Circuits and multi-party protocols
Grolmusz92bGrolmusz1992Separating the communication complexities of MOD m and MOD p circuits
Grolmusz93aGrolmusz1993Multi-party protocols and spectral norms
Grolmusz93bGrolmusz1993MOD m gates do not help on the ground floor
Grolmusz93cGrolmusz1993Harmonic analysis, real approximation, and the communication complexity of Boolean functions
Grolmusz93dGrolmusz1993On multi-party communication complexity of random functions
GunopulosMannilaSaluja96Gunopulos, Mannila, Saluja1996Discovering all most specific sentences by randomized algorithms
Show details for GuptaJanardanSmid93aGuptaJanardanSmid93aGupta, Janardan, Smid1993Algorithms for some intersection searching problems involving curved objects
GuptaJanardanSmid93bGupta, Janardan, Smid1993Effizient algorithms for generalized intersection searching on non-iso-oriented objects
GuptaJanardanSmid94Gupta, Janardan, Smid1994Fast algorithms for collision and proximity problems involving moving geometric objects
GuptaJanardanSmid96aGupta, Janardan, Smid1996Efficient algorithms for counting and reporting pairwise intersections between convex polygons
GuptaJanardanSmid96bGupta, Janardan, Smid1996A technique for adding range restrictions to generalized searching problems
GuptaJanardanSmidDasgupta94Gupta, Janardan, Smid, Dasgupta1994The rectangle enclosure and point-dominance problems revisited
GuptaReport2015Gupta, Berberich2016Diversifying Search Results Using Time
GurevichVeanes98Gurevich, Veanes1998Partisan corroboration, and shifted pairing
HaberSchmittKosterSeidel2004Haber, Schmitt, Koster, Seidel2004Modeling hair using a wisp hair model
HaberSeidel1999Haber, Seidel1999A framework for evaluating the quality of lossy image compression
Hagerup91aHagerup1991Fast parallel space allocation, estimation an integer sorting
Hagerup91bHagerup1991On a compaction theorem of ragde
Hagerup92Hagerup1992Fast deterministic processor allocation
Hagerup93Hagerup1993Optimal parallel string algorithms: sorting, merching and computing the minimum
Hagerup96Hagerup1996Vorlesungsskript Komplexitätstheorie
HagerupKutylowski92Hagerup, Kutylowski1992Fast integer merging on the EREW PRAM
HagerupMaas93Hagerup, Maas1993Generalized topological sorting in linear time
HagerupRaman92Hagerup, Raman1992Waste makes haste: tight bounds for loose parallel sorting
HangelbroekNürnbergerRoesslSeidelZeilfelder2003Hangelbroek, Nürnberger, Roessl, Seidel, Zeilfelder2003The dimension of $C^1$ splines of arbitrary degree on a tetrahedral partition
Hanus92aHanus1992An abstract interpretation algorithm for residuating logic programs
Hanus92bHanus1992Analysis of nonlinear constraints in CLP(R)
Hanus93bHanus1993Lazy unification with inductive simplification
Hanus94ExtraReportHanus1994On extra variables in (Equational) logic programming
Hanus94wieJLPHanus1994The integration of functions into logic programming: a survey
HanusJosephs93Hanus, Josephs1993A debugging model for functional logic programs
HavranHerzogSeidel2006Havran, Herzog, Seidel2006On fast construction of spatial hierarchies for ray tracing
HavranZajacDrahokoupilSeidel2009Havran, Zajac, Drahokoupil, Seidel2009MPI Informatics building model as data for your research
HeffernanSchirra91Heffernan, Schirra1991Approximate decision algorithms for point set congruence
HenzingerLeonardi98Henzinger, Leonardi1998Scheduling multicasts on unit-capacity trees and meshes
HenzingerRaskinSchobbens99Henzinger, Raskin, Schobbens1999Axioms for real-time logics
HenzingerRaskinSchobbens99Henzinger, Raskin, Schobbens1999Fully decidable logics, automata and classical theories for defining regular real-time languages
HertHoffmannKettnerPionSeelHert, Hoffmann, Kettner, Pion, Seel2001An adaptable and extensible geometry kernel
HertPolzinKettnerSchäfer2002Hert, Polzin, Kettner, Schäfer2002Exp Lab: a tool set for computational experiments
Herzig96Herzig1996SCAN and systems of conditional logic
HerzogHavranMyszkowskiSeidel2007Herzog, Havran, Myszkowski, Seidel2007Global illumination using photon ray splatting
HillenbrandWeidenbach2007Hillenbrand, Weidenbach2007Superposition for finite domains
HillenbrandWeidenbach2007Hillenbrand, Weidenbach2007Superpositon for Finite Domains
Hisao2003Tamaki2003Alternating cycles contribution: a strategy of tour-merging for the traveling salesman problem
HisaoDietzfelbinger2003Dietzfelbinger, Tamaki2003On the probability of rendezvous in graphs
Hoefer2002Hoefer2002Performance of heuristic and approximation algorithms for the uncapacitated facility location problem
HoepmannPapatriantafilouTsigas95Hoepmann, Papatriantafilou, Tsigas1995Towards self-stabilizing wait-free shared memory objects
HoffartSuchanekBerberichWeikum2010Hoffart, Suchanek, Berberich, Weikum2010YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia
HoffmannGomesSelman2005Hoffmann, Gomes, Selman2005Bottleneck behavior in CNF formulas
Horbach2009Horbach, Weidenbach2009Superposition for fixed domains
HorbachWeidenbach2009Horbach, Weidenbach2009Deciding the inductive validity of $\forall\exists^*$ queries
HorbachWeidenbach2010Horbach, Weidenbach2010Decidability results for saturation-based model building
HromkovicMuellerSykoraVrto91Hromkovic, Müller, Sýkora, Vrto1991On embeddings in cycles
HuangKavitha2010Huang, Kavitha2010Maximum cardinality popular matchings in strict two-sided preference lists
HuangOtt2013Ott2013New results for non-preemptive speed scaling
HullinAjdinHanikaSeidelKautzLensch2009Hullin, Ajdin, Hanika, Seidel, Kautz, Lensch2009Acquisition and analysis of bispectral bidirectional reflectance distribution functions
Hustadt91Hustadt1991A complete transformation system for polymorphic higher-order unification
Hustadt92Hustadt1992Unification and matching in Church's Original Lambda Calculus
HustadtNonnengartSchmidtTimm92Hustadt, Nonnengart, Schmidt, Timm1992Motel user manual
HustadtNonnengartSchmidtTimm92Hustadt, Nonnengart, Schmidt, Timm1992Motel User Manual
HustadtNonnengartSchmidtTimm92Hustadt, Nonnengart, Schmidt, Timm1992Motel User Manual
HustadtSchmidt97Hustadt, Schmidt1997On evaluating decision procedures for modal logic
IvrissimtzisJeongLeeLeeSeidel2004Ivrissimtzis, Jeong, Lee, Lee, Seidel2004Neural meshes: surface reconstruction with a learning algorithm
IvrissimtzisJeongSeidel2003Ivrissimtzis, Jeong, Seidel2003Neural meshes: statistical learning methods in surface reconstruction
J'ungerLeipertMutzel98Jünger, Leipert, Mutzel1998A note on computing a maximal planar subgraph using PQ-trees
JacquemardMeyerWeidenbach98Jacquemard, Meyer, Weidenbach1998Unification in extensions of shallow equational theories
Jaeger2003Jaeger2003A representation theorem and applications to measure selection and noninformative priors
Jaeger94bJaeger1994A probabilistic extension of terminological logics
Jansen98-1-005Jansen1998The mutual exclusion scheduling problem for permutation and comparability graphs
Jansen98-1-006Jansen1998A new characterization for parity graphs and a coloring problem with costs
JansenPorkolab98-1-025Jansen, Porkolab1998Linear-time approximation schemes for scheduling malleable parallel tasks
JansenPorkolab98-1-026Jansen, Porkolab1998Improved approximation schemes for scheduling unrelated parallel machines
JohannSocher-Ambrosius93Johann, Socher-Ambrosius1993Solving simplifications ordering constraints
JuengerMutzel95Jünger, Mutzel1995Exact and heuristic algorithms for 2-layer straightline crossing minimization
JuengerMutzelOdenthalScharbrodt95Jünger, Mutzel, Odenthal, Scharbrodt1995The thickness of a minor-excluded class of graphs
JúngerLeipertMutzel97Jünger, Leipert, Mutzel1997Pitfalls of using PQ--Trees in automatic graph drawing
JüngerMutzel96Jünger, Mutzel19962-Layer straigthline crossing minimization: performance of exact and heuristic algorithms
JungLenhofMüllerRüb97Jung, Lenhof, Müller, Rüb1997Parallel algorithms for MD-simulations of synthetic polymers
Kapoor95Kapoor1995Dynamic maintenance of 2-d convex hulls and order decomposable problems
KapoorSmid93Kapoor, Smid1993New techniques for exact and approximate dynamic closest-point problems
KargarisPantziouTragoudasZaroliagis94Kargaris, Pantziou, Tragoudas, Zaroliagis1994Quickest paths: faster algorithms and dynamization
KarpinksiZelikovsky94Karpinksi, Zelikovsky1994Further improvements of Steiner tree approximations
KasneciRamanathSozioSuchanekWeikum2008Kasneci, Ramanath, Sozio, Suchanek, Weikum2008STAR: Steiner tree approximation in relationship-graphs
KasneciSuchanekIfrimRamanathWeikum2007Kasneci, Suchanek, Ifrim, Ramanath, Weikum2007NAGA: searching and ranking knowledge
KasneciWeikumElbassuoni2009Kasneci, Weikum, Elbassuoni2009MING: Mining Informative Entity-Relationship Subgraphs
Katriel2004Katriel2004On algorithms for online topological ordering and sorting
KatrielKutz2005Katriel, Kutz2005A faster algorithm for computing a longest common increasing
subsequence
KatrielKutzSkutella2005Katriel, Kutz, Skutella2005Reachability substitutes for planar digraphs
KatrielSandersTräff2002Katriel, Sanders, Träff2002A practical minimum spanning tree algorithm using the cycle property
KatrielThiel2003Katriel, Thiel2003Fast bound consistency for the global cardinality constraint
KaufmannMeyerSibeyn94Kaufmann, Meyer, Sibeyn1994Towards practical permutation routing on meshes
KautzHeidrichDaubert2000Kautz, Heidrich, Daubert2000Bump map shadows for openGL rendering
KavvadiasPantziouSpirakisZaroliagis94Kavvadias, Pantziou, Spirakis, Zaroliagis1994Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems
KazakovNivelle2003Kazakov, de Nivelle2003Subsumption of concepts in $DL$ $\cal FL_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete
Kerber2006Kerber2006Division-free computation of subresultants using bezout matrices
KerberBokelohWandSeidel2012Kerber, Bokeloh, Wand, Seidel2012Symmetry detection in large scale city scans
KimKwonKimTheobalt2011Kim, Kwon, Kim, Theobalt2011Efficient learning-based image enhancement : application to
compression artifact removal and super-resolution
KimTompkinTheobalt2014Kim, Tompkin, Theobalt2014Local high-order regularization on data manifolds
KlauMutzel98-1-013Klau, Mutzel1998Quasi-orthogonal drawing of planar graphs
KlauMutzel98-1-031Klau, Mutzel1998Optimal compaction of orthogonal grid drawings
KleinMehlhornMeiser93Klein, Mehlhorn, Meiser1993Randomized incremental construction of abstract Voronoi diagrams
KoenemannSchmitzSchwarz95Könemann, Schmitz, Schwarz1995Radix heaps an efficient implementation for priority queues
Kovács2003Kovács2003Sum-Multicoloring on paths
KraanBasinBundy92Kraan, Basin, Bundy1992Logic program synthesis via proof planning
KrawczykGoeseleSeidel2005Krawczyk, Goesele, Seidel2005Photometric calibration of high dynamic range cameras
KrithivasanVanisreeDatta92Krithivasan, Vanisree, Datta1992The largest hyper-rectangle in a three dimensional orthogonal polyhedron
Krysta2001Krysta2001Approximating minimum size 1,2-connected networks
KrystaCzumajVoecking2003Krysta, Czumaj, Voecking2003Selfish traffic allocation for server farms
KrystaLorys98-1-016Krysta, Lory\'{s}1998New approximation algorithms for the achromatic number
KrystaSandersVöcking2003Krysta, Sanders, Vöcking2003Scheduling and traffic allocation for tasks with bounded splittability
Kucera93aKucera1993Broadcasting through a noisy one-dimensional network
Kucera93bKucera1993Coloring k-colorable graphs in expected parallel time
Kucera93cKucera1993Expected complexity of graph partitioning problems
LangerBelyaevSeidel2005Langer, Belyaev, Seidel2005Analysis and design of discrete normals and curvatures
LangerSeidel2007Langer, Seidel2007Construction of smooth maps with mean value coordinates
Lenhof95Lenhof1995An algorithm for the protein docking problem
Lenhof97Lenhof1997New contact measures for the protein docking problem
LenhofSmid91Lenhof, Smid1991An optimal construction method for generalized convex layers
LenhofSmid92aLenhof, Smid1992Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
LenhofSmid92bLenhof, Smid1992Sequential and parallel algorithms for the k closest pairs problem
LenschGoeseleSeidel2001Lensch, Goesele, Seidel2001A framework for the acquisition, processing and interactive display of high quality 3D models
LenschKautzGoeseleHeidrichSeidel2001Lensch, Kautz, Goesele, Heidrich, Seidel2001Image-based reconstruction of spatially varying materials
LenschKautzGoeseleSeidel2001Lensch, Kautz, Goesele, Seidel2001A framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the Web
LeonardiMarchetti-SpaccamelaPresciuttiRostènLeonardi, Marchetti-Spaccamela1997Randomized on-line call control revisited
LermenReinert97Lermen, Reinert1997The practical use of the $\calA^*$ algorithm for exact multiple sequence alignment
LuMerzWeidenbach2011Lu, Merz, Weidenbach2011Towards verification of the pastry protocol using TLA+
Madden94-238Madden1994Formal methods of automated program improvement
Madden94aMadden1994Recursive program optimization through inductive synthesis proof transformation
Madden94bMadden1994A survey of program transformation with special reference to unfold/fold style program development
MaddenGreen94Madden, Green1994A general technique for automatically optimizing programs through the use of proof plans
Magnor2004Magnor2004Axisymmetric reconstruction and 3D visualization of bipolar planetary nebulae
MahajanRamesh96Mahajan, Ramesh1996Derandomizing semidefinite programming based approximation algorithms
MahajanRamosSubrahmanyam98Mahajan, Ramos, Subrahmanyam1998Solving some discrepancy problems in NC*
Maier2003Maier2003Compositional circular assume-guarantee rules cannot be sound and complete
Maier2004Maier2004Intuitionistic LTL and a new characterization of safety and liveness
MaierCharatonikGeorgieva2005Maier, Charatonik, Georgieva2005Bounded model checking of pointer programs
MakariAwerbuchGemullaKhandekarMestreSozio2013Makari, Gemulla, Khandekar, Mestre, Sozio2013A distributed algorithm for large-scale generalized matching
Matthews92Matthews1992Reflection in logical systems
Matthews93Matthews1993A theory and its metatheory in FS 0
MatthewsSimpson94Matthews, Simpson1994Reflection using the derivability conditions
MatthewsSmaillBasin92Matthews, Smaill, Basin1992Experience with FS0 as a framework theory
MavronicolasPapatriantafilouTsigas96Mavronicolas, Papatriantafilou, Tsigas1996The impact of timing on linearizability in counting networks
Mehlhorn93Mehlhorn1993An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm
MehlhornMeiserRaschMehlhorn, Meiser, Rasch1992Furthest site abstract Voronoi diagrams
MehlhornMutzel94Mehlhorn, Mutzel1994On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
MehlhornNaeher94Mehlhorn, Näher1994Implementation of a sweep line algorithm for the Straight \& Line Segment Intersection Problem
MehlhornNäherSchirraSeelUhrig96Mehlhorn, Näher, Schirra, Seel, Uhrig1996A computational basis for higher-dimensional computational geometry
MehlhornSchirraMehlhorn, Schirra2000Generalized and improved constructive separation bound for real algebraic expressions
MehlhornSharirWelzlMehlhorn, Sharir, Welzl1993Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
MehlhornSharirWelzl91Mehlhorn, Sharir, Welzl1991Tail estimates for the space complexity of randomized incremantal algorithms
MehlhornUhrig93Mehlhorn, Uhrig1993Maintaining dynamic sequences under equality-tests in polylogorithmic time
MehlhornUhrigRaman92Mehlhorn, Uhrig, Raman1992A lower bound for set intersection queries
MehlhornWAE98Mehlhorn (ed.)19982nd Workshop on Algorithm Engineering WAE '98 - Proceedings
Michail2005Michail2005Rank-maximal through maximum weight matchings
MichaylovPfenning91Michaylov, Pfenning1991Natural semantics and some of its meta-theory in Elf
MiettinenVreekenMiettinen, Vreeken2012MDL4BMF: Minimum Description Length for Boolean Matrix Factorization
Mikkel97Thorup1997Faster deterministic sorting and priority queues in linear space
Mishra2015Mishra2015?
MuellerZiegler94Müller, Ziegler1994An implementation of a Convex Hull Algorithm, Version 1.0
Müller2016Müller2016?
Mutzel95aMutzel1995Automatisiertes Zeichnen von Diagrammen
Mutzel95bMutzel1995A polyhedral approach to planar augmentation and related problems
Mutzel97Mutzel1997An alternative method to crossing minimization on hierarchical graphs
MutzelOdenthalScharbrodt96Mutzel, Odenthal, Scharbrodt1996The thickness of graphs: a survey
MutzelWeiskircher98Mutzel, Weiskircher1998Optimizing over all combinatorial embeddings of a planar graph
NaeherMehlhorn93Näher, Mehlhorn1993LEDA-Manual Version 3.0
NaeherUhrig95
Näher, Uhrig1995LEDA user manual (version R 3.2)
NeumannMoerkotte2008Neumann, Moerkotte2008Single phase construction of optimal DAG-structured QEPs
NeumannWeikum2009Neumann, Weikum2009The RDF-3X engine for scalable management of RDF data
Nieuwenhuis92aNieuwenhuis1992A new ordering constraint solving method and its applications
Nissen1999Nissen, Weihe1999How generic language extensions enable ''open-world'' design in Java
Nissen99Nissen1999Integration of graph iterators into LEDA
Nivelle2005Nivelle2005Using resolution as a decision procedure
NivelleSchulz2001de Nivelle, Schulz2001Proceeding of the Second International Workshop of the Implementation of Logics
NivelleYevgeny2004de Nivelle, Kazakov2004Resolution decision procedures for the guarded fragment with transitive guards
Nonnengart92Nonnengart1992First-order modal logic theorem proving and standard PROLOG
Nonnengart96aNonnengart1996Auxiliary modal operators and the characterization of modal frames
Nonnengart96bNonnengart1996Strong skolemization
NonnengartMPI-I-1999-2-006Nonnengart1999A deductive model checking approach for hybrid systems
NonnengartSzalas95Nonnengart, Szalas1995A fixpoint approach to second-order quantifier elimination with applications to correspondence theory
Ohlbach92Ohlbach1992Preprints of Proceedings of GWAI-92
Ohlbach93Ohlbach1993Translation methods for non-classical logics: an overview
Ohlbach94Ohlbach1994Synthesizing semantics for extensions of propositional logic
Ohlbach94aOhlbach1994Computer support for the development and investigation of logics
Ohlbach94cOhlbach (ed.)1994Temporal logic: Proceedings of the ICTL Workshop
OhlbachBaader93Ohlbach, Baader1993A multi-dimensional terminological knowledge representation language - preliminary version
OhlbachGabbayPlaisted94Ohlbach, Gabbay, Plaisted1994Killer transformations
OhlbachSchmidt95Ohlbach, Schmidt1995Functional translation and second-order frame properties of modal logics
OhlbachSchmidtHustadt95aOhlbach, Schmidt, Hustadt1995Translating graded modalities into predicate logic
PapatriantafilouTsigas95Papatriantafilou, Tsigas1995Wait-free consensus in "in-phase" multiprocessor systems
PatersonSchroederSykoraVrto91Paterson, Schröder, Sýkora, Vrto1991Optimal embedding of a toroidal mesh in a path
Pellegrini95Pellegrini1995New deterministic algorithms for counting pairs of intersecting segments and off-line triangle range searching
Plaisted94aPlaisted1994An abstract program generation logic
Plaisted94bPlaisted1994The search efficiency of theorem proving strategies: an analytical comparison
Plaisted94cPlaisted1994Ordered semantic hyper-linking
Plaisted95Plaisted1995Special cases and substitutes for rigid $E$-unification
PodelskiRybalchenko2003Podelski, Rybalchenko2003Software model checking of liveness properties via transition invariants
PodelskiSchaeferWagner2004Wagner2004Summaries for while programs with recursion
PodelskiWagner2007Podelski, Wagner2007A method and a tool for automatic veriication of region stability for hybrid systems
PolzinVahdati2001aPolzin, Vahdati2001On Steiner trees and minimum spanning trees in hypergraphs
PolzinVahdati2001bPolzin, Vahdati2001Partitioning techniques for the Steiner problem
PolzinVahdati2001cPolzin, Vahdati2001Extending reduction techniques for the Steiner tree problem: a combination of alternative-and bound-based approaches
PolzinVahdati2002Polzin, Vahdati2002Using (sub)graphs of small width for solving the Steiner problem
PredaSuchanekKasneciNeumannWeikum2009Preda, Suchanek, Kasneci, Neumann, Weikum2009Coupling knowledge bases and web services for active knowledge
PredaSuchanekYuanWeikum2011Preda, Suchanek, Yuan, Weikum2011Query evaluation with asymmetric web services
RadhakrishnanSaluja95Radhakrishnan, Saluja1995Interactive Proof Systems
Ramanath2008Ramanath, Kumar, Ifrim2009Generating concise and readable summaries of XML documents
Ramangalahy98Ramangalahy1998Strategies for conformance testing
RaskinSchobbens99Raskin, Schobbens1999Proving a conjecture of Andreka on temporal logic
RaskinSchobbens99Raskin, Schobbens1999The logic of event clocks
ReinertLenhofMutzelMehlhornKececioglou96Reinert, Lenhof, Mutzel, Mehlhorn, Kececioglou1996A branch-and-cut algorithm for multiple sequence alignment
Rhaleb2004Zayer, Rössl, Seidel2004r-adaptive parameterization of surfaces
Rieger93Rieger1996Proximity in arrangements of algebraic sets
RoesslZeilfelderNürnbergerSeidel2003Roessl, Zeilfelder, Nürnberger, Seidel2003Visualization of volume data with quadratic super splines
Rüb97Rüb1997On Batcher's Merge Sorts as Parallel Sorting Algorithms
Rüb98Rüb1998On Wallace's method for the generation of normal variates
Rueb92Rüb1992Computing intersections and arrangements for red-blue curve segments in parallel
Rueb93Rüb1993Lower bounds for merging on the hypercube
Rueb95Rüb1995On the average running time of odd-even merge sort
SalujaGupta96Saluja, Gupta1996Optimal algorithms for some proximity problems on the Gaussian sphere with applications
Sandeep93Sen1993Tight bounds for some problems in computational geometry: the complete sub-logarithmic parallel time range
Sanders2003Sanders2003Polynomial time algorithms for network information flow
SandersDementiev2003Sanders, Dementiev2003Asynchronous parallel disk sorting
SandersEgnerKorst99Sanders, Egner, Korst1999Fast concurrent access to parallel disks
SandersPettie2004Sanders, Pettie2004A simpler linear time 2/3 - epsilon approximation for maximum weight matching
SandersTräff2002Sanders, Träff2002The factor algorithm for all-to-all communication on clusters of SMP nodes
Schaefer2003Schaefer2003A note on the smoothed complexity of the single-source shortest path problem
Schäfer2003Schäfer, Sivadasan2003Topology matters: smoothed competitive analysis of metrical task systems
SchäferBecchettiLeonardiMarchetti-SpaccamelaVredeveld2003Schäfer, Becchetti, Leonardi, Marchetti-Spaccamela, Vredeveld2003Average case and smoothed competitive analysis of the multi-level feedback algorithm
SchäferLeonardi2003Schäfer, Leonardi2003Cross-monotonic cost sharing methods for connected facility location games
SchallBelyaevSeidel2005Schall, Belyaev, Seidel2005Sparse meshing of uncertain and noisy surface scattered data
SchallBelyaevSeidel2006Schall, Belyaev, Seidel2006Feature-preserving non-local denoising of static and time-varying
range data
Schirra1998-1-003Schirra1998Parameterized implementations of classical planar convex hull algorithms and extreme point compuations
Schirra97Schirra1997Designing a Computational Geometry Algorithms Library
Schirra98-1-004Schirra1998Robustness and precision issues in geometric computation
Schmidt91Schmidt1991Algebraic terminological representation
Schmidt92Schmidt1992Terminological representation, natural language & relation algebra
Schmidt97Schmidt1997Resolution is a decision procedure for many propositional modal logics
Schmidt98Schmidt1998E-unification for subsystems of S4
SchmittFoussee2004Schmitt, Fousse2004A comparison of polynomial evaluation schemes
SchoernerThiel94Schömer, Thiel1994Efficient collision detection for moving polyhedra
Scholz2006Scholz, Magnor2006Garment texture editing in monocular video sequences based on
color-coded printing patterns
SchultzlWeickertSeidel2007Schultz, Weickert, Seidel2007A higher-order structure tensor
SchultzTheiselSeidel2008Schultz, Theisel, Seidel2008Crease surfaces: from theory to extraction and application to diffusion tensor MRI
Schwarz92Schwarz1992Semi-dynamic maintenance of the width of a planar point set
SchwarzSmid91Schwarz, Smid1991An O(n log n log log n) algorithm for the on-line closes pair problem
SchwarzSmidSnoeyink91Schwarz, Smid, Snoeyink1991An optimal algorithm for the on-line closest-pair problem
Seel2001Seel2001Implementation of planar Nef polyhedra
Seel97Seel1996A runtime test of integer arithmetic and linear algebra in LEDA
SeelMehlhorn00Seel, Mehlhorn2000Infimaximal frames: a technique for making lines look like segments
SeufertBedathurMestreWeikum2010Seufert, Bedathur, Mestre, Weikum2010Bonsai: Growing Interesting Small Trees
Sibeyn1999Sibeyn1999Ultimate parallel list ranking?
Sibeyn93Sibeyn1993Routing and sorting on circular arrays
Sibeyn94Sibeyn1994Desnakification of mesh sorting algorithms
Sibeyn95aSibeyn1995Sample sort on meshes
Sibeyn95bSibeyn1995Overview of mesh results
Sibeyn97Sibeyn1997From parallel to external list ranking
SibeynKaufmann93Sibeyn, Kaufmann1993Deterministic 1-k routing on meshes with applications to worm-hole routing
SibeynKaufmann97Sibeyn, Kaufmann1997BSP-like external-memory computation
SibeynRaoJuurlink96Sibeyn, Rao, Juurlink1996Gossiping on meshes and tori
SiersdorferSizovWeikum2004Siersdorfer, Sizov, Weikum2004Goal-oriented methods and meta methods for document classification and their parameter tuning
SiersdorferWeikum2005Siersdorfer, Weikum2005Automated retraining methods for document classification and their parameter tuning
SivadasanSandersSkutella2004Sivadasan, Sanders, Skutella2004Online scheduling with bounded migration
Smid91aSmid1991Dynamic rectangular point location, with an application to the closest pair problem
Smid91bSmid1991Range trees with slack parameter
Smid91cSmid1991Maintaining the minimal distance of a point set in polylogarithmic time (revised version)
Smid92Smid1992Finding k points with a smallest enclosing square
Smid93
Smid1993Finding k points with a smallest enclosing square
Smid94Smid1994Lecture notes selected topics in data structures
Smid95Smid1995Closest point problems in computational geometry
SmidDattaLenhofSchwarz93Smid, Datta, Lenhof, Schwarz1993Static and dynamic algorithms for k-point clustering problems
SmidGuptaJanardan92Smid, Gupta, Janardan1992Further results on generalized intersection searching problems: counting, reporting, and dynamization
SmidLenhof92Smid, Lenhof1992Enumerating the k closest pairs mechanically
SmidRavi94Smid, Janardan1994On the width and roundness of a set of points in the plane
SmidThielFollertSchoemerSellen95Smid, Thiel, Follert, Schömer, Sellen1995Computing a largest empty anchored cylinder, and related problems
Socher-Ambrosius92aSocher-Ambrosius1992A goal oriented strategy based on completion
Socher-Ambrosius92bSocher-Ambrosius1992Semi-unification
Socher-Ambrosius92cSocher-Ambrosius1992Completeness of resolution and superposition calculi
Socher-Ambrosius93aSocher-Ambrosius1993Unification of terms with exponents
Socher-Ambrosius93bSocher-Ambrosius1993A refined version of general E-unification
Sofronie-Stokkermans2001Sofronie-Stokkermans2001Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators
SogomonjanGoessl92Sogomonjan, Goessel1992Self-testing and self-checking combinational circuits with weakly independent outputs
Solis-Oba98Solis-Oba19982-Approximation algorithm for finding a spanning tree with maximum number of leaves
Sridhar2014Sridhar, Oulasvirta, Theobalt2014Fast Tracking of Hand and Finger Articulations Using a Single Depth Camera
Sridhar2016Sridhar2016?
Stoll2007Stoll, de Aguiar, Theobalt, Seidel2007A volumetric approach to interactive shape editing
Stoll2009Stoll2009Optical reconstruction of detailed animatable human body models
Struth-MPI-I-96-2-004Struth1996Non-symmetric rewriting
Stuber93Stuber1993Computing stable models by program transformation
Suchanek2006Suchanek, Ifrim, Weikum2006Combining linguistic and statistical analysis to extract relations from web documents
Suchanek2007Suchanek, Kasneci, Weikum2007Yago : a large ontology from Wikipedia and WordNet
SuchanekMauroWeikum2008Suchanek, Sozio, Weikum2008SOFIE: a self-organizing framework for information extraction
SudaWeidenbach2012Suda, Weidenbach2012Labelled superposition for PLTL
SudaWischnewski2010Suda, Weidenbach, Wischnewski2010On the saturation of YAGO
SykoraVrto91aSýkora, Vrto1991On crossing numbers of hypercubes and cube connected cycles
SykoraVrto91b
Sýkora, Vrto1991Edge separators for graphs of bounded genus with applications
Szalas92aSzalas1992On natural deduction in fixpoint logics
Szalas92bSzalas1992On correspondence between modal and classical logic: automated approach
Tamaki2003Tamaki2003A linear time heuristic for the branch-decomposition of planar graphs
TanevaKacimiWeikum2011Taneva, Kacimi, Weikum2011Finding images of rare and ambiguous entities
TariniLenschGoeseleSeidel2003Tarini, Lensch, Goesele, Seidel20033D acquisition of mirroring objects
TevsWandIhrkeSeidel2010Tevs, Wand, Ihrke, Seidel2010A Bayesian approach to manifold topology reconstruction
Theobald2010Theobald, Sozio, Suchanek, Nakashole2010URDF: Efficient Reasoning in Uncertain RDF Knowledge Bases with Soft and Hard Rules
TheobaltAhmedDeAguiarZieglerLenschMagnorSeidel2005Theobalt, Ahmed, De Aguiar, Ziegler, Lensch, Magnor, Seidel2005Joint motion and reflectance capture for creating relightable 3D videos
TheobaltAhmedLenschMagnorSeidel2006Theobalt, Ahmed, Lensch, Magnor, Seidel2006Enhanced dynamic reflectometry for relightable free-viewpoint video
TheobaltMingMagnorSeidel2003Theobalt, Li, Magnor, Seidel2003A flexible and versatile studio for synchronized multi-view video recording
TompkinKimKautzTheobalt2011Tompkin, Kim, Kautz, Theobalt2011Videoscapes: exploring unstructured video collections
Torben98Hagerup1998Simpler and faster static AC$^0$ dictionaries
tr241Hopf (ed.)1994Genetic algorithms within the framework of evolutionary computation: Proceedings of the KI-94 Workshop
TräffZaroliagis96Träff, Zaroliagis1996A simple parallel algorithm for the single-source shortest path problem on planar diagraphs
TzakovaBlackburn98Tzakova, Blackburn1998Hybridizing concept languages
Ulrich2001Meyer2001Directed single-source shortest-paths in linear average-case time
UlrichSibeyn98Meyer, Sibeyn1998Time-independent gossiping on full-port tori
Veanes98-2-005Veanes1998The relation between second-order unification and simultaneous rigid \sl E-unification
VingronLenhofMutzel96Vingron, Lenhof, Mutzel1996Computational Molecular Biology
Vorobyov94hVorobyov1994Structural decidable extensions of bounded quantification
Vorobyov95-RR-2-001Vorobyov1995Proof normalization and subject reduction in extensions of Fsub
Vorobyov96-RR-008Vorobyov1996On the decision complexity of the bounded theories of trees
Vorobyov97-2-006Vorobyov1997Third-order matching in $\lambda\rightarrow$-Curry is undecidable
Vorobyov98-2-004Vorobyov1998Satisfiability of Functional+Record Subtype Constraints is NP-Hard
Vorobyov98-2-007Vorobyov1998The most nonelementary theory (a direct lower bound proof)
Vorobyov98-2-008Vorobyov1998AE-Equational theory of context unification is Co-RE-Hard
Vorobyov98-2-009Vorobyov1998The undecidability of the first-order theories of one step rewriting in linear canonical systems
Vorobyov99Vorobyov1999New lower bounds for the expressiveness and the higher-order Matching problem in the simply typed lambda calculus
VorobyovVoronkov97Vorobyov, Voronkov1997Complexity of nonrecursive logic programs with complex values
Waldmann2013Baumgartner, Waldmann2013Hierarchic superposition with weak abstraction
WaldmannMPI-I-1999-2-003Waldmann1999Cancellative superposition decides the theory of divisible torsion-free abelian groups
WaldmannMPI-I-2001-2-001Waldmann2001Superposition and chaining for totally ordered divisible abelian groups
Wang1997Wang1997Bicriteria job sequencing with release dates
WangBelyaevSaleemSeidel2008Wang, Belyaev, Saleem, Seidel2008Shape complexity from image similarity
Weidenbach-91-mpii218Weidenbach1991A sorted logic using dynamic sorts
Weidenbach-93-mpii211Weidenbach1993Unification in sort theories and its applications
Weidenbach94bWeidenbach1994Minimal resolution
Wertz-92-mpii216Wertz1992First-order theorem proving modulo equations
WiesKuncakZeePodelskiRinard2006Wies, Kuncak, Zee, Podelski, Rinard2006On verifying complex properties using symbolic shape analysis
WischnewskiWeidenbach2009Wischnewski, Weidenbach2009Contextual rewriting
WuMPI-I-1999-2-005Wu1999Symmetries in logic programs
Zakaria2003Zakaria2003FaceSketch: an interface for sketching and coloring cartoon faces
ZayerRoesslSeidel2003Zayer, Roessl, Seidel2003Convex boundary angle based flattening
Zelikovsky92aZelikovsky1992Minimum base of weighted k polymatroid and Steiner tree problem
Zelikovsky92bZelikovsky1992A faster 11/6-approximation algorithm for the Steiner tree problem in graphs
Ziegler2006Ziegler, Tevs, Theobalt, Seidel2006GPU point list generation through histogram pyramids