scientific article
From MaRDI portal
zbMath0703.05046MaRDI QIDQ3481743
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Probabilistic estimates for the generalized maximum satisfiability problem, On the complexity of the parity argument and other inefficient proofs of existence, Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps, Lower bounds for on-line graph coloring, The size Ramsey number of a complete bipartite graph, Threshold circuits of bounded depth, Listing graphs that satisfy first-order sentences, Critical Density Thresholds in Distributed Wireless Networks, The probabilistic method yields deterministic parallel algorithms, The shortest disjunctive normal form of a random Boolean function, From Erdős to algorithms, Covering with Latin transversals, Weighted fractional and integral \(k\)-matching in hypergraphs, Undecidable statements and random graphs, Monte Carlo approximation of form factors with error bounded a priori, Lower bounds for set intersection queries, On key storage in secure networks, Branching rules for satisfiability, Space-filling subsets of a normal rational curve, Tight approximations for resource constrained scheduling and bin packing, Partitioning claw-free subcubic graphs into two dominating sets, The abstract lace expansion, The linear arboricity of graphs, Hadamard tensors and lower bounds on multiparty communication complexity, Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions, Randomized geometric algorithms and pseudorandom generators, (De)randomized construction of small sample spaces in \(\mathcal{NC}\), Critical behavior in the computational cost of satisfiability testing, On the number of cycles of given length of a free word in several random permutations, LARGE SIGNED SUBSET SUMS, The prime submodules hypergraph of a free module of finite rank over a commutative ring, Combinatorial model and bounds for target set selection, Cubic graphs with total domatic number at least two, Constant time parallel sorting: An empirical view., Near-optimal dominating sets in dense random graphs in polynomial expected time, On the discrepancy of random matrices with many columns, Technical Note—Assortment Optimization with Small Consideration Sets, Patience of matrix games, On complexity, representation and approximation of integral multicommodity flows, The complexity of short two-person games, Cutting hyperplane arrangements, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing, Randomized optimal algorithm for slope selection, Deterministic parallel algorithms for bilinear objective functions, Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors, A theory of even functionals and their algorithmic applications, Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time, How hard is half-space range searching?, Probability and convergence for supra-majority rule with Euclidean preferences, Approximation algorithms for the max-buying problem with limited supply, Enumeration of order preserving maps, Cutting hyperplanes for divide-and-conquer, On-line algorithms for 2-coloring hypergraphs via chip games, Random edge domination, On the benefit of supporting virtual channels in wormhole routers, The instability of instability of centered distributions, Vector balancing games with aging, Approximating maximum independent sets by excluding subgraphs, The maximum number of Hamiltonian paths in tournaments, The distribution of clusters in random graphs, Note on the lamp lighting problem, Privacy-preserving data splitting: a combinatorial approach, Expectation and Variance of Self-assembled Graph Structures, EPCOT: An efficient procedure for coloring optimally with Tabu Search, Embedding multidimensional grids into optimal hypercubes, Every null-additive set is meager-additive, Plane and planarity thresholds for random geometric graphs, A deterministic view of random sampling and its use in geometry, Polarization, sign sequences and isotropic vector systems, A Beck-Fiala-type theorem for Euclidean norms, Lopsided Lovász Local lemma and Latin transversals, On the linear and hereditary discrepancies, A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy, Note on linear arboricity of graphs with large girth, Weak measure extension axioms, Improved algorithms via approximations of probability distributions, Partitioning single-molecule maps into multiple populations: Algorithms and probabilistic analysis, Stochastic Online Scheduling Revisited, Approximation algorithms for covering/packing integer programs, Bounds and constructions for the star-discrepancy via \(\delta\)-covers, On the robustness of interconnections in random graphs: a symbolic approach., Removing randomness in parallel computation without a processor penalty, An optimal convex hull algorithm in any fixed dimension, Vector Balancing Games with Aging, Pointwise compact and stable sets of measurable functions, Fast algorithms for approximately counting mismatches, Asymptotic behavior of the chromatic index for hypergraphs, Discrepancy and approximations for bounded VC-dimension, A theory of even functionals and their algorithmic applications, Drifting games and Brownian motion, Probabilistic methods in coloring and decomposition problems
