Number | | Title | Name(s) | Pages |
2016-5-002 | | ? | Mishra | ? |
2016-5-001 |  | Diversifying Search Results Using Time | Gupta, Berberich | ? |
2016-4-002 | | ? | Sridhar | ? |
2016-4-001 | | ? | Müller | ? |
2014-5-002 |  | Phrase Query Optimization on Inverted Indexes | Anand, Mele, Bedathur, Berberich | 20 |
2014-5-001 |  | Learning Tuple Probabilities in Probabilistic Databases | Dylla, Theobald | 51 |
2014-4-002 |  | Fast Tracking of Hand and Finger Articulations Using a Single Depth Camera | Sridhar, Oulasvirta, Theobalt | 14 |
2014-4-001 |  | Local high-order regularization on data manifolds | Kim, Tompkin, Theobalt | ? |
2013-RG1-002 |  | Hierarchic superposition with weak abstraction | Baumgartner, Waldmann | 45 |
2013-5-002 |  | A distributed algorithm for large-scale generalized matching | Makari, Gemulla, Khandekar, Mestre, Sozio | 39 |
2013-4-001 | | HDR reconstruction of cluttered dynamic scenes | Granados, Kim, Theobalt | ? |
2013-1-001 |  | New results for non-preemptive speed scaling | Ott | 32 |
2012-RG1-002 |  | Automatic generation of inductive invariants by SUP(LA) | Fietzke, Kruglov, Weidenbach | 26 |
2012-RG1-001 |  | Labelled superposition for PLTL | Suda, Weidenbach | 42 |
2012-5-004 |  | Building and maintaining halls of fame over a database | Alvanaki, Michel, Stupar | 36 |
2012-5-003 |  | Computing n-gram statistics in MapReduce | Berberich, Bedathur | 39 |
2012-5-002 |  | Top-k query processing in probabilistic databases with non-materialized views | Dylla, Miliaraki, Theobald | 59 |
2012-5-001 |  | MDL4BMF: Minimum Description Length for Boolean Matrix Factorization | Miettinen, Vreeken | 48 |
2012-4-001 |  | Symmetry detection in large scale city scans | Kerber, Bokeloh, Wand, Seidel | 32 |
2011-RG1-002 |  | Towards verification of the pastry protocol using TLA+ | Lu, Merz, Weidenbach | 51 |
2011-5-002 |  | Finding images of rare and ambiguous entities | Taneva, Kacimi, Weikum | 30 |
2011-5-001 |  | Temporal index sharding for space-time efficiency in archive search | Anand, Bedathur, Berberich, Schenkel | 32 |
2011-4-005 |  | A morphable part model for shape manipulation | Berner, Burghard, Wand, Mitra, Klein, Seidel | 33 |
2011-4-003 |  | Videoscapes: exploring unstructured video collections | Tompkin, Kim, Kautz, Theobalt | 32 |
2011-4-002 |  | Efficient learning-based image enhancement : application to
compression artifact removal and super-resolution | Kim, Kwon, Kim, Theobalt | 28 |
2011-4-001 |  | How not to be seen – inpainting dynamic objects in crowded scenes | Granados, Tompkin, In Kim, Grau, Kautz, Theobalt | 35 |
2010-RG1-001 |  | On the saturation of YAGO | Suda, Weidenbach, Wischnewski | 50 |
2010-5-008 |  | Query relaxation for entity-relationship search | Elbassuoni, Ramanath, Weikum | 40 |
2010-5-007 |  | YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia | Hoffart, Suchanek, Berberich, Weikum | 50 |
2010-5-006 |  | Real-time text queries with tunable term pair indexes | Broschart, Schenkel | 41 |
2010-5-005 |  | Bonsai: Growing Interesting Small Trees | Seufert, Bedathur, Mestre, Weikum | 27 |
2010-5-004 |  | Query evaluation with asymmetric web services | Preda, Suchanek, Yuan, Weikum | 31 |
2010-5-003 |  | Efficient temporal keyword queries over versioned text | Anand, Bedathur, Berberich, Schenkel | 39 |
2010-5-002 |  | URDF: Efficient Reasoning in Uncertain RDF Knowledge Bases with Soft and Hard Rules | Theobald, Sozio, Suchanek, Nakashole | 45 |
2010-5-001 |  | A language modeling approach for temporal information needs | Berberich, Bedathur, Alonso, Weikum | 29 |
2010-1-001 |  | Maximum cardinality popular matchings in strict two-sided preference lists | Huang, Kavitha | 17 |
2009-RG1-005 |  | Superposition for fixed domains | Horbach, Weidenbach | 49 |
2009-RG1-004 |  | Decidability results for saturation-based model building | Horbach, Weidenbach | 38 |
2009-RG1-002 |  | Contextual rewriting | Wischnewski, Weidenbach | 28 |
2009-RG1-001 |  | Deciding the inductive validity of $\forall\exists^*$ queries | Horbach, Weidenbach | 43 |
2009-5-007 |  | MING: Mining Informative Entity-Relationship Subgraphs | Kasneci, Weikum, Elbassuoni | 32 |
2009-5-006 |  | Scalable phrase mining for ad-hoc text analytics | Bedathur, Berberich, Dittrich, Mamoulis, Weikum | 41 |
2009-5-005 |  | Towards a Universal Wordnet by learning from combined evidenc | de Melo, Weikum | 32 |
2009-5-004 |  | Coupling knowledge bases and web services for active knowledge | Preda, Suchanek, Kasneci, Neumann, Weikum | 24 |
2009-5-003 |  | The RDF-3X engine for scalable management of RDF data | Neumann, Weikum | 53 |
2009-5-003 |  | The RDF-3X engine for scalable management of RDF data | Neumann, Weikum | 53 S. |
2009-5-002 |  | Generating concise and readable summaries of XML documents | Ramanath, Kumar, Ifrim | 30 |
2009-4-006 |  | Optical reconstruction of detailed animatable human body models | Stoll | 37 |
2009-4-005 |  | Generalized intrinsic symmetry detection | Berner, Bokeloh, Wand, Schilling, Seidel | 33 |
2009-4-004 |  | MPI Informatics building model as data for your research | Havran, Zajac, Drahokoupil, Seidel | 113 |
2009-4-003 |  | A shaped temporal filter camera | Fuchs, Chen, Wang, Raskar, Lensch, Seidel | 25 |
2009-4-002 |  | A Bayesian approach to manifold topology reconstruction | Tevs, Wand, Ihrke, Seidel | 23 |
2009-4-001 |  | Acquisition and analysis of bispectral bidirectional reflectance distribution functions | Hullin, Ajdin, Hanika, Seidel, Kautz, Lensch | 25 |
2008-RG1-001 |  | Labelled splitting | Fietzke, Weidenbach | 45 |
2008-5-004 |  | SOFIE: a self-organizing framework for information extraction | Suchanek, Sozio, Weikum | 49 |
2008-5-003 |  | Integrating Yago into the suggested upper merged ontology | de Melo, Suchanek, Pease | 31 |
2008-5-002 |  | Single phase construction of optimal DAG-structured QEPs | Neumann, Moerkotte | 73 |
2008-5-001 |  | STAR: Steiner tree approximation in relationship-graphs | Kasneci, Ramanath, Sozio, Suchanek, Weikum | 37 |
2008-4-003 |  | Crease surfaces: from theory to extraction and application to diffusion tensor MRI | Schultz, Theisel, Seidel | 33 |
2008-4-002 |  | Shape complexity from image similarity | Wang, Belyaev, Saleem, Seidel | 28 |
2008-1-001 |  | Characterizing the performance of Flash memory storage devices and its impact on algorithm design | Ajwani, Malinger, Meyer, Toledo | 36 |
2007-RG1-002 |  | Superposition for finite domains | Hillenbrand, Weidenbach | 29 |
2007-RG1-002 |  | Superpositon for Finite Domains | Hillenbrand, Weidenbach | 29 |
2007-5-003 |  | Yago : a large ontology from Wikipedia and WordNet | Suchanek, Kasneci, Weikum | 67 |
2007-5-002 |  | A time machine for text search | Berberich, Bedathur, Neumann, Weikum | 39 |
2007-5-002 | | A Time Machine for Text Search | Berberich, Bedathur, Neumann, Weikum | 0 |
2007-5-001 |  | NAGA: searching and ranking knowledge | Kasneci, Suchanek, Ifrim, Ramanath, Weikum | 42 |
2007-4-008 |  | Global stochastic optimization for robust and accurate human motion capture | Gall, Brox, Rosenhahn, Seidel | 28 |
2007-4-007 |  | Global illumination using photon ray splatting | Herzog, Havran, Myszkowski, Seidel | 65 |
2007-4-006 |  | HistoPyramids in Iso-Surface Extraction | Dyken, Ziegler, Theobalt, Seidel | 16 |
2007-4-005 |  | A higher-order structure tensor | Schultz, Weickert, Seidel | 29 |
2007-4-004 |  | A volumetric approach to interactive shape editing | Stoll, de Aguiar, Theobalt, Seidel | 28 |
2007-4-003 |  | A nonlinear viseme model for triphone-based speech synthesis | Bargmann, Blanz, Seidel | 28 |
2007-4-002 | | A Higher-Order Structure Tensor | Schultz, Weickert, Seidel | ? |
2007-4-002 |  | Construction of smooth maps with mean value coordinates | Langer, Seidel | 22 |
2007-4-002 | | ? | De Aguiar, Theobalt | ? |
2007-4-001 |  | Clustered stochastic optimization for object recognition and pose estimation | Gall, Rosenhahn, Seidel | 23 |
2007-2-001 |  | A method and a tool for automatic veriication of region stability for hybrid systems | Podelski, Wagner | 46 |
2007-1-003 |  | LFthreads: a lock-free thread library | Gidenstam, Papatriantafilou | 36 |
2007-1-002 |  | A Lagrangian relaxation approach for the multiple sequence alignment problem | Althaus, Canzar | 41 |
2007-1-001 | | A New Approximation Algorithm for thr Maximum Traveling Salesman Problem | Paluch | ? |
2007-1-001 |  | Linear-time reordering in a sweep-line algorithm for algebraic curves intersecting in a common point | Berberich, Kettner | 20 |
2006-5-006 |  | Yago - a core of semantic knowledge | Kasnec, Suchanek, Weikum | 39 |
2006-5-005 |  | A neighborhood-based approach for clustering of linked document collections | Angelova, Siersdorfer | 32 |
2006-5-004 |  | Combining linguistic and statistical analysis to extract relations from web documents | Suchanek, Ifrim, Weikum | 37 |
2006-5-003 |  | Garment texture editing in monocular video sequences based on
color-coded printing patterns | Scholz, Magnor | 24 |
2006-5-002 |  | IO-Top-k: index-access optimized top-k query processing | Bast, Majumdar, Schenkel, Theobald, Weikum | 49 |
2006-5-001 |  | Overlap-aware global df estimation in distributed information retrieval systems | Bender, Michel, Weikum, Triantafilou | 25 |
2006-4-010 |  | Mean value coordinates for arbitrary spherical polygons and
polyhedra in $\mathbbR^3$ | Belyaev, Langer, Seidel | 19 |
2006-4-009 |  | Interacting and annealing particle filters: mathematics and a recipe for applications | Gall, Potthoff, Rosenhahn, Schnoerr, Seidel | 44 |
2006-4-008 |  | Gesture modeling and animation by imitation | Albrecht, Kipp, Neff, Seidel | 62 |
2006-4-007 |  | Feature-preserving non-local denoising of static and time-varying
range data | Schall, Belyaev, Seidel | 22 |
2006-4-006 |  | Enhanced dynamic reflectometry for relightable free-viewpoint video | Theobalt, Ahmed, Lensch, Magnor, Seidel | 37 |
2006-4-005 |  | Skeleton-driven Laplacian mesh deformations | Belyaev, Seidel, Yoshizawa | 36 |
2006-4-004 |  | On fast construction of spatial hierarchies for ray tracing | Havran, Herzog, Seidel | 40 |
2006-4-003 |  | A framework for natural animation of digitized models | de Aguiar, Zayer, Theobalt, Magnor, Seidel | 27 |
2006-4-002 |  | GPU point list generation through histogram pyramids | Ziegler, Tevs, Theobalt, Seidel | 13 |
2006-4-001 |  | Design and evaluation of backward compatible high dynamic range video compression | Efremov, Mantiuk, Myszkowski, Seidel | 50 |
2006-2-001 |  | On verifying complex properties using symbolic shape analysis | Wies, Kuncak, Zee, Podelski, Rinard | 32 |
2006-1-007 |  | Output-sensitive autocompletion search | Bast, Weber, Mortensen | 17 |
2006-1-006 |  | Division-free computation of subresultants using bezout matrices | Kerber | 20 |
2006-1-005 |  | Snap rounding of Bézier curves | Eigenwillig, Kettner, Wolpert | 39 |
2006-1-004 |  | Power assignment problems in wireless communication | Funke, Laue, Naujoks, Zvi | 25 |
2005-5-002 |  | Automated retraining methods for document classification and their parameter tuning | Siersdorfer, Weikum | 23 |
2005-4-006 |  | An emperical model for heterogeneous translucent objects | Fuchs, Goesele, Chen, Seidel | 20 |
2005-4-005 |  | Photometric calibration of high dynamic range cameras
| Krawczyk, Goesele, Seidel | 21 |
2005-4-004 |  | Joint motion and reflectance capture for creating relightable 3D videos | Theobalt, Ahmed, De Aguiar, Ziegler, Lensch, Magnor, Seidel | 18 |
2005-4-003 |  | Analysis and design of discrete normals and curvatures | Langer, Belyaev, Seidel | 42 |
2005-4-002 |  | Sparse meshing of uncertain and noisy surface scattered data
| Schall, Belyaev, Seidel | 20 |
2005-4-001 |  | Reflectance from images: a model-based approach for human faces | Fuchs, Blanz, Lensch, Seidel | 33 |
2005-2-004 | | A Framework of refutational theorem proving for saturation-based decision procedures | Kazakov | ? |
2005-2-003 |  | Using resolution as a decision procedure | Nivelle | 53 |
2005-2-002 |  | Bounded model checking of pointer programs | Maier, Charatonik, Georgieva | 34 |
2005-2-001 |  | Bottleneck behavior in CNF formulas | Hoffmann, Gomes, Selman | 35 |
2005-1-008 |  | Cycle bases of graphs and sampled manifolds | Gotsman, Kaligosi, Mehlhorn, Michail, Pyrga | 30 |
2005-1-007 |  | A faster algorithm for computing a longest common increasing
subsequence | Katriel, Kutz | 13 |
2005-1-003 |  | Improved algorithms for all-pairs approximate shortest paths in weighted graphs | Baswana, Telikepalli | 26 |
2005-1-002 |  | Reachability substitutes for planar digraphs | Katriel, Kutz, Skutella | 24 |
2005-1-001 |  | Rank-maximal through maximum weight matchings | Michail | 22 |
2004-NWG3-001 |  | Axisymmetric reconstruction and 3D visualization of bipolar planetary nebulae | Magnor | 20 |
2004-NWG1-001 |  | Automatic proof of strong secrecy for security protocols | Blanchet | 78 |
2004-5-001 |  | Goal-oriented methods and meta methods for document classification and their parameter tuning | Siersdorfer, Sizov, Weikum | 32 |
2004-4-006 |  | Faster ray tracing with SIMD shaft culling | Dmitriev, Havran, Seidel | 13 |
2004-4-005 |  | Neural meshes: surface reconstruction with a learning algorithm | Ivrissimtzis, Jeong, Lee, Lee, Seidel | 22 |
2004-4-004 |  | r-adaptive parameterization of surfaces | Zayer, Rössl, Seidel | 16 |
2004-4-003 | | 3D scattered data interpolation and approximation with multilevel compactly supported RBFs | Ohtake, Belyaev, Seidel | ? |
2004-4-002 | | Quadric-based mesh reconstruction from scattered data | Ohtake, Belyaev, Seidel | ? |
2004-4-001 |  | Modeling hair using a wisp hair model | Haber, Schmitt, Koster, Seidel | 40 |
2004-2-007 |  | Summaries for while programs with recursion | Wagner | 22 |
2004-2-002 |  | Intuitionistic LTL and a new characterization of safety and liveness | Maier | 20 |
2004-2-001 |  | Resolution decision procedures for the guarded fragment with transitive guards | de Nivelle, Kazakov | 32 |
2004-1-006 |  | On the Hadwiger's conjecture for graph products | Chandran, Sivadasan | 12 |
2004-1-005 |  | A comparison of polynomial evaluation schemes | Schmitt, Fousse | 19 |
2004-1-004 |  | Online scheduling with bounded migration | Sivadasan, Sanders, Skutella | 21 |
2004-1-003 |  | On algorithms for online topological ordering and sorting | Katriel | 15 |
2004-1-002 |  | A simpler linear time 2/3 - epsilon approximation for maximum weight matching | Sanders, Pettie | 10 |
2004-1-001 |  | Filtering algorithms for the Same and UsedBy constraints | Beldiceanu, Katriel, Thiel | 36 |
2003-NWG2-002 |  | Fast integer programming in fixed dimension | Eisenbrand | 14 |
2003-NWG2-001 |  | Girth and treewidth | Chandran, Subramanian | 11 |
2003-4-009 |  | FaceSketch: an interface for sketching and coloring cartoon faces | Zakaria | 30 |
2003-4-007 |  | Neural meshes: statistical learning methods in surface reconstruction | Ivrissimtzis, Jeong, Seidel | 23 |
2003-4-006 |  | Visualization of volume data with quadratic super splines | Roessl, Zeilfelder, Nürnberger, Seidel | 15 |
2003-4-005 |  | The dimension of $C^1$ splines of arbitrary degree on a tetrahedral partition | Hangelbroek, Nürnberger, Roessl, Seidel, Zeilfelder | 39 |
2003-4-004 |  | A custom designed density estimation method for light transport | Bekaert, Slusallek, Cools, Havran, Seidel | 28 |
2003-4-003 |  | Convex boundary angle based flattening | Zayer, Roessl, Seidel | 16 |
2003-4-002 |  | A flexible and versatile studio for synchronized multi-view video recording | Theobalt, Li, Magnor, Seidel | 18 |
2003-4-001 |  | 3D acquisition of mirroring objects | Tarini, Lensch, Goesele, Seidel | 37 |
2003-2-004 |  | Software model checking of liveness properties via transition invariants | Podelski, Rybalchenko | 29 |
2003-2-003 |  | Subsumption of concepts in $DL$ $\cal FL_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete | Kazakov, de Nivelle | 12 |
2003-2-002 |  | A representation theorem and applications to measure selection and noninformative priors | Jaeger | 35 |
2003-2-001 |  | Compositional circular assume-guarantee rules cannot be sound and complete | Maier | 22 |
2003-1-018 |  | A note on the smoothed complexity of the single-source shortest path problem | Schaefer | 8 |
2003-1-017 |  | Cross-monotonic cost sharing methods for connected facility location games | Schäfer, Leonardi | 10 |
2003-1-016 |  | Topology matters: smoothed competitive analysis of metrical task systems | Schäfer, Sivadasan | 28 |
2003-1-015 |  | Sum-Multicoloring on paths | Kovács | 20 |
2003-1-014 |  | Average case and smoothed competitive analysis of the multi-level feedback algorithm | Schäfer, Becchetti, Leonardi, Marchetti-Spaccamela, Vredeveld | 31 |
2003-1-013 |  | Fast bound consistency for the global cardinality constraint | Katriel, Thiel | 30 |
2003-1-011 |  | Selfish traffic allocation for server farms | Krysta, Czumaj, Voecking | 43 |
2003-1-010 |  | A linear time heuristic for the branch-decomposition of planar graphs | Tamaki | 18 |
2003-1-009 |  | On the Bollob\'as -- Eldridge conjecture for bipartite graphs | Csaba | 29 |
2003-1-008 |  | Polynomial time algorithms for network information flow | Sanders | 15 |
2003-1-007 |  | Alternating cycles contribution: a strategy of tour-merging for the traveling salesman problem | Tamaki | 22 |
2003-1-006 |  | On the probability of rendezvous in graphs | Dietzfelbinger, Tamaki | 30 |
2003-1-005 |  | Almost random graphs with simple hash functions | Dietzfelbinger, Woelfel | 23 |
2003-1-004 |  | Improving linear programming approaches for the Steiner tree problem | Althaus, Polzin, Daneshmand | 19 |
2003-1-003 |  | Random knapsack in expected polynomial time | Beier, Vöcking | 22 |
2003-1-002 |  | Scheduling and traffic allocation for tasks with bounded splittability | Krysta, Sanders, Vöcking | 15 |
2003-1-001 |  | Asynchronous parallel disk sorting | Sanders, Dementiev | 22 |
2002-4-002 |  | Perceptual evaluation of tone mapping operators with regard to similarity and preference | Drago, Martens, Myszkowski, Seidel | 30 |
2002-4-001 |  | Tutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models | Goesele, Kautz, Lang, Lensch, Seidel | 50 |
2002-2-008 |  | Atomic set constraints with projection | Charatonik, Talbot | 20 |
2002-2-007 |  | Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi | Charatonik, Ganzinger | 64 |
2002-1-008 |  | The factor algorithm for all-to-all communication on clusters of SMP nodes | Sanders, Träff | 8 |
2002-1-005 |  | Performance of heuristic and approximation algorithms for the uncapacitated facility location problem | Hoefer | 27 |
2002-1-004 |  | Exp Lab: a tool set for computational experiments | Hert, Polzin, Kettner, Schäfer | 59 |
2002-1-003 |  | A practical minimum spanning tree algorithm using the cycle property | Katriel, Sanders, Träff | 21 |
2002-1-002 |  | Incrementally maintaining the number of l-cliques | Grandoni | 10 |
2002-1-001 |  | Using (sub)graphs of small width for solving the Steiner problem | Polzin, Vahdati | 9 |
2001-4-005 |  | A framework for the acquisition, processing and interactive display of high quality 3D models | Lensch, Goesele, Seidel | 39 |
2001-4-004 |  | Linear one-sided stability of MAT for weakly injective domain | Choi, Seidel | 18 |
2001-4-003 |  | Efficient light transport using precomputed visibility | Daubert, Heidrich, Kautz, Dischler, Seidel | 32 |
2001-4-002 |  | A framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the Web | Lensch, Kautz, Goesele, Seidel | 20 |
2001-4-001 |  | Image-based reconstruction of spatially varying materials | Lensch, Kautz, Goesele, Heidrich, Seidel | 20 |
2001-2-006 |  | Proceeding of the Second International Workshop of the Implementation of Logics | de Nivelle, Schulz | ? 102 |
2001-2-005 |  | Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators | Sofronie-Stokkermans | 41 |
2001-2-003 |  | Experiments with iterative improvement algorithms on completely unimodel hypercubes | Björklund, Petersson, Vorobyov | 25 |
2001-2-001 |  | Superposition and chaining for totally ordered divisible abelian groups | Waldmann | 40 |
2001-1-007 |  | Extending reduction techniques for the Steiner tree problem: a combination of alternative-and bound-based approaches | Polzin, Vahdati | 24 |
2001-1-006 |  | Partitioning techniques for the Steiner problem | Polzin, Vahdati | 21 |
2001-1-005 |  | On Steiner trees and minimum spanning trees in hypergraphs | Polzin, Vahdati | 15 |
2001-1-004 |  | An adaptable and extensible geometry kernel | Hert, Hoffmann, Kettner, Pion, Seel | 27 |
2001-1-003 |  | Implementation of planar Nef polyhedra | Seel | 345 |
2001-1-002 |  | Directed single-source shortest-paths in linear average-case time | Meyer | 32 |
2001-1-001 |  | Approximating minimum size 1,2-connected networks | Krysta | 22 |
2000-4-003 |  | Hyperbolic Hausdorff distance for medial axis transform | Choi, Seidel | 30 |
2000-4-002 |  | Geometric modeling based on polygonal meshes | Kobbelt, Bischoff, Kähler, Schneider, Botsch, Rössl, Vorsatz | 52 |
2000-4-001 |  | Bump map shadows for openGL rendering | Kautz, Heidrich, Daubert | 18 |
2000-2-001 |  | Short vectors of planar lattices via continued fractions | Eisenbrand | 10 |
2000-1-005 |  | Infimaximal frames: a technique for making lines look like segments | Seel, Mehlhorn | 16 |
2000-1-004 |  | Generalized and improved constructive separation bound for real algebraic expressions | Mehlhorn, Schirra | 12 |
2000-1-003 |  | Low-contention depth-first scheduling of parallel computations with synchronization variables | Fatourou | 56 |
2000-1-002 |  | A powerful heuristic for telephone gossiping | Beier, Sibeyn | 23 |
2000-1-001 |  | A branch and cut algorithm for the optimal solution of the side-chain placement problem | Althaus, Kohlbacher, Lenhof, Müller | 26 |
1999-4-001 |  | A framework for evaluating the quality of lossy image compression | Haber, Seidel | 20 |
1999-3-005 |  | Axioms for real-time logics | Henzinger, Raskin, Schobbens | 31 |
1999-3-004 |  | Proving a conjecture of Andreka on temporal logic | Raskin, Schobbens | 13 |
1999-3-003 |  | Fully decidable logics, automata and classical theories for defining regular real-time languages | Henzinger, Raskin, Schobbens | 102 |
1999-3-002 |  | The logic of event clocks | Raskin, Schobbens | 41 |
1999-3-001 |  | New lower bounds for the expressiveness and the higher-order Matching problem in the simply typed lambda calculus | Vorobyov | 20 |
1999-2-008 |  | Cutting planes and the elementary closure in fixed dimension | Bockmayr, Eisenbrand | 12 |
1999-2-007 |  | Symbolic representation of upward-closed sets | Delzanno, Raskin | 24 |
1999-2-006 |  | A deductive model checking approach for hybrid systems | Nonnengart | 40 |
1999-2-005 |  | Symmetries in logic programs | Wu | 44 |
1999-2-004 |  | Decidable fragments of simultaneous rigid reachability | Cortier, Ganzinger, Jacquemard, Veanes | 19 |
1999-2-003 |  | Cancellative superposition decides the theory of divisible torsion-free abelian groups | Waldmann | 23 |
1999-2-001 |  | Automata on DAG representations of finite trees | Charatonik | 30 |
1999-1-007 |  | A simple way to recognize a correct Voronoi diagram of line segments | Burnikel, Mehlhorn, Seel | 11 |
1999-1-006 |  | Integration of graph iterators into LEDA | Nissen | 39 |
1999-1-005 |  | Ultimate parallel list ranking? | Sibeyn | 20 |
1999-1-004 |  | How generic language extensions enable ''open-world'' design in Java | Nissen, Weihe | 40 |
1999-1-003 |  | Fast concurrent access to parallel disks | Sanders, Egner, Korst | 30 |
1999-1-002 |  | BALL: Biochemical Algorithms Library | Boghossian, Kohlbacher, Lenhof | 20 |
1999-1-001 |  | A theoretical and experimental study on the construction of suffix arrays in external memory | Crauser, Ferragina | 40 |
98-2-018 |  | A note on the membership problem for the first elementary closure of a polyhedron | Eisenbrand | 3 |
98-2-017 |  | Hybridizing concept languages | Tzakova, Blackburn | 33 |
98-2-014 |  | Partisan corroboration, and shifted pairing | Gurevich, Veanes | 35 |
98-2-013 |  | Rigid reachability | Ganzinger, Jacquemard, Veanes | 24 |
98-2-012 |  | Model checking infinite-state systems in CLP | Delzanno, Podelski | 44 |
98-2-011 |  | Equality reasoning in sequent-based calculi | Degtyarev, Voronkov | 128 |
98-2-010 |  | Strategies for conformance testing | Ramangalahy | 24 |
98-2-009 |  | The undecidability of the first-order theories of one step rewriting in linear canonical systems | Vorobyov | 59 |
98-2-008 |  | AE-Equational theory of context unification is Co-RE-Hard | Vorobyov | 20 |
98-2-007 |  | The most nonelementary theory (a direct lower bound proof) | Vorobyov | 36 |
98-2-006 |  | Hybrid languages and temporal logic | Blackburn, Tzakova | 29 |
98-2-005 |  | The relation between second-order unification and simultaneous rigid \sl E-unification | Veanes | 26 |
98-2-004 |  | Satisfiability of Functional+Record Subtype Constraints is NP-Hard | Vorobyov | 16 |
98-2-003 |  | E-unification for subsystems of S4 | Schmidt | 30 |
98-2-002 |  | Unification in extensions of shallow equational theories | Jacquemard, Meyer, Weidenbach | 31 |
98-1-031 |  | Optimal compaction of orthogonal grid drawings | Klau, Mutzel | 20 |
98-1-030 |  | Applications of the generic programming paradigm in the design of CGAL | Brönniman, Kettner, Schirra, Veltkamp | 12 |
98-1-029 |  | Optimizing over all combinatorial embeddings of a planar graph | Mutzel, Weiskircher | 23 |
98-1-028 |  | On the performance of LEDA-SM | Crauser, Mehlhorn, Althaus, Brengel, Buchheit, Keller, Krone, Lambert, Schulte, Thiel, Westphal, Wirth | 26 |
98-1-027 |  | Delaunay graphs by divide and conquer | Burnikel | 24 |
98-1-026 |  | Improved approximation schemes for scheduling unrelated parallel machines | Jansen, Porkolab | 14 |
98-1-025 |  | Linear-time approximation schemes for scheduling malleable parallel tasks | Jansen, Porkolab | 15 |
98-1-024 |  | $q$-gram based database searching using a suffix array (QUASAR) | Burkhardt, Crauser, Ferragina, Lenhof, Rivals, Vingron | 11 |
98-1-023 |  | Rational points on circles | Burnikel | 14 |
98-1-022 |  | Fast recursive division | Burnikel, Ziegler | 29 |
98-1-021 |  | Scheduling with unexpected machine breakdowns | Albers, Schmidt | 15 |
98-1-020 |  | On Wallace's method for the generation of normal variates | Rüb | 17 |
98-1-019 |  | 2nd Workshop on Algorithm Engineering WAE '98 - Proceedings | Mehlhorn (ed.) | 213 |
98-1-018 |  | On positive influence and negative dependence | Dubhashi, Ranjan | 12 |
98-1-017 |  | Randomized external-memory algorithms for some geometric problems | Crauser, Ferragina, Mehlhorn, Meyer, Ramos | 27 |
98-1-016 |  | New approximation algorithms for the achromatic number | Krysta, Lory\'{s} | 26 |
98-1-015 |  | Scheduling multicasts on unit-capacity trees and meshes | Henzinger, Leonardi | 38 |
98-1-014 |  | Time-independent gossiping on full-port tori | Meyer, Sibeyn | 20 |
98-1-013 |  | Quasi-orthogonal drawing of planar graphs | Klau, Mutzel | 15 |
98-1-012 |  | Solving some discrepancy problems in NC* | Mahajan, Ramos, Subrahmanyam | 21 |
98-1-011 |  | Robustness analysis in combinatorial optimization | Frederickson, Solis-Oba | 66 |
98-1-010 |  | 2-Approximation algorithm for finding a spanning tree with maximum number of leaves | Solis-Oba | 16 |
98-1-009 |  | Fully dynamic shortest paths and negative cycle detection on diagraphs with Arbitrary Arc Weights | Frigioni, Marchetti-Spaccamela, Nanni | 18 |
98-1-008 |  | A note on computing a maximal planar subgraph using PQ-trees | Jünger, Leipert, Mutzel | 5 |
98-1-007 |  | On the Design of CGAL, the Computational Geometry Algorithms Library | Fabri, Giezeman, Kettner, Schirra, Schönherr | 31 |
98-1-006 |  | A new characterization for parity graphs and a coloring problem with costs | Jansen | 16 |
98-1-005 |  | The mutual exclusion scheduling problem for permutation and comparability graphs | Jansen | 12 |
98-1-004 |  | Robustness and precision issues in geometric computation | Schirra | 34 |
98-1-003 |  | Parameterized implementations of classical planar convex hull algorithms and extreme point compuations | Schirra | 93 |
98-1-002 |  | Comparator networks for binary heap construction | Brodal, Pinotti | 11 |
98-1-001 |  | Simpler and faster static AC$^0$ dictionaries | Hagerup | 13 |
97-2-012 |  | Elimination of equality via transformation with ordering constraints | Bachmair, Ganzinger, Voronkov | 18 |
97-2-011 |  | Strict basic superposition and chaining | Bachmair, Ganzinger | 22 |
97-2-010 |  | Complexity of nonrecursive logic programs with complex values | Vorobyov, Voronkov | 46 |
97-2-009 |  | On the Chvátal rank of polytopes in the 0/1 cube | Bockmayr, Eisenbrand | 12 |
97-2-008 |  | A unifying framework for integer and finite domain constraint programming | Bockmayr, Kasper | 24 |
97-2-007 |  | Two hybrid logics | Blackburn, Tzakova | 33 |
97-2-006 |  | Third-order matching in $\lambda\rightarrow$-Curry is undecidable | Vorobyov | 17 |
97-2-005 |  | A theory of resolution | Bachmair, Ganzinger | 79 |
97-2-004 |  | Solving set constraints for greatest models | Charatonik, Podelski | 12 |
97-2-003 |  | On evaluating decision procedures for modal logic | Hustadt, Schmidt | 50 |
97-2-002 |  | Resolution is a decision procedure for many propositional modal logics | Schmidt | 60 |
97-2-001 |  | Labelled modal logics: quantifiers | Basin, Matthews, Viganò | 31 |
97-1-028 |  | The practical use of the $\calA^*$ algorithm for exact multiple sequence alignment | Lermen, Reinert | 16 |
97-1-027 |  | A polylogarithmic approximation algorithm for group Steiner tree problem | Garg, Konjevod, Ravi | 7 |
97-1-026 |  | On-line network routing - a survey | Fiat, Leonardi | 19 |
97-1-025 |  | Faster and simpler algorithms for multicommodity flow and other fractional packing problems | Garg, Könemann | 13 |
97-1-024 |  | Minimizing stall time in single and parallel disk systems | Albers, Garg, Leonardi | 16 |
97-1-023 |  | Randomized on-line call control revisited | Leonardi, Marchetti-Spaccamela | 19 |
97-1-022 |  | Maximum network flow with floating point arithmetic | Althaus, Mehlhorn | 5 |
97-1-021 |  | From parallel to external list ranking | Sibeyn | 15 |
97-1-020 |  | Finger search trees with constant insertion time | Brodal | 17 |
97-1-019 |  | AGD-Library: A Library of Algorithms for Graph Drawing | Alberts, Gutwenger, Mutzel, Näher | 13 |
97-1-018 |  | On the Bahncard problem | Fleischer | 16 |
97-1-017 |  | Exploring unknown environments | Albers, Henzinger | 23 |
97-1-016 |  | Faster deterministic sorting and priority queues in linear space | Thorup | 9 |
97-1-015 |  | Pitfalls of using PQ--Trees in automatic graph drawing | Jünger, Leipert, Mutzel | 12 |
97-1-014 |  | Designing a Computational Geometry Algorithms Library | Schirra | 8 |
97-1-013 |  | Datenstrukturen und Algorithmen | Hagerup | 223 |
97-1-012 |  | On Batcher's Merge Sorts as Parallel Sorting Algorithms | Rüb | 23 |
97-1-011 |  | A parallel priority queue with constant time operations | Brodal, Träff, Zaroliagis | 19 |
97-1-010 |  | Evaluating a 2-approximation algorithm for edge-separators in planar graphs | Garg, Manss | 9 |
97-1-009 |  | Better bounds for online scheduling | Albers | 16 |
97-1-008 |  | An alternative method to crossing minimization on hierarchical graphs | Mutzel | 15 |
97-1-007 |  | Algorithmen zum automatischen Zeichnen von Graphen | Brandenburg, Jünger, Mutzel | 9 |
97-1-006 |  | Restricted 2-factor polytopes | Cunningham, Wang | 30 |
97-1-005 |  | Bicriteria job sequencing with release dates | Wang | 18 |
97-1-004 |  | New contact measures for the protein docking problem | Lenhof | 10 |
97-1-003 |  | Parallel algorithms for MD-simulations of synthetic polymers | Jung, Lenhof, Müller, Rüb | 32 |
97-1-002 |  | Approximating sparsest cuts | Garg | 9 |
97-1-001 |  | BSP-like external-memory computation | Sibeyn, Kaufmann | 14 |
96-2-010 |  | Strong skolemization | Nonnengart | 16 |
96-2-009 |  | Beyond the finite in automatic hardware verification | Basin, Klarlund | 51 |
96-2-008 |  | On the decision complexity of the bounded theories of trees | Vorobyov | 26 |
96-2-007 |  | SCAN and systems of conditional logic | Herzig | 33 |
96-2-006 |  | Natural deduction for non-classical logics | Basin, Matthews, Viganò | 44 |
96-2-005 |  | Auxiliary modal operators and the characterization of modal frames | Nonnengart | 37 |
96-2-004 |  | Non-symmetric rewriting | Struth | 20 |
96-2-003 |  | Using algebraic specification languages for model-oriented specifications | Baumeister | 17 |
96-2-002 |  | Labelled propositional modal logics: theory and practice | Basin, Matthews, Viganò | 46 |
96-2-001 |  | Theorem proving in cancellative abelian monoids | Ganzinger, Waldmann | 52 |
96-1-033 |  | A runtime test of integer arithmetic and linear algebra in LEDA | Seel | 10 |
96-1-032 |  | Runtime prediction of real programs on real machines | Finkler, Mehlhorn | 10 |
96-1-031 |  | On the complexity of computing evolutionary trees | Gasieniec, Jansson, Lingas, Östlin | 14 |
96-1-030 |  | External inverse pattern matching | Gasieniec, Indyk, Krysta | 12 |
96-1-029 |  | Lower bounds for row minima searching | Bradford, Reinert | 12 |
96-1-028 |  | A branch-and-cut algorithm for multiple sequence alignment | Reinert, Lenhof, Mutzel, Mehlhorn, Kececioglou | 15 |
96-1-027 |  | A branch-and-cut approach to physical mapping with end-probes | Christof, Jünger, Kececioglou, Mutzel, Reinelt | 10 |
96-1-026 |  | A survey of self-organizing data structures | Albers, Westbrook | 39 |
96-1-025 |  | 2-Layer straigthline crossing minimization: performance of exact and heuristic algorithms | Jünger, Mutzel | 14 |
96-1-024 |  | More geneal parallel tree contraction: Register allocation and broadcasting in a tree | Diks, Hagerup | 24 |
96-1-023 |  | Discovering all most specific sentences by randomized algorithms | Gunopulos, Mannila, Saluja | 23 |
96-1-022 |  | Optimal algorithms for some proximity problems on the Gaussian sphere with applications | Saluja, Gupta | 8 |
96-1-021 |  | Generalized $k$-Center Problems | Garg, Chaudhuri, Ravi | 9 |
96-1-020 |  | Negative dependence through the FKG Inequality | Dubhashi, Priebe, Ranjan | 10 |
96-1-019 |  | Rotations of periodic strings and short superstrings | Breslauer, Jiang, Jiang | 13 |
96-1-018 |  | Gossiping on meshes and tori | Sibeyn, Rao, Juurlink | 19 |
96-1-017 |  | A technique for adding range restrictions to generalized searching problems | Gupta, Janardan, Smid | 9 |
96-1-016 |  | A computational basis for higher-dimensional computational geometry | Mehlhorn, Näher, Schirra, Seel, Uhrig | 120 |
96-1-015 |  | Computational Molecular Biology | Vingron, Lenhof, Mutzel | 26 |
96-1-014 |  | The randomized complexity of maintaining the minimum | Brodal, Chaudhuri, Radhakrishnan | 12 |
96-1-013 |  | Derandomizing semidefinite programming based approximation algorithms | Mahajan, Ramesh | 22 |
96-1-012 |  | A simple parallel algorithm for the single-source shortest path problem on planar diagraphs | Träff, Zaroliagis | 17 |
96-1-011 |  | The impact of timing on linearizability in counting networks | Mavronicolas, Papatriantafilou, Tsigas | 19 |
96-1-010 |  | Distributed list coloring: how to dynamically allocate frequencies to mobile base stations | Garg, Papatriantafilou, Tsigas | 15 |
96-1-009 |  | The thickness of graphs: a survey | Mutzel, Odenthal, Scharbrodt | 18 |
96-1-008 |  | Efficient algorithms for counting and reporting pairwise intersections between convex polygons | Gupta, Janardan, Smid | 11 |
96-1-007 |  | All-pairs min-cut in sparse networks | Arikati, Chaudhuri, Zaroliagis | 27 |
96-1-006 |  | On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees | Das, Kapoor, Smid | 14 |
96-1-005 |  | Vorlesungsskript Komplexitätstheorie | Hagerup | 150 |
96-1-004 |  | Exact ground states of two-dimensional $\pm J$ Ising Spin Glasses | De Simone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi | 10 |
96-1-003 |  | Proximity in arrangements of algebraic sets | Rieger | 25 |
96-1-002 |  | High-precision floating point numbers in LEDA | Burnikel, Könemann | 47 |
96-1-001 |  | The LEDA class real number | Burnikel, Mehlhorn, Schirra | 52 |
95-2-011 |  | Modelling mixed-integer optimisation problems in constraint logic programming | Barth, Bockmayr | 22 |
95-2-010 |  | Special cases and substitutes for rigid $E$-unification | Plaisted | 46 |
95-2-009 |  | Ordered chaining calculi for first-order theories of binary relations | Bachmair, Ganzinger | 42 |
95-2-008 |  | Translating graded modalities into predicate logic | Ohlbach, Schmidt, Hustadt | 37 |
95-2-007 |  | A fixpoint approach to second-order quantifier elimination with applications to correspondence theory | Nonnengart, Szalas | 16 |
95-2-006 |  | Automated complexity analysis based on ordered resolution | Basin, Ganzinger | 33 |
95-2-005 |  | A multi-dimensional terminological knowledge representation language | Baader, Ohlbach | 32 |
95-2-003 |  | A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization | Barth | 13 |
95-2-002 |  | Functional translation and second-order frame properties of modal logics | Ohlbach, Schmidt | 27 |
95-2-001 |  | Proof normalization and subject reduction in extensions of Fsub | Vorobyov | 18 |
95-1-029 |  | Weak epsilon-nets for points on a hypersphere | Bradford, Capoyleas | 8 |
95-1-028 |  | Exact and heuristic algorithms for 2-layer straightline crossing minimization | Jünger, Mutzel | 12 |
95-1-027 |  | The thickness of a minor-excluded class of graphs | Jünger, Mutzel, Odenthal, Scharbrodt | 9 |
95-1-026 |  | Closest point problems in computational geometry | Smid | 62 |
95-1-025 |  | Matching nuts and bolts optimally | Bradford | 24 |
95-1-024 |  | Sorting in linear time? | Andersson, Nilsson, Hagerup, Raman | 32 |
95-1-023 |  | An algorithm for the protein docking problem | Lenhof | 11 |
95-1-022 |  | New deterministic algorithms for counting pairs of intersecting segments and off-line triangle range searching | Pellegrini | 12 |
95-1-021 |  | Shortest paths in digraphs of small treewidth part II: optimal parallel algirithms | Chaudhuri, Zaroliagis | 20 |
95-1-020 |  | Shortest paths in digraphs of small treewidth sequential algorithms | Chaudhuri, Zaroliagis | 17 |
95-1-019 |  | The fourth moment in Luby`s distribution | Dubhashi, Pantziou, Spirakis, Zaroliagis | 10 |
95-1-018 |  | Overview of mesh results | Sibeyn | 22 |
95-1-017 |  | Parallel algorithms with optimal speedup for bounded treewidth | Bodlaender, Hagerup | 27 |
95-1-016 |  | Wait-free consensus in "in-phase" multiprocessor systems | Papatriantafilou, Tsigas | 12 |
95-1-015 |  | Dynamic maintenance of 2-d convex hulls and order decomposable problems | Kapoor | 22 |
95-1-014 |  | A polyhedral approach to planar augmentation and related problems | Mutzel | 14 |
95-1-013 |  | Efficient computation of implicit representations of sparse graphs (revised version) | Arikati, Maheshwari, Zaroliagis | 16 |
95-1-012 |  | Sample sort on meshes | Sibeyn | 14 |
95-1-011 |  | Automatisiertes Zeichnen von Diagrammen | Mutzel | 5 |
95-1-010 |  | On the average running time of odd-even merge sort | Rüb | 16 |
95-1-009 |  | Radix heaps an efficient implementation for priority queues | Könemann, Schmitz, Schwarz | 27 |
95-1-007 |  | Interactive Proof Systems | Radhakrishnan, Saluja | 121 |
95-1-006 |  | A polylog-time and $O(n\sqrt\lg n)$-work parallel algorithm for finding the row minima in totally monotone matrices | Bradford, Fleischer, Smid | 12 |
95-1-005 |  | Towards self-stabilizing wait-free shared memory objects | Hoepmann, Papatriantafilou, Tsigas | 15 |
95-1-004 |  | Exact ground states of Ising spin classes: new experimental results with a branch and cut algorithm | Diehl, De Simone, Jünger, Mutzel, Reinelt, Rinaldi | 17 |
95-1-003 |  | Matching nuts and bolts faster | Bradford, Fleischer | 7 |
95-1-002 |  | LEDA user manual (version R 3.2) | Näher, Uhrig | 184 |
95-1-001 |  | Computing a largest empty anchored cylinder, and related problems | Smid, Thiel, Follert, Schömer, Sellen | 17 |
94-261 |  | Finite domain and cutting plane techniques in CLP($\cal PB$) | Barth, Bockmayr | 16 |
94-257 |  | Structural decidable extensions of bounded quantification | Vorobyov | 12 |
94-252 |  | A survey of program transformation with special reference to unfold/fold style program development | Madden | 36 |
94-251 |  | Substitution tree indexing | Graf | 34 |
94-246 |  | On extra variables in (Equational) logic programming | Hanus | 33 |
94-241 |  | Genetic algorithms within the framework of evolutionary computation: Proceedings of the KI-94 Workshop | Hopf (ed.) | 161 |
94-240 |  | Recursive program optimization through inductive synthesis proof transformation | Madden | 44 |
94-239 |  | A general technique for automatically optimizing programs through the use of proof plans | Madden, Green | 16 |
94-238 |  | Formal methods of automated program improvement | Madden | 12 |
94-235 |  | Ordered semantic hyper-linking | Plaisted | 22 |
94-234 |  | Reflection using the derivability conditions | Matthews, Simpson | 14 |
94-233 |  | The search efficiency of theorem proving strategies: an analytical comparison | Plaisted | 40 |
94-232 |  | An abstract program generation logic | Plaisted | 58 |
94-230 |  | Temporal logic: Proceedings of the ICTL Workshop | Ohlbach (ed.) | 116 |
94-229 |  | Classical methods in nonmonotonic reasoning | Dimopoulos | 26 |
94-228 |  | Computer support for the development and investigation of logics | Ohlbach | 24 |
94-227 |  | Minimal resolution | Weidenbach | 20 |
94-226 |  | Killer transformations | Ohlbach, Gabbay, Plaisted | 45 |
94-225 |  | Synthesizing semantics for extensions of propositional logic | Ohlbach | 45 |
94-224 |  | Integration of declarative paradigms: Proceedings of the ICLP'94 Post-Conference Workshop, Santa Margherita Ligure, Italy | Aït-Kaci, Hanus, Navarro | 149 |
94-223 |  | LDS - Labelled Deductive Systems: Volume 1 - Foundations | Gabbay | 465 |
94-218 |  | Logic frameworks for logic programs | Basin | 13 |
94-216 |  | Linear 0-1 inequalities and extended clauses | Barth | 53 |
94-209 |  | Termination orderings for rippling | Basin, Walsh | 15 |
94-208 |  | A probabilistic extension of terminological logics | Jaeger | 64 |
94-207 |  | Cutting planes in constraint logic programming | Bockmayr | 23 |
94-201 |  | The integration of functions into logic programming: a survey | Hanus | 48 |
94-162 |  | On the parallel complexity of degree sequence problems | Arikati | 12 |
94-160 |  | Implementation of a sweep line algorithm for the Straight \& Line Segment Intersection Problem | Mehlhorn, Näher | 41 |
94-158 |  | Further improvements of Steiner tree approximations | Karpinksi, Zelikovsky | 10 |
94-156 |  | Dynamic algorithms for geometric spanners of small diameter: randomized solutions | Arya, Mount, Smid | ? |
94-155 |  | Lecture notes selected topics in data structures | Smid | 76 |
94-153 |  | Towards practical permutation routing on meshes | Kaufmann, Meyer, Sibeyn | 11 |
94-150 |  | On characteristic points and approximate decision algorithms for the minimum Hausdorff distance | Chew, Kedem, Schirra | 10 |
94-149 |  | Revenge of the dog: queries on Voronoi diagrams of moving points | Devillers, Golin, Schirra, Kedem | 14 |
94-148 |  | Efficient computation of compact representations of sparse graphs | Arikati, Maheshwari, Zaroliagis | 10 |
94-147 |  | Efficient collision detection for moving polyhedra | Schömer, Thiel | 24 |
94-145 |  | Prefix graphs and their applications | Chaudhuri, Hagerup | 13 |
94-144 |  | Stochastic majorisation: exploding some myths | Dubhashi, Ranjan | 5 |
94-143 |  | Some correlation inequalities for probabilistic analysis of algorithms | Dubhashi, Ranjan | 16 |
94-142 |  | The rectangle enclosure and point-dominance problems revisited | Gupta, Janardan, Smid, Dasgupta | 16 |
94-137 |  | Improved parallel integer sorting without concurrent writing | Albers, Hagerup | ? |
94-136 |  | Near-optimal distributed edge | Dubhashi, Panconesi | 12 |
94-131 |  | Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems | Kavvadias, Pantziou, Spirakis, Zaroliagis | 38 |
94-122 |  | Realizing degree sequences in parallel | Arikati, Maheshwari | 27 |
94-121 |  | Short random walks on graphs | Barnes, Feige | 14 |
94-120 |  | A method for implementing lock-free shared data structures | Barnes | 15 |
94-119 |  | Time-space lower bounds for directed s-t connectivity on JAG models | Barnes, Edmonds | ? |
94-117 |  | On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm | Mehlhorn, Mutzel | 8 |
94-115 |  | Efficient construction of a bounded degree spanner with low weight | Arya, Smid | 25 |
94-114 |  | On-line and dynamic algorithms for shortest path problems | Djidjev, Pantziou, Zaroliagis | 20 |
94-113 |  | Fast algorithms for collision and proximity problems involving moving geometric objects | Gupta, Janardan, Smid | 22 |
94-112 |  | On-line and Dynamic Shortest Paths through Graph Decompositions (Preliminary Version) | Djidjev, Pantziou, Zaroliagis | 14 |
94-111 |  | On the width and roundness of a set of points in the plane | Smid, Janardan | 14 |
94-110 |  | Quickest paths: faster algorithms and dynamization | Kargaris, Pantziou, Tragoudas, Zaroliagis | 15 |
94-106 |  | New on-line algorithms for the page replication problem | Albers, Koga | 18 |
94-105 |  | An implementation of a Convex Hull Algorithm, Version 1.0 | Müller, Ziegler | 63 |
94-104 |  | Komplexitätstheorie und effiziente Algorithmen | Fleischer | 30 |
94-103 |  | On the intellectual terrain around NP | Chari, Hartmanis | 11 |
94-102 |  | Desnakification of mesh sorting algorithms | Sibeyn | 21 |
93-.01 | | *No Title | Matthews, Simpson | |
93-267 |  | Associative-commutative superposition | Bachmair, Ganzinger | ? |
93-265 |  | Negativ set constraints: an easy proof of decidability | Charatonik, Pacholski | 11 |
93-264 |  | Graph theoretical structures in logic programs and default theories | Dimopoulos, Torres | 28 |
93-260 |  | The logic of preference and decision supporting systems | Cvetkovic | 71 |
93-258 | | Linear logic meets the Lambda Calculus, part I | Tönne | ? |
93-257 |  | Computing stable models by program transformation | Stuber | 15 |
93-256 |  | Solving simplifications ordering constraints | Johann, Socher-Ambrosius | 16 |
93-253 |  | Extended path-indexing | Graf, Meyer | ? |
93-253 |  | Extended path-Indexing | Graf, Meyer | ? |
93-250 |  | Ordered chaining for total orderings | Bachmair, Ganzinger | 20 |
93-249 |  | Rewrite techniques for transitive relations | Bachmair, Ganzinger | 19 |
93-243 |  | A needed narrowing strategy | Antoy, Echahed, Hanus | 28 |
93-237 |  | A refined version of general E-unification | Socher-Ambrosius | 12 |
93-236 |  | Basic paramodulation | Bachmair, Ganzinger, Lynch, Snyder | 36 |
93-235 |  | A conservative extension of first-order logic and its application to theorem proving | Basin, Matthews | 11 |
93-234 |  | Künstliche Intelligenz und Operations Research | Bockmayr, Radermacher | 36 |
93-233 |  | Narrowing strategies for arbitrary canonical rewrite systems | Bockmayr, Krischer, Werner | 29 |
93-231 |  | A framework for program development based on schematic proof | Basin, Bundy, Kraan, Matthews | 12 |
93-230 |  | Classical vs non-classical logics: the universality of classical logic | Gabbay | 101 |
93-227 |  | A theory and its metatheory in FS 0 | Matthews | 22 |
93-226 |  | On kernels, defaults and even graphs | Dimopoulos, Magirou, Papadimitriou | 11 |
93-225 |  | Translation methods for non-classical logics: an overview | Ohlbach | 18 |
93-222 |  | A debugging model for functional logic programs | Hanus, Josephs | 14 |
93-220 |  | Towards automating duality | Brink, Gabbay, Ohlbach | 50 |
93-217 |  | Unification of terms with exponents | Socher-Ambrosius | 21 |
93-215 |  | Lazy unification with inductive simplification | Hanus | 20 |
93-214 |  | Middle-out reasoning for logic program synthesis | Basin, Kraan, Bundy | 12 |
93-213 |  | Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, 1993 | Basin, Hähnle, Fronhöfer, Posegga, Schwind (ed.) | ? |
93-212 |  | A multi-dimensional terminological knowledge representation language - preliminary version | Ohlbach, Baader | 17 |
93-211 |  | Unification in sort theories and its applications | Weidenbach | 36 |
93-204 |  | Superposition with simplification as a decision procedure for the monadic class with equality | Ganzinger, Bachmair, Waldmann | 14 |
93-166 |  | Effizient algorithms for generalized intersection searching on non-iso-oriented objects | Gupta, Janardan, Smid | 32 |
93-163 |  | Deterministic 1-k routing on meshes with applications to worm-hole routing | Sibeyn, Kaufmann | 13 |
93-162 |  | On multi-party communication complexity of random functions | Grolmusz | 10 |
93-161 |  | Harmonic analysis, real approximation, and the communication complexity of Boolean functions | Grolmusz | 15 |
93-159 |  | New techniques for exact and approximate dynamic closest-point problems | Kapoor, Smid | 29 |
93-155 |  | Quantifier elimination in p-adic fields | Dubhashi | 21 |
93-154 |  | Searching, sorting and randomised algorithms for central elements and ideal counting in posets | Dubhashi, Mehlhorn, Ranjan, Thiel | 8 |
93-152 |  | Optimal parallel string algorithms: sorting, merching and computing the minimum | Hagerup | 25 |
93-151 |  | An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm | Mehlhorn | 20 |
93-148 |  | Lower bounds for merging on the hypercube | Rüb | 10 |
93-147 |  | The complexity of parallel prefix problems on small domains | Chaudhuri, Radhakrishnan | 17 |
93-146 |  | A lower bound for linear approximate compaction | Chaudhuri | 12 |
93-145 |  | Sensitive functions and approximate problems | Chaudhuri | 8 |
93-144 |  | A lower bound for area-universal graphs | Bilardi, Chaudhuri, Dubhashi, Mehlhorn | 7 |
93-142 |  | MOD m gates do not help on the ground floor | Grolmusz | 13 |
93-140 |  | A complete and efficient algorithm for the intersection of a general convex polyhedron | Dobrindt, Mehlhorn, Yvinec | 14 |
93-138 |  | Routing and sorting on circular arrays | Sibeyn | 20 |
93-132 |  | Multi-party protocols and spectral norms | Grolmusz | 11 |
93-129 |  | Tight bounds for some problems in computational geometry: the complete sub-logarithmic parallel time range | Sen | 12 |
93-128 |  | Maintaining dynamic sequences under equality-tests in polylogorithmic time | Mehlhorn, Uhrig | 17 |
93-124 |  | Algorithms for some intersection searching problems involving curved objects | Gupta, Janardan, Smid | 43 |
[Replication or Save Conflict] |  |  |  |  |
93-123 |  | Fast parallel space allocation, estimation and integer sorting (revised) | Bast, Hagerup | 85 |
93-121 |  | The circuit subfunction relations are $sum^P_2$-complete | Borchert, Ranjan | 14 |
93-119 |  | Generalized topological sorting in linear time | Hagerup, Maas | 10 |
93-118 |  | Approximate and exact deterministic parallel selection | Chaudhuri, Hagerup, Raman | 10 |
93-116 |  | Finding k points with a smallest enclosing square | Smid | 17 |
93-110 |  | Coloring k-colorable graphs in expected parallel time | Kucera | 14 |
93-109 |  | LEDA-Manual Version 3.0 | Näher, Mehlhorn | 140 |
93-108 |  | Static and dynamic algorithms for k-point clustering problems | Smid, Datta, Lenhof, Schwarz | 20 |
93-107 |  | Expected complexity of graph partitioning problems | Kucera | 16 |
93-106 |  | Broadcasting through a noisy one-dimensional network | Kucera | 14 |
93-105 |  | Randomized incremental construction of abstract Voronoi diagrams | Klein, Mehlhorn, Meiser | 29 |
93-103 |  | Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection | Mehlhorn, Sharir, Welzl | 12 |
93-102 |  | Randomized Data Structures for the Dynamic Closest-Pair Problem | Golin, Raman, Schwarz, Smid | 32 |
92-.48 | | not published | Tönne |  |
92-601 |  | Self-testing and self-checking combinational circuits with weakly independent outputs | Sogomonjan, Goessel | 18 |
92-251 |  | Analysis of nonlinear constraints in CLP(R) | Hanus | 31 |
92-250 |  | Reflection in logical systems | Matthews | 14 |
92-247 |  | Difference unification | Basin, Walsh | 15 |
92-246 |  | Terminological representation, natural language & relation algebra | Schmidt | 13 |
92-244 |  | Logic program synthesis via proof planning | Kraan, Basin, Bundy | 14 |
92-242 |  | Temporal logic: Mathematical foundations, part 2 | Gabbay, Hodkinson, Reynolds | 30 |
92-240 |  | Set constraints are the Monadic class | Ganzinger, Bachmair, Waldmann | 13 |
92-238 |  | A new ordering constraint solving method and its applications | Nieuwenhuis | 12 |
92-237 |  | Path indexing for term retrieval | Graf | 12 |
92-237 |  | Path Indexing for Term Retrieval | Graf | 12 |
92-236 |  | Motel user manual | Hustadt, Nonnengart, Schmidt, Timm | 45 |
92-236 |  | Motel User Manual | Hustadt, Nonnengart, Schmidt, Timm | |
92-236 |  | Motel User Manual | Hustadt, Nonnengart, Schmidt, Timm |  |
92-233 |  | CLP($\cal PB$): A Meta-Interpreter in CLP($\cal R$) | Barth | 18 |
92-232 |  | Preprints of Proceedings of GWAI-92 | Ohlbach | 47 |
92-231 |  | Quantifier elimination in second-order predicate logic | Gabbay, Ohlbach | 18 |
92-230 |  | A recursion planning analysis of inductive completion | Barnett, Basin, Hesketh | 14 |
92-229 |  | Peirce algebras | Brink, Britz, Schmidt | 22 |
92-228 |  | First-order modal logic theorem proving and standard PROLOG | Nonnengart | 48 |
92-224 |  | Completeness of resolution and superposition calculi | Socher-Ambrosius | 9 |
92-219 |  | Unification and matching in Church's Original Lambda Calculus | Hustadt | 16 |
92-217 |  | An abstract interpretation algorithm for residuating logic programs | Hanus | 20 |
92-216 |  | First-order theorem proving modulo equations | Wertz | 108 |
92-214 |  | Experience with FS0 as a framework theory | Matthews, Smaill, Basin | 25 |
92-213 |  | Temporal logic: Mathematical foundations | Gabbay | 166 |
92-211 |  | Difference matching | Basin, Walsh | 12 |
92-209 |  | On correspondence between modal and classical logic: automated approach | Szalas | 17 |
92-207 |  | Semi-unification | Socher-Ambrosius | 10 |
92-206 |  | A goal oriented strategy based on completion | Socher-Ambrosius | 14 |
92-205 |  | Metalogical frameworks | Basin, Constable | 20 |
92-203 |  | On natural deduction in fixpoint logics | Szalas | 18 |
92-155 |  | Simple randomized algorithms for closest pair problems | Golin, Raman, Schwarz, Smid | 14 |
92-154 |  | Further results on generalized intersection searching problems: counting, reporting, and dynamization | Smid, Gupta, Janardan | 41 |
92-153 |  | Semi-dynamic maintenance of the width of a planar point set | Schwarz | 14 |
92-152 |  | Finding k points with a smallest enclosing square | Smid | 8 |
92-149 |  | Fast deterministic processor allocation | Hagerup | 11 |
92-145 | | not published | Hagerup, Mehlhorn, Munro |  |
92-143 |  | The influence of lookahead in competitive on-line algorithms | Albers | 56 |
92-141 |  | Waste makes haste: tight bounds for loose parallel sorting | Hagerup, Raman | 185 |
92-135 |  | Furthest site abstract Voronoi diagrams | Mehlhorn, Meiser, Rasch | 25 |
92-134 |  | Sequential and parallel algorithms for the k closest pairs problem | Lenhof, Smid | 18 |
92-127 |  | A lower bound for set intersection queries | Mehlhorn, Uhrig, Raman | 14 |
92-126 |  | Dynamic point location in general subdivisions | Baumgarten, Jung, Mehlhorn | 30 |
92-125 |  | A new lower bound technique for decision trees | Fleischer | 21 |
92-123 |  | The largest hyper-rectangle in a three dimensional orthogonal polyhedron | Krithivasan, Vanisree, Datta | 7 |
92-122 |  | A faster 11/6-approximation algorithm for the Steiner tree problem in graphs | Zelikovsky | 8 |
92-121 |  | Minimum base of weighted k polymatroid and Steiner tree problem | Zelikovsky | 9 |
92-120 |  | Separating the communication complexities of MOD m and MOD p circuits | Grolmusz | 16 |
92-118 |  | Enumerating the k closest pairs mechanically | Smid, Lenhof | 12 |
92-115 |  | Fast integer merging on the EREW PRAM | Hagerup, Kutylowski | 12 |
92-112 |  | Four results on randomized incremental constructions | Clarkson, Mehlhorn, Seidel | 21 |
92-110 |  | A method for obtaining randomized algorithms with small tail probalities | Alt, Guibas, Mehlhorn, Karp, Widgerson | 5 |
92-108 |  | Computing intersections and arrangements for red-blue curve segments in parallel | Rüb | 30 |
92-104 |  | Circuits and multi-party protocols | Grolmusz | 16 |
92-102 |  | Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity | Lenhof, Smid | 16 |
92-101 |  | A simple balanced search tree with 0(1) worst-case update time | Fleischer | 10 |
91-228 |  | A complete transformation system for polymorphic higher-order unification | Hustadt | 22 |
91-227 |  | Logic programming with pseudo-Boolean constraints | Bockmayr | 20 |
91-218 |  | A sorted logic using dynamic sorts | Weidenbach | 71 |
91-217 |  | Deduction systems based on resolution | Eisinger, Ohlbach | 68 |
91-216 |  | Algebraic terminological representation | Schmidt | 113 |
91-211 |  | Natural semantics and some of its meta-theory in Elf | Michaylov, Pfenning | 26 |
91-209 |  | Associative-commutative reduction orderings | Bachmair | 7 |
91-208 |  | Rewrite-based equational theorem proving with selection and simplification | Bachmair, Ganzinger | 24 |
91-126 |  | Optimal embedding of a toroidal mesh in a path | Paterson, Schröder, Sýkora, Vrto | 6 |
91-125 |  | Edge separators for graphs of bounded genus with applications | Sýkora, Vrto | 10 |
91-124 |  | On crossing numbers of hypercubes and cube connected cycles | Sýkora, Vrto | 6 |
91-123 |  | An optimal algorithm for the on-line closest-pair problem | Schwarz, Smid, Snoeyink | 11 |
91-122 |  | On embeddings in cycles | Hromkovic, Müller, Sýkora, Vrto | 22 |
91-121 |  | On a compaction theorem of ragde | Hagerup | 6 |
91-120 |  | An $O(n^3)$-time maximum-flow algorithm | Cheriyan, Hagerup, Mehlhorn | 30 |
91-115 |  | A lower bound for the nondeterministic space complexity of contextfree recognition | Alt, Geffert, Mehlhorn | 4 |
91-114 |  | Algorithms for dense graphs and networks | Cheriyan, Mehlhorn | 29 |
91-113 |  | Tail estimates for the space complexity of randomized incremantal algorithms | Mehlhorn, Sharir, Welzl | 8 |
91-112 |  | An optimal construction method for generalized convex layers | Lenhof, Smid | 25 |
91-110 |  | Approximate decision algorithms for point set congruence | Heffernan, Schirra | 25 |
91-107 |  | An O(n log n log log n) algorithm for the on-line closes pair problem | Schwarz, Smid | 21 |
91-106 |  | Fast parallel space allocation, estimation an integer sorting | Hagerup | 28 |
91-105 |  | Simultaneous inner and outer aproximation of shapes | Fleischer, Mehlhorn, Rote, Welzl | 24 |
91-104 |  | A tight lower bound for the worst case of bottom-up-heapsort | Fleischer | 13 |
91-103 |  | Maintaining the minimal distance of a point set in polylogarithmic time (revised version) | Smid | 17 |
91-102 |  | Range trees with slack parameter | Smid | 11 |
91-101 |  | Dynamic rectangular point location, with an application to the closest pair problem | Smid | 28 |