scientific article

zbMath0556.68001MaRDI QIDQ3219751

Publication date: 1984

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

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms in computer science (68W99)

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

Memory management for Union-Find algorithms ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ Efficient Construction of Near-Optimal Binary and Multiway Search Trees ⋮ Maintaining minimum spanning trees in dynamic graphs ⋮ Minimal and Monotone Minimal Perfect Hash Functions ⋮ Concatenable segment trees ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Finding cores of limited length ⋮ An approximation algorithm for stacking up bins from a conveyer onto pallets ⋮ Detecting arrays for effects of single factors ⋮ Energy efficient sorting, selection and searching ⋮ Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ Area-efficient algorithms for upward straight-line tree drawings ⋮ Graphs, hypergraphs and hashing ⋮ Bandwidth and profile minimization ⋮ On paths in search or decision trees which require almost worst-case time ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. ⋮ Generic top-down discrimination for sorting and partitioning in linear time ⋮ Sorting using heap structure ⋮ A faster approximation algorithm for the Steiner problem in graphs ⋮ Explicit constructions of perfect hash families from algebraic curves over finite fields ⋮ Spaces, Trees, and Colors ⋮ Sorting shuffled monotone sequences ⋮ Broadcast authentication for group communication ⋮ Agglomerative clustering of growing squares ⋮ A framework for adaptive sorting ⋮ Multi-Finger Binary Search Trees ⋮ An algorithm for handling many relational calculus queries efficiently. ⋮ On polychotomous search problems ⋮ Ray shooting in polygons using geodesic triangulations ⋮ Dynamic dictionary matching with failure functions ⋮ Dynamic layers of maxima with applications to dominating queries ⋮ Algorithms for projecting points to give the most uniform distribution with applications to hashing ⋮ Bounded fan-out $m$-center problem ⋮ Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings ⋮ A linear-time near-optimum-length triangulation algorithm for convex polygons ⋮ New results for online page replication ⋮ An efficient algorithm for hidden surface removal. II ⋮ Rotation and lighting invariant template matching ⋮ Sorting on graphs by adjacent swaps using permutation groups ⋮ A framework for adaptive sorting ⋮ Average-case results on heapsort ⋮ Weighted fractional and integral $k$-matching in hypergraphs ⋮ In-place initializable arrays ⋮ The node visit cost of brother trees ⋮ The longest common subsequence problem revisited ⋮ Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons ⋮ A sequence approach to linear perfect hash families ⋮ The problem of space invariance for sequential machines ⋮ Data structures and algorithms for approximate string matching ⋮ On-line sorting of twisted sequences in linear time ⋮ Realistic computer graphics and free form surfaces ⋮ Parallel construction of binary trees with near optimal weighted path length ⋮ On saving space in parallel computation ⋮ VLSI-sorting evaluated under the linear model ⋮ Improved bounds for separating hash families ⋮ Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions ⋮ Randomized search trees ⋮ Perfect hashing ⋮ A statistical approach to adaptive problem solving ⋮ Strengthening hash families and compressive sensing ⋮ Flash memory efficient LTL model checking ⋮ A hierarchical framework for recovery in compressive sensing ⋮ A kinetic triangulation scheme for moving points in the plane ⋮ Bounds for separating hash families ⋮ Dynamic fractional cascading ⋮ A new dynamic programming algorithm for the simplified partial digest problem ⋮ Bounded ordered dictionaries in O(log log N) time and O(n) space ⋮ Dynamic deferred data structuring ⋮ Improved nonconservative sequential and parallel integer sorting ⋮ Colored top-$K$ range-aggregate queries ⋮ Trees with exponentially growing costs ⋮ Some intriguing upper bounds for separating hash families ⋮ Splitsort -- an adaptive sorting algorithm ⋮ New bounds on $\bar{2}$-separable codes of length 2 ⋮ A practical approach to the 2D incremental nearest-point problem suitable for different point distributions ⋮ On the longest upsequence problem for permutations ⋮ Two linear time Union--Find strategies for image processing ⋮ Multiple matching of parameterized patterns ⋮ Maintaining the minimal distance of a point set in polylogarithmic time ⋮ Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem ⋮ Fast linear-space computations of longest common subsequences ⋮ On generalized separating hash families ⋮ Geometric constructions of optimal linear perfect hash families ⋮ Search performance of double-linked coalesced hashing can not exceed bucketing ⋮ Counting and cutting cycles of lines and rods in space ⋮ A framework for 1-D compaction with forbidden region avoidance ⋮ Asymptotic analysis of dichotomous search with search and travel costs ⋮ On the structural grammatical inference problem for some classes of context-free grammars ⋮ More efficient bottom-up multi-pattern matching in trees ⋮ Computing inversion pair cardinality through partition-based sorting ⋮ Four results on randomized incremental constructions ⋮ Computing equivalence classes among the edges of a graph with applications ⋮ Improved bounds on 2-frameproof codes with length 4 ⋮ Structural filtering: a paradigm for efficient and exact geometric programs ⋮ Fast connected-component labeling ⋮ Lempel-Ziv compressed structures for document retrieval ⋮ Comparing trees via crossing minimization

This page was built for publication: