Hermann Maurer

From MaRDI portal
(Redirected from Hermann Maurer)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Tribute to Arto Salomaa. A towering figure in theoretical computer science
Bulletin of the European Association for Theoretical Computer Science EATCS
2025-04-22Paper
Merging image databases as an example for information integration
CEJOR. Central European Journal of Operations Research
2016-07-04Paper
Calude as Father of One of the Computer Science Journals
Computation, Physics and Beyond
2012-06-15Paper
Seventy years Derick Wood2010-09-22Paper
scientific article; zbMATH DE number 1951562 (Why is no real title available?)2003-07-21Paper
Can knowledge management help in poverty-stricken countries and crisis situations
Journal of Universal Computer Science
2001-10-23Paper
Active documents: Concept, implementation and applications
Journal of Universal Computer Science
2001-05-10Paper
scientific article; zbMATH DE number 1542823 (Why is no real title available?)2001-02-26Paper
scientific article; zbMATH DE number 1408327 (Why is no real title available?)2000-04-03Paper
scientific article; zbMATH DE number 1263585 (Why is no real title available?)1999-11-03Paper
scientific article; zbMATH DE number 1342350 (Why is no real title available?)1999-09-22Paper
scientific article; zbMATH DE number 1138728 (Why is no real title available?)1998-04-05Paper
Bounded delay L codes
Theoretical Computer Science
1992-06-26Paper
Denseness, maximality, and decidability of grammatical families
Annales Academiae Scientiarum Fennicae Series A I Mathematica
1986-01-01Paper
Finding extreme points in three dimensions and solving the post-office problem in the plane
Information Processing Letters
1985-01-01Paper
scientific article; zbMATH DE number 3860410 (Why is no real title available?)1984-01-01Paper
Context-free complexity of finite languages
Theoretical Computer Science
1984-01-01Paper
A Supernormal-Form Theorem for Context-Free Grammars
Journal of the ACM
1983-01-01Paper
scientific article; zbMATH DE number 3827229 (Why is no real title available?)1983-01-01Paper
On finite grammar forms
International Journal of Computer Mathematics
1983-01-01Paper
L codes and number systems
Theoretical Computer Science
1983-01-01Paper
Stabbing line segments
BIT
1982-01-01Paper
Polygonal intersection searching
Information Processing Letters
1982-01-01Paper
Using string languages to describe picture languages
Information and Control
1982-01-01Paper
Dense Hierarchies of Grammatical Families
Journal of the ACM
1982-01-01Paper
Finitary and infinitary interpretations of languages
Mathematical Systems Theory
1982-01-01Paper
Colorings and interpretations: a connection between graphs and grammar forms
Discrete Applied Mathematics
1981-01-01Paper
A space-optimal solution of general region location
Theoretical Computer Science
1981-01-01Paper
Concise description of finite languages
Theoretical Computer Science
1981-01-01Paper
Completeness of context-free grammar forms
Journal of Computer and System Sciences
1981-01-01Paper
Decidability and density in two-symbol grammar forms
Discrete Applied Mathematics
1981-01-01Paper
On predecessors of finite languages
Information and Control
1981-01-01Paper
Sub context-free<i>L</i>forms<sup>†</sup>
International Journal of Computer Mathematics
1981-01-01Paper
Derivation languages of grammar forms†
International Journal of Computer Mathematics
1981-01-01Paper
Uniform Interpretations of Grammar Forms
SIAM Journal on Computing
1981-01-01Paper
On the complexity of the general coloring problem
Information and Control
1981-01-01Paper
scientific article; zbMATH DE number 3800951 (Why is no real title available?)1981-01-01Paper
Synchronized EOL forms
Theoretical Computer Science
1980-01-01Paper
Context-free grammar forms with strict interpretations
Journal of Computer and System Sciences
1980-01-01Paper
Efficient worst-case data structures for range searching
Acta Informatica
1980-01-01Paper
Rational bijection of rational sets
Acta Informatica
1980-01-01Paper
On generators and generative capacity of EOL forms
Acta Informatica
1980-01-01Paper
Pure grammars
Information and Control
1980-01-01Paper
scientific article; zbMATH DE number 3716802 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3720382 (Why is no real title available?)1980-01-01Paper
Continuous grammars
Information and Control
1980-01-01Paper
MSW spaces
Information and Control
1980-01-01Paper
On epsilon productions for terminals in EOL forms
Discrete Applied Mathematics
1979-01-01Paper
A note on Euclidean near neighbor searching in the plane
Information Processing Letters
1979-01-01Paper
Secure information storage and retrieval using new results in cryptography
Information Processing Letters
1979-01-01Paper
On non context-free grammar forms
Mathematical Systems Theory
1979-01-01Paper
Context-dependent L forms
Information and Control
1979-01-01Paper
scientific article; zbMATH DE number 3673546 (Why is no real title available?)1979-01-01Paper
scientific article; zbMATH DE number 3677226 (Why is no real title available?)1979-01-01Paper
scientific article; zbMATH DE number 3617566 (Why is no real title available?)1979-01-01Paper
scientific article; zbMATH DE number 3628376 (Why is no real title available?)1979-01-01Paper
Isomorphism, form equivalence and sequence equivalence of PDOL forms
Theoretical Computer Science
1978-01-01Paper
On two-symbol complete EOL forms
Theoretical Computer Science
1978-01-01Paper
Good OL forms
Acta Informatica
1978-01-01Paper
ETOL forms
Journal of Computer and System Sciences
1978-01-01Paper
Uniform interpretations of L forms
Information and Control
1978-01-01Paper
Propagating chain-free normal forms for EOL systems
Information and Control
1978-01-01Paper
On Good EOL Forms
SIAM Journal on Computing
1978-01-01Paper
scientific article; zbMATH DE number 3594669 (Why is no real title available?)1978-01-01Paper
Increasing the similarity of EOL form interpretations
Information and Control
1978-01-01Paper
scientific article; zbMATH DE number 3604380 (Why is no real title available?)1978-01-01Paper
String representations of graphs
International Journal of Computer Mathematics
1978-01-01Paper
EOL forms
Acta Informatica
1977-01-01Paper
On the form equivalence of L-forms
Theoretical Computer Science
1977-01-01Paper
Tree controlled grammars
Computing
1977-01-01Paper
On quasi-interpretations of grammar forms
Computing
1977-01-01Paper
The class of context-free languages is not an EOL family
Information Processing Letters
1977-01-01Paper
scientific article; zbMATH DE number 3666161 (Why is no real title available?)1977-01-01Paper
scientific article; zbMATH DE number 3551891 (Why is no real title available?)1977-01-01Paper
scientific article; zbMATH DE number 3562548 (Why is no real title available?)1977-01-01Paper
scientific article; zbMATH DE number 3566740 (Why is no real title available?)1977-01-01Paper
On grammar forms with terminal context
Acta Informatica
1976-01-01Paper
Implementing dictionaries using binary trees of very small height
Information Processing Letters
1976-01-01Paper
On strongly equivalent context-free grammar forms
Computing
1976-01-01Paper
scientific article; zbMATH DE number 3497359 (Why is no real title available?)1976-01-01Paper
Formal translations and Szilard languages
Information and Control
1976-01-01Paper
scientific article; zbMATH DE number 3574964 (Why is no real title available?)1976-01-01Paper
scientific article; zbMATH DE number 3488636 (Why is no real title available?)1975-01-01Paper
scientific article; zbMATH DE number 3453089 (Why is no real title available?)1974-01-01Paper
A note on leftmost restricted random context grammars
Information Processing Letters
1973-01-01Paper
Simple matrix languages with a leftmost restriction
Information and Control
1973-01-01Paper
The solution of a problem by Ginsburg
Information Processing Letters
1971-01-01Paper
On the inherent ambiguity of simple tuple languages
Computing
1971-01-01Paper
The structure generating function and entropy of tuple languages
Information and Control
1971-01-01Paper
A note on the complement of inherently ambiguous context-free languages
Communications of the ACM
1970-01-01Paper
A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language
Journal of the ACM
1969-01-01Paper


Research outcomes over time


This page was built for person: Hermann Maurer