scientific article; zbMATH DE number 1099195
From MaRDI portal
Publication:4369384
Cited in
(only showing first 100 items - show all)- The \(S\)-digraph optimization problem and the greedy algorithm
- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
- Optimal alphabetic search trees with restricted maximal height
- Ascending runs of sequences of geometrically distributed random variables: A probabilistic analysis
- A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
- Measuring with jugs
- The distributions of the entries of Young tableaux
- Series expansions for analytic systems linear in control
- Parameter-hiding order revealing encryption
- 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
- New statistical randomness tests based on length of runs
- Profiles of PATRICIA tries
- Benford's law and continuous dependent random variables
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses
- 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
- A necessary condition for c-Wilf equivalence
- Combinatorial proofs of some properties of tangent and Genocchi numbers
- Pickover biomorphs and non-standard complex numbers
- 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
- 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
- The fibres of the Scott map on polygon tilings are the flip equivalence classes
- Generating random binary trees -- a survey
- On the negation-limited circuit complexity of merging
- Asymptotic analysis via Mellin transforms for small deviations in \(L^2\)-norm of integrated Brownian sheets
- The weak-heap data structure: variants and applications
- Improved bounds for finger search on a RAM
- Efficient adaptive collect algorithms
- Mathematical morphology on irregularly sampled data in one dimension
- Enumerating models of DNF faster: breaking the dependency on the formula size
- Constructing quantum hash functions based on quantum walks on Johnson graphs
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
- 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
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- Duality of graded graphs through operads
- Extremal values of the Sackin tree balance index
- 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
- Efficient proximal mapping computation for low-rank inducing norms
- Sharp phase transition for random loop models on trees
- Hardware implementation of multiplication over quartic extension fields
- Pseudorandom vector generation using elliptic curves and applications to Wiener processes
- Preimages under the bubblesort operator
- Enumeration of maximal common subsequences between two strings
- Can one hear a matrix? Recovering a real symmetric matrix from its spectral data
- Mallows permutations and finite dependence
- On testing pseudorandom generators via statistical tests based on the arcsine law
- Exploring the long-term dynamics of perturbed Keplerian motion in high degree potential fields
- A modular extension for a computer algebra system
- Generic smooth representations
- The \(k\)-cut model in deterministic and random trees
- Constant-time sorting
- Small \(k\)-pyramids and the complexity of determining \(k\)
- The CB tree: a practical concurrent self-adjusting search tree
- The faster methods for computing Bessel functions of the first kind of an integer order with application to graphic processors
- Robust chaos of cubic polynomial discrete maps with application to pseudorandom number generators
- Binary representation of natural numbers
- Global dynamic behavior of a multigroup cholera model with indirect transmission
- Arithmetic and \(k\)-maximality of the cyclic free magma
- Numerical validation of compensated algorithms with stochastic arithmetic
- Permutation patterns and cell decompositions
- R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences
- 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
- 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
- The arithmetic computational complexity of linear transforms
- The \(m\)th longest runs of multivariate random sequences
- On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
- Regenerative random permutations of integers
- Red-black trees with constant update time
- Single machine scheduling with delivery dates and cumulative payoffs
- A uniform paradigm to succinctly encode various families of trees
- Pattern classes of permutations via bijections between linearly ordered sets
- Combinatorial sums and finite differences
- Computing the modular inverses is as simple as computing the GCDs
- A framework for incremental generation of closed itemsets
- An algorithm for multiple-precision floating-point multiplication
- Algorithmic combinatorics based on slicing posets
- Hashing via finite field
- Robust principal component pursuit via inexact alternating minimization on matrix manifolds
- Two descent statistics over \(321\)-avoiding centrosymmetric involutions
- Probabilistic analysis of algorithms for the Dutch national flag problem
- On explicit formulae for Bernoulli numbers and their counterparts in positive characteristic
- On Floyd and Rivest's SELECT algorithm
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
- Fighting fish and two-stack sortable permutations
- Normal approximations for descents and inversions of permutations of multisets
- Optimum service capacity and demand management with price incentives
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 Q4369384)
