Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Otto Mayer

dblp:38/797 · DBLP profile ↗
← Back
13ranked-venue papers
4as first author
0since 2021 · last 1992
0000-0002-8023-3749ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 12 · 4 first-authorDatabases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
4 papers
Automata and formal languages · 95% Computational complexity · 5%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 5 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
parsing
0.011979
On Deterministic Canonical Bottom-up-Parsing · Inf. Control. 1979
Automata and formal languages › context-free languages
context-free rewriting systems
0.011974
On the Complexity of Regulated Context-Free Rewriting · Inf. Control. 1974
Automata and formal languages › formal grammars
context-free grammar
0.011972
Some Restrictive Devices for Context-Free Grammars · Inf. Control. 1972
Automata and formal languages
formal grammars
0.011972
Some Restrictive Devices for Context-Free Grammars · Inf. Control. 1972
Automata and formal languages › formal grammars › regulated rewriting
matrix grammars
0.011973
On Matrix Languages · Inf. Control. 1973

Methods — techniques the papers use, named apart from their topics

deterministic parsing · 0.0restrictive devices · 0.0regulated context-free rewriting · 0.0matrix languages · 0.0
YearPublicationVenuePosition
1992 Concurrency Control in the Interpolation-Based Grid File
Aris M. Ouksel, A. Ghazal, Otto Mayer
DEXA3
1992 A Robust and Efficient Spatial Data Structure
Aris M. Ouksel, Otto Mayer
Acta Informatica2
1979 On Deterministic Canonical Bottom-up-Parsing
Otto Mayer
Inf. Control.1
1979 On Strict Interpretations of Grammar Forms
Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke
Math. Syst. Theory3
1978 A Framework for Producing Deterministic Canonical Bottom-up Parsers
Otto Mayer
MFCS1
1976 On Strict Interpretations of Grammar Forms
Seymour Ginsburg, Otto Mayer
MFCS2
1975 On the Analysis and Synthesis Problems for Context-Free Expressions
Otto Mayer
MFCS1
1974 On the Complexity of Regulated Context-Free Rewriting
Armin B. Cremers, Otto Mayer, K. Weiss
Inf. Control.2
1974 On Vector Languages
Armin B. Cremers, Otto Mayer
J. Comput. Syst. Sci.2
1973 On Vector Languages
Armin B. Cremers, Otto Mayer
MFCS2
1973 On Matrix Languages
Armin B. Cremers, Otto Mayer
Inf. Control.2
1973 A Note on Leftmost Restricted Random Context Grammars
Armin B. Cremers, Hermann A. Maurer, Otto Mayer
Inf. Process. Lett.3
1972 Some Restrictive Devices for Context-Free Grammars
Otto Mayer
Inf. Control.1