EDBT 2026 Demo / reviewers in the wild / expert
Hermann A. Maurer
dblp:m/HermannAMaurer · also Hermann Maurer
· DBLP profile ↗
83ranked-venue papers
49as first author
2since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 55 · 33 first-authorDatabases, data management, data science and information retrieval · 14 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 10 · 6 first-authorComputer networks · 8 · 3 first-authorSoftware engineering, systems software and programming languages · 3 · 3 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 since 2021
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
20 papers |
Automata and formal languages · 91% Computational complexity · 4% Graph algorithms and graph theory · 4% |
Topics — the 17 heaviest of 21, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages
l systems |
0.0 | 5 | 1979 | Context-Dependent L Forms · Inf. Control. 1979 Uniform Interpretations of L Forms · Inf. Control. 1978 Increasing the Similarity of EOL Form Interpretations · Inf. Control. 1978 |
Automata and formal languages
formal grammars |
0.0 | 4 | 1981 | Uniform Interpretations of Grammar Forms · SIAM J. Comput. 1981 Pure Grammars · Inf. Control. 1980 On Good E0L Forms · SIAM J. Comput. 1978 |
Automata and formal languages › grammar formalisms
grammar forms |
0.0 | 2 | 1982 | Dense Hierarchies of Grammatical Families · J. ACM 1982 Uniform Interpretations of Grammar Forms · SIAM J. Comput. 1981 |
Automata and formal languages › grammar transformation
normal forms |
0.0 | 2 | 1983 | A Supernormal-Form Theorem for Context-Free Grammars · J. ACM 1983 Propagating Chain-Free Normal Forms for EOL Systems · Inf. Control. 1978 |
Automata and formal languages › formal grammars
context-free grammar |
0.0 | 1 | 1983 | A Supernormal-Form Theorem for Context-Free Grammars · J. ACM 1983 |
Automata and formal languages › formal language classes
picture languages |
0.0 | 1 | 1982 | Using String Languages to Describe Picture Languages · Inf. Control. 1982 |
Graph algorithms and graph theory
graph coloring |
0.0 | 1 | 1981 | On the Complexity of the General Coloring Problem · Inf. Control. 1981 |
Automata and formal languages
context-free languages |
0.0 | 2 | 1978 | Simple EOL Forms under Uniform Interpretation Generating CF Languages · ICALP 1978 A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language · J. ACM 1969 |
Automata and formal languages › formal grammars
continuous grammars |
0.0 | 1 | 1980 | Continuous Grammars · Inf. Control. 1980 |
Automata and formal languages › formal grammars
grammar systems |
0.0 | 1 | 1980 | Continuous Grammars · Inf. Control. 1980 |
Automata and formal languages
regular languages |
0.0 | 1 | 1979 | Bijective A-Transducers · FOCS 1979 |
Automata and formal languages
transducers |
0.0 | 1 | 1979 | Bijective A-Transducers · FOCS 1979 |
Automata and formal languages
formal translations |
0.0 | 1 | 1976 | Formal Translations and Szilard Languages · Inf. Control. 1976 |
Automata and formal languages › formal grammars
szilard languages |
0.0 | 1 | 1976 | Formal Translations and Szilard Languages · Inf. Control. 1976 |
Automata and formal languages › formal grammars › regulated rewriting
matrix languages |
0.0 | 1 | 1973 | Simple Matrix Languages with a Leftmost Restriction · Inf. Control. 1973 |
Combinatorics and discrete mathematics › analytic combinatorics
structure generating function |
0.0 | 1 | 1971 | The Structure Generating Function and Entropy of Tuple Languages · Inf. Control. 1971 |
Automata and formal languages › context-free languages
inherent ambiguity |
0.0 | 1 | 1969 | A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language · J. ACM 1969 |
Methods — techniques the papers use, named apart from their topics
formal language theory · 0.0grammar transformation · 0.0hierarchy construction · 0.0grammar interpretation · 0.0complexity analysis · 0.0uniform interpretations · 0.0similarity analysis · 0.0formal grammar theory · 0.0bijection construction · 0.0automata theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Passively Acquiring Information Must End
Hermann A. Maurer, Bilal Zaka, Sonja Eisenberger |
EuroSPI | 1 |
| 2021 | Impact analysis of adverbs for sentiment classification on Twitter product reviewsabstractSummary Social networking websites such as Twitter provide a platform where users share their opinions about different news, events, and products. A recent research has identified that 81% of users search online first before purchasing products. Reviews are written in natural language and needs sentiment analysis for opinion extraction. Various approaches have been proposed to perform sentiment classification based on polarity bearing words in reviews such as noun, verb, adverb, and an adjective. Prior researchers have also identified the role of an adverb as a feature. However, impact analysis of adverb forms, are not yet studied and remains an open research area. This study focused on the following tasks: (1) impact of different forms of adverbs that are not studied for sentiment classification; (2) analysis of possible combinations of eight forms that are 255. The different forms are Adverb (RA), Degree Adverbs (RG), Degree Comparative Adverbs (RGR), General Adverbs (RR), General Comparative Adverbs (RRR), Locative Adverbs (RL), Prep. Adverb (RP), and Adverbs of time (RT); (3) comparison with benchmark dataset. Dataset of 5513 tweets is used to evaluate the idea. The findings of this work show that RRR and RR are important polarities bearing words for neutral opinions, RL for positive, and RP for negative opinions. Sajjad Haider 0008, Muhammad Tanvir Afzal, Muhammad Asif 0002, Hermann A. Maurer, Awais Ahmad 0001, Abdelrahman Abuarqoub |
Concurr. Comput. Pract. Exp. | 4 |
| 2019 | A Critical Discussion of Some Current and Future Developments of IT
Hermann A. Maurer, Namik Delilovic |
EuroSPI | 1 |
| 2015 | Facts Collection and Verification EffortsabstractGeographic web portals and geospatial databases are emerging on the web recently, offering information about countries and places in the world. Digital content is increasing at a staggering rate due to community collaboration and the integration of information from webcams and sensors. Like in case of Wikipedia, some geospatial databases allow everyone to edit the content. We cannot ignore the role of wikis and geospatial databases particularly Wikipedia, Wikicommons, GeoNames etc., as they have replaced the traditional encyclopedias and they are empowering information seekers by providing information at the door step. However, there is no guarantee of validity and authenticity of the information provided by them. The reason behind is that very little attention has been given to verify information before publishing it on the Web. Also, to find particular information about countries, web users mainly teachers, students and tourists rely on search engines
such as Google which often points to Wikipedia. We will identify some inconsistencies in online facts such as area, cities and mountains rankings using multiple data sources. Our investigations reveal that there is a need for a reliable geographic web portal which can be used for learning and other purpose. We will explain how we managed to devise a mechanism for collecting and verifying different facts. Our attempt to provide a reliable geographic web portal has resulted in a comprehensive collection covering a wide range of information aspects such as culture, geography, economy etc. that are associated with a country. We will also describe our approach to measure the reliability of geographic facts such as area, cities and mountains rankings for all countries. Rizwan Mehmood, Hermann A. Maurer |
DATA | 2 |
| 2013 | Metadata Extraction from Books with Facts about AustriaabstractDigitized fact books are valuable sources of knowledge. Full-text search is a powerful tool to access such knowledge. However, it often delivers too many results for general queries. Therefore we propose an approach to find relevant data by extracting metadata relevant for each page and allow to search for pages on the basis of their metadata as alternative to full-text search. Given the size of scanned data (high quality image scans) clearly this extraction cannot be done manually. As it turns out, although there are some common aspects, different books often need to be treated differently. In particular we can distinguish two kinds of books: lexicons (dictionaries) where items are arranged alphabetically and other books that describe various topics in a more narrative style. In this paper we describe the approach we used on different fact books in detail and share our learnings from this subject. Petra Korica-Pehserl, Hermann A. Maurer |
iiWAS | 2 |
| 2013 | Aspects of Information Integration in a WikiabstractInformation integration means pulling information pieces from various sources together with as little loss, as little overlap and as little redundancy of information as is possible. This paper explores different aspects of information integration using as an example a wiki that contains a set of documents to which we want to add suitable further pictures. We take into account a number of important aspects such as: (i) Pictures outside the domain of the wiki are ignored. (ii) Pictures that already occur in the wiki or very similar to existing ones are also ignored. (iii) Each new picture has to be associated with a suitable document in the wiki subject to three restraints: if a suitable document does not exist, a new one is created; if the document size due to pictures gets too large some additional actions are necessary; an image may be associated with more than one document. Each of the above points offer many challenges which are discussed. Rizwan Mehmood, Hermann A. Maurer |
iiWAS | 2 |
| 2013 | Towards the integration of images on the WebabstractDue to the proliferation of data sources on the Web, information integration has emerged as a research topic of great interest in the scholars community. The crutial challenge is to stitch heterogeneous data together. In addition to formulating the problem of information integration, we sketch a model of information integration system based on the past efforts which represent original heritage of the field. We describe key components of an information integration system and their usage with an example in the image domain. To facilitate searching of images about a particular geo entity we have developed a system that presents a unified view of images extracted from different data sources. The real challenge is the extraction of images from different data sources followed by their meaningful representation on the user interface which is discussed along with the problems related to the deep Web which came up while crawling Web data. Rizwan Mehmood, Hermann A. Maurer |
iiWAS | 2 |
| 2013 | New Technologies: We have seen nothing yetabstractIn this talk we will argue that developments in science will continue with increasing speed, opening completely new vistas. Why this is so is not just due to the usual trivial observations such as "developments are happening very fast and it seems even at accelerating speed". Rather, we will show a number of much deeper reasons, why nw developments will come at us as surprise, and to an extent hard to imagine. Some of the arguments are surprising in themselves and shed a light on how we think, and how we have to change our thinking to at least grasp a bit of what is going to happen. Surprisingly, it also turns out that some reasons show the weaknesses of our information age and how knowing this, we can become better in handling complicated situations and negotiations. If this sounds all a bit vague, it is, and it is vague on purpose: the speaker wants to surprise everyone in the audience a few times by presenting concrete samples and does not want to give away some of the highlights in this abstract. Hermann A. Maurer |
MoMM | 1 |
| 2012 | A linear ordering of a multi-parameter universe is usually nonsenseabstractWe are talking about the most beautiful woman in the world, about the largest cave in Europe, about the best sportsman of a particular year. We have even started to rank companies according to their “intellectual assets”, universities according to their “importance”, and scientists according to their “impact”. It is time that we protest against this culture of “linearity” in a world that is multi-faceted, where many things cannot be described by one parameter, but only (if at all) by a very long vector of parameters. In this paper, I investigate this phenomenon to some extent as it applies to (computer) scientists and also indicate a link to the information avalanche we are confronted with. Hermann A. Maurer |
Theor. Comput. Sci. | 1 |
| 2011 | Adaptive Visual Symbols for Personal Health RecordsabstractAs a hub of information controlled by the patient, personal health records (PHR) collect information from the patient medical history including a wide variety of data sources as patient's observations, lab results, clinical findings and in the future maybe even personal genetic data and automatic recordings from monitoring devices. This development will on the one hand make health care more personalized and user controlled but on the other hand also overloads consumers with a huge amount of data. To address this issue we developed a framework for adaptive visual symbols (AVS). An AVS can adapt its appearance and level of detail during the communication process. Finally we demonstrate the AVS principle for the visualization of personal health records. Heimo Müller, Hermann A. Maurer, Robert Reihs, Stefan Sauer 0002, Kurt Zatloukal |
IV | 2 |
| 2010 | "How Much Technology?" is the Question
Hermann A. Maurer |
CSEDU (1) | 1 |
| 2009 | Extended Visualization for a Digital Journal
Muhammad Salman Khan 0003, Muhammad Tanvir Afzal, Narayanan Kulathuramaiyer, Hermann A. Maurer |
WEBIST | 4 |
| 2006 | The Growing Importance of E-Communities
Hermann A. Maurer |
WEBIST (1) | 1 |
| 2004 | Knowledge transfer processes in a modern WBT system
Denis Helic, Hermann A. Maurer, Nick Scerbakov |
J. Netw. Comput. Appl. | 2 |
| 2001 | MUSLI: A hypermedia interface for dynamic, interactive, and symbolic communication
Jennifer Lennon, Hermann A. Maurer |
J. Netw. Comput. Appl. | 2 |
| 2001 | Augmenting text and voice conversations with dynamic, interactive abstractions using P2P networking
Jennifer Lennon, Hermann A. Maurer |
J. Netw. Comput. Appl. | 2 |
| 2000 | Preface for the special issue 'Support for flexible e-Learning on the WWW'
Hermann A. Maurer |
J. Netw. Comput. Appl. | 1 |
| 1999 | Introducing hypermedia composites to WWW
Denis Helic, Hermann A. Maurer, Nick Scerbakov |
J. Netw. Comput. Appl. | 2 |
| 1995 | On Some New Aspects of Networked Multimedia Systems
Hermann A. Maurer |
SOFSEM | 1 |
| 1995 | Serving Information to the Web with Hyper-G
Keith Andrews, Frank Kappe, Hermann A. Maurer |
Comput. Networks ISDN Syst. | 3 |
| 1995 | HM-Card: A New Hypermedia Authoring System
Hermann A. Maurer, Nick Scerbakov, Achim Schneider |
Multim. Tools Appl. | 1 |
| 1994 | The AEIOU hypermedia projectabstractAustria is celebrating its millennium in 1996: although Austria is much older than 1000 years, the German name for Austria (Ostarici) is first found in a written document dated 996. For this celebration, one of the most ambitious networked multimedia presentations ever is currently being developed. For the name of the project, the acronym AEIOU has been chosen: one may read this as "Annotatable Electronic Interactive Ostarici Universal presentation" or as "Austria Erit In Orbe Ultima" ("Austria will be the best in the world"). Most aspects of Austria are covered by compiling a 50 GByte database that will be available as a series of CD-ROMs, as public kiosk applications and as a multi-platform presentation via the Internet. This paper describes the aim of the project, mentions some of the more unusual details and reports on the status of the development.> Hermann A. Maurer |
CA | 1 |
| 1994 | J.UCS - The next generation in electronic journal publishing
Hermann A. Maurer, Klaus Schmaranz |
Comput. Networks ISDN Syst. | 1 |
| 1994 | Object-oriented modelling of hyperstructure: overcoming the static link deficiency
Hermann A. Maurer, Nick Scerbakov, Keith Andrews, P. Srinivasan 0001 |
Inf. Softw. Technol. | 1 |
| 1993 | A New Hyermedia Data Model
Hermann A. Maurer, Nick Scerbakov, P. Srinivasan 0001 |
DEXA | 1 |
| 1991 | Bounded Delay L Codes
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Theor. Comput. Sci. | 1 |
| 1985 | Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane
Herbert Edelsbrunner, Hermann A. Maurer |
Inf. Process. Lett. | 2 |
| 1984 | Context-Free Complexity of Finite Languages
Walter Bucher, Hermann A. Maurer, Karel Culík II |
Theor. Comput. Sci. | 2 |
| 1983 | Inhouse Versus Public Videotex Systems
Hermann A. Maurer, Istvan Sebestyén |
Comput. Networks | 1 |
| 1983 | A Supernormal-Form Theorem for Context-Free GrammarsabstractFor every triple (k, /, m) of nonnegaUve integers, every context-free grammar G can be transformed rote a normal form where (1) each nontermmating production is of the type A ~ wkBwtCw,~ with I wk [ = k, I wll --/, and I w,~ [ = m, and 00 each terminating producUon A ~ w has the property that I wl appears m the length set of L(G).Apphcations and generalizations of this result are discussed. Hermann A. Maurer, Arto Salomaa, Derick Wood |
J. ACM | 1 |
| 1983 | L Codes and Number Systems
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Theor. Comput. Sci. | 1 |
| 1982 | Using String Languages to Describe Picture Languages
Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl |
Inf. Control. | 1 |
| 1982 | Polygonal Intersection Searching
Herbert Edelsbrunner, Hermann A. Maurer, David G. Kirkpatrick |
Inf. Process. Lett. | 2 |
| 1982 | Dense Hierarchies of Grammatical FamiliesabstractA technique ts presented for constructing dense hierarchies of grammatical subfamthes of context-free languages The question of "where" such dense hierarchies may lie is also investigated Infinite hierarchies of successors are studied.The major open problems concern questions deahng with fimte grammar forms Categories and SubJect Descriptors.F 4 3 ] Hermann A. Maurer, Arto Salomaa, Derick Wood |
J. ACM | 1 |
| 1982 | Finitary and Infinitary Interpretations of Languages
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Math. Syst. Theory | 1 |
| 1981 | Colorings and interpretations: a connection between graphs and grammar forms
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Discret. Appl. Math. | 1 |
| 1981 | Decidability and density in two-symbol grammar forms
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Discret. Appl. Math. | 1 |
| 1981 | On subregular OL forms
Jürgen Albert, Hermann A. Maurer, Thomas Ottmann |
Fundam. Informaticae | 2 |
| 1981 | On Predecessors of Finite Languages
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Inf. Control. | 1 |
| 1981 | On the Complexity of the General Coloring Problem
Hermann A. Maurer, Ivan Hal Sudborough, Emo Welzl |
Inf. Control. | 1 |
| 1981 | On the Intersection of Orthogonal Objects
Herbert Edelsbrunner, Hermann A. Maurer |
Inf. Process. Lett. | 2 |
| 1981 | Completeness of Context-Free Grammar Forms
Hermann A. Maurer, Arto Salomaa, Derick Wood |
J. Comput. Syst. Sci. | 1 |
| 1981 | Uniform Interpretations of Grammar FormsabstractEncouraged by positive experiences with so-called uniform-interpretations of L-forms, we investigate in this paper a suitable analogous definition of uniform interpretations of grammar forms. Concerning CF grammar forms it is shown that a rich variety of language families can be obtained. CF grammar forms with a single variable are extensively examined both with regard to generative capacity (including a characterization of subregular, sublinear and subfinite index families) and with regard to the notion of goodness and badness. Concerning non-CF grammar forms it is shown that each of the families of EOL-, ETOL-, matrix-, scattered context-, context sensitive, type 0-languages (and many others) can be obtained by using interpretations of one form specific to this family. Hermann A. Maurer, Arto Salomaa, Derick Wood |
SIAM J. Comput. | 1 |
| 1981 | Concise Description of Finite Languages
Walter Bucher, Hermann A. Maurer, Karel Culík II, Detlef Wotschke |
Theor. Comput. Sci. | 2 |
| 1981 | A Space-Optimal Solution of General Region Location
Herbert Edelsbrunner, Hermann A. Maurer |
Theor. Comput. Sci. | 2 |
| 1980 | The Post-Office Problem and Related Questions
Hermann A. Maurer |
WG | 1 |
| 1980 | Efficient Worst-Case Data Structures for Range Searching
Jon Louis Bentley, Hermann A. Maurer |
Acta Informatica | 2 |
| 1980 | Rational Bijection of Rational Sets
Hermann A. Maurer, Maurice Nivat |
Acta Informatica | 1 |
| 1980 | On Generators and Generative Capacity of EOL Forms
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Acta Informatica | 1 |
| 1980 | Simple EOL forms under uniform interpretation generating CF languages
Jürgen Albert, Hermann A. Maurer, Grzegorz Rozenberg |
Fundam. Informaticae | 2 |
| 1980 | Continuous Grammars
Andrzej Ehrenfeucht, Hermann A. Maurer, Grzegorz Rozenberg |
Inf. Control. | 2 |
| 1980 | Pure Grammars
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Inf. Control. | 1 |
| 1980 | MSW Spaces
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Inf. Control. | 1 |
| 1980 | Context-Free Grammar Forms with Strict Interpretations
Hermann A. Maurer, Arto Salomaa, Derick Wood |
J. Comput. Syst. Sci. | 1 |
| 1980 | Synchronized E0L Forms
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Theor. Comput. Sci. | 1 |
| 1979 | Bijective A-TransducersabstractIn this paper we study bijective a-transducers. We derive necessary and sufficient conditions on pairs of regular sets (R,S) such that a bijective a-transducer, mapping R cnto S exists. The results obtained allow the systematic construction of an a-transducer, mapping a set R onto a set S bijectively for surprisingly "different" regular sets R and S. Hermann A. Maurer, Maurice Nivat |
FOCS | 1 |
| 1979 | On Some Recent Developments in Cryptography and Their Applications to Computer Science
Hermann A. Maurer |
MFCS | 1 |
| 1979 | On ε productions for terminals in E0L forms
Werner Ainhirn, Hermann A. Maurer |
Discret. Appl. Math. | 2 |
| 1979 | Context-Dependent L Forms
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Inf. Control. | 1 |
| 1979 | A Note on Euclidean Near Neighbor Searching in the Plane
Jon Louis Bentley, Hermann A. Maurer |
Inf. Process. Lett. | 2 |
| 1979 | Secure Information Storage and Retrieval Using New Results in Cryptography
Karel Culík II, Hermann A. Maurer |
Inf. Process. Lett. | 2 |
| 1979 | On Non Context-Free Grammar Forms
Hermann A. Maurer, Martti Penttonen, Arto Salomaa, Derick Wood |
Math. Syst. Theory | 1 |
| 1978 | Simple EOL Forms under Uniform Interpretation Generating CF Languages
Jürgen Albert, Hermann A. Maurer, Grzegorz Rozenberg |
ICALP | 2 |
| 1978 | Good OL Forms
H. Hule, Hermann A. Maurer, Thomas Ottmann |
Acta Informatica | 2 |
| 1978 | Propagating Chain-Free Normal Forms for EOL Systems
Karel Culík II, Hermann A. Maurer |
Inf. Control. | 2 |
| 1978 | Increasing the Similarity of EOL Form Interpretations
Hermann A. Maurer, Grzegorz Rozenberg |
Inf. Control. | 1 |
| 1978 | Uniform Interpretations of L Forms
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Inf. Control. | 1 |
| 1978 | ETOL Forms
Hermann A. Maurer, Arto Salomaa, Derick Wood |
J. Comput. Syst. Sci. | 1 |
| 1978 | On Good E0L FormsabstractThis paper continues the study of EOL forms. The notion of a good EOL form is introduced as an important generalization of the notion of complete and very complete EOL forms. Transformations preserving the property good are obtained and the existence of a variety of good and bad (i.e. not good) forms is demonstrated. It is further shown that good and complete (i.e. vomplete) EOL forms do exist; that propagating EOL forms are bad except under very special circumstances; and that synchronized EOL forms are always bad. Hermann A. Maurer, Arto Salomaa, Derick Wood |
SIAM J. Comput. | 1 |
| 1978 | On Two-Symbol Complete E0L Forms
Karel Culík II, Hermann A. Maurer, Thomas Ottmann |
Theor. Comput. Sci. | 2 |
| 1978 | Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms
Karel Culík II, Hermann A. Maurer, Thomas Ottmann, Keijo Ruohonen, Arto Salomaa |
Theor. Comput. Sci. | 2 |
| 1977 | Tree-Structures for Set Manipulation Problems
Hermann A. Maurer, Thomas Ottmann |
MFCS | 1 |
| 1977 | EOL Forms
Hermann A. Maurer, Arto Salomaa, Derick Wood |
Acta Informatica | 1 |
| 1977 | The Class of Context-Free Languages is not an E0L Family
Jürgen Albert, Hermann A. Maurer |
Inf. Process. Lett. | 2 |
| 1977 | On the Form Equivalence of L-Forms
Hermann A. Maurer, Thomas Ottmann, Arto Salomaa |
Theor. Comput. Sci. | 1 |
| 1976 | On Grammar Forms with Terminal Context
Hermann A. Maurer, Derick Wood |
Acta Informatica | 1 |
| 1976 | Formal Translations and Szilard Languages
Hans-Peter Kriegel, Hermann A. Maurer |
Inf. Control. | 2 |
| 1976 | Implementing Dictionaries Using Binary Trees of Very Small Height
Hermann A. Maurer, Thomas Ottmann, Hans-Werner Six |
Inf. Process. Lett. | 1 |
| 1973 | Simple Matrix Languages with a Leftmost Restriction
Hermann A. Maurer |
Inf. Control. | 1 |
| 1973 | A Note on Leftmost Restricted Random Context Grammars
Armin B. Cremers, Hermann A. Maurer, Otto Mayer |
Inf. Process. Lett. | 2 |
| 1971 | The Structure Generating Function and Entropy of Tuple Languages
Werner Kuich, Hermann A. Maurer |
Inf. Control. | 2 |
| 1971 | The Solution of a Problem by Ginsburg
Hermann A. Maurer |
Inf. Process. Lett. | 1 |
| 1969 | A Direct Proof of the Inherent Ambiguity of a Simple Context-Free LanguageabstractA direct and self-contained proof is given of the inherent ambiguity of the context-free language L = { a i b i c i ∣ i,j > 1} ∪ { a i b i c i ∣ i,j > 1}, which is the solution to an open problem pointed out by Ginsburg. Hermann A. Maurer |
J. ACM | 1 |