scientific article; zbMATH DE number 1033192
From MaRDI portal
Publication:4344097
Recommendations
- scientific article; zbMATH DE number 1458587
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- scientific article; zbMATH DE number 3995020
- scientific article; zbMATH DE number 3473265
- scientific article; zbMATH DE number 3303654
- scientific article; zbMATH DE number 1178976
- scientific article; zbMATH DE number 1099195
- scientific article; zbMATH DE number 3802822
- The Secret Art of Computer Programming
- scientific article; zbMATH DE number 3303655
Cited in
(only showing first 100 items - show all)- Accurate simple zeros of polynomials in floating point arithmetic
- Maximum likelihood analysis of algorithms and data structures
- An asymptotic theory for recurrence relations based on minimization and maximization.
- A fast modular semi-Lagrangian method for moving interfaces
- Log-concavity of some independence polynomials via a partial ordering
- Generic hardness of the Boolean satisfiability problem
- Modeling of an asymptotically central Markov process on 3D Young graph
- The necklace process: a generating function approach
- Polynomially complete quasigroups of prime order
- Swapping colored tokens on graphs
- Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics
- Signed bits and fast exponentiation
- 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
- How can we explain different number systems?
- Algorithm design through the optimization of reuse-based generation
- \texttt{FASTSET}: a fast data structure for the representation of sets of integers
- On partial sorting in restricted rounds
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- On the complexity of monotone circuits for threshold symmetric Boolean functions
- Doubly stochastic matrices and Schur-Weyl duality for partition algebras
- Pattern-functions, statistics, and shallow permutations
- Enumeration of Gelfand-Cetlin type reduced words
- The limiting distribution of the hook length of a randomly chosen cell in a random Young diagram
- Regular numeral systems for data structures
- Optimizing registration based encryption
- Almost sure convergence to the quicksort process
- Quantifying noninvertibility in discrete dynamical systems
- 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
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
- Achieving parametric uniformity for knowledge bases in a relational probabilistic conditional logic with maximum entropy semantics
- On the implementation of LIR: the case of simple linear regression with interval data
- A permutation-and-backtrack approach for reliability evaluation in multistate information networks
- The ancestral matrix of a rooted tree
- The number of parking functions with center of a given length
- The sorting index and equidistribution of set-valued statistics over restricted permutations
- Fast algorithms for the calculation of Kendall's \(\tau\)
- Riffle shuffles of decks with repeated cards
- Sampling for passive internet measurement: a review
- Another representation of binary tree traversal
- Performing work with asynchronous processors: Message-delay-sensitive bounds
- Computing quadratic function fields with high 3-rank via cubic field tabulation
- Feistel-inspired scrambling improves the quality of linear congruential generators
- Faster merging networks with a small constant period
- Integer multiplication in time \(O(n\log n)\)
- Asymptotic expectation of protected node profile in random digital search trees
- Intrinsic argument strength in structured argumentation: a principled approach
- Depth optimized efficient homomorphic sorting
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Chebyshev-Taylor parameterization of stable/unstable manifolds for periodic orbits: implementation and applications
- Multi-owner secure encrypted search using searching adversarial networks
- scientific article; zbMATH DE number 5596834 (Why is no real title available?)
- The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Generating all combinations and partitions. Fasc. 4: Generating all trees. History of combinatorial generation.
- The Secret Art of Computer Programming
- Swapping Colored Tokens on Graphs
- Average-Case Analysis of Cousins in m-ary Tries
- Aligator: A Mathematica Package for Invariant Generation (System Description)
- scientific article; zbMATH DE number 5480930 (Why is no real title available?)
- Rule weights in a neuro-fuzzy system with a hierarchical domain partition
- Learning of Digital Spiking Neuron and its Application Potentials
- An efficient implementation of a least squares Monte Carlo method for valuing American-style options
- scientific article; zbMATH DE number 3936474 (Why is no real title available?)
- Fonctions symétriques et séries hypergéométriques basiques multivariées
- Success runs in symmetric Bernoulli process
- scientific article; zbMATH DE number 194176 (Why is no real title available?)
- Asymptotic properties of Fibonacci cubes and Lucas cubes
- An efficient collision detection method for computing discrete logarithms with Pollard's rho
- Random subshifts of finite type
- Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers
- Table space designs for implicit and explicit concurrent tabled evaluation
- Simplified expectations in the birthday problem
- Pseudorandom number generation using chaotic true orbits of the Bernoulli map
- A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
- Combinatorial approach to the representation of the Schur-Weyl duality in one-dimensional spin systems
- Automatic discovery of structural rules of permutation classes
- Lectures on integrable probability
- Detecting dynamical changes in time series by using the Jensen Shannon divergence
- Simplices for numeral systems
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- scientific article; zbMATH DE number 3995020 (Why is no real title available?)
- Computing stationary expectations in level-dependent QBD processes
- A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm
- An exponent one-fifth algorithm for deterministic integer factorisation
- On the enumeration and asymptotic growth of free quasigroup words
- Selection Algorithms with Small Groups
- Renyi entropy estimation revisited
- Permutations, moments, measures
- On the worst-case complexity of TimSort
- Image encryption by using a specific adaptation of Lehmer’s algorithm
- Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic”
- Polynomial multiplication over finite fields in time O(n n)
- A \(\log\)-\(\log\) speedup for exponent one-fifth deterministic integer factorisation
- Dichotomic Selection on Words: A Probabilistic Analysis
- Multi-Finger Binary Search Trees
- What (quilting) circles can be squared?
- Some combinatorics of factorial base representations
- A Class of Fast and Accurate Summation Algorithms
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 Q4344097)
