scientific article; zbMATH DE number 3303654
From MaRDI portal
Publication:5585020
Cited in
(only showing first 100 items - show all)- The Level-Ancestor problem on pure pointer machines
- Allocating the fixed cost as a complement of other cost inputs: A DEA approach
- Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations
- On the complexity of finding balanced oneway cuts
- On structural properties of eta-expansions of identity
- A property of the elementary symmetric functions on the frequencies of sinusoidal signals
- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
- Hybrid parallel tempering and simulated annealing method
- Asymptotic behavior of an affine random recursion in \(\mathbf Z_p^k\) defined by a matrix with an eigenvalue of size 1
- Randomized selection in \(n+C+o(n)\) comparisons
- Compact searchable static binary trees
- Tumble, a fast simple iteration algorithm for Fibonacci
- Exact solutions of lattice polymer models
- The Parikh counting functions of sparse context-free languages are quasi-polynomials
- Quantum Hilbert matrices and orthogonal polynomials
- Emergence as a computability-theoretic phenomenon
- The sorting order on a Coxeter group.
- Packing sets of patterns
- Restructuring binary search trees revisited
- A note on `Efficient scheduling of periodic information monitoring requests'
- Hamiltonian paths in Cayley graphs
- Global-stability problem for coupled systems of differential equations on networks
- Increasing the orders of equidistribution of the leading bits of the Tausworthe sequence
- Size-space tradeoffs for oblivious computations
- Shape distribution of height-balanced trees
- The duodirun merging algorithm: a new fast algorithm for parallel merging
- Listing and counting subtrees of equal size of a binary tree
- The Rodrigues formula and polynomial differential operators
- Binary search trees with limited rotation
- Sorting in \(c \log n\) parallel steps
- On the X-Y convex hull of a set of X-Y polygons
- Thrifty execution of task pipelines
- Dynamic storage allocation with limited compaction - complexity and some practical implications
- Algebraic properties of cellular automata
- On the average internal path length of m-ary search trees
- Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices
- Permutation representation of k-ary trees
- A heuristic approach to hard constrained shortest path problems
- A note on the dynamic storage allocation problem
- A method for numbering binary rooted and unrooted phylogenies and their hypothetical taxonomic units
- Algebraic algorithms in GF(q)
- Resurrecting the asymptotics of linear recurrences
- q-Catalan numbers
- Notes on the complexity of sorting in abstract machines
- Some properties of commutation in free partially commutative monoids
- Analysis of the performance of the parallel quicksort method
- On the number of polynomials over \(\mathrm{GF}(2)\) that factor into \(2, 3\) or \(4\) prime polynomials
- A 1-1 poly-t random variable generator with application to Monte Carlo integration
- Shuffles of permutations and the Kronecker product
- On the integral \(\int ^{\infty}_{0}x^{\nu -1}(1+\beta x)^{- \lambda}\,\ln ^ mx\,dx\)
- A note on the higher moments of the expected behavior of straight insertion sort
- On growing random binary trees
- Brownian motion and algorithm complexity
- Efficient symbolic analysis of programs
- Application of the MuMATH(R) symbol manipulation system to chemically significant permutation groups
- Almost optimal dynamic 2-3 trees
- The principle of optimality in the design of efficient algorithms
- A taxonomy of binary tree traversals
- Complexity of certain decision problems about congruential languages
- Implementation techniques for the vehicle routing problem
- Finding the two-core of a tree
- On the number of divisions of the Euclidean algorithm applied to Gaussian integers
- Polymorphic arrays: A novel VLSI layout for systolic computers
- Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials
- Extreme values of exponentially autocorrelated sequences
- On non-intersecting Eulerian circuits
- On the design of a key-lock-pair mechanism in information protection systems
- The generalized Sprague-Grundy function and its invariance under certain mappings
- Regressions and monotone chains. II: the poset of integer intervals
- Reductions among number theoretic problems
- Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\)
- Ordered priority queues
- An algorithm for testing Leopoldt's conjecture
- About the choice of uniformly distributed sequences to be used in the random choice method
- On a class of nonlinear dynamical systems: the structure of a differential operator in the application of the decomposition method
- Divisor generating functions and insertion into a heap
- Factoring polynomials and primitive elements for special primes
- Level number sequences for trees
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Jump interpolation search trees and symmetric binary numbers
- A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers)
- A catalogue of complete group presentations
- Computer algebra: Past and future
- Termination of rewriting
- On the logistic midrange
- Deviations from uniformity in random strings
- Efficient generation of binary trees from inorder-postorder sequences
- Modeling B-tree insertion activity
- Some remarks on Catalan families
- A diffusion limit for a class of randomly-growing binary trees
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
- Bounds for min-max heaps
- A logical approach to asymptotic combinatorics I. First order properties
- An exponential lower bound for the pure literal rule
- Data structures and algorithms for approximate string matching
- Generating t-ary trees in A-order
- Linear open addressing and Peterson's theorem rehashed
- Self-organizing sequential search and Hilbert's inequalities
- A VLSI partition algorithm
- Modeling splits in file structures
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 Q5585020)
