scientific article; zbMATH DE number 819814

Publication date: 23 November 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Markov chains random walks hashing fingerprinting perfect pattern matching

Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Discrete geometry (52C99) Probability theory on algebraic and topological structures (60B99)

Related Items (only showing first 100 items - show all)

Estimation of singular values of very large matrices using random sampling ⋮ Random walks with ``back buttons ⋮ On the complexity of pattern matching for highly compressed two-dimensional texts. ⋮ Diffusion without false rumors: On propagating updates in a Byzantine environment. ⋮ Towards optimal lower bounds for clique and chromatic number. ⋮ On finding common neighborhoods in massive graphs. ⋮ When can you fold a map? ⋮ Approximate constrained bipartite edge coloring ⋮ The Missing Difference problem, and its applications to counter mode encryption ⋮ Is Shapley cost sharing optimal? ⋮ Localization of VC classes: beyond local Rademacher complexities ⋮ Exact learning of juntas from membership queries ⋮ Randomized nonlinear projections uncover high-dimensional structure ⋮ Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity ⋮ Rigorous upper bounds on data complexities of block cipher cryptanalysis ⋮ Some results on the strength of relaxations of multilinear functions ⋮ A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring ⋮ Phylogenetic mixtures: concentration of measure in the large-tree limit ⋮ Strengthening hash families and compressive sensing ⋮ Information gathering in ad-hoc radio networks with tree topology ⋮ Indexing moving points ⋮ When distributed computation is communication expensive ⋮ Analysis of a randomized rendezvous algorithm ⋮ News from the online traveling repairman. ⋮ Distributed broadcast in radio networks of unknown topology. ⋮ Optimal aggregation algorithms for middleware. ⋮ Poly-symmetry in processor-sharing systems ⋮ On stability of fuzzy formal concepts over randomized one-sided formal context ⋮ Triggering cascades on undirected connected graphs ⋮ Black-box search by unbiased variation ⋮ On reversible cascades in scale-free and Erdős-Rényi random graphs ⋮ Comparing the strength of query types in property testing: the case of \(k\)-colorability ⋮ Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis ⋮ Fixed-parameter evolutionary algorithms and the vertex cover problem ⋮ Game-theoretic discussion of quantum state estimation and cloning ⋮ Uncovering the riffled independence structure of ranked data ⋮ Randomized registers and iterative algorithms ⋮ Efficient adaptive collect using randomization ⋮ Sublinear-time algorithms for counting star subgraphs via edge sampling ⋮ Optimal deterministic broadcasting in known topology radio networks ⋮ Summarizing numeric spatial data streams by trend cluster discovery ⋮ On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Hardness of approximation for non-overlapping local alignments. ⋮ Distinguishing string selection problems. ⋮ Sublinear time motif discovery from multiple sequences ⋮ On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization ⋮ Communication and location discovery in geometric ring networks ⋮ Online estimation of discrete, continuous, and conditional joint densities using classifier chains ⋮ On the smoothness of paging algorithms ⋮ Convergence theorems for operators sequences on functionals of discrete-time normal martingales ⋮ The \((1+1)\) elitist black-box complexity of LeadingOnes ⋮ Quantum walks: a comprehensive review ⋮ An approximation algorithm for the traveling tournament problem ⋮ Fun-Sort -- or the chaos of unordered binary search ⋮ Efficiency test of pseudorandom number generators using random walks ⋮ Uncertain convex programs: randomized solutions and confidence levels ⋮ New bounds for randomized busing ⋮ The analysis of evolutionary algorithms on sorting and shortest paths problems ⋮ Computing the optimal partition of variables in multi-homogeneous homotopy methods ⋮ On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions ⋮ Balanced vertex-orderings of graphs ⋮ A probabilistic model of computing with words ⋮ Core instances for testing: a case study ⋮ Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme ⋮ Social integration in two-sided matching markets ⋮ On cutting a few vertices from a graph ⋮ A space lower bound for \(st\)-connectivity on node-named JAGs ⋮ Random walks on a finite graph with congestion points ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ Popularity based random graph models leading to a scale-free degree sequence ⋮ Quantum analog computing ⋮ A discipline of evolutionary programming ⋮ On the complexity of multi-dimensional interval routing schemes ⋮ Interactive and probabilistic proof-checking ⋮ Randomized algorithms over finite fields for the exact parity base problem. ⋮ Polynomial-time counting and sampling of two-rowed contingency tables ⋮ Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots ⋮ Clique is hard to approximate within \(n^{1-\epsilon}\) ⋮ Measure and probability for concurrency theorists ⋮ Efficient searching with linear constraints ⋮ Randomized local elections. ⋮ How to analyse evolutionary algorithms. ⋮ Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions. ⋮ On computing the diameter of a point set in high dimensional Euclidean space. ⋮ On the Hamming distance of constraint satisfaction problems. ⋮ Randomized path coloring on binary trees. ⋮ Probabilistic quorum systems ⋮ Distributed probabilistic polling and applications to proportionate agreement ⋮ The nonapproximability of OBDD minimization ⋮ On asymptotically optimal methods of prediction and adaptive coding for Markov sources ⋮ On approximating planar metrics by tree metrics. ⋮ Small generic hardcore subsets for the discrete logarithm: short secret DL-keys. ⋮ Algorithms, nymphs, and shepherds ⋮ On the analysis of the \((1+1)\) evolutionary algorithm ⋮ A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem ⋮ Competitive on-line scheduling of continuous-media streams ⋮ Approximate congruence in nearly linear time ⋮ Finding similar regions in many sequences ⋮ A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis

This page was built for publication: