Some Results for Elementary Operations

DOI10.1007/978-3-642-03456-5_8MaRDI QIDQ3644718zbMATH OpenOpenAlexFDO

Authors Athanasios K. Tsakalidis

Publication date 12 November 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03456-5_8

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms on strings (68W32)

Recommendations

• Publication:3202719
• Some not-quite-elementary operators
• scientific article; zbMATH DE number 746221
• Arithmetical operations of basic elements
• Publication:3483415
• Some results on multiplicative functions
• scientific article; zbMATH DE number 3067763
• Elementary results for certain Diophantine equations
• scientific article; zbMATH DE number 3880788

Cites work

• A locally adaptive data compression scheme
• A log log n data structure for three-sided range queries
• A new algorithm for rectangle enclosure reporting
• A new data structure for representing sorted lists
• A simple optimal solution for the temporal precedence problem on pure pointer machines
• A space efficient variant of path copying for partially persistent sorted sets
• Algorithms and Computation
• Algorithms for extracting motifs from biological weighted sequences
• Algorithms for three-dimensional dominance searching in linear space.
• An Amortized Analysis of Insertions into AVL-Trees
• An improved algorithm for the rectangle enclosure problem
• An optimal algorithm for reporting visible rectangles
• AVL-trees for localized search
• Binary Search Trees of Bounded Balance
• Computing rectangle enclosures
• Design and Analysis of a Data Structure for Representing Sorted Lists
• Dynamic interpolation search
• Dynamic Interpolation Search Revisited
• Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
• Fast Algorithms for Finding Nearest Common Ancestors
• scientific article; zbMATH DE number 437540 (Why is no real title available?)
• scientific article; zbMATH DE number 1809602 (Why is no real title available?)
• scientific article; zbMATH DE number 4211552 (Why is no real title available?)
• scientific article; zbMATH DE number 3928331 (Why is no real title available?)
• scientific article; zbMATH DE number 3958733 (Why is no real title available?)
• scientific article; zbMATH DE number 140460 (Why is no real title available?)
• scientific article; zbMATH DE number 1947389 (Why is no real title available?)
• scientific article; zbMATH DE number 2052918 (Why is no real title available?)
• scientific article; zbMATH DE number 2163028 (Why is no real title available?)
• Improved bounds for finger search on a RAM
• Improving the performance of multidimensional search using fingers
• Maintaining order in a generalized linked list
• Making data structures persistent
• On Dominance Reporting in 3D
• On the average number of rebalancing operations in weight-balanced trees
• Optimal finger search trees in the pointer machine
• Optimal solutions for the temporal precedence problem
• Reflected min-Max heaps
• Searching Unindexed and Nonuniformly Generated Files in \log \log N Time
• Space reduction and an extension for a hidden line elimination algorithm
• Space-optimal hidden line elimination for rectangles
• The nearest common ancestor in a dynamic tree
• THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL
• The Rectangle Enclosure and Point-Dominance Problems Revisited
• The space-optimal version of a known rectangle enclosure reporting algorithm
• The temporal precedence problem
• The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications

This page was built for publication: Some Results for Elementary Operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644718)