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

D

---

• d-to-1 conjecture
• dag-like communication
• daptive chosen ciphertext security
• Data Compression
• Data Possession
• data processing inequality
• data stream algorithms
• data streaming
• data streams
• data structures
• Data Structures for Boolean Functions
• Data Structures, Online Algorithms, Sequential Search, Competitive Analysis
• data-independent automata
• Datalog
• datastream
• daul BCH codes
• Davis-Putnam resolution
• DDH
• DDH assumption
• de Bruijn
• De Morgan Formula
• de Morgan formulas
• de Rham
• De-Randomization
• debuging
• decidability
• decidable languages
• Decision lists
• decision making under uncertainity
• Decision Tree
• decision tree complexity
• Decision Tree Complexity, Fractional Block Sensitivity, Sensitivity, Approximate Degree
• decision tree)
• decision trees
• Decision-making under uncertainty
• decision-tree complexity
• decisional Diffie-Hellman
• decoding
• Decoding algorithms
• decoherence
• decomposition
• Decomposition Theorems
• Deduction Theorem
• deficiency
• definable languages
• Defining Equations
• degenerated graphs
• Degree structure
• degree
• degree bound in graph
• degree-bounded minimum spanning forests
• Degree-d Chow Parameters
• degrees
• Delegating Computations
• Delegation
• deletion codes
• delta distance
• delta matroids
• delta-matroid intersection
• delta-matroid parity
• Demi-bits
• deMorgan Formula
• deMorgan formulas
• Dense and Non-Dense Weighted Instances
• Dense Graphs
• Dense Instances
• Dense k-Partite Instances
• Densest k-subgraph
• density
• dependency schemes
• depth
• depth 3
• depth 3 arithmetic circuit
• Depth 3 arithmetic circuits
• Depth 3 Circuits
• depth 3 or 4
• Depth 4 arithmetic circuits
• depth complexity
• Depth Four
• depth four arithmetic circuits
• depth irreducibility hypothesis
• Depth Lower bound
• Depth Lower bounds
• Depth reduction
• depth reductions
• depth separation
• Depth Three
• Depth Three Circuit
• depth three circuits
• Depth Two Circuits Having Arbitary Symmetric Gates in the Bottom Level
• depth-$3$ circuits
• depth-2 circuits
• depth-2 threshold circuits
• depth-3
• Depth-3 arithmetic circuits
• depth-3 circuit
• depth-3 circuits
• depth-3 diagonal circuit
• depth-3 multilinear
• depth-4
• depth-4 circuits
• Depth-4 formula
• Depth-First Search
• depth-reduction
• depth-three Boolean circuits
• deradomization
• derandomization
• derandomized squaring
• derivatives
• descripitive complexity
• descriptional complexity
• descriptive complexity
• design
• design matrix
• Design polynomials
• designing linear classifiers
• designs
• DET
• determinant
• determinant computation
• determinant equivalence test
• determinantal complexity
• determinism
• deterministic
• Deterministic Algorithm
• deterministic algorithms
• Deterministic Amplification
• deterministic approximate counting
• Deterministic Construction
• Deterministic Extractor
• Deterministic Extractors
• Deterministic Isolation
• Deterministic Logspace
• Deterministic Transitive Closure Logic
• DFAs
• DFT
• diagonal
• diagonalization
• dichotomy
• dichotomy results
• Dichotomy theorem
• Dictatorship tesing
• Dictatorship test
• Dictatorship testing
• Dictatorship Tests
• dictionary
• difference matrix
• difference ramification
• difference-of-Gaussian units
• Differential Equations
• differential privacy
• Diffie--Hellman key
• Diffie-Hellman
• Diffie-Hellman Assumption
• Diffie-Hellman key
• Diffie-Hellman problem
• Digital signatures
• Dimension
• dimension complexity
• dimension expanders
• dimension reduction
• Diophantine Equations
• diophantine linear equations
• Direct product
• Direct Product Lemma
• Direct Product Problems
• Direct Product Test
• direct product testing
• direct product theorem
• direct product theorems
• direct product, testing, PCPs
• direct products
• direct sum
• Direct Sum and Product Conjectures
• Direct Sum Conjecture
• direct sum problems
• Direct Sum Test
• direct sum theorems
• Direct sums
• Direct-product Theorem
• directed
• Directed graphs
• directed acyclic graph
• directed acyclic graphs
• directed cacti
• Directed Networks
• directed reachability
• directional derivatives
• Discrepancy
• Discrepancy method
• discrete central limit theorems
• discrete dynamical systems
• Discrete Fourier Analysis
• discrete gaussian sampling
• discrete Hopfield networks
• Discrete logarithm
• Discrete Logarithm Problem
• discrete memoryless channels
• Discrete Perturbations
• Discrete Torus
• discrete uncertainty principles
• discriminant
• Disjoint NP pairs
• disjoint NP-pair
• disjoint NP-pairs
• Disjoint path problems
• Disjoint paths
• disjointness
• disjunctive normal form
• Disjunctive Normal Forms
• Disk covering
• Disk graph
• disperser
• Dispersers
• dispersion of mass
• dissection
• Distance
• distance amplification
• distance estimation
• Distance Estimators
• Distinct Elements Problem
• distinguishers
• distinguishing compleixty
• Distinguishing Complexity
• distortion
• Distributed algorithms
• distributed computing
• distributed databases
• distributed intrusion detection
• Distributed market dynamics
• Distributed matchings
• distributed memory machine
• Distributed Memory Machines
• distributed networks
• Distributed Oblivious RAM
• distributed sketching
• distribution
• distribution learning
• Distribution Support Size Estimation
• distribution testing
• distribution testing, property testing
• Distribution-free learning
• Distribution-free testing
• distribution-independent
• Distributional and randomized communication complexity
• Distributional communication complexity
• distributional NP search problems
• Distributions
• divisibility testing
• Division
• Division elimination
• DLOGTIME
• dlogtime uniformity
• DLOGTIME-uniformity
• DNF
• DNF formulas
• DNF minimization
• DNF Resolution
• DNF sparsification
• DNF-resolution
• Domain Extension
• Domain Reduction
• domatic number problem
• Dominating Set
• dominating set problem
• domination
• dot-depth
• dot-depth hierarchy
• doubly-efficient
• downward self-reducibility
• Downward-closed
• DPLL
• DPLL algorithms
• DPP
• DQBF
• DQC1
• Dual BCH Codes
• Dual codes
• dual lattice
• dual polynomials
• dual weak pigeonhole principle
• dual-ascent
• Duality
• Duality gap
• dynamic
• Dynamic cell-probe lower bounds
• Dynamic Connectivity
• dynamic data structures
• dynamic graph algorithms
• dynamic process graphs
• dynamic programming

---

ISSN 1433-8092 | Imprint