↓ Skip to main content

Language and Automata Theory and Applications

Overview of attention for book
Cover of 'Language and Automata Theory and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Brief History of Strahler Numbers
  3. Altmetric Badge
    Chapter 2 On the Parikh Membership Problem for FAs, PDAs, and CMs
  4. Altmetric Badge
    Chapter 3 Matchings, Random Walks, and Sampling
  5. Altmetric Badge
    Chapter 4 Interprocedural Information Flow Analysis of XML Processors
  6. Altmetric Badge
    Chapter 5 Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata
  7. Altmetric Badge
    Chapter 6 Formulae for Polyominoes on Twisted Cylinders
  8. Altmetric Badge
    Chapter 7 Picture Codes with Finite Deciphering Delay
  9. Altmetric Badge
    Chapter 8 Networks of Polarized Evolutionary Processors Are Computationally Complete
  10. Altmetric Badge
    Chapter 9 Two Double-Exponential Gaps for Automata with a Limited Pushdown
  11. Altmetric Badge
    Chapter 10 Covering Pairs in Directed Acyclic Graphs
  12. Altmetric Badge
    Chapter 11 Efficient List-Based Computation of the String Subsequence Kernel
  13. Altmetric Badge
    Chapter 12 Channel Synthesis Revisited
  14. Altmetric Badge
    Chapter 13 Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
  15. Altmetric Badge
    Chapter 14 Computing Depths of Patterns
  16. Altmetric Badge
    Chapter 15 Solving Equations on Words with Morphisms and Antimorphisms
  17. Altmetric Badge
    Chapter 16 On the Arithmetics of Discrete Figures
  18. Altmetric Badge
    Chapter 17 On the List Update Problem with Advice
  19. Altmetric Badge
    Chapter 18 Shift-Reduce Parsers for Transition Networks
  20. Altmetric Badge
    Chapter 19 Optimal Sorting Networks
  21. Altmetric Badge
    Chapter 20 Satisfiability for MTL and TPTL over Non-monotonic Data Words
  22. Altmetric Badge
    Chapter 21 (k,l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization
  23. Altmetric Badge
    Chapter 22 Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms
  24. Altmetric Badge
    Chapter 23 Succinct Encodings of Graph Isomorphism
  25. Altmetric Badge
    Chapter 24 Extremal Combinatorics of Reaction Systems
  26. Altmetric Badge
    Chapter 25 Stochastic k-Tree Grammar and Its Application in Biomolecular Structure Modeling
  27. Altmetric Badge
    Chapter 26 Weighted Automata and Logics for Infinite Nested Words
  28. Altmetric Badge
    Chapter 27 Algebraic Tools for the Overlapping Tile Product
  29. Altmetric Badge
    Chapter 28 Language and Automata Theory and Applications
  30. Altmetric Badge
    Chapter 29 Counting Models of Linear-Time Temporal Logic
  31. Altmetric Badge
    Chapter 30 ω-rational Languages: High Complexity Classes vs. Borel Hierarchy
  32. Altmetric Badge
    Chapter 31 On Context-Diverse Repeats and Their Incremental Computation
  33. Altmetric Badge
    Chapter 32 Ordered Counter-Abstraction
  34. Altmetric Badge
    Chapter 33 On SAT Representations of XOR Constraints
  35. Altmetric Badge
    Chapter 34 Minimal Triangulation Algorithms for Perfect Phylogeny Problems
  36. Altmetric Badge
    Chapter 35 On Computability and Learnability of the Pumping Lemma Function
  37. Altmetric Badge
    Chapter 36 Interval Temporal Logic Semantics of Box Algebra
  38. Altmetric Badge
    Chapter 37 Are Good-for-Games Automata Good for Probabilistic Model Checking?
  39. Altmetric Badge
    Chapter 38 Top-Down Tree Edit-Distance of Regular Tree Languages
  40. Altmetric Badge
    Chapter 39 DFA with a Bounded Activity Level
  41. Altmetric Badge
    Chapter 40 Learning Sequential Tree-to-Word Transducers
  42. Altmetric Badge
    Chapter 41 Probabilistic Simulation for Probabilistic Data-Aware Business Processes
  43. Altmetric Badge
    Chapter 42 Expressiveness of Dynamic Networks of Timed Petri Nets
  44. Altmetric Badge
    Chapter 43 Distinguishing Pattern Languages with Membership Examples
  45. Altmetric Badge
    Chapter 44 Extended Two-Way Ordered Restarting Automata for Picture Languages
  46. Altmetric Badge
    Chapter 45 Weight-Reducing Hennie Machines and Their Descriptional Complexity
  47. Altmetric Badge
    Chapter 46 Computing with Catalan Families
  48. Altmetric Badge
    Chapter 47 Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata
  49. Altmetric Badge
    Chapter 48 Probabilistic ω-Regular Expressions
  50. Altmetric Badge
    Chapter 49 On the State Complexity of Semi-quantum Finite Automata
Attention for Chapter 19: Optimal Sorting Networks
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age (54th percentile)
  • Good Attention Score compared to outputs of the same age and source (70th percentile)

Mentioned by

wikipedia
6 Wikipedia pages

Readers on

mendeley
14 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
Optimal Sorting Networks
Chapter number 19
Book title
Language and Automata Theory and Applications
Published in
Lecture notes in computer science, March 2014
DOI 10.1007/978-3-319-04921-2_19
Book ISBNs
978-3-31-904920-5, 978-3-31-904921-2
Authors

Daniel Bundala, Jakub Závodný

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Spain 1 7%
United States 1 7%
Zimbabwe 1 7%
Unknown 11 79%

Demographic breakdown

Readers by professional status Count As %
Student > Master 5 36%
Researcher 3 21%
Student > Bachelor 2 14%
Professor 2 14%
Student > Ph. D. Student 1 7%
Other 1 7%
Readers by discipline Count As %
Computer Science 8 57%
Engineering 5 36%
Mathematics 1 7%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 09 June 2023.
All research outputs
#7,452,489
of 22,783,848 outputs
Outputs from Lecture notes in computer science
#2,485
of 8,124 outputs
Outputs of similar age
#73,491
of 220,834 outputs
Outputs of similar age from Lecture notes in computer science
#22
of 86 outputs
Altmetric has tracked 22,783,848 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,124 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 55% 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 220,834 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 54% of its contemporaries.
We're also able to compare this research output to 86 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 70% of its contemporaries.