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 Algorithmic Papers From FCT 2023
share announcement

Selected Algorithmic Papers From FCT 2023

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

Deadline for manuscript submissions: closed (31 January 2024) | Viewed by 3253

Special Issue Editors

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
Prof. Dr. Klaus Jansen

E-Mail Website
Guest Editor
Department of Computer Science, Kiel University, Christian-Albrechts-Platz 4, 24118 Kiel, Germany
Interests: algorithms; data structures; parallel computing; scheduling; graph theory

Special Issue Information

Dear Colleagues,

The 24th International Symposium on the Fundamentals of Computation Theory (FCT 2023) is an annual international conference held in Germany that is designed to cover a broad range of topics related to Theoretical Computer Science. Further details can be found here: https://www.uni-trier.de/index.php?id=71937&L=2

We will welcome and invite selected papers with a clear algorithmic nature whose abstracts have been submitted to the conference. We will base our invitations on the reviews received for these abstracts and the impression of the presentation at the conference.

Prof. Dr. Henning Fernau
Prof. Dr. Klaus Jansen
Guest Editors

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

  • algorithmic game theory
  • complexity of games
  • algorithmic learning theory
  • algorithmic randomness
  • algorithms and data structures
  • algorithms for big data
  • approximation algorithms
  • combinatorics and graph theory
  • combinatorial generation, enumeration and counting
  • combinatorial optimization
  • complexity theory
  • computable analysis
  • computational biology
  • computational geometry
  • computational learning theory
  • discrete optimization
  • distributed, parallel and network algorithms
  • energy-aware algorithms
  • graph algorithms and modeling with graphs
  • scheduling
  • string algorithms
  • telecommunication algorithms
  • model-checking algorithms
  • network theory and temporal graphs
  • online algorithms
  • parameterized and exact algorithms
  • parameterized complexity
  • probabilistic and randomized algorithms

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 (3 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

75 pages, 1896 KiB  
Article
Complete Subhedge Projection for Stepwise Hedge Automata
by Antonio Al Serhali and Joachim Niehren
Algorithms 2024, 17(8), 339; https://doi.org/10.3390/a17080339 - 2 Aug 2024
Viewed by 867
Abstract
We demonstrate how to evaluate stepwise hedge automata (Shas) with subhedge projection while completely projecting irrelevant subhedges. Since this requires passing finite state information top-down, we introduce the notion of downward stepwise hedge automata. We use them to define in-memory and [...] Read more.
We demonstrate how to evaluate stepwise hedge automata (Shas) with subhedge projection while completely projecting irrelevant subhedges. Since this requires passing finite state information top-down, we introduce the notion of downward stepwise hedge automata. We use them to define in-memory and streaming evaluators with complete subhedge projection for Shas. We then tune the evaluators so that they can decide on membership at the earliest time point. We apply our algorithms to the problem of answering regular XPath queries on Xml streams. Our experiments show that complete subhedge projection of Shas can indeed speed up earliest query answering on Xml streams so that it becomes competitive with the best existing streaming tools for XPath queries. Full article
(This article belongs to the Special Issue Selected Algorithmic Papers From FCT 2023)
►▼ Show Figures

Figure 1

14 pages, 312 KiB  
Article
Parsing Unranked Tree Languages, Folded Once
by Martin Berglund, Henrik Björklund and Johanna Björklund
Algorithms 2024, 17(6), 268; https://doi.org/10.3390/a17060268 - 19 Jun 2024
Viewed by 798
Abstract
A regular unranked tree folding consists of a regular unranked tree language and a folding operation that merges (i.e., folds) selected nodes of a tree to form a graph; the combination is a formal device for representing graph languages. If, in the [...] Read more.
A regular unranked tree folding consists of a regular unranked tree language and a folding operation that merges (i.e., folds) selected nodes of a tree to form a graph; the combination is a formal device for representing graph languages. If, in the process of folding, the order among edges is discarded so that the result is an unordered graph, then two applications of a fold operation are enough to make the associated parsing problem NP-complete. However, if the order is kept, then the problem is solvable in non-uniform polynomial time. In this paper, we address the remaining case, where only one fold operation is applied, but the order among the edges is discarded. We show that, under these conditions, the problem is solvable in non-uniform polynomial time. Full article
(This article belongs to the Special Issue Selected Algorithmic Papers From FCT 2023)
►▼ Show Figures

Figure 1

13 pages, 346 KiB  
Article
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time
by William Evans and David Kirkpatrick
Algorithms 2024, 17(6), 246; https://doi.org/10.3390/a17060246 - 6 Jun 2024
Viewed by 861
Abstract
Consider a collection of entities moving continuously with bounded speed, but otherwise unpredictably, in some low-dimensional space. Two such entities encroach upon one another at a fixed time if their separation is less than some specified threshold. Encroachment, of concern in many settings [...] Read more.
Consider a collection of entities moving continuously with bounded speed, but otherwise unpredictably, in some low-dimensional space. Two such entities encroach upon one another at a fixed time if their separation is less than some specified threshold. Encroachment, of concern in many settings such as collision avoidance, may be unavoidable. However, the associated difficulties are compounded if there is uncertainty about the precise location of entities, giving rise to potential encroachment and, more generally, potential congestion within the full collection. We adopt a model in which entities can be queried for their current location (at some cost) and the uncertainty region associated with an entity grows in proportion to the time since that entity was last queried. The goal is to maintain low potential congestion, measured in terms of the (dynamic) intersection graph of uncertainty regions, at specified (possibly all) times, using the lowest possible query cost. Previous work in the same uncertainty model addressed the problem of minimizing the congestion potential of point entities using location queries of some bounded frequency. It was shown that it is possible to design query schemes that are O(1)-competitive, in terms of worst-case congestion potential, with other, even clairvoyant query schemes (that exploit knowledge of the trajectories of all entities), subject to the same bound on query frequency. In this paper, we initiate the treatment of a more general problem with the complementary optimization objective: minimizing the query frequency, measured as the reciprocal of the minimum time between queries (granularity), while guaranteeing a fixed bound on congestion potential of entities with positive extent at one specified target time. This complementary objective necessitates quite different schemes and analyses. Nevertheless, our results parallel those of the earlier papers, specifically tight competitive bounds on required query frequency. Full article
(This article belongs to the Special Issue Selected Algorithmic Papers From FCT 2023)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-3
Back to TopTop