↓ Skip to main content
What is this page? Embed badge

Automata, Languages and Programming

Overview of attention for book
Cover of 'Automata, Languages and Programming'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Generating Hard Instances of the Short Basis Problem
  3. Altmetric Badge
    Chapter 2 Wide Area Computation
  4. Altmetric Badge
    Chapter 3 Proof Techniques for Cryptographic Protocols
  5. Altmetric Badge
    Chapter 4 Type Structure for Low-Level Programming Languages
  6. Altmetric Badge
    Chapter 5 Real Computations with Fake Numbers
  7. Altmetric Badge
    Chapter 6 A Model for Associative Memory, a Basis for Thinking and Consciousness
  8. Altmetric Badge
    Chapter 7 Numerical Integration with Exact Real Arithmetic
  9. Altmetric Badge
    Chapter 8 Observations about the Nature and State of Computer Science
  10. Altmetric Badge
    Chapter 9 DNA Computing: New Ideas and Paradigms
  11. Altmetric Badge
    Chapter 10 Online Data Structures in External Memory
  12. Altmetric Badge
    Chapter 11 From Computational Learning Theory to Discovery Science
  13. Altmetric Badge
    Chapter 12 Bounded Depth Arithmetic Circuits: Counting and Closure
  14. Altmetric Badge
    Chapter 13 Parametric Temporal Logic for “Model Measuring”
  15. Altmetric Badge
    Chapter 14 Communicating Hierarchical State Machines
  16. Altmetric Badge
    Chapter 15 Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching Programs
  17. Altmetric Badge
    Chapter 16 General Morphisms of Petri Nets (Extended Abstract)
  18. Altmetric Badge
    Chapter 17 On Some Tighter Inapproximability Results (Extended Abstract)
  19. Altmetric Badge
    Chapter 18 Decomposition and Composition of Timed Automata
  20. Altmetric Badge
    Chapter 19 New Applications of the Incompressibility Method (Extended Abstract)
  21. Altmetric Badge
    Chapter 20 Mobility Types for Mobile Ambients
  22. Altmetric Badge
    Chapter 21 Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains
  23. Altmetric Badge
    Chapter 22 Decidable Fragments of Simultaneous Rigid Reachability
  24. Altmetric Badge
    Chapter 23 Text Compression Using Antidictionaries
  25. Altmetric Badge
    Chapter 24 Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract)
  26. Altmetric Badge
    Chapter 25 Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem
  27. Altmetric Badge
    Chapter 26 Space-Time Tradeoffs for Graph Properties
  28. Altmetric Badge
    Chapter 27 Boundedness of Reset P/T Nets
  29. Altmetric Badge
    Chapter 28 Two-way finite state transducers and monadic second-order logic
  30. Altmetric Badge
    Chapter 29 Partially Ordered Regular Languages for Graph Queries
  31. Altmetric Badge
    Chapter 30 Deciding First-Order Properties of Locally Tree-Decomposable Graphs
  32. Altmetric Badge
    Chapter 31 Comparison of Process Algebra Equivalences Using Formats
  33. Altmetric Badge
    Chapter 32 Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract)
  34. Altmetric Badge
    Chapter 33 Computing LOGCFL Certificates
  35. Altmetric Badge
    Chapter 34 Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract)
  36. Altmetric Badge
    Chapter 35 On the Complements of Partial k-Trees
  37. Altmetric Badge
    Chapter 36 Approximation Results for Kinetic Variants of TSP
  38. Altmetric Badge
    Chapter 37 Distributed Probabilistic Polling and Applications to Proportionate Agreement
  39. Altmetric Badge
    Chapter 38 Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract)
  40. Altmetric Badge
    Chapter 39 A Framework for Decidable Metrical Logics
  41. Altmetric Badge
    Chapter 40 On the Power of Las Vegas II. Two-Way Finite Automata
  42. Altmetric Badge
    Chapter 41 Stable Marriage with Incomplete Lists and Ties
  43. Altmetric Badge
    Chapter 42 Average-Case Complexity of Shellsort (Preliminary Version)
  44. Altmetric Badge
    Chapter 43 Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract)
  45. Altmetric Badge
    Chapter 44 A Connection between the Star Problem and the Finite Power Property in Trace Monoids (Extended Abstract)
  46. Altmetric Badge
    Chapter 45 Two Techniques in the Area of the Star Problem
  47. Altmetric Badge
    Chapter 46 Approximations by OBDDs and the Variable Ordering Problem
  48. Altmetric Badge
    Chapter 47 Simulation Preorder on Simple Process Algebras
  49. Altmetric Badge
    Chapter 48 Solos in Concert
  50. Altmetric Badge
    Chapter 49 Shortest Anisotropic Paths on Terrains
  51. Altmetric Badge
    Chapter 50 Relations between Local and Global Periodicity of Words (Extended Abstract)
  52. Altmetric Badge
    Chapter 51 Efficient Merging, Construction, and Maintenance of Evolutionary Trees
  53. Altmetric Badge
    Chapter 52 Formalizing a Lazy Substitution Proof System for π-Calculus in the Calculus of Inductive Constructions
  54. Altmetric Badge
    Chapter 53 Leader Election by d Dimensional Cellular Automata
  55. Altmetric Badge
    Chapter 54 New Upper Bounds for MaxSat
  56. Altmetric Badge
    Chapter 55 Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) ⋆
  57. Altmetric Badge
    Chapter 56 Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time
  58. Altmetric Badge
    Chapter 57 Finite Automata with Generalized Acceptance Criteria
  59. Altmetric Badge
    Chapter 58 A Variant of the Arrow Distributed Directory with Low Average Complexity (Extended Abstract)
  60. Altmetric Badge
    Chapter 59 Closed Freyd- and κ-categories
  61. Altmetric Badge
    Chapter 60 Typed Exceptions and Continuations Cannot Macro-Express Each Other
  62. Altmetric Badge
    Chapter 61 Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract)
  63. Altmetric Badge
    Chapter 62 Accessing Multiple Sequences Through Set Associative Caches
  64. Altmetric Badge
    Chapter 63 T(A) = T(B)?
  65. Altmetric Badge
    Chapter 64 Many-Valued Logics and Holographic Proofs
  66. Altmetric Badge
    Chapter 65 On the Complexity and Inapproximability of Shortest Implicant Problems
  67. Altmetric Badge
    Chapter 66 The Wave Propagator Is Turing Computable
  68. Altmetric Badge
    Chapter 67 An FPTAS for Agreeably Weighted Variance on a Single Machine (Extended Abstract)
  69. Altmetric Badge
    Chapter 68 Erratum: Bulk-Synchronous Parallel Multiplication of Boolean Matrices
Attention for Chapter 41: Stable Marriage with Incomplete Lists and Ties
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
31 Mendeley
Summary Dimensions citations
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
Stable Marriage with Incomplete Lists and Ties
Chapter number 41
Book title
Automata, Languages and Programming
Published in
Lecture notes in computer science, January 2002
DOI 10.1007/3-540-48523-6_41
Book ISBNs
978-3-54-066224-2, 978-3-54-048523-0
Authors

Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita, David Manlove

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Spain 1 3%
Unknown 30 97%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 9 29%
Professor > Associate Professor 5 16%
Researcher 5 16%
Student > Master 3 10%
Lecturer 2 6%
Other 4 13%
Unknown 3 10%
Readers by discipline Count As %
Computer Science 16 52%
Engineering 4 13%
Mathematics 2 6%
Business, Management and Accounting 2 6%
Agricultural and Biological Sciences 1 3%
Other 2 6%
Unknown 4 13%

This page is provided by Altmetric.