scientific article; zbMATH DE number 1033192

Publication date: 13 July 1997

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

shortest paths discrete dynamic programming combinatorial algorithms independence theory efficient matroid algorithms

Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical programming (90Cxx)

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

A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0 ⋮ Limit laws for partial match queries in quadtrees ⋮ Enumeration of Gelfand-Cetlin type reduced words ⋮ Log-concavity of some independence polynomials via a partial ordering ⋮ The limiting distribution of the hook length of a randomly chosen cell in a random Young diagram ⋮ Feistel-inspired scrambling improves the quality of linear congruential generators ⋮ Swapping Colored Tokens on Graphs ⋮ Faster merging networks with a small constant period ⋮ Regular numeral systems for data structures ⋮ Longest alternating subsequences of permutations ⋮ Computing with algebraically closed fields ⋮ Theoretical and empirical convergence results for additive congruential random number generators ⋮ Optimizing registration based encryption ⋮ Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers ⋮ Rounding of continuous random variables and oscillatory asymptotics ⋮ Table space designs for implicit and explicit concurrent tabled evaluation ⋮ Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments ⋮ Integer multiplication in time \(O(n\log n)\) ⋮ Generic hardness of the Boolean satisfiability problem ⋮ Simplified Expectations in the Birthday Problem ⋮ Success runs in symmetric Bernoulli process ⋮ Depth Optimized Efficient Homomorphic Sorting ⋮ Fast sort of floating-point data for data engineering ⋮ The ancestral matrix of a rooted tree ⋮ Pseudorandom number generation using chaotic true orbits of the Bernoulli map ⋮ Asymptotic properties of Fibonacci cubes and Lucas cubes ⋮ The number of parking functions with center of a given length ⋮ An efficient collision detection method for computing discrete logarithms with Pollard's rho ⋮ A Tight Bound on the Worst-Case Number of Comparisons for Floyd’s Heap Construction Algorithm ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Random subshifts of finite type ⋮ Almost sure convergence to the quicksort process ⋮ Unnamed Item ⋮ Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations ⋮ Asymptotic expectation of protected node profile in random digital search trees ⋮ Quantifying noninvertibility in discrete dynamical systems ⋮ Modeling of an asymptotically central Markov process on 3D Young graph ⋮ Unnamed Item ⋮ Intrinsic argument strength in structured argumentation: a principled approach ⋮ Combinatorial approach to the representation of the Schur-Weyl duality in one-dimensional spin systems ⋮ Fonctions symétriques et séries hypergéométriques basiques multivariées ⋮ Average-Case Analysis of Cousins in m-ary Tries ⋮ Graded alphabets, circular codes, free Lie algebras and comma-free codes ⋮ Computing exact solutions of consensus halving and the Borsuk-Ulam theorem ⋮ A table of short-period Tausworthe generators for Markov chain quasi-Monte Carlo ⋮ Aligator: A Mathematica Package for Invariant Generation (System Description) ⋮ The necklace process: a generating function approach ⋮ The sorting index and equidistribution of set-valued statistics over restricted permutations ⋮ A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees ⋮ Automatic discovery of structural rules of permutation classes ⋮ Polynomially complete quasigroups of prime order ⋮ Multi-owner Secure Encrypted Search Using Searching Adversarial Networks ⋮ A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm ⋮ How can we explain different number systems? ⋮ Algorithm design through the optimization of reuse-based generation ⋮ QuickHeapsort: modifications and improved analysis ⋮ Detecting dynamical changes in time series by using the Jensen Shannon divergence ⋮ Simplices for numeral systems ⋮ Swapping colored tokens on graphs ⋮ Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics ⋮ Computing Stationary Expectations in Level-Dependent QBD Processes ⋮ Achieving parametric uniformity for knowledge bases in a relational probabilistic conditional logic with maximum entropy semantics ⋮ Multiway in-place merging ⋮ \texttt{FASTSET}: a fast data structure for the representation of sets of integers ⋮ Approximating a real number by a rational number with a limited denominator: a geometric approach ⋮ On the implementation of LIR: the case of simple linear regression with interval data ⋮ A low-complexity LUT-based squaring algorithm ⋮ Fast algorithms for the calculation of Kendall's \(\tau\) ⋮ Solving the conjugacy problem in Garside groups by cyclic sliding. ⋮ Rule weights in a neuro-fuzzy system with a hierarchical domain partition ⋮ On partial sorting in restricted rounds ⋮ Statistics on wreath products, perfect matchings, and signed words ⋮ The oscillatory distribution of distances in random tries ⋮ Descent polynomials for permutations with bounded drop size ⋮ Riffle shuffles of decks with repeated cards ⋮ On the silhouette of binary search trees ⋮ The sorting index ⋮ A functional limit theorem for the profile of \(b\)-ary trees ⋮ Sampling for passive internet measurement: a review ⋮ An efficient parallel implementation of the MSPAI preconditioner ⋮ An exponent one-fifth algorithm for deterministic integer factorisation ⋮ Accurate simple zeros of polynomials in floating point arithmetic ⋮ A permutation-and-backtrack approach for reliability evaluation in multistate information networks ⋮ Learning of Digital Spiking Neuron and its Application Potentials ⋮ On the enumeration and asymptotic growth of free quasigroup words ⋮ Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory ⋮ An efficient implementation of a least squares Monte Carlo method for valuing American-style options ⋮ On the complexity of monotone circuits for threshold symmetric Boolean functions ⋮ Selection Algorithms with Small Groups ⋮ Signed bits and fast exponentiation ⋮ Another representation of binary tree traversal ⋮ Lectures on integrable probability ⋮ Maximum likelihood analysis of algorithms and data structures ⋮ A fast modular semi-Lagrangian method for moving interfaces ⋮ Permutations, Moments, Measures ⋮ Chebyshev–Taylor Parameterization of Stable/Unstable Manifolds for Periodic Orbits: Implementation and Applications ⋮ Performing work with asynchronous processors: Message-delay-sensitive bounds ⋮ Doubly stochastic matrices and Schur-Weyl duality for partition algebras ⋮ Pattern-functions, statistics, and shallow permutations ⋮ Computing quadratic function fields with high 3-rank via cubic field tabulation

This page was built for publication: