Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Algorithmica

Search In Journal Title:

Abbravation: Algorithmica

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1016/0165-1765(94)00533-8

Search In DOI:

ISSN

1432-0541

Search In ISSN:
Search In Title Of Papers:

Integer Representation and Counting in the Bit Pro

Authors: M Ziaur Rahman J Ian Munro
Publish Date: 2008/12/02
Volume: 56, Issue: 1, Pages: 105-
PDF Link

Abstract

We examine the problem of integer representation in a nearly minimal number of bits so that the increment and the decrement and indeed the addition and the subtraction operations can be performed using few bit inspections and fewer bit changes The model of computation we considered is the bit probe model where the complexity measure counts only the bitwise accesses to the data structure We present several efficient data structures to represent integer that use a logarithmic number of bit inspections and a constant number of bit changes per operation The most spaceefficient data structure uses only one extra bit We also present an extension to our data structure to support efficient addition and subtraction where the larger value is replaced by the result while retaining the same asymptotic bounds for the increment and the decrement operations

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. On Minimum Sum of Radii and Diameters Clustering
  2. An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization
  3. New Approximation Algorithms for Minimum Cycle Bases of Graphs
  4. The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
  5. Aligning Two Convex Figures to Minimize Area or Perimeter
  6. Introduction for S.I. AofA14
  7. Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
  8. Detecting Regular Visit Patterns
  9. Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
  10. Random Matrices and Codes for the Erasure Channel
  11. On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs
  12. The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
  13. Optimal Parallel Quantum Query Algorithms
  14. Average Case Network Lifetime on an Interval with Adjustable Sensing Ranges
  15. Maximum Series-Parallel Subgraph
  16. A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties
  17. Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets
  18. The Parameterized Complexity of Local Search for TSP, More Refined
  19. Approximating Fixation Probabilities in the Generalized Moran Process
  20. Approximation Algorithms for Scheduling with Reservations
  21. Algorithms for the Homogeneous Set Sandwich Problem
  22. A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
  23. Computing Minimum Cuts by Randomized Search Heuristics
  24. Constructing Labeling Schemes through Universal Matrices
  25. An Approximation Algorithm for the Minimum Co-Path Set Problem
  26. Scheduling with an Orthogonal Resource Constraint
  27. Approximate Boyer-Moore String Matching for Small Alphabets
  28. Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
  29. Between Treewidth and Clique-Width
  30. What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid
  31. Multi-sided Boundary Labeling
  32. A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Search Result: