scientific article; zbMATH DE number 1099195
From MaRDI portal
Publication:4369384
zbMath0883.68015MaRDI QIDQ4369384
Publication date: 18 December 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)
Related Items
Series expansions for analytic systems linear in control ⋮ Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization ⋮ Asymptotic analysis via Mellin transforms for small deviations in \(L^2\)-norm of integrated Brownian sheets ⋮ New algorithms for Taylor coefficients of indefinite integrals and their applications ⋮ Parameter-hiding order revealing encryption ⋮ What is a sorting function? ⋮ Efficient optimally lazy algorithms for minimal-interval semantics ⋮ Orbit Dirichlet series and multiset permutations ⋮ Improving quantum state transfer efficiency and entanglement distribution in binary tree spin network through incomplete collapsing measurements ⋮ Mathematics, philosophical and semantic considerations on infinity. II: Dialectical vision ⋮ Stable concurrent synchronization in dynamic system networks ⋮ New statistical randomness tests based on length of runs ⋮ Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus ⋮ An experimental study of approximation algorithms for the joint spectral radius ⋮ Random binary search tree with equal elements ⋮ Exploring confusion in product ciphers through regression analysis ⋮ Enumerative encoding of correlation-immune Boolean functions ⋮ Sorting and generating reduced words ⋮ Fast modular multi-exponentiation using modified complex arithmetic ⋮ Are electroencephalogram (EEG) signals pseudo-random number generators? ⋮ The weak-heap data structure: variants and applications ⋮ ISB-tree: A new indexing scheme with efficient expected behaviour ⋮ Shape matching using a binary search tree structure of weak classifiers ⋮ The universality of iterated hashing over variable-length strings ⋮ Ascending runs of sequences of geometrically distributed random variables: A probabilistic analysis ⋮ Selective association rule generator ⋮ Model based peer-to-peer estimator over wireless sensor networks with lossy channels ⋮ Padovan numbers as sums over partitions into odd parts ⋮ Further advances on low-energy lunar impact dynamics ⋮ Profiles of PATRICIA tries ⋮ A quantitative study of pure parallel processes ⋮ Global stability analysis with a discretization approach for an age-structured multigroup SIR epidemic model ⋮ Benford's law and continuous dependent random variables ⋮ Improved bounds for finger search on a RAM ⋮ Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses ⋮ Efficient adaptive collect algorithms ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Quantifying local randomness in human DNA and RNA sequences using Erdös motifs ⋮ Enumerating permutations by their run structure ⋮ Enumerations of plane trees with multiple edges and Raney lattice paths ⋮ A stochastically quasi-optimal search algorithm for the maximum of the simple random walk ⋮ The geometry of impacts on a synchronous planetary satellite ⋮ Sample-path analysis of general arrival queueing systems with constant amount of work for all customers ⋮ Scheduling results applicable to decision-theoretic troubleshooting ⋮ A fast algorithm for order-preserving pattern matching ⋮ Adaptive initialization algorithm for ad hoc radio networks with carrier sensing ⋮ Value-at-Risk model for hazardous material transportation ⋮ On differences of zeta values ⋮ On the evaluation of finite-time ruin probabilities in a dependent risk model ⋮ Weighted sampling without replacement from data streams ⋮ Mathematical morphology on irregularly sampled data in one dimension ⋮ Enumerating models of DNF faster: breaking the dependency on the formula size ⋮ A necessary condition for c-Wilf equivalence ⋮ Order acceptance and scheduling with consideration of service level ⋮ Combinatorial proofs of some properties of tangent and Genocchi numbers ⋮ Constructing quantum hash functions based on quantum walks on Johnson graphs ⋮ Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields ⋮ Pickover biomorphs and non-standard complex numbers ⋮ Checking the quality of approximation of \(p\)-values in statistical tests for random number generators by using a three-level test ⋮ Dynamic space efficient hashing ⋮ Fun-Sort -- or the chaos of unordered binary search ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ Efficiency test of pseudorandom number generators using random walks ⋮ Deletions in random binary search trees: a story of errors ⋮ Effective and efficient restriction on producing the multipliers for the multiple recursive random number generator ⋮ Reflected Brownian bridge local time conditioned on its local time at the origin ⋮ Some minimum merging networks ⋮ On reasoning about structural equality in XML: a description logic approach ⋮ Optimal alphabetic search trees with restricted maximal height ⋮ Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties ⋮ Hashing and canonicalizing Notation 3 graphs ⋮ An image encryption scheme with a pseudorandom permutation based on chaotic maps ⋮ Sort and Search: exact algorithms for generalized domination ⋮ Lempel-Ziv-78 compressed string dictionaries ⋮ Extremal permutations in routing cycles ⋮ Duality of graded graphs through operads ⋮ Extremal values of the Sackin tree balance index ⋮ Masking patterns in sequences: A new class of motif discovery with don't cares ⋮ The fibres of the Scott map on polygon tilings are the flip equivalence classes ⋮ A robust scheme of model parameters estimation based on the particle swarm method in the image matching problem ⋮ Symmetric and quasi-symmetric functions associated to polymatroids ⋮ About optimal management of work-stealing deques in two-level memory ⋮ Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes ⋮ The \(S\)-digraph optimization problem and the greedy algorithm ⋮ Generating random binary trees -- a survey ⋮ Tightening the bounds on the Baron's omni-sequence ⋮ Efficient proximal mapping computation for low-rank inducing norms ⋮ Sharp phase transition for random loop models on trees ⋮ A note on Dekker's FastTwoSum algorithm ⋮ Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm ⋮ Hardware implementation of multiplication over quartic extension fields ⋮ Pseudorandom vector generation using elliptic curves and applications to Wiener processes ⋮ On the negation-limited circuit complexity of merging ⋮ Measuring with jugs ⋮ The distributions of the entries of Young tableaux ⋮ Preimages under the bubblesort operator ⋮ Two descent statistics over \(321\)-avoiding centrosymmetric involutions ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm ⋮ Enumeration of maximal common subsequences between two strings ⋮ Locating factors of the infinite Fibonacci word ⋮ Can one hear a matrix? Recovering a real symmetric matrix from its spectral data ⋮ Hollow Heaps ⋮ Equivalency in periodicity and spectral test for two associated multiple recursive random number generators ⋮ Fast Mesh-to-Mesh Remaps Using Hash Algorithms ⋮ Sum of alternating-like series as definite integrals ⋮ Efficient Computation of Higher-Order Cumulant Tensors ⋮ Fighting fish and two-stack sortable permutations ⋮ Normal approximations for descents and inversions of permutations of multisets ⋮ The \(m\)th longest runs of multivariate random sequences ⋮ Optimum service capacity and demand management with price incentives ⋮ Tractable Relaxations of Composite Functions ⋮ Bridging between short-range and long-range dependence with mixed spatio-temporal Ornstein–Uhlenbeck processes ⋮ Array Layouts for Comparison-Based Searching ⋮ Bijections for faces of the Shi and Catalan arrangements ⋮ Modular Fuss-Catalan numbers ⋮ Efficient and reliable algorithms for the computation of non-twist invariant circles ⋮ Partial-Collision Attack on the Round-Reduced Compression Function of Skein-256 ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ Mallows permutations and finite dependence ⋮ About optimal management of FIFO-queues in two-level memory ⋮ On testing pseudorandom generators via statistical tests based on the arcsine law ⋮ Global analysis of a new reaction-diffusion multi-group SVEIR propagation model with time delay ⋮ Regenerative random permutations of integers ⋮ Red-black trees with constant update time ⋮ Geometric p-Center Problems with Centers Constrained to Two Lines ⋮ On some combinatorial properties of LINUX process trees ⋮ The effect of bottleneck size on evolution in nested Darwinian populations ⋮ Unnamed Item ⋮ SOME TOPOLOGICAL RESULTS ON LEVEL SETS AND MULTIFRACTAL SETS ⋮ DEGREE-BASED GINI INDEX FOR GRAPHS ⋮ Clean Reversible Simulations of Ranking Binary Trees ⋮ RNA secondary structures with given motif specification: combinatorics and algorithms ⋮ Single machine scheduling with delivery dates and cumulative payoffs ⋮ Exploring the long-term dynamics of perturbed Keplerian motion in high degree potential fields ⋮ A uniform paradigm to succinctly encode various families of trees ⋮ Detecting the morphic images of a word : improving the general algorithm ⋮ A modular extension for a computer algebra system ⋮ Generic smooth representations ⋮ The \(k\)-cut model in deterministic and random trees ⋮ Connection Scan Algorithm ⋮ Density Independent Algorithms for Sparsifying k-Step Random Walks ⋮ Pairing heaps: the forward variant. ⋮ Generating random factored ideals in number fields ⋮ Pattern classes of permutations via bijections between linearly ordered sets ⋮ Combinatorial sums and finite differences ⋮ Improving the pseudo-randomness properties of chaotic maps using deep-zoom ⋮ Computing the modular inverses is as simple as computing the GCDs ⋮ Unnamed Item ⋮ A framework for incremental generation of closed itemsets ⋮ Constant-time sorting ⋮ Small \(k\)-pyramids and the complexity of determining \(k\) ⋮ The CB tree: a practical concurrent self-adjusting search tree ⋮ Increasing robustness in global adaptive quadrature through interval selection heuristics ⋮ An algorithm for multiple-precision floating-point multiplication ⋮ Small gaps in the spectrum of the rectangular billiard ⋮ Algorithmic combinatorics based on slicing posets ⋮ Entropy rates for Horton self-similar trees ⋮ Hashing via finite field ⋮ The faster methods for computing Bessel functions of the first kind of an integer order with application to graphic processors ⋮ Testing randomness via aperiodic words ⋮ Robust principal component pursuit via inexact alternating minimization on matrix manifolds ⋮ К вопросу о предельном распределении серий в случайной двоичной последовательности ⋮ Unnamed Item ⋮ Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems ⋮ Unnamed Item ⋮ Robust chaos of cubic polynomial discrete maps with application to pseudorandom number generators ⋮ Спектрально-линейный и спектрально-дифференциальный методы построения S-бокcов с близкими к оптимальным значениями криптографических параметров ⋮ Forest resampling for distributed sequential Monte Carlo ⋮ Halving the Bounds for the Markov, Chebyshev, and Chernoff Inequalities Using Smoothing ⋮ Cryptology, Mathematics, and Technology ⋮ Unnamed Item ⋮ Binary representation of natural numbers ⋮ Representing Permutations with Few Moves ⋮ Global dynamic behavior of a multigroup cholera model with indirect transmission ⋮ Fast Compressed Tries through Path Decompositions ⋮ Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies ⋮ Finding Safe Strategies for Competitive Diffusion on Trees ⋮ Arithmetic and \(k\)-maximality of the cyclic free magma ⋮ An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code ⋮ Numerical validation of compensated algorithms with stochastic arithmetic ⋮ Permutation patterns and cell decompositions ⋮ Unnamed Item ⋮ R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences ⋮ Enumerating Large Orbits and Direct Condensation ⋮ Dynamic Space Efficient Hashing. ⋮ A Twin Error Gauge for Kaczmarz's Iterations ⋮ Probabilistic analysis of algorithms for the Dutch national flag problem ⋮ On explicit formulae for Bernoulli numbers and their counterparts in positive characteristic ⋮ Importance sampling for partially observed temporal epidemic models ⋮ Mahonian STAT on rearrangement class of words ⋮ Generic undecidability of universal theories ⋮ Rigorous validation of stochastic transition paths ⋮ Efficient big integer multiplication and squaring algorithms for cryptographic applications ⋮ On Floyd and Rivest's SELECT algorithm ⋮ Internet routing between autonomous systems: fast algorithms for path trading ⋮ No easy puzzles: hardness results for jigsaw puzzles ⋮ MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems ⋮ Scalable mechanisms for rational secret sharing ⋮ Phase transition for Parking blocks, Brownian excursion and coalescence ⋮ The arithmetic computational complexity of linear transforms ⋮ A Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs ⋮ Token Swapping on Trees ⋮ Further analysis of the statistical independence of the NIST SP 800-22 randomness tests ⋮ On the approximation of Euclidean SL via geometric method ⋮ White Noise Test from Ordinal Patterns in the Entropy–Complexity Plane ⋮ Combinatorial and stochastic properties of ranked tree‐child networks ⋮ Efficient Generic Quotients Using Exact Arithmetic ⋮ Unnamed Item ⋮ Software as storytelling: a systematic literature review ⋮ Planar tanglegram layouts and single edge insertion ⋮ EuMMD: efficiently computing the MMD two-sample test statistic for univariate data ⋮ Highly optimized quantum circuits synthesized via data-flow engines ⋮ Identities and periodic oscillations of divide-and-conquer recurrences splitting at half ⋮ Linear-time 2-party secure merge from additively homomorphic encryption ⋮ Constrained polynomial zonotopes ⋮ A color-avoiding approach to subgraph counting in bounded expansion classes ⋮ Private evaluation of a decision tree based on secret sharing ⋮ Fast exact Bayesian inference for sparse signals in the normal sequence model ⋮ Gaussian Distribution of Trie Depth for Strongly Tame Sources ⋮ Simplifying Inclusion–Exclusion Formulas ⋮ Unnamed Item ⋮ Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods ⋮ Unnamed Item ⋮ Generalization of Knuth's Formula for the Number of Skew Tableaux ⋮ Profiles of random trees: correlation and width of random recursive trees and binary search trees ⋮ ON GENERIC UNDECIDABILITY OF HILBERT’S TENTH PROBLEM FOR POLYNOMIAL TREES ⋮ ON GENERIC COMPLEXITY OF THE EXISTENTIAL THEORIES ⋮ Moving boundary transformation for American call options with transaction cost: finite difference methods and computing ⋮ Ex post efficiency in the buyer's bid double auction when demand can be arbitrarily larger than supply ⋮ An experimental study of a compressed index ⋮ Reconstruction of piecewise constant functions from x-ray data ⋮ Polynomial hash functions are reliable ⋮ Multisets, heaps, bags, families: What is a multiset? ⋮ COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets ⋮ Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities ⋮ Inference for conditioned Galton-Watson trees from their Harris path ⋮ Inequalities involving the generating function for the number of partitions into odd parts ⋮ Koopman operator and its approximations for systems with symmetries ⋮ Unnamed Item ⋮ Calculation of Discrepancy Measures and Applications ⋮ Clifford Algebras, Spin Groups and Qubit Trees
