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

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 7. Library - 4. Category, Keywords

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Author/EditorYearTitleType
Show details for
approximation algorithm
Show details for AbacusAbacus
Show details for Above-Guarantee ParameterizationAbove-Guarantee Parameterization
Show details for absolute worst-case ratioabsolute worst-case ratio
Show details for abstract data typeabstract data type
Show details for Achlioptas processAchlioptas process
Show details for Ad-Hoc and Sensor NetworksAd-Hoc and Sensor Networks
Show details for adaptive granularity controladaptive granularity control
Show details for Adaptive SortingAdaptive Sorting
Show details for ADHOC networksADHOC networks
Show details for Advanced SearchAdvanced Search
Show details for Aerospace electronicsAerospace electronics
Show details for aerospace instrumentationaerospace instrumentation
Show details for Agebraic curvesAgebraic curves
Show details for Airline Crew SchedulingAirline Crew Scheduling
Show details for algebraic computation treealgebraic computation tree
Show details for Algebraic curvesAlgebraic curves
Show details for Algebraic ExtensionAlgebraic Extension
Show details for Algebraic GeometryAlgebraic Geometry
Show details for Algebraic KernelAlgebraic Kernel
Show details for algebraic surfacealgebraic surface
Show details for Algebraic surfacesAlgebraic surfaces
Show details for algorithmalgorithm
Show details for Algorithm EngineeringAlgorithm Engineering
Show details for algorithmic game theoryalgorithmic game theory
Show details for AlgorithmsAlgorithms
Show details for Algorithms and Data StructuresAlgorithms and Data Structures
Show details for Algorithms for compressed dataAlgorithms for compressed data
Show details for algorithms.algorithms.
Show details for AlgorithmusAlgorithmus
Show details for AmbiguityAmbiguity
Show details for Amortized AnalysisAmortized Analysis
Show details for AnalysisAnalysis
Show details for AND/OR precedence constraintsAND/OR precedence constraints
Show details for Angel and DevilAngel and Devil
Show details for Ant Colony OptimizationAnt Colony Optimization
Show details for Apex-Minor-Free GraphsApex-Minor-Free Graphs
Show details for approximateapproximate
Show details for approximate algorithmsapproximate algorithms
Show details for approximate arithmeticapproximate arithmetic
Show details for approximate string matchingapproximate string matching
Show details for ApproximationApproximation
Show details for Approximation AlgorithmApproximation Algorithm
Show details for Approximation algorithmsApproximation algorithms
Show details for ArchaeologyArchaeology
Show details for Archiving AlgorithmsArchiving Algorithms
Show details for arithmetic circuit complexityarithmetic circuit complexity
Show details for Arithmetic ProgressionsArithmetic Progressions
Show details for arrangementarrangement
Show details for ArrangementsArrangements
Show details for Art Gallery ProblemArt Gallery Problem
Show details for AssignmentAssignment
Show details for assignment problemassignment problem
Show details for asynchronous algorithmasynchronous algorithm
Show details for Average-case analysisAverage-case analysis
Show details for Average-Case ComplexityAverage-Case Complexity
Show details for average caseaverage case
Show details for Average Case AnalysisAverage Case Analysis
Show details for average search timeaverage search time
Show details for AVL-treesAVL-trees
Show details for BahncardBahncard
Show details for BALLBALL
Show details for bandwidth criterionbandwidth criterion
Show details for Baraff’s algorithmBaraff’s algorithm
Show details for BaumBaum
Show details for bendbend
Show details for Bernstein basisBernstein basis
Show details for Bézier curvesBézier curves
Show details for Bezout matrixBezout matrix
Show details for bin packingbin packing
Show details for binary comparison modelbinary comparison model
Show details for binary search treebinary search tree
Show details for binary treesbinary trees
Show details for Bio-inspired ComputationBio-inspired Computation
Show details for bipartite graphsbipartite graphs
Show details for Black-box complexityBlack-box complexity
Show details for black-box modelblack-box model
Show details for Bollobas-Eldridge conjectureBollobas-Eldridge conjecture
Show details for Bound-ConsistencyBound-Consistency
Show details for bounded-degree networkbounded-degree network
Show details for Bounded Ordered DictionariesBounded Ordered Dictionaries
Show details for Bounded Priority QueuesBounded Priority Queues
Show details for Box-decomposition treesBox-decomposition trees
Show details for BoxesBoxes
Show details for Branch-and-CutBranch-and-Cut
Show details for Branch and CutBranch and Cut
Show details for Branch & CutBranch & Cut
Show details for BroadcastBroadcast
Show details for broadcastingbroadcasting
Show details for Broadcasting in NetworksBroadcasting in Networks
Show details for bufferbuffer
Show details for B.7.2 [Integrated Circuits]: Design Aids-placement and routingB.7.2 [Integrated Circuits]: Design Aids-placement and routing
Show details for cachecache
Show details for CachingCaching
Show details for CADCAD
Show details for Cake cuttingCake cutting
Show details for Car DesignCar Design
Show details for Categories and Subject Descriptors: B.7. I [Integrated Circuits]: Types and Design Styles- VLSI (very large scCategories and Subject Descriptors: B.7. I [Integrated Circuits]: Types and Design Styles- VLSI (very large scale integration)
Show details for Categories and Subject Descriptors: F.I.2 [Computation by Abstract Devices]: Modes of Computation-- alternatioCategories and Subject Descriptors: F.I.2 [Computation by Abstract Devices]: Modes of Computation-- alternation and nondeterminism
Show details for certified computationcertified computation
Show details for Certifying Verification LEDA Isabelle VCCCertifying Verification LEDA Isabelle VCC
Show details for CGALCGAL
Show details for Chernoff boundsChernoff bounds
Show details for Chinese remainderingChinese remaindering
Show details for Chordal GraphsChordal Graphs
Show details for circuitscircuits
Show details for Claw-free graphsClaw-free graphs
Show details for CliqueClique
Show details for clusteringclustering
Show details for ClustersClusters
Show details for codescodes
Show details for Coefficient sign variationsCoefficient sign variations
Show details for collective communicationcollective communication
Show details for Collision DetectionCollision Detection
Show details for Collision responseCollision response
Show details for Colorful MotifColorful Motif
Show details for Comb graphsComb graphs
Show details for Combinatorial EnumerationCombinatorial Enumeration
Show details for combinatorial gamecombinatorial game
Show details for Combinatorial gamesCombinatorial games
Show details for Combinatorial OptimizationCombinatorial Optimization
Show details for Combinatorial problemsCombinatorial problems
Show details for combinatorial reconstructioncombinatorial reconstruction
Show details for combinatorial surface reconstructioncombinatorial surface reconstruction
Show details for combinatoricscombinatorics
Show details for CommunicationCommunication
Show details for CompactionCompaction
Show details for competitive analysiscompetitive analysis
Show details for complexitycomplexity
Show details for complexity classescomplexity classes
Show details for complexity of incremental algorithmscomplexity of incremental algorithms
Show details for Compressed membership problemCompressed membership problem
Show details for CompressionCompression
Show details for ComputabilityComputability
Show details for Computation GeometryComputation Geometry
Show details for computational and structural complexitycomputational and structural complexity
Show details for Computational BiologyComputational Biology
Show details for Computational Biology;Computational Biology;
Show details for Computational ChemistryComputational Chemistry
Show details for Computational complexityComputational complexity
Show details for computational complexity idealized parallel computerscomputational complexity idealized parallel computers
Show details for Computational GeometryComputational Geometry
Show details for computational modelscomputational models
Show details for Computational Molecular BiologyComputational Molecular Biology
Show details for computational topologycomputational topology
Show details for computer cartographycomputer cartography
Show details for Computer GraphicsComputer Graphics
Show details for Computer Programming--AlgorithmsComputer Programming--Algorithms
Show details for computer sciencecomputer science
Show details for Computer Science and Game TheoryComputer Science and Game Theory
Show details for ConicsConics
Show details for Conjunctive grammarsConjunctive grammars
Show details for Connected ComponentsConnected Components
Show details for Connected dominating setConnected dominating set
Show details for Connected Feedback Vertex SetConnected Feedback Vertex Set
Show details for Constant FactorsConstant Factors
Show details for constrained shortest pathconstrained shortest path
Show details for constrained shortest pathsconstrained shortest paths
Show details for constraint based simulationconstraint based simulation
Show details for Constraint ProgrammingConstraint Programming
Show details for Construction of the smallest grammarConstruction of the smallest grammar
Show details for Contention ResolutionContention Resolution
Show details for Context unificationContext unification
Show details for convex hullconvex hull
Show details for Cooperative gamesCooperative games
Show details for CoreCore
Show details for Cost FilteringCost Filtering
Show details for cost trade-offscost trade-offs
Show details for covariance matrix adaptationcovariance matrix adaptation
Show details for covering numbercovering number
Show details for Covering ProblemsCovering Problems
Show details for crossing minimizationcrossing minimization
Show details for CrossoverCrossover
Show details for cryptographycryptography
Show details for CUDACUDA
Show details for Curvature constraintCurvature constraint
Show details for curve in generic positioncurve in generic position
Show details for Curved ObjectsCurved Objects
Show details for Curved SurfacesCurved Surfaces
Show details for cycle basiscycle basis
Show details for cylindrical algebraic decompositioncylindrical algebraic decomposition
Show details for C++C++
Show details for d-dimensional meshd-dimensional mesh
Show details for d-factorsd-factors
Show details for Data CompressionData Compression
Show details for Data gatheringData gathering
Show details for Data miningData mining
Show details for Data ProcessingData Processing
Show details for Data Processing--Data StructuresData Processing--Data Structures
Show details for data structuredata structure
Show details for data structuresdata structures
Show details for Data Structures and AlgorithmsData Structures and Algorithms
Show details for DatenstrukturDatenstruktur
Show details for Davenport-Mahler boundDavenport-Mahler bound
Show details for Deadline MonotonicDeadline Monotonic
Show details for decision treedecision tree
Show details for Decrease-Key OperationDecrease-Key Operation
Show details for Deferred Data StructuresDeferred Data Structures
Show details for DegeneraciesDegeneracies
Show details for Degenerate graphsDegenerate graphs
Show details for degree sequencedegree sequence
Show details for Delaunay graphsDelaunay graphs
Show details for deletionsdeletions
Show details for depth-3depth-3
Show details for depth-4depth-4
Show details for derandomizationderandomization
Show details for Descartes' Rule of SignsDescartes' Rule of Signs
Show details for Descartes-Jacobi RuleDescartes-Jacobi Rule
Show details for Descartes methodDescartes method
Show details for Descartes rule of signsDescartes rule of signs
Show details for DesignDesign
Show details for Design of algorithmsDesign of algorithms
Show details for determinantsdeterminants
Show details for Deterministic AlgorithmsDeterministic Algorithms
Show details for Deterministic tree automatonDeterministic tree automaton
Show details for DFTDFT
Show details for diamond operatordiamond operator
Show details for DictionariesDictionaries
Show details for dictionary problemdictionary problem
Show details for diffusion load balancingdiffusion load balancing
Show details for Dijkstra's algorithmDijkstra's algorithm
Show details for dilation-costdilation-cost
Show details for dimension reductiondimension reduction
Show details for Directed Feedback Arc SetDirected Feedback Arc Set
Show details for directed Hamiltonian ringdirected Hamiltonian ring
Show details for DiscrepancyDiscrepancy
Show details for Discrepancy TheoryDiscrepancy Theory
Show details for discrete algorithm enginieeringdiscrete algorithm enginieering
Show details for discrete algorithmsdiscrete algorithms
Show details for Discrete GeometryDiscrete Geometry
Show details for Discrete OptimizationDiscrete Optimization
Show details for distancedistance
Show details for Distance ComputationDistance Computation
Show details for Distributed algorithmDistributed algorithm
Show details for distributed algorithmsdistributed algorithms
Show details for Division of choresDivision of chores
Show details for DockingDocking
Show details for Document ExpansionDocument Expansion
Show details for Dominating SetDominating Set
Show details for Dominator ColoringDominator Coloring
Show details for Double-Ended Priority QueuesDouble-Ended Priority Queues
Show details for Double RulingDouble Ruling
Show details for Doubling metricsDoubling metrics
Show details for Drift analysisDrift analysis
Show details for dualizationdualization
Show details for Dupin ring cyclideDupin ring cyclide
Show details for Dynamic algorithmsDynamic algorithms
Show details for Dynamic Computational GeometryDynamic Computational Geometry
Show details for dynamic deferred data structuringdynamic deferred data structuring
Show details for dynamic flowdynamic flow
Show details for dynamic network flowsdynamic network flows
Show details for dynamic reconfigurationdynamic reconfiguration
Show details for Dynamical SystemDynamical System
Show details for Earliest Deadline FirstEarliest Deadline First
Show details for earliest start scheduleearliest start schedule
Show details for Economic equilibriumEconomic equilibrium
Show details for EconomicsEconomics
Show details for EDFEDF
Show details for edge-disjoint pathsedge-disjoint paths
Show details for Edge coloringEdge coloring
Show details for edgesedges
Show details for Edmonds' AlgorithmEdmonds' Algorithm
Show details for efficient algor ithmsefficient algor ithms
Show details for efficient algorithmefficient algorithm
Show details for EffizienzEffizienz
Show details for elliptic curveselliptic curves
Show details for EmbeddingEmbedding
Show details for entropyentropy
Show details for EnumerationEnumeration
Show details for enumeration algorithmsenumeration algorithms
Show details for Enumeration problemsEnumeration problems
Show details for epidemic algorithmsepidemic algorithms
Show details for error-tolerant searcherror-tolerant search
Show details for ESA solar orbiter missionESA solar orbiter mission
Show details for Euler tourEuler tour
Show details for Eulerian CycleEulerian Cycle
Show details for Evolutionary AlgorithmEvolutionary Algorithm
Show details for Evolutionary AlgorithmsEvolutionary Algorithms
Show details for Evolutionary ComputationEvolutionary Computation
Show details for evolutionary strategyevolutionary strategy
Show details for Exact AlgorithmExact Algorithm
Show details for Exact AlgorithmsExact Algorithms
Show details for exact computationexact computation
Show details for exact geometric computationexact geometric computation
Show details for Exact Geometric ComputingExact Geometric Computing
Show details for EXACUSEXACUS
Show details for expansion-costexpansion-cost
Show details for expectationexpectation
Show details for ExperimentationExperimentation
Show details for ExperimentsExperiments
Show details for exponent of periodicityexponent of periodicity
Show details for external graph algorithmexternal graph algorithm
Show details for external memoryexternal memory
Show details for external memory algorithmexternal memory algorithm
Show details for external memory algorithmsexternal memory algorithms
Show details for external memoryJulyexternal memoryJuly
Show details for external priority queueexternal priority queue
Show details for ExternspeicherExternspeicher
Show details for extremal graph theoryextremal graph theory
Show details for E. I [Data]:E. I [Data]:
Data Structures--arrays
Show details for Face hitting setFace hitting set
Show details for Facility LocationFacility Location
Show details for factorizationfactorization
Show details for fast arithmeticfast arithmetic
Show details for fast matrix multiplicationfast matrix multiplication
Show details for fault-tolerancefault-tolerance
Show details for Feasibility TestFeasibility Test
Show details for feature vectorfeature vector
Show details for Feedback Vertex Set problemsFeedback Vertex Set problems
Show details for Fibonacci HeapsFibonacci Heaps
Show details for field programmable gate arraysfield programmable gate arrays
Show details for filterfilter
Show details for filter algorithmfilter algorithm
Show details for Filter AlgorithmsFilter Algorithms
Show details for Finite automataFinite automata
Show details for Fixed-Parameter TractabilityFixed-Parameter Tractability
Show details for Fixed parameter tractabilityFixed parameter tractability
Show details for Floating point arithmeticFloating point arithmetic
Show details for flow over timeflow over time
Show details for Forbidden minorsForbidden minors
Show details for forestforest
Show details for Forest ecosystem - Biodiversity - Ecological dispersal model - Forest simulation model - Approximation algoritForest ecosystem - Biodiversity - Ecological dispersal model - Forest simulation model - Approximation algorithms
Show details for Fourier AnalysisFourier Analysis
Show details for FPGAFPGA
Show details for frameworkframework
Show details for fringe analysisfringe analysis
Show details for full-text indexfull-text index
Show details for Full Steiner TreesFull Steiner Trees
Show details for funfun
Show details for fixed parameter tractabilityfixed parameter tractability
Show details for F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-routing and layoutF.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-routing and layout

General Terms: Design
Show details for F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerieal Algorithms and Problems--computations on dF.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerieal Algorithms and Problems--computations on discrete structures
Show details for F.2.3 [Analysis of Algolithms and Problem Complexity]: Trade-offs among Complexity MeasuresF.2.3 [Analysis of Algolithms and Problem Complexity]: Trade-offs among Complexity Measures
Show details for Galois ringsGalois rings
Show details for Game TheoryGame Theory
Show details for GamesGames
Show details for gapped q-gramsgapped q-grams
Show details for General MatchingGeneral Matching
Show details for Generating FunctionsGenerating Functions
Show details for generic graphsgeneric graphs
Show details for generic programminggeneric programming
Show details for Geographic Information SystemsGeographic Information Systems
Show details for geometric algorithmsgeometric algorithms
Show details for Geometric ComputationGeometric Computation
Show details for geometric computinggeometric computing
Show details for geometric configurationsgeometric configurations
Show details for Geometric Data StructuresGeometric Data Structures
Show details for geometric optimizationgeometric optimization
Show details for geometric roundinggeometric rounding
Show details for Geometric transversalsGeometric transversals
Show details for geometrygeometry
Show details for geometry kernelgeometry kernel
Show details for GirthGirth
Show details for Glivenko Kuroda Higher-order Logic classical intuitionistic intensional extensionalGlivenko Kuroda Higher-order Logic classical intuitionistic intensional extensional
Show details for Global ConstraintGlobal Constraint
Show details for Global ConstraintsGlobal Constraints
Show details for Global Multiprocessor SchedulingGlobal Multiprocessor Scheduling
Show details for GossipingGossiping
Show details for GPGPUGPGPU
Show details for Grammar-based compressionGrammar-based compression
Show details for graphgraph
Show details for Graph AlgorithmGraph Algorithm
Show details for Graph AlgorithmsGraph Algorithms
Show details for graph coloringgraph coloring
Show details for Graph DrawingGraph Drawing
Show details for Graph LabelingGraph Labeling
Show details for Graph LayoutGraph Layout
Show details for Graph Modification ProblemsGraph Modification Problems
Show details for graph partitioninggraph partitioning
Show details for Graph TheoryGraph Theory
Show details for Graphs with ConstraintsGraphs with Constraints
Show details for Greatest Common DivisorGreatest Common Divisor
Show details for Group Steiner TreeGroup Steiner Tree
Show details for GUI C++GUI C++
Show details for G.2 2 [Discrete Mathematics]: Graph Theory General Terms: AlgorithmsG.2 2 [Discrete Mathematics]: Graph Theory General Terms: Algorithms
Show details for Hamming metricHamming metric
Show details for hashinghashing
Show details for HeapsHeaps
Show details for heightheight
Show details for Hidden Line EliminationHidden Line Elimination
Show details for hidden line elimination problemhidden line elimination problem
Show details for High-Performance Parallel ComputingHigh-Performance Parallel Computing
Show details for history graphhistory graph
Show details for History of mathematicsHistory of mathematics
Show details for Hitting SetsHitting Sets
Show details for homotopic routinghomotopic routing
Show details for Homotopy continuationHomotopy continuation
Show details for Hop diameterHop diameter
Show details for Human FactorsHuman Factors
Show details for Hybrid methodsHybrid methods
Show details for Hyper-minimizationHyper-minimization
Show details for hypercubic and mesh networkhypercubic and mesh network
Show details for HypergraphHypergraph
Show details for Hypergraph TransversalsHypergraph Transversals
Show details for HypergraphsHypergraphs
Show details for Hypervolume IndicatorHypervolume Indicator
Show details for ideal theoryideal theory
Show details for identity testingidentity testing
Show details for implementationimplementation
Show details for in-approximabilityin-approximability
Show details for IncompressibilityIncompressibility
Show details for incremental algorithmincremental algorithm
Show details for incremental algorithmsincremental algorithms
Show details for incremental generation algorithmsincremental generation algorithms
Show details for Incremental polynomial timeIncremental polynomial time
Show details for Independent Feedback Vertex SetIndependent Feedback Vertex Set
Show details for independent setindependent set
Show details for indexingindexing
Show details for induced subgraphinduced subgraph
Show details for Inefficiency of EquilibriaInefficiency of Equilibria
Show details for Infinite gamesInfinite games
Show details for Information BrokerageInformation Brokerage
Show details for information retrievalinformation retrieval
Show details for insertionsinsertions
Show details for InstrumentsInstruments
Show details for integer divisioninteger division
Show details for Integer Linear ProgrammingInteger Linear Programming
Show details for Integer Linear ProgramsInteger Linear Programs
Show details for integer multiplicationinteger multiplication
Show details for Integer OptimizationInteger Optimization
Show details for integer programinteger program
Show details for Integer ProgrammingInteger Programming
Show details for Integer Programming Graph DrawingInteger Programming Graph Drawing
Show details for Interconnection NetworksInterconnection Networks
Show details for Internet RoutingInternet Routing
Show details for intersection computationintersection computation
Show details for interval arithmeticinterval arithmetic
Show details for InversionsInversions
Show details for IP networksIP networks
Show details for IrregularIrregular
Show details for Isooriented RectanglesIsooriented Rectangles
Show details for I.3.5 [ComputationalI.3.5 [Computational
Geometry and Object Modeling]: Curve
Show details for I/O KomplexitätI/O Komplexität
Show details for job shop schedulingjob shop scheduling
Show details for k-splittable flowk-splittable flow
Show details for k mismatches problemk mismatches problem
Show details for Kemeny AggregationKemeny Aggregation
Show details for Kernel lower boundsKernel lower bounds
Show details for KernelizationKernelization
Show details for Knapsack ProblemKnapsack Problem
Show details for Knapsack problem - Random instances - Experimental study - Pareto optimalityKnapsack problem - Random instances - Experimental study - Pareto optimality
Show details for KomplexitaetstheorieKomplexitaetstheorie
Show details for Kürzeste-Wege-BerechnungKürzeste-Wege-Berechnung
Show details for Language equationsLanguage equations
Show details for Latent Semantic IndexingLatent Semantic Indexing
Show details for latticelattice
Show details for latticeslattices
Show details for LayoutLayout
Show details for LectinsLectins
Show details for LEDALEDA
Show details for Levenshtein DistanceLevenshtein Distance
Show details for LibraryLibrary
Show details for limiting distributionlimiting distribution
Show details for line segmentsline segments
Show details for Line simplificationLine simplification
Show details for Linear complementarity problem (LCP)Linear complementarity problem (LCP)
Show details for linear programminglinear programming
Show details for linear systemslinear systems
Show details for List-RankingList-Ranking
Show details for List RankingList Ranking
Show details for Load BalancingLoad Balancing
Show details for load balancing random loadsload balancing random loads
Show details for Local algorithmLocal algorithm
Show details for Location FreenessLocation Freeness
Show details for lock-freelock-free
Show details for LoopsLoops
Show details for Lossy minimization.Lossy minimization.
Show details for LovLov
Show details for low-discrepancy point setslow-discrepancy point sets
Show details for lower boundlower bound
Show details for Lower EnvelopesLower Envelopes
Show details for LP relaxationLP relaxation
Show details for manifoldsmanifolds
Show details for Map LabelingMap Labeling
Show details for MappingMapping
Show details for Market EquilibriaMarket Equilibria
Show details for massive data setmassive data set
Show details for massive data setsmassive data sets
Show details for MastermindMastermind
Show details for matchingmatching
Show details for matchingsmatchings
Show details for Mathematical economicsMathematical economics
Show details for Mathematical Techniques--GeometryMathematical Techniques--Geometry
Show details for Mathematical Techniques--TreesMathematical Techniques--Trees
Show details for mathematicsmathematics
Show details for matrix multiplication.matrix multiplication.
Show details for matroidmatroid
Show details for Max-CutMax-Cut
Show details for max-min fairnessmax-min fairness
Show details for Maximal frequent setMaximal frequent set
Show details for maximum flowmaximum flow
Show details for maximum load deviationmaximum load deviation
Show details for maximum weight matchingmaximum weight matching
Show details for mean payoff gamesmean payoff games
Show details for membership queriesmembership queries
Show details for memory-restricted algorithmsmemory-restricted algorithms
Show details for memory hierarchymemory hierarchy
Show details for MengeMenge
Show details for MeshesMeshes
Show details for meshingmeshing
Show details for Meticulous AnalysisMeticulous Analysis
Show details for metric spacesmetric spaces
Show details for MIMDMIMD
Show details for Min-Max Priority QueuesMin-Max Priority Queues
Show details for MinimizationMinimization
Show details for Minimum Cycle BasisMinimum Cycle Basis
Show details for Minimum DiameterMinimum Diameter
Show details for Minimum Fill-InMinimum Fill-In
Show details for Mixed CriticalityMixed Criticality
Show details for Möbius transformationsMöbius transformations
Show details for Modified Uspensky methodModified Uspensky method
Show details for Modular ArithmeticModular Arithmetic
Show details for Molecular ModelingMolecular Modeling
Show details for momentsmoments
Show details for Monotone Boolean dualizationMonotone Boolean dualization
Show details for Monotone Boolean functionMonotone Boolean function
Show details for monotone discrete binary functionsmonotone discrete binary functions
Show details for monotone inequalitiesmonotone inequalities
Show details for Mordell-Weil groupMordell-Weil group
Show details for Motion PlanningMotion Planning
Show details for MSIMDMSIMD
Show details for Multi-Objective OptimizationMulti-Objective Optimization
Show details for multi mergemulti merge
Show details for multicommodity flowmulticommodity flow
Show details for multicore algorithmsmulticore algorithms
Show details for multicoresmulticores
Show details for Multiobjective OptimizationMultiobjective Optimization
Show details for multiple robotsmultiple robots
Show details for multipoint evaluationmultipoint evaluation
Show details for MultiprocessorMultiprocessor
Show details for multiprocessorsmultiprocessors
Show details for multithreaded computationsmultithreaded computations
Show details for multithreadingmultithreading
Show details for NarrowingNarrowing
Show details for natural adaptive networksnatural adaptive networks
Show details for natural algorithmnatural algorithm
Show details for nearest neighbor load balancing algorithmnearest neighbor load balancing algorithm
Show details for nearest neighborsnearest neighbors
Show details for network designnetwork design
Show details for Network flowNetwork flow
Show details for Network FlowsNetwork Flows
Show details for Network Routing GamesNetwork Routing Games
Show details for NetworksNetworks
Show details for noiseless codingnoiseless coding
Show details for non-trivial cyclesnon-trivial cycles
Show details for nonuniform deterministic simulationnonuniform deterministic simulation
Show details for Normal polynomialsNormal polynomials
Show details for NP-completenessNP-completeness
Show details for NP-hardNP-hard
Show details for numerical integrationnumerical integration
Show details for Numerical solverNumerical solver
Show details for Object ModelingObject Modeling
Show details for object oriented programmingobject oriented programming
Show details for observerobserver
Show details for On-line algorithmOn-line algorithm
Show details for on-line algorithmson-line algorithms
Show details for One-Sided Crossing MinimizationOne-Sided Crossing Minimization
Show details for One variable equationsOne variable equations
Show details for online algorithmonline algorithm
Show details for Online AlgorithmsOnline Algorithms
Show details for online processonline process
Show details for Operations ResearchOperations Research
Show details for optimal networksoptimal networks
Show details for OptimizationOptimization
Show details for optimization heuristicsoptimization heuristics
Show details for Optimization problemsOptimization problems
Show details for orthogonalorthogonal
Show details for output maximizationoutput maximization
Show details for packet switchingpacket switching
Show details for PagingPaging
Show details for Pairing HeapsPairing Heaps
Show details for ParallelParallel
Show details for parallel algorithm analysisparallel algorithm analysis
Show details for parallel algorithmsparallel algorithms
Show details for parallel backtrack searchparallel backtrack search
Show details for Parallel ComputationParallel Computation
Show details for Parallel ComputingParallel Computing
Show details for parallel disksparallel disks
Show details for Parallel linear algebra. Tridiagonal systems. Alternating direction implicit methodParallel linear algebra. Tridiagonal systems. Alternating direction implicit method
Show details for Parallel LoopParallel Loop
Show details for Parallel LoopsParallel Loops
Show details for parallel processingparallel processing
Show details for parallel RAMparallel RAM
Show details for parallel random permutationparallel random permutation
Show details for Parameterized AlgorithmsParameterized Algorithms
Show details for Parameterized ComplexityParameterized Complexity
Show details for Parametric SearchParametric Search
Show details for parametric searchingparametric searching
Show details for Parking FunctionsParking Functions
Show details for Partition treesPartition trees
Show details for Path planningPath planning
Show details for Pathwidth-One DeletionPathwidth-One Deletion
Show details for pattern matchingpattern matching
Show details for PerformancePerformance
Show details for Periodic Task SystemPeriodic Task System
Show details for Permutation RoutingPermutation Routing
Show details for PersistencePersistence
Show details for Persistent data structuresPersistent data structures
Show details for PerturbationPerturbation
Show details for PhysarumPhysarum
Show details for Planar AugmentationPlanar Augmentation
Show details for planar graphplanar graph
Show details for Planar GraphsPlanar Graphs
Show details for PlanarizationPlanarization
Show details for plottingplotting
Show details for Point locationPoint location
Show details for pointspoints
Show details for Polygon CoveringPolygon Covering
Show details for polygon partitioningpolygon partitioning
Show details for polygonspolygons
Show details for Polyhedral CombinatoricsPolyhedral Combinatorics
Show details for polyline fittingpolyline fitting
Show details for PolymatroidPolymatroid
Show details for polymatroid functionpolymatroid function
Show details for polymatroid functionspolymatroid functions
Show details for Polynomial-time approximation algorithmsPolynomial-time approximation algorithms
Show details for polynomial average time algorithmspolynomial average time algorithms
Show details for polynomial average time.polynomial average time.
Show details for polynomial divisionpolynomial division
Show details for Polynomial gcdPolynomial gcd
Show details for polynomial interpolationpolynomial interpolation
Show details for Polynomial KernelsPolynomial Kernels
Show details for Polynomial real root isolationPolynomial real root isolation
Show details for Polynomial systemsPolynomial systems
Show details for polynomial time approximation schemepolynomial time approximation scheme
Show details for posetposet
Show details for poset.poset.
Show details for positional gamepositional game
Show details for Power ControlPower Control
Show details for power of choicespower of choices
Show details for PRAMPRAM
Show details for PRAM SimulationPRAM Simulation
Show details for precedence constraintsprecedence constraints
Show details for precisionprecision
Show details for Precision ProblemPrecision Problem
Show details for preemptionpreemption
Show details for Preemptive SchedulingPreemptive Scheduling
Show details for PrefetchingPrefetching
Show details for prefix codesprefix codes
Show details for PreprocessingPreprocessing
Show details for Preprocessing HeuristicsPreprocessing Heuristics
Show details for price of anarchyprice of anarchy
Show details for Price of fairnessPrice of fairness
Show details for price of stabilityprice of stability
Show details for Primal-dual algorithms - Approximation algorithms - Min-sum scheduling problemsPrimal-dual algorithms - Approximation algorithms - Min-sum scheduling problems
Show details for Priority DequesPriority Deques
Show details for priority queuespriority queues
Show details for probabalistic analysisprobabalistic analysis
Show details for probabilistic analysis.probabilistic analysis.
Show details for probabilistic methodsprobabilistic methods
Show details for processing modulesprocessing modules
Show details for Processor Speedup FactorProcessor Speedup Factor
Show details for project schedulingproject scheduling
Show details for PropagationPropagation
Show details for Pursuit-evasionPursuit-evasion
Show details for Quadratic Interval RefinementQuadratic Interval Refinement
Show details for QuadricsQuadrics
Show details for QUASARQUASAR
Show details for quasi-polynomial timequasi-polynomial time
Show details for quasi-polynomial.quasi-polynomial.
Show details for Quasi-RandomnessQuasi-Randomness
Show details for QuasirandomnessQuasirandomness
Show details for query complexityquery complexity
Show details for Ramsey propertyRamsey property
Show details for Ramsey TheoryRamsey Theory
Show details for random access machinerandom access machine
Show details for random graphrandom graph
Show details for random graphsrandom graphs
Show details for random insertions and deletionsrandom insertions and deletions
Show details for random permutationrandom permutation
Show details for random planar graphs sampling enumerationrandom planar graphs sampling enumeration
Show details for Random StructuresRandom Structures
Show details for Random walkRandom walk
Show details for RandomizedRandomized
Show details for randomized algorithmrandomized algorithm
Show details for Randomized algorithmsRandomized algorithms
Show details for randomized load balancing algorithmrandomized load balancing algorithm
Show details for Randomized Local SearchRandomized Local Search
Show details for Randomized RoundingRandomized Rounding
Show details for Randomized search heuristicsRandomized search heuristics
Show details for Range searchingRange searching
Show details for rankrank
Show details for rank-maximalrank-maximal
Show details for Rapid PrototypingRapid Prototyping
Show details for Rapid Software PrototypingRapid Software Prototyping
Show details for ReadabilityReadability
Show details for Real-Time SchedulingReal-Time Scheduling
Show details for real algebraic numbersreal algebraic numbers
Show details for Real Root IsolationReal Root Isolation
Show details for realsreals
Show details for RecompressionRecompression
Show details for reconfiguration overheadreconfiguration overhead
Show details for rectangle packingrectangle packing
Show details for Recursion tree analysisRecursion tree analysis
Show details for redundant assignmentsredundant assignments
Show details for regression analysisregression analysis
Show details for regular discrete functionsregular discrete functions
Show details for regular discrete functions.regular discrete functions.
Show details for RelaxationRelaxation
Show details for Resource augmentationResource augmentation
Show details for Resource managementResource management
Show details for resultantsresultants
Show details for Rigid body simulationsRigid body simulations
Show details for roboticsrobotics
Show details for robustnessrobustness
Show details for rolling motionrolling motion
Show details for Root ApproximationRoot Approximation
Show details for root isolationroot isolation
Show details for root refinementroot refinement
Show details for root separationroot separation
Show details for Root separation boundsRoot separation bounds
Show details for Root SolvingRoot Solving
Show details for RotationRotation
Show details for RoutingRouting
Show details for Row-MajorRow-Major
Show details for Rumor SpreadingRumor Spreading
Show details for running time analysisrunning time analysis
Show details for Runtime AnalysisRuntime Analysis
Show details for Safety-Critical SystemsSafety-Critical Systems
Show details for SatisfiabilitySatisfiability
Show details for scenescene
Show details for SchedulabilitySchedulability
Show details for Schedulability testSchedulability test
Show details for SchedulingScheduling
Show details for scheduling algorithmsscheduling algorithms
Show details for scientific space instrumentscientific space instrument
Show details for search treesearch tree
Show details for search treessearch trees
Show details for searchingsearching
Show details for Second order unificationSecond order unification
Show details for secondary memorysecondary memory
Show details for SelectionSelection
Show details for Self-Adjusting StructuresSelf-Adjusting Structures
Show details for Semi-algebraic SetsSemi-algebraic Sets
Show details for semi-random graphssemi-random graphs
Show details for Semialgebraic geometrySemialgebraic geometry
Show details for Semidefinite ProgrammingSemidefinite Programming
Show details for sensor coversensor cover
Show details for separation boundseparation bound
Show details for separation boundsseparation bounds
Show details for Set associative cacheSet associative cache
Show details for set coverset cover
Show details for set cover polytopeset cover polytope
Show details for set equalityset equality
Show details for shape recognitionshape recognition
Show details for shared memoryshared memory
Show details for shortest-pathshortest-path
Show details for Shortest-PathsShortest-Paths
Show details for Shortest-Paths ProblemsShortest-Paths Problems
Show details for Shortest pathShortest path
Show details for Shortest PathsShortest Paths
Show details for SIMDSIMD
Show details for simplex algorithmsimplex algorithm
Show details for Simulated AnnealingSimulated Annealing
Show details for SimulationSimulation
Show details for single-source shortest-path problemsingle-source shortest-path problem
Show details for Single Source Shortest PathSingle Source Shortest Path
Show details for ski rental problemski rental problem
Show details for slime moldslime mold
Show details for sliversslivers
Show details for SLPSLP
Show details for small subgraphsmall subgraph
Show details for Smoothed analysisSmoothed analysis
Show details for smoothed analysis}smoothed analysis}
Show details for snap roundingsnap rounding
Show details for Snippet generationSnippet generation
Show details for Social Choice TheorySocial Choice Theory
Show details for Software LibrariesSoftware Libraries
Show details for software librarysoftware library
Show details for software reusesoftware reuse
Show details for solar orbiter PHI instrumentsolar orbiter PHI instrument
Show details for solidsolid
Show details for solving NP-hard problem instances to optimalitysolving NP-hard problem instances to optimality
Show details for SortierenSortieren
Show details for SortingSorting
Show details for sorting lower boundsorting lower bound
Show details for space curvesspace curves
Show details for Space vehiclesSpace vehicles
Show details for spanning treespanning tree
Show details for Sparse graphsSparse graphs
Show details for Sparse spannersSparse spanners
Show details for spectralspectral
Show details for Spectral RetrievalSpectral Retrieval
Show details for Spelling variantsSpelling variants
Show details for splinessplines
Show details for Sporadic task systemSporadic task system
Show details for Sporadic TasksSporadic Tasks
Show details for SPQR-treesSPQR-trees
Show details for square rootingsquare rooting
Show details for Stackelberg RoutingStackelberg Routing
Show details for star-discrepancystar-discrepancy
Show details for statisticsstatistics
Show details for Steiner ProblemSteiner Problem
Show details for Steiner treeSteiner tree
Show details for Steiner Tree ProblemSteiner Tree Problem
Show details for Steiner TreesSteiner Trees
Show details for STL LEDA Graphiterators Iterator Design PatternSTL LEDA Graphiterators Iterator Design Pattern
Show details for storage systemsstorage systems
Show details for streamingstreaming
Show details for streaming algorithmsstreaming algorithms
Show details for string matchingstring matching
Show details for string unificationstring unification
Show details for strip packingstrip packing
Show details for Strong -netsStrong -nets
Show details for Strongly Connected Component.Strongly Connected Component.
Show details for Structural AlignmentStructural Alignment
Show details for Sturm-Habicht sequenceSturm-Habicht sequence
Show details for subdivision simplificationsubdivision simplification
Show details for Subexponential-time AlgorithmsSubexponential-time Algorithms
Show details for submodular functionsubmodular function
Show details for SubresultantSubresultant
Show details for SuchbaumSuchbaum
Show details for SuchenSuchen
Show details for suffix arraysuffix array
Show details for Suffix Array ConstructionSuffix Array Construction
Show details for Sum of square rootsSum of square roots
Show details for suppressionssuppressions
Show details for surfacesurface
Show details for Surface analysisSurface analysis
Show details for surface reconstructionsurface reconstruction
Show details for SurfacesSurfaces
Show details for Sweep-line algorithmSweep-line algorithm
Show details for SweeplineSweepline
Show details for Symbolic–numeric algorithmsSymbolic–numeric algorithms
Show details for synchronizationsynchronization
Show details for system of loopssystem of loops
Show details for system of polymatroid inequalitiessystem of polymatroid inequalities
Show details for SystemsSystems
Show details for systems of inequalitiessystems of inequalities
Show details for task allocationtask allocation
Show details for Taylor shiftTaylor shift
Show details for Term rewritingTerm rewriting
Show details for terrain coveringterrain covering
Show details for Text IndexingText Indexing
Show details for TheoryTheory
Show details for Theory of Randomized Search HeuristicsTheory of Randomized Search Heuristics
Show details for thresholdthreshold
Show details for threshold acceptingthreshold accepting
Show details for time-varying access probabilitiestime-varying access probabilities
Show details for time boundtime bound
Show details for time forward processingtime forward processing
Show details for Topological OrderingTopological Ordering
Show details for topologytopology
Show details for topology computationtopology computation
Show details for Topology ControlTopology Control
Show details for ToriTori
Show details for torsion-grouptorsion-group
Show details for torustorus
Show details for Total completion timeTotal completion time
Show details for Total Edge CoverTotal Edge Cover
Show details for Total Vertex CoverTotal Vertex Cover
Show details for Touching distancesTouching distances
Show details for TransformationTransformation
Show details for Transveral hypergraphsTransveral hypergraphs
Show details for TransversalTransversal
Show details for transversal hypergraphtransversal hypergraph
Show details for Tree-grammarsTree-grammars
Show details for Tree compressionTree compression
Show details for tree decompositionstree decompositions
Show details for treestrees
Show details for TreewidthTreewidth
Show details for TRIESTRIES
Show details for Trunk PackingTrunk Packing
Show details for two-dimensional bin packingtwo-dimensional bin packing
Show details for Unary languagesUnary languages
Show details for UncertaintyUncertainty
Show details for UndecidabilityUndecidability
Show details for unequal letter costsunequal letter costs
Show details for unequal probabilitiesunequal probabilities
Show details for Unification AlgorithmsUnification Algorithms
Show details for union of ballsunion of balls
Show details for Union of CubesUnion of Cubes
Show details for Unit-Ball GraphUnit-Ball Graph
Show details for universal coveruniversal cover
Show details for universal hashinguniversal hashing
Show details for unsplittable flowunsplittable flow
Show details for Vertex Deletion ProblemsVertex Deletion Problems
Show details for virtual address translationvirtual address translation
Show details for visibilityvisibility
Show details for visible partsvisible parts
Show details for VisualizationVisualization
Show details for VLSI-theoryVLSI-theory
Show details for VLSI computationVLSI computation
Show details for Voronoi diagramVoronoi diagram
Show details for Voronoi DiagramsVoronoi Diagrams
Show details for wake considerationwake consideration
Show details for Weierstrass functionWeierstrass function
Show details for weighted bipartite matching problemweighted bipartite matching problem
Show details for Weighted MatchingWeighted Matching
Show details for Wind farm designWind farm design
Show details for wirelesswireless
Show details for wireless communicationwireless communication
Show details for Wireless LANsWireless LANs
Show details for Wireless networksWireless networks
Show details for Wireless Sensor NetworksWireless Sensor Networks
Show details for Word equationsWord equations
Show details for work-stealingwork-stealing
Show details for Worst-Case Execution TimesWorst-Case Execution Times
Show details for worst case ratioworst case ratio
Show details for Zigzag persistent homologyZigzag persistent homology
Show details for zufällige Graphenzufällige Graphen
Show details for $k$-Anonymity$k$-Anonymity
Show details for $k$-anonymous$k$-anonymous
Show details for (1+1)-EA(1+1)-EA
Show details for >> Categories and Subject Descriptors>> Categories and Subject Descriptors
F.2.2 [Nonnumerical Algorithms and Problems]: Geometrical
problems and computations
Hide details for (Not Categorized)(Not Categorized)
Abed, Fidaa
Huang, Chien-Chung
2012Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23
Proceedings Article
Abo-Hasna, Ziad1994Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes
Thesis - Master's thesis
Abraham, David
Cechlárová, Katarina
Manlove, David F.
Mehlhorn, Kurt
2004Attachment IconPareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15
Proceedings Article
Abraham, David
Irving, Robert W.
Mehlhorn, Kurt
Telikepalli, Kavitha
2005Attachment IconPopular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
Proceedings Article
Abraham, David J.
Cechlárová, Katarína
Manlove, David
Mehlhorn, Kurt
2005Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175
Proceedings Article
Abraham, David J.
Irving, Robert W.
Kavitha, Telikepalli
Mehlhorn, Kurt
2007Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Journal Article
Adamaszek, Anna
Wiese, Andreas
2013Approximation Schemes for Maximum Weight Independent Set of Rectangles
In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013),
Proceedings Article
Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold
2003Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Doerr, Carola
Larsen, Kasper Green
Mehlhorn, Kurt
2013The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11
Part of a Book
Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Green Larsen, Kasper
Mehlhorn, Kurt
Winzen, Carola
2012The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36
Electronic Journal Article
Agarwal, Amit
Agarwal, Tarun
Chopra, Sumit
Feldmann, Anja
Kammenhuber, Nils
Krysta, Piotr
Vöcking, Berthold
2003An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235
Proceedings Article
Agarwal, Pankaj
Arge, Lars
Brodal, Gerth Stølting
Vitter, Jeffrey Scott
1999I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20
Proceedings Article
Agrawal, Manindra
Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin
2012Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
Proceedings Article
Agrawal, Manindra
Saha, Chandan
Saxena, Nitin
2013A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article
Agrawal, Manindra
Saha, Chandan
Saxena, Nitin
2012Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
Electronic Journal Article
Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand
2005Attachment IconOn the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26
Proceedings Article
Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Srivastav, Anand
2004Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133
Journal Article
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1990Attachment IconFaster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223
Journal Article
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1988Faster Algorithms for the Shortest Path ProblemReport
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1988Faster Algorithms for the Shortest Path ProblemReport
Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Edo
van Zuylen, Anke
2012Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121
Journal Article
Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Noa
van Zuylen, Anke
2011Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36
Proceedings Article
Ajwani, Deepak2005Design, Implementation and Experimental Study of External Memory BFS Algorithms
Universität des Saarlandes
Thesis - Master's thesis
Ajwani, Deepak
Dementiev, Roman
Meyer, Ulrich
2006Attachment IconA computational study of external memory BFS algorithms
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 601-610
Proceedings Article
Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh
2012Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52
Journal Article
Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh
2007Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187
Proceedings Article
Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
Ray, Saurabh
2007Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear)
Proceedings Article
Ajwani, Deepak
Friedrich, Tobias
2010Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250
Journal Article
Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
2008An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14
Journal Article
Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
2006Attachment IconAn $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64
Proceedings Article
Ajwani, Deepak
Malinger, Itay
Meyer, Ulrich
Toledo, Sivan
2008Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219
Proceedings Article
Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly
2009Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307
Part of a Book
Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly
2007Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12
Proceedings Article
Ajwani, Deepak
Ray, Saurabh
Seidel, Raimund
Tiwary, Hans Raj
2007On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Proceedings Article
Akbari, Hoda
Berenbrink, Petra
Sauerwald, Thomas
2012A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280
Proceedings Article
Albers, Susanne1999Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473
Journal Article
Albers, Susanne1999Online-Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
Albers, Susanne1998A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109
Journal Article
Albers, Susanne1998Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693
Journal Article
Albers, Susanne1997Better Bounds for Online Scheduling
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 130-139
Proceedings Article
Albers, Susanne1997On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305
Journal Article
Albers, Susanne1995Improved randomized on-line algorithms for the list update problem
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 412-419
Proceedings Article
Albers, Susanne
Arora, Sanjeev
Khanna, Sanjeev
1999Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40
Proceedings Article
Albers, Susanne
Charikar, Moses
Mitzenmacher, Michael
1998On delayed information and action in on-line algorithms
In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS-98), 71-80
Proceedings Article
Albers, Susanne
Garg, Naveen
Leonardi, Stefano
2000Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986
Journal Article
Albers, Susanne
Garg, Naveen
Leonardi, Stefano
1998Minimizing stall time in single and parallel disk systems
In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), 454-462
Proceedings Article
Albers, Susanne
Hagerup, Torben
1997Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51
Journal Article
Albers, Susanne
Henzinger, Monika R.
1997Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425
Proceedings Article
Albers, Susanne
Koga, Hisashi
1998New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96
Journal Article
Albers, Susanne
Koga, Hisashi
1995Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158
Proceedings Article
Albers, Susanne
Kursawe, Klaus
1999Exploring unknown environments with obstacles
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 842-843
Proceedings Article
Albers, Susanne
Kursawe, Klaus
Schuierer, Sven
2002Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143
Journal Article
Albers, Susanne
Mitzenmacher, Michael
2000Average-Case Analyses of First Fit and Random Fit Bin Packing
In: Random Structures & Algorithms [16], 240 - 259
Journal Article
Albers, Susanne
Mitzenmacher, Michael
1998Average case analyses of First-Fit and Random-Fit bin packing
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 290-299
Proceedings Article
Albers, Susanne
Mitzenmacher, Michael
1998Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329
Journal Article
Albers, Susanne
Mitzenmacher, Michael
1997Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160
Journal Article
Albers, Susanne
Mitzenmacher, Michael
1996Average Case Analysis of List Update Algorithms, with Applications to Data Compression
In: Automata, Languages and Programming: 23rd International Colloquium (ICALP'96), 514-525
Proceedings Article
Albers, Susanne
von Stengel, Bernhard
Wechner, Ralph
1995A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139
Journal Article
Albers, Susanne
Westbrook, Jeffery
1998Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51
Part of a Book
Alberts, David
Cattaneo, G
Italiano, Giuseppe
Nanni, Umberto
Zaroliagis, Christos
1998A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136
Proceedings Article
Albrecht, Jung, Mehlhorn (ed.)1987Parallel algorithms and architectures (WPAA-87) : international workshopProceedings
Albrecht, Jung, Mehlhorn (ed.)1987Parallel algorithms and architectures : International WorkshopProceedings
Albrecht, Marc
Karrenbauer, Andreas
Xu, Chihao
2008A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289
Proceedings Article
Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch
Baumbach, Jan
2012Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764
Journal Article
Alefragis, Panayiotis
Goumopoulos, Christos
Sanders, Peter
Takkula, Tuomo
Wedelin, Dag
1998Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
Proceedings Article
Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine
2013A Framework for the Verification of Certifying ComputationsUnpublished/Draft
Alon, Noga
Bradford, Phillip Gnassi
Fleischer, Rudolf
1996Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127
Journal Article
Show details for Altenkamp, Doris
Mehlhorn, KurtAltenkamp, Doris
Mehlhorn, Kurt
1978Codes: Unequal Probabilities, Unequal Letter CostReport
Altenkamp, Doris
Mehlhorn, Kurt
1978Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25
Proceedings Article
Althaus, Ernst2001Curve Reconstruction and the Traveling Salesman Problem
Universität des Saarlandes
Thesis - Doctoral dissertation
Althaus, Ernst
Baumann, Tobias
Schömer, Elmar
Werth, Kai
2007Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Proceedings Article
Althaus, Ernst
Bockmayr, Alexander
Elf, Matthias
Kasper, Thomas
Jünger, Michael
Mehlhorn, Kurt
2002Attachment IconSCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
Proceedings Article
Show details for Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, AlexanderAlthaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander
2006Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299
Journal Article
Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander
2003Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894
Proceedings Article
Althaus, Ernst
Canzar, Stefan
2008A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154
Journal Article
Althaus, Ernst
Canzar, Stefan
2008LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498
Proceedings Article
Althaus, Ernst
Canzar, Stefan
2007A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278
Proceedings Article
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julian
2011Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361
Journal Article
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián
2008Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221
Proceedings Article
Althaus, Ernst
Canzar, Stefan
Emmett, Mark
Karrenbauer, Andreas
Marshall, Alan
Meyer-Bäse, Anke
Zhang, Huimin
2008Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277
Proceedings Article
Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut
2006Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425
Journal Article
Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut
2002Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics
In: Proceedings of the European Conference on Computational Biology (ECCB 2002), S4-S16
Proceedings Article
Althaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven
2003Attachment IconAn Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
Journal Article
Althaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven
2001An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824
Proceedings Article
Althaus, Ernst
Dumitriu, Daniel
2009Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50
Proceedings Article
Althaus, Ernst
Eisenbrand, Friedrich
Funke, Stefan
Mehlhorn, Kurt
2004Attachment IconPoint Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933
Proceedings Article
Althaus, Ernst
Fink, Christian
2002A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, 258-272
Proceedings Article
Althaus, Ernst
Karamanis, Nikiforos
Koller, Alexander
2004Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406
Proceedings Article
Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter
2002A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612
Journal Article
Althaus, Ernst
Kupilas, Joschka
Naujoks, Rouven
2011On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
In: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, 308-319
Proceedings Article
Althaus, Ernst
Mehlhorn, Kurt
2001Attachment IconTraveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66
Journal Article
Althaus, Ernst
Mehlhorn, Kurt
2000TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695
Proceedings Article
Althaus, Ernst
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
2000Attachment IconExperiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114
Electronic Proceedings Article
Althaus, Ernst
Naujoks, Rouven
2008Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288
Proceedings Article

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