Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

Viewed by: 1. Author,Editor - 1. by Individual

| Previous Page | Next Page | Expand All | Collapse All | Search (Full Text )

#YearTitlePages
2
Hide details for Ahmed, NaveedAhmed, Naveed
2006Attachment IconEnhanced dynamic reflectometry for relightable free-viewpoint video37
2005Attachment IconJoint motion and reflectance capture for creating relightable 3D videos18
1
Hide details for Aït-Kaci, HassanAït-Kaci, Hassan
1994Attachment IconIntegration of declarative paradigms: Proceedings of the ICLP'94 Post-Conference Workshop, Santa Margherita Ligure, Italy149
1
Hide details for Ajdin, BorisAjdin, Boris
2009Attachment IconAcquisition and analysis of bispectral bidirectional reflectance distribution functions25
1
Hide details for Ajwani, DeepakAjwani, Deepak
2008Attachment IconCharacterizing the performance of Flash memory storage devices and its impact on algorithm design36
8
Hide details for Albers, SusanneAlbers, Susanne
1998Attachment IconScheduling with unexpected machine breakdowns15
1997Attachment IconMinimizing stall time in single and parallel disk systems16
1997Attachment IconExploring unknown environments23
1997Attachment IconBetter bounds for online scheduling16
1996Attachment IconA survey of self-organizing data structures39
1994Attachment IconImproved parallel integer sorting without concurrent writing?
1994Attachment IconNew on-line algorithms for the page replication problem18
1992Attachment IconThe influence of lookahead in competitive on-line algorithms56
1
Hide details for Alberts, DavidAlberts, David
1997Attachment IconAGD-Library: A Library of Algorithms for Graph Drawing13
1
Hide details for Albrecht, IreneAlbrecht, Irene
2006Attachment IconGesture modeling and animation by imitation62
1
Hide details for Alonso, OmarAlonso, Omar
2010Attachment IconA language modeling approach for temporal information needs29
5
Hide details for Althaus, ErnstAlthaus, Ernst
2007Attachment IconA Lagrangian relaxation approach for the multiple sequence alignment problem41
2003Attachment IconImproving linear programming approaches for the Steiner tree problem19
2000Attachment IconA branch and cut algorithm for the optimal solution of the side-chain placement problem26
1998Attachment IconOn the performance of LEDA-SM26
1997Attachment IconMaximum network flow with floating point arithmetic5
2
Hide details for Alt, HelmutAlt, Helmut
1992Attachment IconA method for obtaining randomized algorithms with small tail probalities5
1991Attachment IconA lower bound for the nondeterministic space complexity of contextfree recognition4
1
Hide details for Alvanaki, FoteiniAlvanaki, Foteini
2012Attachment IconBuilding and maintaining halls of fame over a database36
3
Hide details for Anand, AvishekAnand, Avishek
2014Attachment IconPhrase Query Optimization on Inverted Indexes20
2011Attachment IconTemporal index sharding for space-time efficiency in archive search32
2010Attachment IconEfficient temporal keyword queries over versioned text39
1
Hide details for Andersson, A.Andersson, A.
1995Attachment IconSorting in linear time?32
1
Hide details for Angelova, RalitsaAngelova, Ralitsa
2006Attachment IconA neighborhood-based approach for clustering of linked document collections32
1
Hide details for Antoy, SergioAntoy, Sergio
1993Attachment IconA needed narrowing strategy28
5
Hide details for Arikati, Srinivasa R.Arikati, Srinivasa R.
1996Attachment IconAll-pairs min-cut in sparse networks27
1995Attachment IconEfficient computation of implicit representations of sparse graphs (revised version)16
1994Attachment IconOn the parallel complexity of degree sequence problems12
1994Attachment IconEfficient computation of compact representations of sparse graphs10
1994Attachment IconRealizing degree sequences in parallel27
2
Hide details for Arya, SunilArya, Sunil
1994Attachment IconDynamic algorithms for geometric spanners of small diameter: randomized solutions?
1994Attachment IconEfficient construction of a bounded degree spanner with low weight25
2
Hide details for Baader, FranzBaader, Franz
1995Attachment IconA multi-dimensional terminological knowledge representation language32
1993Attachment IconA multi-dimensional terminological knowledge representation language - preliminary version17
12
Hide details for Bachmair, LeoBachmair, Leo
1997Attachment IconElimination of equality via transformation with ordering constraints18
1997Attachment IconStrict basic superposition and chaining22
1997Attachment IconA theory of resolution79
1995Attachment IconOrdered chaining calculi for first-order theories of binary relations42
1993Attachment IconAssociative-commutative superposition?
1993Attachment IconOrdered chaining for total orderings20
1993Attachment IconRewrite techniques for transitive relations19
1993Attachment IconBasic paramodulation36
1993Attachment IconSuperposition with simplification as a decision procedure for the monadic class with equality14
1992Attachment IconSet constraints are the Monadic class13
1991Attachment IconAssociative-commutative reduction orderings7
1991Attachment IconRewrite-based equational theorem proving with selection and simplification24
1
Hide details for Bargmann, RobertBargmann, Robert
2007Attachment IconA nonlinear viseme model for triphone-based speech synthesis28
3
Hide details for Barnes, GregBarnes, Greg
1994Attachment IconShort random walks on graphs14
1994Attachment IconA method for implementing lock-free shared data structures15
1994Attachment IconTime-space lower bounds for directed s-t connectivity on JAG models?
1
Hide details for Barnett, RichardBarnett, Richard
1992Attachment IconA recursion planning analysis of inductive completion14
5
Hide details for Barth, PeterBarth, Peter
1995Attachment IconModelling mixed-integer optimisation problems in constraint logic programming22
1995Attachment IconA Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization13
1994Attachment IconFinite domain and cutting plane techniques in CLP($\cal PB$)16
1994Attachment IconLinear 0-1 inequalities and extended clauses53
1992Attachment IconCLP($\cal PB$): A Meta-Interpreter in CLP($\cal R$)18
16
Hide details for Basin, David A.Basin, David A.
1997Attachment IconLabelled modal logics: quantifiers31
1996Attachment IconBeyond the finite in automatic hardware verification51
1996Attachment IconNatural deduction for non-classical logics44
1996Attachment IconLabelled propositional modal logics: theory and practice46
1995Attachment IconAutomated complexity analysis based on ordered resolution33
1994Attachment IconLogic frameworks for logic programs13
1994Attachment IconTermination orderings for rippling15
1993Attachment IconA conservative extension of first-order logic and its application to theorem proving11
1993Attachment IconA framework for program development based on schematic proof12
1993Attachment IconMiddle-out reasoning for logic program synthesis12
1992Attachment IconDifference unification15
1992Attachment IconLogic program synthesis via proof planning14
1992Attachment IconA recursion planning analysis of inductive completion14
1992Attachment IconExperience with FS0 as a framework theory25
1992Attachment IconDifference matching12
1992Attachment IconMetalogical frameworks20
1
Hide details for Basin, David A. (ed.)Basin, David A. (ed.)
1993Attachment IconWorkshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993?
3
Hide details for Bast, HolgerBast, Holger
2006Attachment IconIO-Top-k: index-access optimized top-k query processing49
2006Attachment IconOutput-sensitive autocompletion search17
1993Attachment IconFast parallel space allocation, estimation and integer sorting (revised)85
1
Hide details for Baswana, SurenderBaswana, Surender
2005Attachment IconImproved algorithms for all-pairs approximate shortest paths in weighted graphs26
1
Hide details for Baumeister, HubertBaumeister, Hubert
1996Attachment IconUsing algebraic specification languages for model-oriented specifications17
1
Hide details for Baumgarten, HannaBaumgarten, Hanna
1992Attachment IconDynamic point location in general subdivisions30
1
Hide details for Baumgartner, PeterBaumgartner, Peter
2013Attachment IconHierarchic superposition with weak abstraction45
1
Hide details for Becchetti, LucaBecchetti, Luca
2003Attachment IconAverage case and smoothed competitive analysis of the multi-level feedback algorithm31
9
Hide details for Bedathur, SrikantaBedathur, Srikanta
2014Attachment IconPhrase Query Optimization on Inverted Indexes20
2012Attachment IconComputing n-gram statistics in MapReduce39
2011Attachment IconTemporal index sharding for space-time efficiency in archive search32
2010Attachment IconBonsai: Growing Interesting Small Trees27
2010Attachment IconEfficient temporal keyword queries over versioned text39
2010Attachment IconA language modeling approach for temporal information needs29
2009Attachment IconScalable phrase mining for ad-hoc text analytics41
2007Attachment IconA time machine for text search39
2007A Time Machine for Text Search0
2
Hide details for Beier, RenéBeier, René
2003Attachment IconRandom knapsack in expected polynomial time22
2000Attachment IconA powerful heuristic for telephone gossiping23
1
Hide details for Bekaert, PhilippeBekaert, Philippe
2003Attachment IconA custom designed density estimation method for light transport28
1
Hide details for Beldiceanu, NicolasBeldiceanu, Nicolas
2004Attachment IconFiltering algorithms for the Same and UsedBy constraints36
7
Hide details for Belyaev, AlexanderBelyaev, Alexander
2008Attachment IconShape complexity from image similarity28
2006Attachment IconMean value coordinates for arbitrary spherical polygons and
polyhedra in $\mathbbR^3$
19
2006Attachment IconFeature-preserving non-local denoising of static and time-varying
range data
22
2006Attachment IconSkeleton-driven Laplacian mesh deformations36
2005Attachment IconSparse meshing of uncertain and noisy surface scattered data
20
20043D scattered data interpolation and approximation with multilevel compactly supported RBFs?
2004Quadric-based mesh reconstruction from scattered data?
1
Hide details for Belyaev, Alexander G.Belyaev, Alexander G.
2005Attachment IconAnalysis and design of discrete normals and curvatures42
1
Hide details for Bender, MatthiasBender, Matthias
2006Attachment IconOverlap-aware global df estimation in distributed information retrieval systems25
1
Hide details for Berberich, EricBerberich, Eric
2007Attachment IconLinear-time reordering in a sweep-line algorithm for algebraic curves intersecting in a common point20
10
Hide details for Berberich, KlausBerberich, Klaus
2016Attachment IconDiversifying Search Results Using Time?
2014Attachment IconPhrase Query Optimization on Inverted Indexes20
2012Attachment IconComputing n-gram statistics in MapReduce39
2011Attachment IconTemporal index sharding for space-time efficiency in archive search32
2010Attachment IconYAGO2: a spatially and temporally enhanced knowledge base from Wikipedia50
2010Attachment IconEfficient temporal keyword queries over versioned text39
2010Attachment IconA language modeling approach for temporal information needs29
2009Attachment IconScalable phrase mining for ad-hoc text analytics41
2007Attachment IconA time machine for text search39
2007A Time Machine for Text Search0
2
Hide details for Berner, AlexanderBerner, Alexander
2011Attachment IconA morphable part model for shape manipulation33
2009Attachment IconGeneralized intrinsic symmetry detection33
1
Hide details for Bilardi, G.Bilardi, G.
1993Attachment IconA lower bound for area-universal graphs7
1
Hide details for Bischoff, StephanBischoff, Stephan
2000Attachment IconGeometric modeling based on polygonal meshes52
1
Hide details for Björklund, HenrikBjörklund, Henrik
2001Attachment IconExperiments with iterative improvement algorithms on completely unimodel hypercubes25
3
Hide details for Blackburn, PatrickBlackburn, Patrick
1998Attachment IconHybridizing concept languages33
1998Attachment IconHybrid languages and temporal logic29
1997Attachment IconTwo hybrid logics33
1
Hide details for Blanchet, BrunoBlanchet, Bruno
2004Attachment IconAutomatic proof of strong secrecy for security protocols78
2
Hide details for Blanz, VolkerBlanz, Volker
2007Attachment IconA nonlinear viseme model for triphone-based speech synthesis28
2005Attachment IconReflectance from images: a model-based approach for human faces33
9
Hide details for Bockmayr, AlexanderBockmayr, Alexander
1999Attachment IconCutting planes and the elementary closure in fixed dimension12
1997Attachment IconOn the Chvátal rank of polytopes in the 0/1 cube12
1997Attachment IconA unifying framework for integer and finite domain constraint programming24
1995Attachment IconModelling mixed-integer optimisation problems in constraint logic programming22
1994Attachment IconFinite domain and cutting plane techniques in CLP($\cal PB$)16
1994Attachment IconCutting planes in constraint logic programming 23
1993Attachment IconKünstliche Intelligenz und Operations Research36
1993Attachment IconNarrowing strategies for arbitrary canonical rewrite systems29
1991Attachment IconLogic programming with pseudo-Boolean constraints20
1
Hide details for Bodlaender, H. L.Bodlaender, H. L.
1995Attachment IconParallel algorithms with optimal speedup for bounded treewidth27
1
Hide details for Boghossian, N. P.Boghossian, N. P.
1999Attachment IconBALL: Biochemical Algorithms Library20
2
Hide details for Bokeloh, MartinBokeloh, Martin
2012Attachment IconSymmetry detection in large scale city scans32
2009Attachment IconGeneralized intrinsic symmetry detection33
1
Hide details for Borchert, BerndBorchert, Bernd
1993Attachment IconThe circuit subfunction relations are $sum^P_2$-complete14
1
Hide details for Botsch, MarioBotsch, Mario
2000Attachment IconGeometric modeling based on polygonal meshes52
5
Hide details for Bradford, Phillip G.Bradford, Phillip G.
1996Attachment IconLower bounds for row minima searching12
1995Attachment IconWeak epsilon-nets for points on a hypersphere8
1995Attachment IconMatching nuts and bolts optimally24
1995Attachment IconA polylog-time and $O(n\sqrt\lg n)$-work parallel algorithm for finding the row minima in totally monotone matrices12
1995Attachment IconMatching nuts and bolts faster7
1
Hide details for Brandenburg, Franz J.Brandenburg, Franz J.
1997Attachment IconAlgorithmen zum automatischen Zeichnen von Graphen9
1
Hide details for Brengel, KlausBrengel, Klaus
1998Attachment IconOn the performance of LEDA-SM26
1
Hide details for Breslauer, DanyBreslauer, Dany
1996Attachment IconRotations of periodic strings and short superstrings13
2
Hide details for Brink, ChrisBrink, Chris
1993Attachment IconTowards automating duality50
1992Attachment IconPeirce algebras22
1
Hide details for Britz, KatarinaBritz, Katarina
1992Attachment IconPeirce algebras22
4
Hide details for Brodal, Gerth StøltingBrodal, Gerth Stølting
1998Attachment IconComparator networks for binary heap construction11
1997Attachment IconFinger search trees with constant insertion time17
1997Attachment IconA parallel priority queue with constant time operations19
1996Attachment IconThe randomized complexity of maintaining the minimum12
1
Hide details for Brönniman, HervèBrönniman, Hervè
1998Attachment IconApplications of the generic programming paradigm in the design of CGAL12
1
Hide details for Broschart, AndreasBroschart, Andreas
2010Attachment IconReal-time text queries with tunable term pair indexes41
1
Hide details for Brox, ThomasBrox, Thomas
2007Attachment IconGlobal stochastic optimization for robust and accurate human motion capture28
1
Hide details for Buchheit, ThomasBuchheit, Thomas
1998Attachment IconOn the performance of LEDA-SM26
3
Hide details for Bundy, AlanBundy, Alan
1993Attachment IconA framework for program development based on schematic proof12
1993Attachment IconMiddle-out reasoning for logic program synthesis12
1992Attachment IconLogic program synthesis via proof planning14
1
Hide details for Burghard, OliverBurghard, Oliver
2011Attachment IconA morphable part model for shape manipulation33
1
Hide details for Burkhardt, StefanBurkhardt, Stefan
1998Attachment Icon$q$-gram based database searching using a suffix array (QUASAR)11
6
Hide details for Burnikel, ChristophBurnikel, Christoph
1999Attachment IconA simple way to recognize a correct Voronoi diagram of line segments11
1998Attachment IconDelaunay graphs by divide and conquer24
1998Attachment IconRational points on circles14
1998Attachment IconFast recursive division29
1996Attachment IconHigh-precision floating point numbers in LEDA47
1996Attachment IconThe LEDA class real number52
1
Hide details for Canzar, StefanCanzar, Stefan
2007Attachment IconA Lagrangian relaxation approach for the multiple sequence alignment problem41
1
Hide details for Capoyleas, VasilisCapoyleas, Vasilis
1995Attachment IconWeak epsilon-nets for points on a hypersphere8
2
Hide details for Chandran, L. SunilChandran, L. Sunil
2004Attachment IconOn the Hadwiger's conjecture for graph products12
2003Attachment IconGirth and treewidth11
6
Hide details for Charatonik, WitoldCharatonik, Witold
2005Attachment IconBounded model checking of pointer programs34
2002Attachment IconAtomic set constraints with projection20
2002Attachment IconSymposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi64
1999Attachment IconAutomata on DAG representations of finite trees30
1997Attachment IconSolving set constraints for greatest models12
1993Attachment IconNegativ set constraints: an easy proof of decidability11
1
Hide details for Chari, S.Chari, S.
1994Attachment IconOn the intellectual terrain around NP11
11
Hide details for Chaudhuri, ShivaChaudhuri, Shiva
1996Attachment IconGeneralized $k$-Center Problems9
1996Attachment IconThe randomized complexity of maintaining the minimum12
1996Attachment IconAll-pairs min-cut in sparse networks27
1995Attachment IconShortest paths in digraphs of small treewidth part II: optimal parallel algirithms20
1995Attachment IconShortest paths in digraphs of small treewidth sequential algorithms17
1994Attachment IconPrefix graphs and their applications13
1993Attachment IconThe complexity of parallel prefix problems on small domains17
1993Attachment IconA lower bound for linear approximate compaction12
1993Attachment IconSensitive functions and approximate problems8
1993Attachment IconA lower bound for area-universal graphs7
1993Attachment IconApproximate and exact deterministic parallel selection10
2
Hide details for Chen, TongboChen, Tongbo
2009Attachment IconA shaped temporal filter camera25
2005Attachment IconAn emperical model for heterogeneous translucent objects20
2
Hide details for Cheriyan, JosephCheriyan, Joseph
1991Attachment IconAn $O(n^3)$-time maximum-flow algorithm30
1991Attachment IconAlgorithms for dense graphs and networks29
1
Hide details for Chew, L. P.Chew, L. P.
1994Attachment IconOn characteristic points and approximate decision algorithms for the minimum Hausdorff distance10
2
Hide details for Choi, Sung WooChoi, Sung Woo
2001Attachment IconLinear one-sided stability of MAT for weakly injective domain18
2000Attachment IconHyperbolic Hausdorff distance for medial axis transform30
1
Hide details for Christof, ThomasChristof, Thomas
1996Attachment IconA branch-and-cut approach to physical mapping with end-probes10
1
Hide details for Clarkson, K. L.Clarkson, K. L.
1992Attachment IconFour results on randomized incremental constructions21
1
Hide details for Constable, Robert L.Constable, Robert L.
1992Attachment IconMetalogical frameworks20
1
Hide details for Cools, RonaldCools, Ronald
2003Attachment IconA custom designed density estimation method for light transport28
1
Hide details for Cortier, VeroniqueCortier, Veronique
1999Attachment IconDecidable fragments of simultaneous rigid reachability19
4
Hide details for Crauser, AndreasCrauser, Andreas
1999Attachment IconA theoretical and experimental study on the construction of suffix arrays in external memory40
1998Attachment IconOn the performance of LEDA-SM26
1998Attachment Icon$q$-gram based database searching using a suffix array (QUASAR)11
1998Attachment IconRandomized external-memory algorithms for some geometric problems27
1
Hide details for Csaba, BelaCsaba, Bela
2003Attachment IconOn the Bollob\'as -- Eldridge conjecture for bipartite graphs29
1
Hide details for Cunningham, William H.Cunningham, William H.
1997Attachment IconRestricted 2-factor polytopes30
1
Hide details for Cvetkovic, DraganCvetkovic, Dragan
1993Attachment IconThe logic of preference and decision supporting systems71
1
Hide details for Czumaj, ArturCzumaj, Artur
2003Attachment IconSelfish traffic allocation for server farms43
1
Hide details for Daneshmand, Siavash VahdatiDaneshmand, Siavash Vahdati
2003Attachment IconImproving linear programming approaches for the Steiner tree problem19
1
Hide details for Dasgupta, BhaskarDasgupta, Bhaskar
1994Attachment IconThe rectangle enclosure and point-dominance problems revisited16
1
Hide details for Das, GautamDas, Gautam
1996Attachment IconOn the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees14
2
Hide details for Datta, AmitavaDatta, Amitava
1993Attachment IconStatic and dynamic algorithms for k-point clustering problems20
1992Attachment IconThe largest hyper-rectangle in a three dimensional orthogonal polyhedron7
2
Hide details for Daubert, KatjaDaubert, Katja
2001Attachment IconEfficient light transport using precomputed visibility32
2000Attachment IconBump map shadows for openGL rendering18
4
Hide details for de Aguiar, Edilsonde Aguiar, Edilson
2007Attachment IconA volumetric approach to interactive shape editing28
2007??
2006Attachment IconA framework for natural animation of digitized models27
2005Attachment IconJoint motion and reflectance capture for creating relightable 3D videos18
2
Hide details for de Melo, Gerardde Melo, Gerard
2009Attachment IconTowards a Universal Wordnet by learning from combined evidenc32
2008Attachment IconIntegrating Yago into the suggested upper merged ontology31
3
Hide details for de Nivelle, Hansde Nivelle, Hans
2004Attachment IconResolution decision procedures for the guarded fragment with transitive guards32
2003Attachment IconSubsumption of concepts in $DL$ $\cal FL_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete12
2001Attachment IconProceeding of the Second International Workshop of the Implementation of Logics? 102
2
Hide details for De Simone, C.De Simone, C.
1996Attachment IconExact ground states of two-dimensional $\pm J$ Ising Spin Glasses10
1995Attachment IconExact ground states of Ising spin classes: new experimental results with a branch and cut algorithm17
1
Hide details for Degtyarev, AnatoliDegtyarev, Anatoli
1998Attachment IconEquality reasoning in sequent-based calculi128
2
Hide details for Delzanno, GiorgioDelzanno, Giorgio
1999Attachment IconSymbolic representation of upward-closed sets24
1998Attachment IconModel checking infinite-state systems in CLP44
1
Hide details for Dementiev, RomanDementiev, Roman
2003Attachment IconAsynchronous parallel disk sorting22
1
Hide details for Devillers, O.Devillers, O.
1994Attachment IconRevenge of the dog: queries on Voronoi diagrams of moving points14
2
Hide details for Diehl, M.Diehl, M.
1996Attachment IconExact ground states of two-dimensional $\pm J$ Ising Spin Glasses10
1995Attachment IconExact ground states of Ising spin classes: new experimental results with a branch and cut algorithm17
2
Hide details for Dietzfelbinger, MartinDietzfelbinger, Martin
2003Attachment IconOn the probability of rendezvous in graphs30
2003Attachment IconAlmost random graphs with simple hash functions23
1
Hide details for Diks, KrzysztofDiks, Krzysztof
1996Attachment IconMore geneal parallel tree contraction: Register allocation and broadcasting in a tree24
3
Hide details for Dimopoulos, YannisDimopoulos, Yannis
1994Attachment IconClassical methods in nonmonotonic reasoning26
1993Attachment IconGraph theoretical structures in logic programs and default theories28
1993Attachment IconOn kernels, defaults and even graphs11
1
Hide details for Dischler, Jean-MichelDischler, Jean-Michel
2001Attachment IconEfficient light transport using precomputed visibility32
1
Hide details for Dittrich, JensDittrich, Jens
2009Attachment IconScalable phrase mining for ad-hoc text analytics41
2
Hide details for Djidjev, Hristo N.Djidjev, Hristo N.
1994Attachment IconOn-line and dynamic algorithms for shortest path problems20
1994Attachment IconOn-line and Dynamic Shortest Paths through Graph Decompositions (Preliminary Version)14
1
Hide details for Dmitriev, KirillDmitriev, Kirill
2004Attachment IconFaster ray tracing with SIMD shaft culling13
1
Hide details for Dobrindt, K.Dobrindt, K.
1993Attachment IconA complete and efficient algorithm for the intersection of a general convex polyhedron14
1
Hide details for Drago, FredericDrago, Frederic
2002Attachment IconPerceptual evaluation of tone mapping operators with regard to similarity and preference30
1
Hide details for Drahokoupil, JiriDrahokoupil, Jiri
2009Attachment IconMPI Informatics building model as data for your research113
1
Hide details for Dubhashi, DevdattDubhashi, Devdatt
1998Attachment IconOn positive influence and negative dependence12
8
Hide details for Dubhashi, Devdatt P.Dubhashi, Devdatt P.
1996Attachment IconNegative dependence through the FKG Inequality10
1995Attachment IconThe fourth moment in Luby`s distribution10
1994Attachment IconStochastic majorisation: exploding some myths5
1994Attachment IconSome correlation inequalities for probabilistic analysis of algorithms16
1994Attachment IconNear-optimal distributed edge12
1993Attachment IconQuantifier elimination in p-adic fields21
1993Attachment IconSearching, sorting and randomised algorithms for central elements and ideal counting in posets8
1993Attachment IconA lower bound for area-universal graphs7
1
Hide details for Dyken, ChristopherDyken, Christopher
2007Attachment IconHistoPyramids in Iso-Surface Extraction16
2
Hide details for Dylla, MaximilianDylla, Maximilian
2014Attachment IconLearning Tuple Probabilities in Probabilistic Databases51
2012Attachment IconTop-k query processing in probabilistic databases with non-materialized views59
1
Hide details for Echahed, RachidEchahed, Rachid
1993Attachment IconA needed narrowing strategy28
1
Hide details for Edmonds, J. A.Edmonds, J. A.
1994Attachment IconTime-space lower bounds for directed s-t connectivity on JAG models?
1
Hide details for Efremov, AlexanderEfremov, Alexander
2006Attachment IconDesign and evaluation of backward compatible high dynamic range video compression50
1
Hide details for Egner, SebastianEgner, Sebastian
1999Attachment IconFast concurrent access to parallel disks30
1
Hide details for Eigenwillig, ArnoEigenwillig, Arno
2006Attachment IconSnap rounding of Bézier curves39
4
Hide details for Eisenbrand, FriedrichEisenbrand, Friedrich
2003Attachment IconFast integer programming in fixed dimension14
1999Attachment IconCutting planes and the elementary closure in fixed dimension12
1998Attachment IconA note on the membership problem for the first elementary closure of a polyhedron3
1997Attachment IconOn the Chvátal rank of polytopes in the 0/1 cube12
1
Hide details for Eisenbrand, FritzEisenbrand, Fritz
2000Attachment IconShort vectors of planar lattices via continued fractions10
1
Hide details for Eisinger, NorbertEisinger, Norbert
1991Attachment IconDeduction systems based on resolution68
2
Hide details for Elbassuoni, ShadyElbassuoni, Shady
2010Attachment IconQuery relaxation for entity-relationship search40
2009Attachment IconMING: Mining Informative Entity-Relationship Subgraphs32
1
Hide details for Fabri, AndreasFabri, Andreas
1998Attachment IconOn the Design of CGAL, the Computational Geometry Algorithms Library31
1
Hide details for Fatourou, PanagiotaFatourou, Panagiota
2000Attachment IconLow-contention depth-first scheduling of parallel computations with synchronization variables56
1
Hide details for Feige, UrielFeige, Uriel
1994Attachment IconShort random walks on graphs14
3
Hide details for Ferragina, PaoloFerragina, Paolo
1999Attachment IconA theoretical and experimental study on the construction of suffix arrays in external memory40
1998Attachment Icon$q$-gram based database searching using a suffix array (QUASAR)11
1998Attachment IconRandomized external-memory algorithms for some geometric problems27
1
Hide details for Fiat, AmosFiat, Amos
1997Attachment IconOn-line network routing - a survey19
2
Hide details for Fietzke, ArnaudFietzke, Arnaud
2012Attachment IconAutomatic generation of inductive invariants by SUP(LA)26
2008Attachment IconLabelled splitting45
1
Hide details for Finkler, UlrichFinkler, Ulrich
1996Attachment IconRuntime prediction of real programs on real machines10
8
Hide details for Fleischer, RudolfFleischer, Rudolf
1997Attachment IconOn the Bahncard problem16
1995Attachment IconA polylog-time and $O(n\sqrt\lg n)$-work parallel algorithm for finding the row minima in totally monotone matrices12
1995Attachment IconMatching nuts and bolts faster7
1994Attachment IconKomplexitätstheorie und effiziente Algorithmen30
1992Attachment IconA new lower bound technique for decision trees21
1992Attachment IconA simple balanced search tree with 0(1) worst-case update time10
1991Attachment IconSimultaneous inner and outer aproximation of shapes24
1991Attachment IconA tight lower bound for the worst case of bottom-up-heapsort13
1
Hide details for Follert, F.Follert, F.
1995Attachment IconComputing a largest empty anchored cylinder, and related problems17
1
Hide details for Fousse, LaurentFousse, Laurent
2004Attachment IconA comparison of polynomial evaluation schemes19
1
Hide details for Frederickson, Greg N.Frederickson, Greg N.
1998Attachment IconRobustness analysis in combinatorial optimization66
1
Hide details for Frigioni, D.Frigioni, D.
1998Attachment IconFully dynamic shortest paths and negative cycle detection on diagraphs with Arbitrary Arc Weights18
1
Hide details for Fronhöfer, B. (ed.)Fronhöfer, B. (ed.)
1993Attachment IconWorkshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993?
1
Hide details for Fuchs, ChristianFuchs, Christian
2005Attachment IconAn emperical model for heterogeneous translucent objects20
2
Hide details for Fuchs, MartinFuchs, Martin
2009Attachment IconA shaped temporal filter camera25
2005Attachment IconReflectance from images: a model-based approach for human faces33
1
Hide details for Funke, StefanFunke, Stefan
2007Attachment IconPower assignment problems in wireless communication25
7
Hide details for Gabbay, Dov M.Gabbay, Dov M.
1994Attachment IconKiller transformations45
1994Attachment IconLDS - Labelled Deductive Systems: Volume 1 - Foundations465
1993Attachment IconClassical vs non-classical logics: the universality of classical logic101
1993Attachment IconTowards automating duality50
1992Attachment IconTemporal logic: Mathematical foundations, part 230
1992Attachment IconQuantifier elimination in second-order predicate logic18
1992Attachment IconTemporal logic: Mathematical foundations166
3
Hide details for Gall, JürgenGall, Jürgen
2007Attachment IconGlobal stochastic optimization for robust and accurate human motion capture28
2007Attachment IconClustered stochastic optimization for object recognition and pose estimation23
2006Attachment IconInteracting and annealing particle filters: mathematics and a recipe for applications44
16
Hide details for Ganzinger, HaraldGanzinger, Harald
2002Attachment IconSymposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi64
1999Attachment IconDecidable fragments of simultaneous rigid reachability19
1998Attachment IconRigid reachability24
1997Attachment IconElimination of equality via transformation with ordering constraints18
1997Attachment IconStrict basic superposition and chaining22
1997Attachment IconA theory of resolution79
1996Attachment IconTheorem proving in cancellative abelian monoids52
1995Attachment IconOrdered chaining calculi for first-order theories of binary relations42
1995Attachment IconAutomated complexity analysis based on ordered resolution33
1993Attachment IconAssociative-commutative superposition?
1993Attachment IconOrdered chaining for total orderings20
1993Attachment IconRewrite techniques for transitive relations19
1993Attachment IconBasic paramodulation36
1993Attachment IconSuperposition with simplification as a decision procedure for the monadic class with equality14
1992Attachment IconSet constraints are the Monadic class13
1991Attachment IconRewrite-based equational theorem proving with selection and simplification24
7
Hide details for Garg, NaveenGarg, Naveen
1997Attachment IconA polylogarithmic approximation algorithm for group Steiner tree problem7
1997Attachment IconFaster and simpler algorithms for multicommodity flow and other fractional packing problems13
1997Attachment IconMinimizing stall time in single and parallel disk systems16
1997Attachment IconEvaluating a 2-approximation algorithm for edge-separators in planar graphs9
1997Attachment IconApproximating sparsest cuts9
1996Attachment IconGeneralized $k$-Center Problems9
1996Attachment IconDistributed list coloring: how to dynamically allocate frequencies to mobile base stations15
2
Hide details for Gasieniec, LeszekGasieniec, Leszek
1996Attachment IconOn the complexity of computing evolutionary trees14
1996Attachment IconExternal inverse pattern matching12
1
Hide details for Geffert, ViliamGeffert, Viliam
1991Attachment IconA lower bound for the nondeterministic space complexity of contextfree recognition4
1
Hide details for Gemulla, RainerGemulla, Rainer
2013Attachment IconA distributed algorithm for large-scale generalized matching39
1
Hide details for Georgieva, LiliaGeorgieva, Lilia
2005Attachment IconBounded model checking of pointer programs34
1
Hide details for Gidenstam, AndersGidenstam, Anders
2007Attachment IconLFthreads: a lock-free thread library36
1
Hide details for Giezeman, Geert-JanGiezeman, Geert-Jan
1998Attachment IconOn the Design of CGAL, the Computational Geometry Algorithms Library31
7
Hide details for Goesele, MichaelGoesele, Michael
2005Attachment IconAn emperical model for heterogeneous translucent objects20
2005Attachment IconPhotometric calibration of high dynamic range cameras
21
2003Attachment Icon3D acquisition of mirroring objects37
2002Attachment IconTutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models50
2001Attachment IconA framework for the acquisition, processing and interactive display of high quality 3D models39
2001Attachment IconA framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the Web20
2001Attachment IconImage-based reconstruction of spatially varying materials20
1
Hide details for Goessel, M.Goessel, M.
1992Attachment IconSelf-testing and self-checking combinational circuits with weakly independent outputs18
3
Hide details for Golin, MordecaiGolin, Mordecai
1994Attachment IconRevenge of the dog: queries on Voronoi diagrams of moving points14
1993Attachment IconRandomized Data Structures for the Dynamic Closest-Pair Problem32
1992Attachment IconSimple randomized algorithms for closest pair problems14
1
Hide details for Gomes, CarlaGomes, Carla
2005Attachment IconBottleneck behavior in CNF formulas35
1
Hide details for Gotsman, CraigGotsman, Craig
2005Attachment IconCycle bases of graphs and sampled manifolds30
4
Hide details for Graf, PeterGraf, Peter
1994Attachment IconSubstitution tree indexing34
1993Attachment IconExtended path-indexing?
1993Attachment IconExtended path-Indexing?
1992Attachment IconPath indexing for term retrieval12
2
Hide details for Granados, MiguelGranados, Miguel
2013HDR reconstruction of cluttered dynamic scenes?
2011Attachment IconHow not to be seen – inpainting dynamic objects in crowded scenes35
1
Hide details for Grandoni, FabrizioGrandoni, Fabrizio
2002Attachment IconIncrementally maintaining the number of l-cliques10
1
Hide details for Grau, OliverGrau, Oliver
2011Attachment IconHow not to be seen – inpainting dynamic objects in crowded scenes35
1
Hide details for Green, IanGreen, Ian
1994Attachment IconA general technique for automatically optimizing programs through the use of proof plans16
6
Hide details for Grolmusz, VinceGrolmusz, Vince
1993Attachment IconOn multi-party communication complexity of random functions10
1993Attachment IconHarmonic analysis, real approximation, and the communication complexity of Boolean functions15
1993Attachment IconMOD m gates do not help on the ground floor13
1993Attachment IconMulti-party protocols and spectral norms11
1992Attachment IconSeparating the communication complexities of MOD m and MOD p circuits16
1992Attachment IconCircuits and multi-party protocols16
1
Hide details for Guibas, L.Guibas, L.
1992Attachment IconA method for obtaining randomized algorithms with small tail probalities5
1
Hide details for Gunopulos, DimitriosGunopulos, Dimitrios
1996Attachment IconDiscovering all most specific sentences by randomized algorithms23
1
Hide details for Gupta, DhruvGupta, Dhruv
2016Attachment IconDiversifying Search Results Using Time?
8
Hide details for Gupta, ProsenjitGupta, Prosenjit
1996Attachment IconOptimal algorithms for some proximity problems on the Gaussian sphere with applications8
1996Attachment IconA technique for adding range restrictions to generalized searching problems9
1996Attachment IconEfficient algorithms for counting and reporting pairwise intersections between convex polygons11
1994Attachment IconThe rectangle enclosure and point-dominance problems revisited16
1994Attachment IconFast algorithms for collision and proximity problems involving moving geometric objects22
1993Attachment IconEffizient algorithms for generalized intersection searching on non-iso-oriented objects32
1993Attachment IconAlgorithms for some intersection searching problems involving curved objects43
1992Attachment IconFurther results on generalized intersection searching problems: counting, reporting, and dynamization41
1
Hide details for Gurevich, YuriGurevich, Yuri
1998Attachment IconPartisan corroboration, and shifted pairing35
1
Hide details for Gutwenger, CarstenGutwenger, Carsten
1997Attachment IconAGD-Library: A Library of Algorithms for Graph Drawing13
2
Hide details for Haber, JörgHaber, Jörg
2004Attachment IconModeling hair using a wisp hair model40
1999Attachment IconA framework for evaluating the quality of lossy image compression20
1
Hide details for Hähnle, R. (ed.)Hähnle, R. (ed.)
1993Attachment IconWorkshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993?
19
Hide details for Hagerup, TorbenHagerup, Torben
1998Attachment IconSimpler and faster static AC$^0$ dictionaries13
1997Attachment IconDatenstrukturen und Algorithmen223
1996Attachment IconMore geneal parallel tree contraction: Register allocation and broadcasting in a tree24
1996Attachment IconVorlesungsskript Komplexitätstheorie150
1995Attachment IconSorting in linear time?32
1995Attachment IconParallel algorithms with optimal speedup for bounded treewidth27
1994Attachment IconPrefix graphs and their applications13
1994Attachment IconImproved parallel integer sorting without concurrent writing?
1993Attachment IconOptimal parallel string algorithms: sorting, merching and computing the minimum25
1993Attachment IconFast parallel space allocation, estimation and integer sorting (revised)85
1993Attachment IconGeneralized topological sorting in linear time10
1993Attachment IconApproximate and exact deterministic parallel selection10
1992Attachment IconFast deterministic processor allocation11
1992not published
1992Attachment IconWaste makes haste: tight bounds for loose parallel sorting185
1992Attachment IconFast integer merging on the EREW PRAM12
1991Attachment IconOn a compaction theorem of ragde6
1991Attachment IconAn $O(n^3)$-time maximum-flow algorithm30
1991Attachment IconFast parallel space allocation, estimation an integer sorting28
1
Hide details for Hangelbroek, ThomasHangelbroek, Thomas
2003Attachment IconThe dimension of $C^1$ splines of arbitrary degree on a tetrahedral partition39
1
Hide details for Hanika, JohannesHanika, Johannes
2009Attachment IconAcquisition and analysis of bispectral bidirectional reflectance distribution functions25
8
Hide details for Hanus, MichaelHanus, Michael
1994Attachment IconOn extra variables in (Equational) logic programming33
1994Attachment IconIntegration of declarative paradigms: Proceedings of the ICLP'94 Post-Conference Workshop, Santa Margherita Ligure, Italy149
1994Attachment IconThe integration of functions into logic programming: a survey48
1993Attachment IconA needed narrowing strategy28
1993Attachment IconA debugging model for functional logic programs14
1993Attachment IconLazy unification with inductive simplification20
1992Attachment IconAnalysis of nonlinear constraints in CLP(R)31
1992Attachment IconAn abstract interpretation algorithm for residuating logic programs20
1
Hide details for Hartmanis, JurisHartmanis, Juris
1994Attachment IconOn the intellectual terrain around NP11
5
Hide details for Havran, VlastimilHavran, Vlastimil
2009Attachment IconMPI Informatics building model as data for your research113
2007Attachment IconGlobal illumination using photon ray splatting65
2006Attachment IconOn fast construction of spatial hierarchies for ray tracing40
2004Attachment IconFaster ray tracing with SIMD shaft culling13
2003Attachment IconA custom designed density estimation method for light transport28
1
Hide details for Heffernan, Paul J.Heffernan, Paul J.
1991Attachment IconApproximate decision algorithms for point set congruence25
3
Hide details for Heidrich, WolfgangHeidrich, Wolfgang
2001Attachment IconEfficient light transport using precomputed visibility32
2001Attachment IconImage-based reconstruction of spatially varying materials20
2000Attachment IconBump map shadows for openGL rendering18
2
Hide details for Henzinger, Monika R.Henzinger, Monika R.
1998Attachment IconScheduling multicasts on unit-capacity trees and meshes38
1997Attachment IconExploring unknown environments23
2
Hide details for Henzinger, Thomas A.Henzinger, Thomas A.
1999Attachment IconAxioms for real-time logics31
1999Attachment IconFully decidable logics, automata and classical theories for defining regular real-time languages102
2
Hide details for Hert, SusanHert, Susan
2002Attachment IconExp Lab: a tool set for computational experiments59
2001Attachment IconAn adaptable and extensible geometry kernel27
1
Hide details for Herzig, AndreasHerzig, Andreas
1996Attachment IconSCAN and systems of conditional logic33
2
Hide details for Herzog, RobertHerzog, Robert
2007Attachment IconGlobal illumination using photon ray splatting65
2006Attachment IconOn fast construction of spatial hierarchies for ray tracing40
1
Hide details for Hesketh, JaneHesketh, Jane
1992Attachment IconA recursion planning analysis of inductive completion14
2
Hide details for Hillenbrand, ThomasHillenbrand, Thomas
2007Attachment IconSuperposition for finite domains29
2007Attachment IconSuperpositon for Finite Domains29
1
Hide details for Hodkinson, Ian M.Hodkinson, Ian M.
1992Attachment IconTemporal logic: Mathematical foundations, part 230
1
Hide details for Hoefer, MartinHoefer, Martin
2002Attachment IconPerformance of heuristic and approximation algorithms for the uncapacitated facility location problem27
1
Hide details for Hoepmann, J.-H.Hoepmann, J.-H.
1995Attachment IconTowards self-stabilizing wait-free shared memory objects15
1
Hide details for Hoffart, JohannesHoffart, Johannes
2010Attachment IconYAGO2: a spatially and temporally enhanced knowledge base from Wikipedia50
1
Hide details for Hoffmann, JörgHoffmann, Jörg
2005Attachment IconBottleneck behavior in CNF formulas35
1
Hide details for Hoffmann, MichaelHoffmann, Michael
2001Attachment IconAn adaptable and extensible geometry kernel27
1
Hide details for Hopf, Jörn (ed.)Hopf, Jörn (ed.)
1994Attachment IconGenetic algorithms within the framework of evolutionary computation: Proceedings of the KI-94 Workshop161
3
Hide details for Horbach, MatthiasHorbach, Matthias
2009Attachment IconSuperposition for fixed domains49
2010Attachment IconDecidability results for saturation-based model building38
2009Attachment IconDeciding the inductive validity of $\forall\exists^*$ queries43
1
Hide details for Hromkovic, JurajHromkovic, Juraj
1991Attachment IconOn embeddings in cycles22
1
Hide details for Huang, Chien-ChungHuang, Chien-Chung
2010Attachment IconMaximum cardinality popular matchings in strict two-sided preference lists17
1
Hide details for Hullin, Matthias B.Hullin, Matthias B.
2009Attachment IconAcquisition and analysis of bispectral bidirectional reflectance distribution functions25
5
Hide details for Hustadt, UllrichHustadt, Ullrich
1997Attachment IconOn evaluating decision procedures for modal logic50
1995Attachment IconTranslating graded modalities into predicate logic37
1992Attachment IconMotel user manual45
1992Attachment IconUnification and matching in Church's Original Lambda Calculus16
1991Attachment IconA complete transformation system for polymorphic higher-order unification22
3
Hide details for Ifrim, GeorgianaIfrim, Georgiana
2009Attachment IconGenerating concise and readable summaries of XML documents30
2007Attachment IconNAGA: searching and ranking knowledge42
2006Attachment IconCombining linguistic and statistical analysis to extract relations from web documents37
1
Hide details for Ihrke, IvoIhrke, Ivo
2010Attachment IconA Bayesian approach to manifold topology reconstruction23
1
Hide details for In Kim, KwangIn Kim, Kwang
2011Attachment IconHow not to be seen – inpainting dynamic objects in crowded scenes35
1
Hide details for Indyk, PiotrIndyk, Piotr
1996Attachment IconExternal inverse pattern matching12
1
Hide details for Ivrissimtzis, IoannisIvrissimtzis, Ioannis
2003Attachment IconNeural meshes: statistical learning methods in surface reconstruction23
1
Hide details for Ivrissimtzis, I.P.Ivrissimtzis, I.P.
2004Attachment IconNeural meshes: surface reconstruction with a learning algorithm22
3
Hide details for Jacquemard, FlorentJacquemard, Florent
1999Attachment IconDecidable fragments of simultaneous rigid reachability19
1998Attachment IconRigid reachability24
1998Attachment IconUnification in extensions of shallow equational theories31
2
Hide details for Jaeger, ManfredJaeger, Manfred
2003Attachment IconA representation theorem and applications to measure selection and noninformative priors35
1994Attachment IconA probabilistic extension of terminological logics64
1
Hide details for Janardan, JanardanJanardan, Janardan
1994Attachment IconFast algorithms for collision and proximity problems involving moving geometric objects22
7
Hide details for Janardan, RaviJanardan, Ravi
1996Attachment IconA technique for adding range restrictions to generalized searching problems9
1996Attachment IconEfficient algorithms for counting and reporting pairwise intersections between convex polygons11
1994Attachment IconThe rectangle enclosure and point-dominance problems revisited16
1994Attachment IconOn the width and roundness of a set of points in the plane14
1993Attachment IconEffizient algorithms for generalized intersection searching on non-iso-oriented objects32
1993Attachment IconAlgorithms for some intersection searching problems involving curved objects43
1992Attachment IconFurther results on generalized intersection searching problems: counting, reporting, and dynamization41
4
Hide details for Jansen, KlausJansen, Klaus
1998Attachment IconImproved approximation schemes for scheduling unrelated parallel machines14
1998Attachment IconLinear-time approximation schemes for scheduling malleable parallel tasks15
1998Attachment IconA new characterization for parity graphs and a coloring problem with costs16
1998Attachment IconThe mutual exclusion scheduling problem for permutation and comparability graphs12
1
Hide details for Jansson, JesperJansson, Jesper
1996Attachment IconOn the complexity of computing evolutionary trees14
1
Hide details for Jeong, Won-KiJeong, Won-Ki
2003Attachment IconNeural meshes: statistical learning methods in surface reconstruction23
1
Hide details for Jeong, W.-K.Jeong, W.-K.
2004Attachment IconNeural meshes: surface reconstruction with a learning algorithm22
1
Hide details for Jiang, TaoJiang, Tao
1996Attachment IconRotations of periodic strings and short superstrings13
1
Hide details for Jiang, ZhigenJiang, Zhigen
1996Attachment IconRotations of periodic strings and short superstrings13
1
Hide details for Johann, PatriciaJohann, Patricia
1993Attachment IconSolving simplifications ordering constraints16
1
Hide details for Josephs, BertholdJosephs, Berthold
1993Attachment IconA debugging model for functional logic programs14
9
Hide details for Jünger, MichaelJünger, Michael
1998Attachment IconA note on computing a maximal planar subgraph using PQ-trees5
1997Attachment IconPitfalls of using PQ--Trees in automatic graph drawing12
1997Attachment IconAlgorithmen zum automatischen Zeichnen von Graphen9
1996Attachment IconA branch-and-cut approach to physical mapping with end-probes10
1996Attachment Icon2-Layer straigthline crossing minimization: performance of exact and heuristic algorithms14
1996Attachment IconExact ground states of two-dimensional $\pm J$ Ising Spin Glasses10
1995Attachment IconExact and heuristic algorithms for 2-layer straightline crossing minimization12
1995Attachment IconThe thickness of a minor-excluded class of graphs9
1995Attachment IconExact ground states of Ising spin classes: new experimental results with a branch and cut algorithm17
1
Hide details for Jung, BerndJung, Bernd
1997Attachment IconParallel algorithms for MD-simulations of synthetic polymers32
1
Hide details for Jung, HermannJung, Hermann
1992Attachment IconDynamic point location in general subdivisions30
1
Hide details for Juurlink, Ben H. H.Juurlink, Ben H. H.
1996Attachment IconGossiping on meshes and tori19
1
Hide details for Kacimi, MounaKacimi, Mouna
2011Attachment IconFinding images of rare and ambiguous entities30
1
Hide details for Kähler, KoljaKähler, Kolja
2000Attachment IconGeometric modeling based on polygonal meshes52
1
Hide details for Kaligosi, KanelaKaligosi, Kanela
2005Attachment IconCycle bases of graphs and sampled manifolds30
3
Hide details for Kapoor, SanjivKapoor, Sanjiv
1996Attachment IconOn the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees14
1995Attachment IconDynamic maintenance of 2-d convex hulls and order decomposable problems22
1993Attachment IconNew techniques for exact and approximate dynamic closest-point problems29
1
Hide details for Kargaris, DimitriosKargaris, Dimitrios
1994Attachment IconQuickest paths: faster algorithms and dynamization15
1
Hide details for Karpinksi, M.Karpinksi, M.
1994Attachment IconFurther improvements of Steiner tree approximations10
1
Hide details for Karp, R.Karp, R.
1992Attachment IconA method for obtaining randomized algorithms with small tail probalities5
5
Hide details for Kasneci, GjergjiKasneci, Gjergji
2009Attachment IconMING: Mining Informative Entity-Relationship Subgraphs32
2009Attachment IconCoupling knowledge bases and web services for active knowledge24
2008Attachment IconSTAR: Steiner tree approximation in relationship-graphs37
2007Attachment IconYago : a large ontology from Wikipedia and WordNet67
2007Attachment IconNAGA: searching and ranking knowledge42
1
Hide details for Kasnec, GjergjiKasnec, Gjergji
2006Attachment IconYago - a core of semantic knowledge39
1
Hide details for Kasper, ThomasKasper, Thomas
1997Attachment IconA unifying framework for integer and finite domain constraint programming24
6
Hide details for Katriel, IritKatriel, Irit
2005Attachment IconA faster algorithm for computing a longest common increasing
subsequence
13
2005Attachment IconReachability substitutes for planar digraphs24
2004Attachment IconOn algorithms for online topological ordering and sorting15
2004Attachment IconFiltering algorithms for the Same and UsedBy constraints36
2003Attachment IconFast bound consistency for the global cardinality constraint30
2002Attachment IconA practical minimum spanning tree algorithm using the cycle property21
3
Hide details for Kaufmann, MichaelKaufmann, Michael
1997Attachment IconBSP-like external-memory computation14
1994Attachment IconTowards practical permutation routing on meshes11
1993Attachment IconDeterministic 1-k routing on meshes with applications to worm-hole routing13
8
Hide details for Kautz, JanKautz, Jan
2011Attachment IconVideoscapes: exploring unstructured video collections32
2011Attachment IconHow not to be seen – inpainting dynamic objects in crowded scenes35
2009Attachment IconAcquisition and analysis of bispectral bidirectional reflectance distribution functions25
2002Attachment IconTutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models50
2001Attachment IconEfficient light transport using precomputed visibility32
2001Attachment IconA framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the Web20
2001Attachment IconImage-based reconstruction of spatially varying materials20
2000Attachment IconBump map shadows for openGL rendering18
1
Hide details for Kavitha, TelikepalliKavitha, Telikepalli
2010Attachment IconMaximum cardinality popular matchings in strict two-sided preference lists17
1
Hide details for Kavvadias, G.Kavvadias, G.
1994Attachment IconHammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems38
3
Hide details for Kazakov, YevgenyKazakov, Yevgeny
2005A Framework of refutational theorem proving for saturation-based decision procedures?
2004Attachment IconResolution decision procedures for the guarded fragment with transitive guards32
2003Attachment IconSubsumption of concepts in $DL$ $\cal FL_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete12
2
Hide details for Kececioglou, John D.Kececioglou, John D.
1996Attachment IconA branch-and-cut algorithm for multiple sequence alignment15
1996Attachment IconA branch-and-cut approach to physical mapping with end-probes10
2
Hide details for Kedem, K.Kedem, K.
1994Attachment IconOn characteristic points and approximate decision algorithms for the minimum Hausdorff distance10
1994Attachment IconRevenge of the dog: queries on Voronoi diagrams of moving points14
1
Hide details for Keller, JörgKeller, Jörg
1998Attachment IconOn the performance of LEDA-SM26
1
Hide details for Kerber, JensKerber, Jens
2012Attachment IconSymmetry detection in large scale city scans32
1
Hide details for Kerber, MichaelKerber, Michael
2006Attachment IconDivision-free computation of subresultants using bezout matrices20
6
Hide details for Kettner, LutzKettner, Lutz
2007Attachment IconLinear-time reordering in a sweep-line algorithm for algebraic curves intersecting in a common point20
2006Attachment IconSnap rounding of Bézier curves39
2002Attachment IconExp Lab: a tool set for computational experiments59
2001Attachment IconAn adaptable and extensible geometry kernel27
1998Attachment IconApplications of the generic programming paradigm in the design of CGAL12
1998Attachment IconOn the Design of CGAL, the Computational Geometry Algorithms Library31
1
Hide details for Khandekar, RohitKhandekar, Rohit
2013Attachment IconA distributed algorithm for large-scale generalized matching39
1
Hide details for Kim, Jin HyungKim, Jin Hyung
2011Attachment IconEfficient learning-based image enhancement : application to
compression artifact removal and super-resolution
28
4
Hide details for Kim, Kwang InKim, Kwang In
2014Attachment IconLocal high-order regularization on data manifolds?
2013HDR reconstruction of cluttered dynamic scenes?
2011Attachment IconVideoscapes: exploring unstructured video collections32
2011Attachment IconEfficient learning-based image enhancement : application to
compression artifact removal and super-resolution
28
1
Hide details for Kipp, MichaelKipp, Michael
2006Attachment IconGesture modeling and animation by imitation62
1
Hide details for Klarlund, NilsKlarlund, Nils
1996Attachment IconBeyond the finite in automatic hardware verification51
2
Hide details for Klau, Gunnar W.Klau, Gunnar W.
1998Attachment IconOptimal compaction of orthogonal grid drawings20
1998Attachment IconQuasi-orthogonal drawing of planar graphs15
1
Hide details for Klein, ReinhardKlein, Reinhard
2011Attachment IconA morphable part model for shape manipulation33
1
Hide details for Klein, RolfKlein, Rolf
1993Attachment IconRandomized incremental construction of abstract Voronoi diagrams29
1
Hide details for Kobbelt, Leif P.Kobbelt, Leif P.
2000Attachment IconGeometric modeling based on polygonal meshes52
3
Hide details for Könemann, JochenKönemann, Jochen
1997Attachment IconFaster and simpler algorithms for multicommodity flow and other fractional packing problems13
1996Attachment IconHigh-precision floating point numbers in LEDA47
1995Attachment IconRadix heaps an efficient implementation for priority queues27
1
Hide details for Koga, JoachimKoga, Joachim
1994Attachment IconNew on-line algorithms for the page replication problem18
1
Hide details for Kohlbacher, OliverKohlbacher, Oliver
2000Attachment IconA branch and cut algorithm for the optimal solution of the side-chain placement problem26
1
Hide details for Kohlbacher, O.Kohlbacher, O.
1999Attachment IconBALL: Biochemical Algorithms Library20
1
Hide details for Konjevod, GoranKonjevod, Goran
1997Attachment IconA polylogarithmic approximation algorithm for group Steiner tree problem7
1
Hide details for Korst, JanKorst, Jan
1999Attachment IconFast concurrent access to parallel disks30
1
Hide details for Koster, MartinKoster, Martin
2004Attachment IconModeling hair using a wisp hair model40
1
Hide details for Kovács, AnnamariaKovács, Annamaria
2003Attachment IconSum-Multicoloring on paths20
3
Hide details for Kraan, InaKraan, Ina
1993Attachment IconA framework for program development based on schematic proof12
1993Attachment IconMiddle-out reasoning for logic program synthesis12
1992Attachment IconLogic program synthesis via proof planning14
1
Hide details for Krawczyk, GrzegorzKrawczyk, Grzegorz
2005Attachment IconPhotometric calibration of high dynamic range cameras
21
1
Hide details for Krischer, StefanKrischer, Stefan
1993Attachment IconNarrowing strategies for arbitrary canonical rewrite systems29
1
Hide details for Krithivasan, KamalaKrithivasan, Kamala
1992Attachment IconThe largest hyper-rectangle in a three dimensional orthogonal polyhedron7
1
Hide details for Krone, HenningKrone, Henning
1998Attachment IconOn the performance of LEDA-SM26
1
Hide details for Kruglov, EvgenyKruglov, Evgeny
2012Attachment IconAutomatic generation of inductive invariants by SUP(LA)26
5
Hide details for Krysta, PiotrKrysta, Piotr
2003Attachment IconSelfish traffic allocation for server farms43
2003Attachment IconScheduling and traffic allocation for tasks with bounded splittability15
2001Attachment IconApproximating minimum size 1,2-connected networks22
1998Attachment IconNew approximation algorithms for the achromatic number26
1996Attachment IconExternal inverse pattern matching12
3
Hide details for Kucera, LudekKucera, Ludek
1993Attachment IconColoring k-colorable graphs in expected parallel time14
1993Attachment IconExpected complexity of graph partitioning problems16
1993Attachment IconBroadcasting through a noisy one-dimensional network14
1
Hide details for Kumar, Kondreddi SarathKumar, Kondreddi Sarath
2009Attachment IconGenerating concise and readable summaries of XML documents30
1
Hide details for Kuncak, ViktorKuncak, Viktor
2006Attachment IconOn verifying complex properties using symbolic shape analysis32
1
Hide details for Kutylowski, MiroslawKutylowski, Miroslaw
1992Attachment IconFast integer merging on the EREW PRAM12
2
Hide details for Kutz, MartinKutz, Martin
2005Attachment IconA faster algorithm for computing a longest common increasing
subsequence
13
2005Attachment IconReachability substitutes for planar digraphs24
1
Hide details for Kwon, YoungheeKwon, Younghee
2011Attachment IconEfficient learning-based image enhancement : application to
compression artifact removal and super-resolution
28
1
Hide details for Lambert, OliverLambert, Oliver
1998Attachment IconOn the performance of LEDA-SM26
3
Hide details for Langer, TorstenLanger, Torsten
2007Attachment IconConstruction of smooth maps with mean value coordinates22
2006Attachment IconMean value coordinates for arbitrary spherical polygons and
polyhedra in $\mathbbR^3$
19
2005Attachment IconAnalysis and design of discrete normals and curvatures42
1
Hide details for Lang, JochenLang, Jochen
2002Attachment IconTutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models50
1
Hide details for Laue, SörenLaue, Sören
2007Attachment IconPower assignment problems in wireless communication25
1
Hide details for Lee, S.Lee, S.
2004Attachment IconNeural meshes: surface reconstruction with a learning algorithm22
1
Hide details for Lee, Y. andLee, Y. and
2004Attachment IconNeural meshes: surface reconstruction with a learning algorithm22
2
Hide details for Leipert, SebastianLeipert, Sebastian
1998Attachment IconA note on computing a maximal planar subgraph using PQ-trees5
1997Attachment IconPitfalls of using PQ--Trees in automatic graph drawing12
12
Hide details for Lenhof, Hans-PeterLenhof, Hans-Peter
2000Attachment IconA branch and cut algorithm for the optimal solution of the side-chain placement problem26
1998Attachment Icon$q$-gram based database searching using a suffix array (QUASAR)11
1997Attachment IconNew contact measures for the protein docking problem10
1997Attachment IconParallel algorithms for MD-simulations of synthetic polymers32
1996Attachment IconA branch-and-cut algorithm for multiple sequence alignment15
1996Attachment IconComputational Molecular Biology26
1995Attachment IconAn algorithm for the protein docking problem11
1993Attachment IconStatic and dynamic algorithms for k-point clustering problems20
1992Attachment IconSequential and parallel algorithms for the k closest pairs problem18
1992Attachment IconEnumerating the k closest pairs mechanically12
1992Attachment IconMaintaining the visibility map of spheres while moving the viewpoint on a circle at infinity16
1991Attachment IconAn optimal construction method for generalized convex layers25
1
Hide details for Lenhof, H.-P.Lenhof, H.-P.
1999Attachment IconBALL: Biochemical Algorithms Library20
3
Hide details for Lensch, HendrikLensch, Hendrik
2006Attachment IconEnhanced dynamic reflectometry for relightable free-viewpoint video37
2005Attachment IconJoint motion and reflectance capture for creating relightable 3D videos18
2005Attachment IconReflectance from images: a model-based approach for human faces33
7
Hide details for Lensch, Hendrik P. A.Lensch, Hendrik P. A.
2009Attachment IconA shaped temporal filter camera25
2009Attachment IconAcquisition and analysis of bispectral bidirectional reflectance distribution functions25
2003Attachment Icon3D acquisition of mirroring objects37
2002Attachment IconTutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models50
2001Attachment IconA framework for the acquisition, processing and interactive display of high quality 3D models39
2001Attachment IconA framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the Web20
2001Attachment IconImage-based reconstruction of spatially varying materials20
5
Hide details for Leonardi, StefanoLeonardi, Stefano
2003Attachment IconCross-monotonic cost sharing methods for connected facility location games10
2003Attachment IconAverage case and smoothed competitive analysis of the multi-level feedback algorithm31
1998Attachment IconScheduling multicasts on unit-capacity trees and meshes38
1997Attachment IconOn-line network routing - a survey19
1997Attachment IconMinimizing stall time in single and parallel disk systems16
1
Hide details for Leonardi, Stefano AlbertoLeonardi, Stefano Alberto
1997Attachment IconRandomized on-line call control revisited19
1
Hide details for Lermen, MartinLermen, Martin
1997Attachment IconThe practical use of the $\calA^*$ algorithm for exact multiple sequence alignment16
1
Hide details for Lingas, AndrzejLingas, Andrzej
1996Attachment IconOn the complexity of computing evolutionary trees14
1
Hide details for Li, MingLi, Ming
2003Attachment IconA flexible and versatile studio for synchronized multi-view video recording18
1
Hide details for LoryLory
1
Hide details for '{s}, Krzysztof'{s}, Krzysztof
1998Attachment IconNew approximation algorithms for the achromatic number26
1
Hide details for Lu, TianxiangLu, Tianxiang
2011Attachment IconTowards verification of the pastry protocol using TLA+51
1
Hide details for Lynch, ChristopherLynch, Christopher
1993Attachment IconBasic paramodulation36
1
Hide details for Maas, MartinMaas, Martin
1993Attachment IconGeneralized topological sorting in linear time10
4
Hide details for Madden, PeterMadden, Peter
1994Attachment IconA survey of program transformation with special reference to unfold/fold style program development36
1994Attachment IconRecursive program optimization through inductive synthesis proof transformation44
1994Attachment IconA general technique for automatically optimizing programs through the use of proof plans16
1994Attachment IconFormal methods of automated program improvement12
1
Hide details for Magirou, VangelisMagirou, Vangelis
1993Attachment IconOn kernels, defaults and even graphs11
5
Hide details for Magnor, MarcusMagnor, Marcus
2006Attachment IconGarment texture editing in monocular video sequences based on
color-coded printing patterns
24
2006Attachment IconEnhanced dynamic reflectometry for relightable free-viewpoint video37
2006Attachment IconA framework for natural animation of digitized models27
2004Attachment IconAxisymmetric reconstruction and 3D visualization of bipolar planetary nebulae20
2003Attachment IconA flexible and versatile studio for synchronized multi-view video recording18
1
Hide details for Magnor, Marcus A.Magnor, Marcus A.
2005Attachment IconJoint motion and reflectance capture for creating relightable 3D videos18
2
Hide details for Mahajan, SanjeevMahajan, Sanjeev
1998Attachment IconSolving some discrepancy problems in NC*21
1996Attachment IconDerandomizing semidefinite programming based approximation algorithms22
3
Hide details for Maheshwari, AnilMaheshwari, Anil
1995Attachment IconEfficient computation of implicit representations of sparse graphs (revised version)16
1994Attachment IconEfficient computation of compact representations of sparse graphs10
1994Attachment IconRealizing degree sequences in parallel27
3
Hide details for Maier, PatrickMaier, Patrick
2005Attachment IconBounded model checking of pointer programs34
2004Attachment IconIntuitionistic LTL and a new characterization of safety and liveness20
2003Attachment IconCompositional circular assume-guarantee rules cannot be sound and complete22
1
Hide details for Majumdar, DebapriyoMajumdar, Debapriyo
2006Attachment IconIO-Top-k: index-access optimized top-k query processing49
1
Hide details for Makari, FarazMakari, Faraz
2013Attachment IconA distributed algorithm for large-scale generalized matching39
1
Hide details for Malinger, ItayMalinger, Itay
2008Attachment IconCharacterizing the performance of Flash memory storage devices and its impact on algorithm design36
1
Hide details for Mamoulis, NikosMamoulis, Nikos
2009Attachment IconScalable phrase mining for ad-hoc text analytics41
1
Hide details for Mannila, HeikkiMannila, Heikki
1996Attachment IconDiscovering all most specific sentences by randomized algorithms23
1
Hide details for Manss, ChristianManss, Christian
1997Attachment IconEvaluating a 2-approximation algorithm for edge-separators in planar graphs9
1
Hide details for Mantiuk, RafalMantiuk, Rafal
2006Attachment IconDesign and evaluation of backward compatible high dynamic range video compression50
1
Hide details for Marchetti-Spaccamela, AlbertoMarchetti-Spaccamela, Alberto
2003Attachment IconAverage case and smoothed competitive analysis of the multi-level feedback algorithm31
1
Hide details for Marchetti-Spaccamela, Alessio PresciuttiMarchetti-Spaccamela, Alessio Presciutti
1997Attachment IconRandomized on-line call control revisited19
1
Hide details for Marchetti-Spaccamela, A.Marchetti-Spaccamela, A.
1998Attachment IconFully dynamic shortest paths and negative cycle detection on diagraphs with Arbitrary Arc Weights18
1
Hide details for Martens, WilliamMartens, William
2002Attachment IconPerceptual evaluation of tone mapping operators with regard to similarity and preference30
9
Hide details for Matthews, SeánMatthews, Seán
1997Attachment IconLabelled modal logics: quantifiers31
1996Attachment IconNatural deduction for non-classical logics44
1996Attachment IconLabelled propositional modal logics: theory and practice46
1994Attachment IconReflection using the derivability conditions14
1993*No Title
1993Attachment IconA conservative extension of first-order logic and its application to theorem proving11
1993Attachment IconA framework for program development based on schematic proof12
1993Attachment IconA theory and its metatheory in FS 022
1992Attachment IconReflection in logical systems14
1992Attachment IconExperience with FS0 as a framework theory25
1
Hide details for Mavronicolas, MariosMavronicolas, Marios
1996Attachment IconThe impact of timing on linearizability in counting networks19