↓ Skip to main content

LATIN 2000: Theoretical Informatics : 4th Latin American Symposium, Punta del Esk, Uruguay, April 10-14, 2000 Proceedings

Overview of attention for book
Cover of 'LATIN 2000: Theoretical Informatics : 4th Latin American Symposium, Punta del Esk, Uruguay, April 10-14, 2000 Proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Algorithmic Aspects of Regularity
  3. Altmetric Badge
    Chapter 2 Small Maximal Matchings in Random Graphs
  4. Altmetric Badge
    Chapter 3 Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs
  5. Altmetric Badge
    Chapter 4 Analysis of Edge Deletion Processes on Faulty Random Regular Graphs
  6. Altmetric Badge
    Chapter 5 Equivalent Conditions for Regularity  (Extended Abstract)
  7. Altmetric Badge
    Chapter 6 Cube Packing
  8. Altmetric Badge
    Chapter 7 Approximation Algorithms for Flexible Job Shop Problems
  9. Altmetric Badge
    Chapter 8 Emerging Behavior as Binary Search Trees Are Symmetrically Updated
  10. Altmetric Badge
    Chapter 9 The LCA Problem Revisited
  11. Altmetric Badge
    Chapter 10 Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays
  12. Altmetric Badge
    Chapter 11 Rank Inequalities for Packing Designs and Sparse Triple Systems
  13. Altmetric Badge
    Chapter 12 The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs
  14. Altmetric Badge
    Chapter 13 Graph Structure of the Web: A Survey
  15. Altmetric Badge
    Chapter 14 Polynomial Time Recognition of Clique-Width ≤  3 Graphs
  16. Altmetric Badge
    Chapter 15 On Dart-Free Perfectly Contractile Graphs Extended Abstract
  17. Altmetric Badge
    Chapter 16 Edge Colouring Reduced Indifference Graphs
  18. Altmetric Badge
    Chapter 17 Two Conjectures on the Chromatic Polynomial
  19. Altmetric Badge
    Chapter 18 Finding Skew Partitions Efficiently
  20. Altmetric Badge
    Chapter 19 On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract)
  21. Altmetric Badge
    Chapter 20 Almost k-Wise Independence and Hard Boolean Functions
  22. Altmetric Badge
    Chapter 21 Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function
  23. Altmetric Badge
    Chapter 22 Multi-parameter Minimum Spanning Trees
  24. Altmetric Badge
    Chapter 23 Linear Time Recognition of Optimal L-Restricted Prefix Codes
  25. Altmetric Badge
    Chapter 24 Uniform Multi-hop All-to-All Optical Routings in Rings
  26. Altmetric Badge
    Chapter 25 A Fully Dynamic Algorithm for Distributed Shortest Paths
  27. Altmetric Badge
    Chapter 26 Integer Factorization and Discrete Logarithms
  28. Altmetric Badge
    Chapter 27 Communication Complexity and Fourier Coefficients of the Diffie–Hellman Key
  29. Altmetric Badge
    Chapter 28 Quintic Reciprocity and Primality Test for Numbers of the Form $M~=~A5^{n} \pm ~\omega_{n}$
  30. Altmetric Badge
    Chapter 29 Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
  31. Altmetric Badge
    Chapter 30 Average-Case Analysis of Rectangle Packings
  32. Altmetric Badge
    Chapter 31 Heights in Generalized Tries and PATRICIA Tries
  33. Altmetric Badge
    Chapter 32 On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract
  34. Altmetric Badge
    Chapter 33 Subresultants Revisited
  35. Altmetric Badge
    Chapter 34 A Unifying Framework for the Analysis of a Class of Euclidean Algorithms
  36. Altmetric Badge
    Chapter 35 Worst-Case Complexity of the Optimal LLL Algorithm
  37. Altmetric Badge
    Chapter 36 Iteration Algebras Are Not Finitely Axiomatizable
  38. Altmetric Badge
    Chapter 37 Undecidable Problems in Unreliable Computations
  39. Altmetric Badge
    Chapter 38 Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups
  40. Altmetric Badge
    Chapter 39 Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers
  41. Altmetric Badge
    Chapter 40 Unambiguous Büchi Automata
  42. Altmetric Badge
    Chapter 41 Linear Time Language Recognition on Cellular Automata with Restricted Communication
  43. Altmetric Badge
    Chapter 42 From Semantics to Spatial Distribution
  44. Altmetric Badge
    Chapter 43 On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics
  45. Altmetric Badge
    Chapter 44 A Theory of Operational Equivalence for Interaction Nets
  46. Altmetric Badge
    Chapter 45 Run Statistics for Geometrically Distributed Random Variables
  47. Altmetric Badge
    Chapter 46 Generalized Covariances of Multi-dimensional Brownian Excursion Local Times
  48. Altmetric Badge
    Chapter 47 Combinatorics of Geometrically Distributed Random Variables: Length of Ascending Runs
Attention for Chapter 9: The LCA Problem Revisited
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (96th percentile)
  • High Attention Score compared to outputs of the same age and source (94th percentile)

Mentioned by

blogs
1 blog
twitter
1 X user
wikipedia
7 Wikipedia pages

Citations

dimensions_citation
6 Dimensions

Readers on

mendeley
147 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
The LCA Problem Revisited
Chapter number 9
Book title
LATIN 2000: Theoretical Informatics
Published in
Lecture notes in computer science, January 2000
DOI 10.1007/10719839_9
Book ISBNs
978-3-54-067306-4, 978-3-54-046415-0
Authors

Michael A. Bender, Martín Farach-Colton, Martín Farach-Colton, Bender, Michael A., Farach-Colton, Martín

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 147 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 4 3%
Italy 1 <1%
Austria 1 <1%
Germany 1 <1%
Denmark 1 <1%
Brazil 1 <1%
Spain 1 <1%
Poland 1 <1%
Unknown 136 93%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 43 29%
Student > Master 24 16%
Researcher 17 12%
Student > Bachelor 12 8%
Professor 10 7%
Other 20 14%
Unknown 21 14%
Readers by discipline Count As %
Computer Science 97 66%
Agricultural and Biological Sciences 9 6%
Engineering 5 3%
Physics and Astronomy 4 3%
Environmental Science 3 2%
Other 4 3%
Unknown 25 17%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 15. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 22 November 2023.
All research outputs
#2,488,179
of 26,017,215 outputs
Outputs from Lecture notes in computer science
#429
of 8,225 outputs
Outputs of similar age
#3,655
of 112,299 outputs
Outputs of similar age from Lecture notes in computer science
#1
of 18 outputs
Altmetric has tracked 26,017,215 research outputs across all sources so far. Compared to these this one has done particularly well and is in the 90th percentile: it's in the top 10% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,225 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.3. This one has done particularly well, scoring higher than 94% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 112,299 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 96% of its contemporaries.
We're also able to compare this research output to 18 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 94% of its contemporaries.