 | Author/Editor | Year | | Title | Type | |
|---|
 | cache |
| |
|
| |
| CAD |
| |
|
| |
| Car Design |
| |
| Categories and Subject Descriptors: B.7. I [Integrated Circuits]: Types and Design Styles- VLSI (very large scale integration) |
| |
| Categories and Subject Descriptors: F.I.2 [Computation by Abstract Devices]: Modes of Computation-- alternation and nondeterminism |
| |
|
| |
| Certifying Verification LEDA Isabelle VCC |
| |
|
| |
| Chernoff bounds |
| |
|
| |
| Chordal Graphs |
| |
|
| |
| Claw-free graphs |
| |
|
| |
| clustering |
| |
|
| |
| codes |
| |
| Coefficient sign variations |
| |
| collective communication |
| |
|
| |
| Collision response |
| |
|
| |
| Comb graphs |
| |
| Combinatorial Enumeration |
| |
| combinatorial game |
| |
|
| |
| Combinatorial Optimization |
| |
|
| |
| combinatorial reconstruction |
| |
| combinatorial surface reconstruction |
| |
| combinatorics |
| |
|
| |
| Compaction |
| |
|
| |
| complexity |
| |
|
| |
| complexity of incremental algorithms |
| |
| Compressed membership problem |
| |
| Compression |
| |
|
| |
| Computation Geometry |
| |
| computational and structural complexity |
| |
| Computational Biology |
| |
|
| |
| Computational Chemistry |
| |
|
| |
| computational complexity idealized parallel computers |
| |
|
| |
| computational models |
| |
| Computational Molecular Biology |
| |
| computational topology |
| |
|
| |
| Computer Graphics |
| |
| Computer Programming--Algorithms |
| |
| computer science |
| |
| Computer Science and Game Theory |
| |
| Conics |
| |
|
| |
| Connected Components |
| |
|
| |
| Connected Feedback Vertex Set |
| |
|
| |
| constrained shortest path |
| |
| constrained shortest paths |
| |
| constraint based simulation |
| |
|
| |
| Construction of the smallest grammar |
| |
|
| |
| Context unification |
| |
|
| |
| Cooperative games |
| |
|
| |
| Cost Filtering |
| |
|
| |
| covariance matrix adaptation |
| |
|
| |
| Covering Problems |
| |
|
| |
| Crossover |
| |
|
| |
| CUDA |
| |
|
| |
| curve in generic position |
| |
|
| |
| Curved Surfaces |
| |
|
| |
| cylindrical algebraic decomposition |
| |
|
| |
| d-dimensional mesh |
| |
|
| |
| Data Compression |
| |
|
| |
| Data mining |
| |
|
| |
| Data Processing--Data Structures |
| |
|
| |
| data structures |
| |
| Data Structures and Algorithms |
| |
| Datenstruktur |
| |
|
| |
| Deadline Monotonic |
| |
|
| |
| Decrease-Key Operation |
| |
|
| |
| Degeneracies |
| |
|
| |
| degree sequence |
| |
|
| |
| deletions |
| |
|
| |
| depth-4 |
| |
|
| |
| Descartes' Rule of Signs |
| |
|
| |
| Descartes method |
| |
|
| |
| Design |
| |
|
| |
| determinants |
| |
|
| |
| Deterministic tree automaton |
| |
|
| |
| diamond operator |
| |
|
| |
| dictionary problem |
| |
|
| |
| Dijkstra's algorithm |
| |
|
| |
| dimension reduction |
| |
| Directed Feedback Arc Set |
| |
| directed Hamiltonian ring |
| |
|
| |
| Discrepancy Theory |
| |
| discrete algorithm enginieering |
| |
| discrete algorithms |
| |
|
| |
| Discrete Optimization |
| |
|
| |
| Distance Computation |
| |
|
| |
| distributed algorithms |
| |
|
| |
| Docking |
| |
|
| |
| Dominating Set |
| |
|
| |
| Double-Ended Priority Queues |
| |
|
| |
| Doubling metrics |
| |
|
| |
| dualization |
| |
|
| |
| Dynamic algorithms |
| |
| Dynamic Computational Geometry |
| |
| dynamic deferred data structuring |
| |
|
| |
| dynamic network flows |
| |
|
| |
| Dynamical System |
| |
|
| |
| earliest start schedule |
| |
|
| |
| Economics |
| |
|
| |
| edge-disjoint paths |
| |
|
| |
| edges |
| |
|
| |
| efficient algor ithms |
| |
|
| |
| Effizienz |
| |
|
| |
| Embedding |
| |
|
| |
| Enumeration |
| |
|
| |
| Enumeration problems |
| |
|
| |
| error-tolerant search |
| |
| ESA solar orbiter mission |
| |
| Euler tour |
| |
|
| |
| Evolutionary Algorithm |
| |
|
| |
| Evolutionary Computation |
| |
|
| |
| Exact Algorithm |
| |
|
| |
| exact computation |
| |
| exact geometric computation |
| |
| Exact Geometric Computing |
| |
|
| |
| expansion-cost |
| |
|
| |
| Experimentation |
| |
|
| |
| exponent of periodicity |
| |
|
| |
| external memory |
| |
| external memory algorithm |
| |
| external memory algorithms |
| |
|
| |
| external priority queue |
| |
|
| |
| extremal graph theory |
| |
| E. I [Data]:
Data Structures--arrays |
| |
| Face hitting set |
| |
|
| |
| factorization |
| |
|
| |
| fast matrix multiplication |
| |
|
| |
| Feasibility Test |
| |
|
| |
| Feedback Vertex Set problems |
| |
|
| |
| field programmable gate arrays |
| |
|
| |
| filter algorithm |
| |
|
| |
| Finite automata |
| |
| Fixed-Parameter Tractability |
| |
| Fixed parameter tractability |
| |
| Floating point arithmetic |
| |
| flow over time |
| |
|
| |
| forest |
| |
| Forest ecosystem - Biodiversity - Ecological dispersal model - Forest simulation model - Approximation algorithms |
| |
| Fourier Analysis |
| |
|
| |
| framework |
| |
|
| |
| full-text index |
| |
|
| |
| fun |
| |
| fixed parameter tractability |
| |
| F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-routing and layout
General Terms: Design |
| |
| F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerieal Algorithms and Problems--computations on discrete structures |
| |
| F.2.3 [Analysis of Algolithms and Problem Complexity]: Trade-offs among Complexity Measures |
| |
|
| |
| Game Theory |
| |
|
| |
| gapped q-grams |
| |
|
| |
| Generating Functions |
| |
|
| |
| generic programming |
| |
| Geographic Information Systems |
| |
| geometric algorithms |
| |
|
| |
| geometric computing |
| |
|
| |
| Geometric Data Structures |
| |
|
| |
| geometric rounding |
| |
|
| |
| geometry |
| |
|
| |
| Girth |
| |
| Glivenko Kuroda Higher-order Logic classical intuitionistic intensional extensional |
| |
| Global Constraint |
| |
|
| |
| Global Multiprocessor Scheduling |
| |
|
| |
| GPGPU |
| |
| Grammar-based compression |
| |
| graph |
| |
|
| |
| Graph Algorithms |
| |
|
| |
| Graph Drawing |
| |
|
| |
| Graph Layout |
| |
| Graph Modification Problems |
| |
| graph partitioning |
| |
|
| |
| Graphs with Constraints |
| |
|
| |
| Group Steiner Tree |
| |
|
| |
| G.2 2 [Discrete Mathematics]: Graph Theory General Terms: Algorithms |
| |
|
| |
| hashing |
| |
|
| |
| height |
| |
|
| |
| hidden line elimination problem |
| |
| High-Performance Parallel Computing |
| |
| history graph |
| |
|
| |
| Hitting Sets |
| |
|
| |
| Homotopy continuation |
| |
|
| |
| Human Factors |
| |
|
| |
| Hyper-minimization |
| |
| hypercubic and mesh network |
| |
| Hypergraph |
| |
|
| |
| Hypergraphs |
| |
|
| |
| ideal theory |
| |
|
| |
| implementation |
| |
|
| |
| Incompressibility |
| |
|
| |
| incremental algorithms |
| |
| incremental generation algorithms |
| |
| Incremental polynomial time |
| |
| Independent Feedback Vertex Set |
| |
| independent set |
| |
|
| |
| induced subgraph |
| |
| Inefficiency of Equilibria |
| |
| Infinite games |
| |
|
| |
| information retrieval |
| |
|
| |
| Instruments |
| |
|
| |
| Integer Linear Programming |
| |
|
| |
| integer multiplication |
| |
|
| |
| integer program |
| |
|
| |
| Integer Programming Graph Drawing |
| |
|
| |
| Internet Routing |
| |
|
| |
| interval arithmetic |
| |
|
| |
| IP networks |
| |
|
| |
| Isooriented Rectangles |
| |
| I.3.5 [Computational
Geometry and Object Modeling]: Curve |
| |
| I/O Komplexität |
| |
|
| |
| k-splittable flow |
| |
|
| |
| Kemeny Aggregation |
| |
|
| |
| Kernelization |
| |
|
| |
| Knapsack problem - Random instances - Experimental study - Pareto optimality |
| |
|
| |
| Kürzeste-Wege-Berechnung |
| |
|
| |
| Latent Semantic Indexing |
| |
|
| |
| lattices |
| |
|
| |
| Lectins |
| |
|
| |
| Levenshtein Distance |
| |
|
| |
| limiting distribution |
| |
|
| |
| Line simplification |
| |
| Linear complementarity problem (LCP) |
| |
| linear programming |
| |
|
| |
| List-Ranking |
| |
|
| |
| Load Balancing |
| |
| load balancing random loads |
| |
| Local algorithm |
| |
|
| |
| lock-free |
| |
|
| |
| Lossy minimization. |
| |
|
| |
| low-discrepancy point sets |
| |
|
| |
| Lower Envelopes |
| |
|
| |
| manifolds |
| |
|
| |
| Mapping |
| |
|
| |
| massive data set |
| |
|
| |
| Mastermind |
| |
|
| |
| matchings |
| |
|
| |
| Mathematical Techniques--Geometry |
| |
| Mathematical Techniques--Trees |
| |
| mathematics |
| |
|
| |
| matroid |
| |
|
| |
| max-min fairness |
| |
|
| |
| maximum flow |
| |
|
| |
| maximum weight matching |
| |
|
| |
| membership queries |
| |
| memory-restricted algorithms |
| |
| memory hierarchy |
| |
|
| |
| Meshes |
| |
|
| |
| Meticulous Analysis |
| |
|
| |
| MIMD |
| |
|
| |
| Minimization |
| |
|
| |
| Minimum Diameter |
| |
|
| |
| Mixed Criticality |
| |
|
| |
| Modified Uspensky method |
| |
|
| |
| Molecular Modeling |
| |
|
| |
| Monotone Boolean dualization |
| |
| Monotone Boolean function |
| |
| monotone discrete binary functions |
| |
|
| |
| Mordell-Weil group |
| |
|
| |
| MSIMD |
| |
| Multi-Objective Optimization |
| |
| multi merge |
| |
|
| |
| multicore algorithms |
| |
|
| |
| Multiobjective Optimization |
| |
|
| |
| multipoint evaluation |
| |
|
| |
| multiprocessors |
| |
| multithreaded computations |
| |
| multithreading |
| |
|
| |
| natural adaptive networks |
| |
|
| |
| nearest neighbor load balancing algorithm |
| |
|
| |
| network design |
| |
|
| |
| Network Flows |
| |
|
| |
| Networks |
| |
|
| |
| non-trivial cycles |
| |
| nonuniform deterministic simulation |
| |
| Normal polynomials |
| |
|
| |
| NP-hard |
| |
|
| |
| Numerical solver |
| |
|
| |
| object oriented programming |
| |
|
| |
| On-line algorithm |
| |
|
| |
| One-Sided Crossing Minimization |
| |
|
| |
| online algorithm |
| |
|
| |
| online process |
| |
|
| |
| optimal networks |
| |
|
| |
| optimization heuristics |
| |
|
| |
| orthogonal |
| |
|
| |
| packet switching |
| |
|
| |
| Pairing Heaps |
| |
|
| |
| parallel algorithm analysis |
| |
|
| |
| parallel backtrack search |
| |
|
| |
| Parallel Computing |
| |
|
| |
| Parallel linear algebra. Tridiagonal systems. Alternating direction implicit method |
| |
|
| |
| Parallel Loops |
| |
|
| |
| parallel RAM |
| |
| parallel random permutation |
| |
| Parameterized Algorithms |
| |
|
| |
| Parametric Search |
| |
|
| |
| Parking Functions |
| |
|
| |
| Path planning |
| |
|
| |
| pattern matching |
| |
|
| |
| Periodic Task System |
| |
|
| |
| Persistence |
| |
| Persistent data structures |
| |
| Perturbation |
| |
|
| |
| Planar Augmentation |
| |
|
| |
| Planar Graphs |
| |
|
| |
| plotting |
| |
|
| |
| points |
| |
|
| |
| polygon partitioning |
| |
|
| |
| Polyhedral Combinatorics |
| |
|
| |
| Polymatroid |
| |
|
| |
| polymatroid functions |
| |
| Polynomial-time approximation algorithms |
| |
| polynomial average time algorithms |
| |
|
| |
| polynomial division |
| |
|
| |
| polynomial interpolation |
| |
|
| |
| Polynomial real root isolation |
| |
|
| |
| polynomial time approximation scheme |
| |
|
| |
| poset. |
| |
|
| |
| Power Control |
| |
|
| |
| PRAM |
| |
|
| |
| precedence constraints |
| |
|
| |
| Precision Problem |
| |
|
| |
| Preemptive Scheduling |
| |
|
| |
| prefix codes |
| |
|
| |
| Preprocessing Heuristics |
| |
|
| |
| Price of fairness |
| |
|
| |
| Primal-dual algorithms - Approximation algorithms - Min-sum scheduling problems |
| |
|
| |
| priority queues |
| |
|
| |
| probabilistic analysis. |
| |
|
| |
| processing modules |
| |
|
| |
| project scheduling |
| |
|
| |
| Pursuit-evasion |
| |
| Quadratic Interval Refinement |
| |
| Quadrics |
| |
|
| |
| quasi-polynomial time |
| |
|
| |
| Quasi-Randomness |
| |
|
| |
| query complexity |
| |
|
| |
| Ramsey Theory |
| |
|
| |
| random graph |
| |
|
| |
| random insertions and deletions |
| |
|
| |
| random planar graphs sampling enumeration |
| |
|
| |
| Random walk |
| |
|
| |
| randomized algorithm |
| |
|
| |
| randomized load balancing algorithm |
| |
|
| |
| Randomized Rounding |
| |
| Randomized search heuristics |
| |
| Range searching |
| |
|
| |
| rank-maximal |
| |
|
| |
| Rapid Software Prototyping |
| |
|
| |
| Real-Time Scheduling |
| |
|
| |
| Real Root Isolation |
| |
|
| |
| Recompression |
| |
|
| |
| rectangle packing |
| |
|
| |
| redundant assignments |
| |
|
| |
| regular discrete functions |
| |
| regular discrete functions. |
| |
| Relaxation |
| |
|
| |
| Resource management |
| |
|
| |
| Rigid body simulations |
| |
|
| |
| robustness |
| |
|
| |
| Root Approximation |
| |
|
| |
| root refinement |
| |
|
| |
| Root separation bounds |
| |
|
| |
| Rotation |
| |
|
| |
| Row-Major |
| |
|
| |
| running time analysis |
| |
|
| |
| Safety-Critical Systems |
| |
|
| |
| scene |
| |
|
| |
| Schedulability test |
| |
|
| |
| scheduling algorithms |
| |
| scientific space instrument |
| |
| search tree |
| |
|
| |
| searching |
| |
|
| |
| secondary memory |
| |
|
| |
| Self-Adjusting Structures |
| |
|
| |
| semi-random graphs |
| |
|
| |
| Semidefinite Programming |
| |
|
| |
| separation bound |
| |
|
| |
| Set associative cache |
| |
|
| |
| set cover polytope |
| |
|
| |
| shape recognition |
| |
|
| |
| shortest-path |
| |
|
| |
| Shortest-Paths Problems |
| |
|
| |
| Shortest Paths |
| |
|
| |
| simplex algorithm |
| |
|
| |
| Simulation |
| |
| single-source shortest-path problem |
| |
| Single Source Shortest Path |
| |
|
| |
| slime mold |
| |
|
| |
| SLP |
| |
|
| |
| Smoothed analysis |
| |
|
| |
| snap rounding |
| |
|
| |
| Social Choice Theory |
| |
|
| |
| software library |
| |
|
| |
| solar orbiter PHI instrument |
| |
|
| |
| solving NP-hard problem instances to optimality |
| |
|
| |
| Sorting |
| |
|
| |
| space curves |
| |
|
| |
| spanning tree |
| |
|
| |
| Sparse spanners |
| |
|
| |
| Spectral Retrieval |
| |
|
| |
| splines |
| |
|
| |
| Sporadic Tasks |
| |
|
| |
| square rooting |
| |
|
| |
| star-discrepancy |
| |
|
| |
| Steiner Problem |
| |
|
| |
| Steiner Tree Problem |
| |
|
| |
| STL LEDA Graphiterators Iterator Design Pattern |
| |
|
| |
| streaming |
| |
|
| |
| string matching |
| |
|
| |
| strip packing |
| |
|
| |
| Strongly Connected Component. |
| |
|
| |
| Sturm-Habicht sequence |
| |
| subdivision simplification |
| |
| Subexponential-time Algorithms |
| |
|
| |
| Subresultant |
| |
|
| |
| Suchen |
| |
|
| |
| Suffix Array Construction |
| |
|
| |
| suppressions |
| |
|
| |
| Surface analysis |
| |
|
| |
| Surfaces |
| |
|
| |
| Sweepline |
| |
| Symbolic–numeric algorithms |
| |
| synchronization |
| |
|
| |
| system of polymatroid inequalities |
| |
|
| |
| systems of inequalities |
| |
|
| |
| Taylor shift |
| |
|
| |
| terrain covering |
| |
|
| |
| Theory |
| |
| Theory of Randomized Search Heuristics |
| |
| threshold |
| |
|
| |
| time-varying access probabilities |
| |
|
| |
| time forward processing |
| |
|
| |
| topology |
| |
|
| |
| Topology Control |
| |
|
| |
| torsion-group |
| |
|
| |
| Total completion time |
| |
|
| |
| Total Vertex Cover |
| |
|
| |
| Transformation |
| |
|
| |
| Transversal |
| |
|
| |
| Tree-grammars |
| |
|
| |
| tree decompositions |
| |
|
| |
| Treewidth |
| |
|
| |
| Trunk Packing |
| |
| two-dimensional bin packing |
| |
| Unary languages |
| |
|
| |
| Undecidability |
| |
|
| |
| unequal probabilities |
| |
|
| |
| union of balls |
| |
|
| |
| Unit-Ball Graph |
| |
|
| |
| universal hashing |
| |
|
| |
| Vertex Deletion Problems |
| |
| virtual address translation |
| |
| visibility |
| |
|
| |
| Visualization |
| |
|
| |
| VLSI computation |
| |
|
| |
| Voronoi Diagrams |
| |
|
| |
| Weierstrass function |
| |
| weighted bipartite matching problem |
| |
| Weighted Matching |
| |
|
| |
| wireless |
| |
|
| |
| Wireless LANs |
| |
|
| |
| Wireless Sensor Networks |
| |
|
| |
| work-stealing |
| |
| Worst-Case Execution Times |
| |
| worst case ratio |
| |
| Zigzag persistent homology |
| |
| zufällige Graphen |
| |
|
| |
| $k$-anonymous |
| |
|
| |
| >> Categories and Subject Descriptors
F.2.2 [Nonnumerical Algorithms and Problems]: Geometrical
problems and computations |
| |
|
| |
