scientific article; zbMATH DE number 3261634
From MaRDI portal
Publication:5547602
Cited in
(30)- Region-fault tolerant geometric spanners
- Construction of universal enumerators and formulas for threshold functions
- Lower bounds for the size of expressions for certain functions in d-ary logic
- An information-theoretic method in combinatorial theory
- The covering problem of complete uniform hypergraphs
- Directed monotone contact networks for threshold functions
- Kolmogorov complexity arguments in combinatorics
- \(\Sigma\Pi\Sigma\) threshold formulas
- Better lower bounds for monotone threshold formulas
- A generalization of the Bollobás set pairs inequality
- Beating Fredman-Komlós for perfect \(k\)-hashing
- Bipartite Hansel results for hypergraphs
- New bounds for perfect \(k\)-hashing
- On the optimality of Bellman-Ford-Moore shortest path algorithm
- On the Power of the Semi-Separated Pair Decomposition
- On the Decomposition of Graphs
- Pi-sigma-pi threshold formulas
- On covering numbers, Young diagrams, and the local dimension of posets
- Beating Fredman-Komlós for Perfect k-Hashing.
- Limitations of incremental dynamic programming
- On minimal coverings of the Boolean cube by centered antichains
- Geometric spanners for weighted point sets
- Homogeneous formulas and symmetric polynomials
- Bounds for \(c\)-ideal hashing
- Separating path systems of almost linear size
- A lower bound on the monotone switching complexity of the threshold function \(T_n^{n-1}\)
- Support testing in the huge object model
- Asymptotic behavior of the chromatic index for hypergraphs
- Separating systems and oriented graphs of diameter two
- On separating systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5547602)
