scientific article; zbMATH DE number 53883
From MaRDI portal
Publication:4004078
Recommendations
Cited in
(only showing first 100 items - show all)- On the spectrum of projective norm-graphs
- Random constructions and density results
- Finding occurrences of protein complexes in protein-protein interaction graphs
- Broadcasting in dynamic radio networks
- Bipartite Ramsey numbers involving large \(K_{n,n}\)
- The SAT-UNSAT transition for random constraint satisfaction problems
- On a random graph evolving by degrees
- Bipartite dimensions and bipartite degrees of graphs
- Progressions in sequences of nearly consecutive integers
- A useful elementary correlation inequality. II
- Covering cubes by random half cubes, with applications to binary neural networks
- 2-partition-transitive tournaments
- Near-optimal, distributed edge colouring via the nibble method
- The parallel complexity of approximating the high degree subgraph problem
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem
- Zero knowledge and the chromatic number
- Approximating hyper-rectangles: Learning and pseudorandom sets
- Random Sidon sequences
- On a graph colouring problem
- The space complexity of approximating the frequency moments
- Extracting randomness: A survey and new constructions
- A strengthening of Brooks' theorem
- Signed domination in regular graphs and set-systems
- Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs
- The independence number of graphs in terms of degrees
- On sparse approximations to randomized strategies and convex combinations
- Randomization, derandomization and antirandomization: Three games
- Approximations for the maximum acyclic subgraph problem
- A probabilistic lower bound on the independence number of graphs
- A problem of Füredi and Seymour on covering intersecting families by pairs
- Random walks supported on random points of Z/nZ
- From Erdős to algorithms
- Independent sets in graphs with triangles
- More on BPP and the polynomial-time hierarchy
- A bound on the strong chromatic index of a graph
- On nearest-neighbor graphs
- Fractional v. integral covers in hypergraphs of bounded edge size
- Hypergraph colouring and the Lovász local lemma
- On the Ramsey number \(r(H+\overline{K_ n},K_ n)\)
- Efficient massively parallel implementation of some combinatorial algorithms
- Nearly perfect matchings in regular simple hypergraphs
- Improved upper bounds for approximation by zonotopes
- The complexity of parallel prefix problems on small domains
- The abstract lace expansion
- On embedding expanders into \(\ell_p\) spaces
- Constructive bounds for a Ramsey-type problem
- Ramsey properties of random hypergraphs
- Rounding algorithms for covering problems
- The local density of triangle-free graphs
- A lower bound for irredundant Ramsey numbers
- Optimal bounds for the approximation of Boolean functions and some applications
- Probabilistic existence theorems in group testing
- Bounded size components -- partitions and transversals.
- Distributed broadcast in radio networks of unknown topology.
- Constant time parallel sorting: An empirical view.
- Partitioning into graphs with only small components
- Two sensitivity theorems in fuzzy integer programming.
- Roman domination in graphs.
- Distinguishing string selection problems.
- Reroute sequence planning in telecommunication networks and compact vector summation.
- Efficient decomposition of separable algebras.
- Coloring graphs with sparse neighborhoods
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Maximum antichains in random subsets of a finite set
- Cellular telephone networks and random maps in hypergraphs
- Inferring evolutionary trees with strong combinatorial evidence
- Min-wise independent permutations
- A near-optimal polynomial time algorithm for learning in certain classes of stochastic games
- An extremal problem for subset-sum-distinct sequences with congruence conditions
- Sign-balanced covering matrices
- Averaging sequences, deranged mappings, and a problem of Lampert and Slater
- Measure and probability for concurrency theorists
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
- Approximation algorithms for maximum linear arrangement
- A manifesto for the computational method
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
- Which problems have strongly exponential complexity?
- Perfect information leader election in \(\log^*n+O(1)\) rounds
- Heuristics for semirandom graph problems
- Approximating the maximum quadratic assignment problem
- Sparse universal graphs
- On a generalization of Polya inequality and some of its statistical implications
- Complexity of finding dense subgraphs
- A dimension gap for continued fractions with independent digits -- the non stationary case
- Boolean functions: influence, threshold and noise
- An improved bound for disjoint directed cycles
- Multiple domination models for placement of electric vehicle charging stations in road networks
- A Gale-Berlekamp permutation-switching problem in higher dimensions
- Bipartite Ramsey numbers of paths for random graphs
- Sparse multipartite graphs as partition universal for graphs with bounded degree
- On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks
- Rigidity and separation indices of Paley graphs
- Antipodality properties of finite sets in Euclidean space
- Local statistics for random domino tilings of the Aztec diamond
- Optimal data compression algorithm
- Chromatic capacities of graphs and hypergraphs
- The Vapnik-Chervonenkis dimension of a random graph
- On generalized Ramsey theory: The bipartite case
- Nowhere-zero flows in random graphs
- The extremal function for complete minors
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 Q4004078)
