Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.1
1.8
Journals
Algorithms
Special Issues
Selected papers from “Theorietage der Gesellschaft für Informatik” in Speyer; Invited Talks
share announcement

Selected papers from “Theorietage der Gesellschaft für Informatik” in Speyer; Invited Talks

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (29 February 2016) | Viewed by 25270

Special Issue Editor

Prof. Dr. Henning Fernau

E-Mail Website
Guest Editor
Informatikwissenschaften, Fachbereich 4, Universität Trier, Universitätsring 15, 54296 Trier, Germany
Interests: complexity theory; fixed parameter algorithms; formal languages; fractal geometry; learning algorithms (machine learning) and pattern recognition
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

The “Gesellschaft für Informatik” (German Informatics Society) is the largest organization of German-based computer scientists. In 2015, the special interest groups of algorithms and complexity, as well as of automata theory and formal languages, held their annual meeting in Speyer. There were a number of invited speakers who attempted to interconnect the above mentioned areas. In this Special Issue, we collate some contributions from the invited speakers that highlight their current research. We would also like to thank MDPI for some financial support for this event. More details can be found via https://www.uni-trier.de/index.php?id=55089&L=2.

Henning Fernau
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Algorithms and Complexity
  • Automata Theory and Formal Languages

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (5 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

Jump to: Other

452 KiB  
Article
LR Parsing for LCFRS
by Laura Kallmeyer and Wolfgang Maier
Algorithms 2016, 9(3), 58; https://doi.org/10.3390/a9030058 - 27 Aug 2016
Cited by 3 | Viewed by 6040
Abstract
LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar. In this paper, we present the first LR-style parsing algorithm for Linear Context-Free Rewriting Systems (LCFRS), a [...] Read more.
LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar. In this paper, we present the first LR-style parsing algorithm for Linear Context-Free Rewriting Systems (LCFRS), a mildly context-sensitive extension of CFG which has received considerable attention in the last years in the context of natural language processing. Full article
(This article belongs to the Special Issue Selected papers from “Theorietage der Gesellschaft für Informatik” in Speyer; Invited Talks)
►▼ Show Figures

Figure 1

582 KiB  
Article
A Gentle Introduction to Applications of Algorithmic Metatheorems for Space and Circuit Classes
by Till Tantau
Algorithms 2016, 9(3), 44; https://doi.org/10.3390/a9030044 - 9 Jul 2016
Cited by 2 | Viewed by 5242
Abstract
Algorithmic metatheorems state that if a problem can be described in a certain logic and the inputs are structured in a certain way, then the problem can be solved with a certain amount of resources. As an example, by Courcelle’s Theorem, all monadic [...] Read more.
Algorithmic metatheorems state that if a problem can be described in a certain logic and the inputs are structured in a certain way, then the problem can be solved with a certain amount of resources. As an example, by Courcelle’s Theorem, all monadic second-order (“in a certain logic”) properties of graphs of bounded tree width (“structured in a certain way”) can be solved in linear time (“with a certain amount of resources”). Such theorems have become valuable tools in algorithmics: if a problem happens to have the right structure and can be described in the right logic, they immediately yield a (typically tight) upper bound on the time complexity of the problem. Perhaps even more importantly, several complex algorithms rely on algorithmic metatheorems internally to solve subproblems, which considerably broadens the range of applications of these theorems. This paper is intended as a gentle introduction to the ideas behind algorithmic metatheorems, especially behind some recent results concerning space and circuit classes, and tries to give a flavor of the range of their applications. Full article
(This article belongs to the Special Issue Selected papers from “Theorietage der Gesellschaft für Informatik” in Speyer; Invited Talks)
►▼ Show Figures

Graphical abstract

235 KiB  
Article
Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey
by Henrik Björklund, Martin Berglund and Petter Ericson
Algorithms 2016, 9(2), 32; https://doi.org/10.3390/a9020032 - 11 May 2016
Cited by 2 | Viewed by 4525
Abstract
Parsing for mildly context-sensitive language formalisms is an important area within natural language processing. While the complexity of the parsing problem for some such formalisms is known to be polynomial, this is not the case for all of them. This article presents a [...] Read more.
Parsing for mildly context-sensitive language formalisms is an important area within natural language processing. While the complexity of the parsing problem for some such formalisms is known to be polynomial, this is not the case for all of them. This article presents a series of results regarding the complexity of parsing for linear context-free rewriting systems and deterministic tree-walking transducers. We discuss the difference between uniform and nonuniform complexity measures and how parameterized complexity theory can be used to investigate how different aspects of the formalisms influence how hard the parsing problem is. The main results we survey are all hardness results and indicate that parsing is hard even for relatively small values of parameters such as rank and fan-out in a rewriting system. Full article
(This article belongs to the Special Issue Selected papers from “Theorietage der Gesellschaft für Informatik” in Speyer; Invited Talks)
►▼ Show Figures

Figure 1

340 KiB  
Article
Multivariate Algorithmics for Finding Cohesive Subnetworks
by Christian Komusiewicz
Algorithms 2016, 9(1), 21; https://doi.org/10.3390/a9010021 - 16 Mar 2016
Cited by 41 | Viewed by 5957
Abstract
Community detection is an important task in the analysis of biological, social or technical networks. We survey different models of cohesive graphs, commonly referred to as clique relaxations, that are used in the detection of network communities. For each clique relaxation, we [...] Read more.
Community detection is an important task in the analysis of biological, social or technical networks. We survey different models of cohesive graphs, commonly referred to as clique relaxations, that are used in the detection of network communities. For each clique relaxation, we give an overview of basic model properties and of the complexity of the problem of finding large cohesive subgraphs under this model. Since this problem is usually NP-hard, we focus on combinatorial fixed-parameter algorithms exploiting typical structural properties of input networks. Full article
(This article belongs to the Special Issue Selected papers from “Theorietage der Gesellschaft für Informatik” in Speyer; Invited Talks)
►▼ Show Figures

Figure 1

Other

Jump to: Research

159 KiB  
Meeting Report
Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue
by Henning Fernau
Algorithms 2016, 9(4), 64; https://doi.org/10.3390/a9040064 - 26 Sep 2016
Viewed by 3507
Abstract
We briefly report on the national workshops on Formal Languages and Automata Theory as well as on Algorithms and Complexity Theory held in early Autumn, 2015. Full article
(This article belongs to the Special Issue Selected papers from “Theorietage der Gesellschaft für Informatik” in Speyer; Invited Talks)
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-5
Back to TopTop