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.
Mendeley readers
Chapter title |
ω-Regular Languages Are Testable with a Constant Number of Queries
|
---|---|
Chapter number | 3 |
Book title |
Randomization and Approximation Techniques in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, September 2002
|
DOI | 10.1007/3-540-45726-7_3 |
Book ISBNs |
978-3-54-044147-2, 978-3-54-045726-8
|
Authors |
Hana Chockler, Orna Kupferman |
Mendeley readers
The data shown below were compiled from readership statistics for 26 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 2 | 8% |
Unknown | 24 | 92% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 7 | 27% |
Student > Master | 5 | 19% |
Researcher | 4 | 15% |
Professor | 3 | 12% |
Professor > Associate Professor | 2 | 8% |
Other | 2 | 8% |
Unknown | 3 | 12% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 21 | 81% |
Mathematics | 1 | 4% |
Physics and Astronomy | 1 | 4% |
Unknown | 3 | 12% |