Theoretical Computer Science - Science topic

The laws of Physics are time-reversible, making no qualitative distinction between the past and the future—yet we can only go towards the future. This apparent contradiction is known as the ‘arrow of time problem’. Its current resolution states that the future is the direction of increasing entropy. But entropy can only increase towards the future...

Bioterrorism represents a significant threat to global security and public health, requiring innovative and effective defense strategies. Discrete mathematics and theoretical computer science offer vital tools in combating this evolving danger, providing essential methods for data analysis, disease modeling, and secure communication. However, sever...

Concept inventories are standardized assessments that evaluate student understanding of key concepts within academic disciplines. While prevalent across STEM fields, their development lags for advanced computer science topics like dynamic programming (DP) -- an algorithmic technique that poses significant conceptual challenges for undergraduates. T...

The P versus NP problem is a cornerstone of theoretical computer science, asking whether problems that are easy to check are also easy to solve. "Easy" here means solvable in polynomial time, where the computation time grows proportionally to the input size. While this problem's origins can be traced to John Nash's 1955 letter, its formalization is...

We prove that every interval order $P$ with no infinite antichain has a Gallai decomposition. That is, $P$ is a lexicographical sum of proper interval orders over a chain, an antichain or a prime interval order. This is a consequence of the fact that the tree decomposition of a graph into robust modules, as introduced by Courcelle and Delhomm\'e (T...

The sum-of-squares hierarchy of semidefinite programs has become a common tool for algorithm design in theoretical computer science, including problems in quantum information. In this work we study a connection between a Hermitian version of the SoS hierarchy, related to the quantum de Finetti theorem, and geometric quantization of compact K\"ahler...

The seminal work of Bencz\'ur and Karger demonstrated cut sparsifiers of near-linear size, with several applications throughout theoretical computer science. Subsequent extensions have yielded sparsifiers for hypergraph cuts and more recently linear codes over Abelian groups. A decade ago, Kogan and Krauthgamer asked about the sparsifiability of ar...

Coboundary expansion is a high dimensional generalization of the Cheeger constant to simplicial complexes. Originally, this notion was motivated by the fact that it implies topological expansion, but nowadays a significant part of the motivation stems from its deep connection to problems in theoretical computer science such as agreement expansion i...

The P versus NP problem is a cornerstone of theoretical computer science, asking whether problems that are easy to check are also easy to solve. "Easy" here means solvable in polynomial time, where the computation time grows proportionally to the input size. While this problem's origins can be traced to John Nash's 1955 letter, its formalization is...

Junta testing for Boolean functions has sparked a long line of work over recent decades in theoretical computer science, and recently has also been studied for unitary operators in quantum computing. Tolerant junta testing is more general and challenging than the standard version. While optimal tolerant junta testers have been obtained for Boolean...

The P versus NP problem is a cornerstone of theoretical computer science, asking whether problems that are easy to check are also easy to solve. "Easy" here means solvable in polynomial time, where the computation time grows proportionally to the input size. While this problem's origins can be traced to John Nash's 1955 letter, its formalization is...

The well-known inequality $$\lvert {\rm supp}(f) \rvert \lvert {\rm supp}( \widehat f) \rvert \geq |G|$$ | supp ( f ) | | supp ( f ^ ) | ≥ | G | gives a lower estimation for each support. In this paper we consider the case where there exists a slowly increasing function $$F$$ F such that $$\lvert {\rm supp}(f) \rvert \leq F(\lvert {\rm supp}( \wide...

We present a new perspective on the P vs NP problem by demonstrating that its answer is inherently observer-dependent in curved spacetime, revealing an oversight in the classical formulation of computational complexity theory. By incorporating general relativistic effects into complexity theory through a gravitational correction factor, we prove th...

We present a new unified graph-based representation of medical data, combining genetic information and medical records of patients with medical knowledge via a unique knowledge graph. This approach allows us to infer meaningful information and explanations that would be unavailable by looking at each data set separately. The systematic use of diffe...

The problem of counting spanning trees of graphs or networks is a fundamental and crucial area of research in combinatorics, while has numerous important applications in statistical physics, network theory and theoretical computer science. Very recently, Kosar, Zaman, Ali and Ullah obtained a nice formula on the number of spanning trees of a K 5-ch...

We present TuringQ, the first benchmark designed to evaluate the reasoning capabilities of large language models (LLMs) in the theory of computation. TuringQ consists of 4,006 undergraduate and graduate-level question-answer pairs, categorized into four difficulty levels and covering seven core theoretical areas. We evaluate several open-source LLM...

The P versus NP problem is a cornerstone of theoretical computer science, asking whether problems that are easy to check are also easy to solve. "Easy" here means solvable in polynomial time, where the computation time grows proportionally to the input size. While this problem's origins can be traced to John Nash's 1955 letter, its formalization is...

Co-lex partial orders were recently introduced in (Cotumaccio et al., SODA 2021 and JACM 2023) as a powerful tool to index finite state automata, with applications to regular expression matching. They generalize Wheeler orders (Gagie et al., Theoretical Computer Science 2017) and naturally reflect the co-lexicographic order of the strings labeling...

This article is intended for Mathematics students as well as anyone with interests in Foundations of Mathematics, Analytic Philosophy, or Theoretical Computer Science. Countable and Uncountable Infinities, Cantor's Diagonal Argument, Cantor's Paradox, Russell’s Paradox, and Barber Paradox. Limited and unlimited abstraction principles, Zermelo-Fraen...

The P versus NP problem is a cornerstone of theoretical computer science, asking whether problems that are easy to check are also easy to solve. "Easy" here means solvable in polynomial time, where the computation time grows proportionally to the input size. While this problem's origins can be traced to John Nash's 1955 letter, its formalization is...

Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras. Their associated multiple-conclusion ( Set - Set ) and single-conclusion ( ) order-preserving logics are non-...

Traditionally, the concept of points and neighborhood structures has been quite dominant in defining and further analyzing various properties in the study of topological spaces. In pointless topology-or point-free topology, also referred to as locale theory-the key emphasis is shifted from points to lattices of open sets. In addition to gaining fur...

The P versus NP problem is a cornerstone of theoretical computer science, asking whether problems that are easy to check are also easy to solve. "Easy" here means solvable in polynomial time, where the computation time grows proportionally to the input size. While this problem's origins can be traced to John Nash's 1955 letter, its formalization is...

The P versus NP problem is a cornerstone of theoretical computer science, asking whether problems that are easy to check are also easy to solve. "Easy" here means solvable in polynomial time, where the computation time grows proportionally to the input size. While this problem's origins can be traced to John Nash's 1955 letter, its formalization is...

We study the oracle complexity of nonsmooth nonconvex optimization, with the algorithm assumed to have access only to local function information. It has been shown by Davis, Drusvyatskiy, and Jiang (2023) that for nonsmooth Lipschitz functions satisfying certain regularity and strictness conditions, perturbed gradient descent converges to local min...

We present a sublinear time algorithm that gives random local access to the uniform distribution over satisfying assignments to an arbitrary k-CNF formula $\Phi$, at exponential clause density. Our algorithm provides memory-less query access to variable assignments, such that the output variable assignments consistently emulate a single global sati...

Licensee System Analytics. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0). 1|Introduction Semigroups are crucial in many branches of mathematics because they provide the abstract algebraic foundation for memoryless sys...

Soft set theory was proposed by Molodtsov in 1999 to model some problems involving uncertainty. It has a wide range of theoretical and practical applications. Soft set operations constitute the basic building blocks of soft set theory. Many kinds of soft set operations have been described and applied in various ways since the inception of the theor...

This work aims to implement and utilize an advanced computer system for image analysis and processing through artificial intelligence. The system will evaluate images from multiple sources. As a result, a comprehensive e-Medicus system will be developed to capture and analyze X-ray data and classify cancer cells. This innovative tool, with its uniq...

The Arrow–Debreu extension of the classic Hylland–Zeckhauser scheme (Hylland and Zeckhauser in J Polit Econ 87(2):293–314, 1979) for a one-sided matching market—called ADHZ in this paper—has natural applications but has instances which do not admit equilibria. By introducing approximation, we define the \documentclass[12pt]{minimal} \usepackage{ams...

The Quantum Approximate Optimisation Algorithm (qaoa) is a widely studied quantum-classical iterative heuristic for combinatorial optimisation. While qaoa targets problems in complexity class NP, the classical optimisation procedure required in every iteration is itself known to be NP-hard. Still, advantage over classical approaches is suspected fo...

The categorical concepts, tools, and techniques advanced not only the theory of automata and languages but also developed the theory of fuzzy automata and languages and played a significant role in many other branches of theoretical computer science. Unlike theory of classical/fuzzy automata with output and their languages, this paper aims to incor...

Calculating and analyzing the number of spanning trees of networks (graphs) is an interesting and important research project in wide variety of fields, such as mathematics, theoretical computer science, chemistry, physics and so on. In this paper, we investigated the number of spanning trees in three sequences of families of graphs of the same aver...

Computational complexity traditionally relies on absolute measures of time and steps, assuming a classical framework. However, in relativistic contexts, where time dilation and relative motion significantly impact perception, these traditional metrics become inadequate. This paper introduces two invariant metrics: Invariant Computational Effort (IC...

Professor Sir Charles Antony Richard Hoare, FRS1, reached his 90th birthday in January this year. Tony Hoare, as he is better known, was knighted for his services to theoretical computer science, and was one of the earliest computer scientists to be made a Fellow by the Royal Society. I believe the first computer scientist to be elected FRS was Mau...

Given an Abelian group G, a Boolean-valued function f: G -> {-1,+1}, is said to be s-sparse, if it has at most s-many non-zero Fourier coefficients over the domain G. In a seminal paper, Gopalan et al. proved "Granularity" for Fourier coefficients of Boolean valued functions over Z_2^n, that have found many diverse applications in theoretical compu...

The stochastic block model is a canonical model of communities in random graphs. It was introduced in the social sciences and statistics as a model of communities, and in theoretical computer science as an average case model for graph partitioning problems under the name of the ``planted partition model.'' Given a sparse stochastic block model, the...

The P=NP problem stands as one of the most profound and challenging questions in theoretical computer science, with far-reaching implications across mathematics, cryptography, and algorithm design. This paper presents a novel approach to resolving this problem through the use of temporal feedback mechanisms in quantum circuits. Temporal feedback me...

Semigroups are the building blocks of algebra as they have application in automata, coding theory , formal languages, and theoretical computer science. They are also used in the solutions of graph theory and optimization theory. For the advanced study of algebraic structures and their applications, ideals are essential. The generalization of ideals...

Since the introduction of the Kolmogorov complexity of binary sequences in the 1960s, there have been significant advancements on the topic of complexity measures for randomness assessment, which are of fundamental importance in theoretical computer science and of practical interest in cryptography. This survey reviews notable research from the pas...

Sampling from the q-state ferromagnetic Potts model is a fundamental question in statistical physics, probability theory, and theoretical computer science. On general graphs, this problem may be computationally hard, and this hardness holds at arbitrarily low temperatures. At the same time, in recent years, there has been significant progress showi...

This paper surveys results about token addition and removal (TAR) reconfiguration for several well-known vertex set parameters including domination, power domination, standard zero forcing, and PSD zero forcing. We also expand the range of parameters to which universal $X$-set TAR graph results apply, for $X$-sets and their TAR graphs introduced in...

This paper explores the computational challenges of clique transversal problems in d-degenerate graphs, which are commonly encountered across theoretical computer science and various network applications. We examine d-degenerate graphs to highlight their utility in representing sparse structures and assess several variations of clique transversal p...

Theoretical computer science plays an important role in the understanding of social networks and their properties. We can model information rippling throughout social networks, or the opinions of social media users for example, using graph theory and Markov chains. In this thesis, we model social networks as graphs, and consider two such processes:...

p>The example of the absent-minded passenger problem illustrates the fundamental difficulty of estimating practical values of probabilistic parameters on the basis of general theorizing and allows us to give more accurate and subtle estimates of various parameters, as well as their practical computable approximation. This article is important for b...

The P vs NP problem is one of the most profound and enduring questions in computer science and mathematics, asking whether every problem whose solution can be quickly verified can also be quickly solved. Traditional approaches have yet to resolve this question, prompting the exploration of unconventional methods. This paper presents a speculative a...

The Halting Problem, introduced by Alan Turing in 1936, is a foundational concept in theoretical computer science. It posits that no general algorithm can determine whether any given program will halt or run indefinitely. While this has provided significant insights into the limits of computation, this paper explores the practical impacts of removi...

In the realm of computational complexity, the classes P and NP represent foundational concepts that help define the limits of what can be efficiently computed versus what can be efficiently verified. This paper introduces a new theoretical complexity class, Infinite Complexity Verification Problems (ICVP), designed to encapsulate problems that, whi...

The integration of relativistic effects with quantum photonic computing presents a groundbreaking approach to tackling the P vs NP problem, a fundamental question in theoretical computer science. By leveraging the speed and unique properties of photons, along with the principles of quantum mechanics, we propose a practical implementation that could...

The intersection of computational complexity, quantum mechanics, and relativistic physics offers a groundbreaking perspective on one of the most profound problems in theoretical computer science: the P vs NP problem. In this paper, we explore how relativistic principles and quantum computation can be integrated within the framework of Homotopy Type...

Constructing explicit RIP matrices is an open problem in compressed sensing theory. In particular , it is quite challenging to construct explicit RIP matrices that break the square-root bottleneck. On the other hand, providing explicit 2-source extractors is a fundamental problem in theoretical computer science, cryptography and combinatorics. Nowa...

Developing a thermodynamic theory of computation is a challenging task at the interface of nonequilibrium thermodynamics and computer science. In particular, this task requires dealing with difficulties such as stochastic halting times, unidirectional (possibly deterministic) transitions, and restricted initial conditions, features common in real-w...

This research paper explores the rich and intriguing world of semi-group identities, their properties, and their applications to various types of semi-groups. Semi-groups are algebraic structures that generalize the notion of groups, allowing for non-invertible elements. Despite their broader scope, semi-groups retain many important features found...

The concept of rationality or irrationality of real numbers has been a fundamental question in mathematics for centuries. However, the theoretical and computational complexity of determining whether a given real number is rational or irrational presents an intriguing challenge. This research aims to explore the Undecidability of this problem and it...

Randomness extraction is a key problem in cryptography and theoretical computer science. With the recent rapid development of quantum cryptography, quantum‐proof randomness extraction has also been widely studied, addressing the security issues in the presence of a quantum adversary. In contrast with conventional quantum‐proof randomness extractors...

Interactions between logic and theoretical computer science are multiple and profound. In the last decades, they have been deeply investigated, but, surprisingly, the study of probabilistic computation was only marginally touched by such fruitful interchanges. The overall goal of my doctoral thesis was precisely that of start bridging this gap by d...

We investigate the problem of estimating the structure of a weighted network from repeated measurements of a Gaussian graphical model (GGM) on the network. In this vein, we consider GGMs whose covariance structures align with the geometry of the weighted network on which they are based. Such GGMs have been of longstanding interest in statistical ph...

An elementary review on principles of qubits and their prospects for quantum computing is provided. Due to its rapid development, quantum computing has attracted considerable attention as a core technology for the next generation and has demonstrated its potential in simulations of exotic materials, molecular structures, and theoretical computer sc...

Many real-world networks, like transportation networks and social networks, are dynamic in the sense that the edge set may change over time, but these changes are known in advance. This behavior is captured by the temporal graphs model, which has recently become a trending topic in theoretical computer science. A core open problem in the field is t...

This contribution presents a methodological framework for formalizing the specifications of a simulator based on deep machine learning. This research work, blending the epistemology of modeling and theoretical computer science, aims to establish computer verification and validation techniques for critical systems requiring the predictive power of a...

Throughout history we encounter some personalities who think ahead of their time and, in many cases, are misunderstood or even wronged. However, they all have one thing in common: they are geniuses who find impressive solutions to complex problems. This article aims to carry out, through bibliographical research using qualitative data analysis meth...

Decision problems in physics have been an active field of research for quite a few decades resulting in some interesting findings in recent years. However, such research investigations are based on a priori knowledge of theoretical computer science and the technical jargon of set theory. Here, I discuss a particular, but a significant, instance of...

The hypercontractive inequality is a fundamental result in analysis, with many applications throughout discrete mathematics, theoretical computer science, combinatorics and more. So far, variants of this inequality have been proved mainly for product spaces, which raises the question of whether analogous results hold over non-product domains. We co...

The Graph Model of Combinatory Logic (Engeler, 1981) is also a mathematical model for "how does the brain think". It attempts to explain how complex scripts of behavior and conceptual content can reside in, combine, and interact on large neural networks (Engeler 2019). This has an impact on building intelligent systems that interact with humans. In...

VLSI physical design is a domain of work as old as more than five decades. Even then, as technology progresses, there are several challenging issues from the perspective of theoretical computer science as well as the high-performance requirements of the chip to be designed. Crosstalk is a threat to achieving routing solutions in high-performance VL...

Neste trabalho realizamos a revisão de seis artigos científicos sobre a evasão escolar que utilizaram Aprendizagem de Máquina como metodologia para detectar as possíveis causas. A metodologia utilizada por esta pesquisa é a bibliográfica, pois investigou-se quais são os temas e elementos técnicos de cada um dos artigos, principalmente em relação a...

A new AI-based method has opened a new path towards solving the most important problem in theoretical computer science. The purpose of this article is to explain in a simple way a method that uses artificial intelligence and the reinforcement learning method to solve the P vs Np problem. I want to start this article by asking the following question...

Automata theory is one of the core theories in computer science because it allows scientists and practitioners to understand the complexity of computational problems, and thus, to develop efficient solutions to them. Several formal methods such as model checking are based on automata theory. Automata theory has traditionally been taught on a theore...

Abstract: This technical report establishes a formal proof for the equivalence between two sets of pushdown automata (PDA) configurations, namely C_emptystack and C_finalstate. In the realm of language acceptance, C_emptystack represents the set of all PDAs that reach acceptance by the language L_emptystack, while C_finalstate encapsulates the set...

Programming language semantics is an important topic in theoretical computer science, but one that beginners often find challenging. This article provides a tutorial introduction to the subject, in which the language of integers and addition is used as a minimal setting in which to present a range of semantic concepts in simple manner. In this sett...

Multiplication between two square matrices is one of the fundamental computational approach in the domain of mathematics and computer science where it is fully recognized as a fore most technique for several interdisciplinary domain and sub domains like linear algebra, graph theory, multidimensional graphics, cryptographic computation, convolution...

p>The problem of computing machine passing the maze is one of theoretical computer science key tasks. This task was partially considered by the classics of computer science, e.g. A. Turing, C. Shannon, L. Budach and Z. Pawlak. Labyrinth problem solving includes fundamental knowledges in the main three branches, namely environment (labyrinth) knowle...

p>The problem of computing machine passing the maze is one of theoretical computer science key tasks. This task was partially considered by the classics of computer science, e.g. A. Turing, C. Shannon, L. Budach and Z. Pawlak. Labyrinth problem solving includes fundamental knowledges in the main three branches, namely environment (labyrinth) knowle...

The theory of presentations of enriched monads was developed by Kelly, Power, and Lack, following classic work of Lawvere, and has been generalized to apply to subcategories of arities in recent work of Bourke–Garner and the authors. We argue that, while theoretically elegant and structurally fundamental, such presentations of enriched monads can b...

The traveling salesman problem is notorious not only for its significance in theoretical computer science but also for the vast number of real-world problems it is involved in. In this paper, we propose a branch and bound method and a 2-opt method for solving traveling salesman problems, in situations where pairwise distances, costs, or travel time...

In line with the recent development in topological graph theory, we are considering undirected graphs that are allowed to contain multiple edges, loops, and semi-edges. A graph is called simple if it contains no semi-edges, no loops, and no multiple edges. A graph covering projection, also known as a locally bijective homomorphism, is a mapping bet...

Knapsack is one of the most fundamental problems in theoretical computer science. In the $(1 - \epsilon)$-approximation setting, although there is a fine-grained lower bound of $(n + 1 / \epsilon) ^ {2 - o(1)}$ based on the $(\min, +)$-convolution hypothesis ([K{\"u}nnemann, Paturi and Stefan Schneider, ICALP 2017] and [Cygan, Mucha, Wegrzycki and...

This paper delves into the intersection of computational theory and music, examining the concept of undecidabil-ity and its significant, yet overlooked, implications within the realm of modern music composition and production. It posits that undecidability, a principle traditionally associated with theoretical computer science, extends its relevanc...

We investigate the problem of estimating the structure of a weighted network from repeated measurements of a Gaussian Graphical Model (GGM) on the network. In this vein, we consider GGMs whose covariance structures align with the geometry of the weighted network on which they are based. Such GGMs have been of longstanding interest in statistical ph...

Workshop for Young Scientists in Computer Science & Software Engineering (CS&SE@SW) is a peer-reviewed computer science workshop focusing on research advances, applications of information technologies. The vision of the CS&SE@SW 2022 is provides an expert environment for young researchers, who are at the beginning of their career, to present and di...

This Special Issue of the open access journal Algorithms is dedicated to showcasing cutting-edge research in algorithms for feature selection. My call for papers sought original articles presenting recent breakthroughs and the state of the art in various research areas related to feature selection techniques. In this context, my primary focus was o...

The maximum independent set problem is a classical NP-hard problem in theoretical computer science. In this work, we study a special case where the family of graphs considered is restricted to intersection graphs of sets of axis-aligned hyperrectangles and the input is provided in an online fashion. We prove bounds on the competitive ratio of an op...

Decision problems in physics have been an active field of research for quite a few decades resulting in some interesting findings in recent years. However, such research investigations are based on a priori knowledge of theoretical computer science and the technical jargon of set theory. Here, I discuss a particular, but a significant, instance of...

Random walks (or Markov chains) are models extensively used in theoretical computer science. Several tools, including analysis of quantities such as hitting and mixing times, are helpful for devising randomized algorithms. A notable example is Schöning's algorithm for the satisfiability (SAT) problem. In this work, we use the density-matrix formali...

Developing a physical theory of computation is an open challenging task at the interface of non-equilibrium thermodynamics and computer science. An important part of this task requires the examination of thermodynamic quantities in formal models of computers which execute computational tasks, such as automata or word-RAM models executing algorithms...

Trophic interaction networks are notoriously difficult to understand and to diagnose. Such ecological networks welcome numerous feedbacks between species and populations and are not frozen at all, as soon as we observe them over a long enough term. These topological changes may be triggered by natural forcings (e.g. seasons) and/or by human influen...

No problema do escalonamento de médicos (PRP, do inglês Physician Rostering Problem) busca-se atribuir turnos para médicos, de forma que todas as demandas do hospital sejam atendidas, nenhum médico fique sobrecarregado, e o escalonamento fique o mais agradável possível para estes. Programação por Restrições (CP, do inglês Constraint Programming) é...

Motivated by questions in theoretical computer science and quantum information theory, we study the classical problem of determining linear spaces of matrices of bounded rank. Spaces of bounded rank three were classified in 1983, and it has been a longstanding problem to classify spaces of bounded rank four. Before our study, no non-classical examp...

Counting maximum matchings in a graph is of great interest in statistical mechanics, solid-state chemistry, theoretical computer science, mathematics, among other disciplines. However, it is a challengeable problem to explicitly determine the number of maximum matchings of general graphs. In this paper, using Gallai-Edmonds structure theorem, we de...

Abstract: The aim of this article is to establish some common fixed point theorems for α-fuzzy mappings under F-contraction in the framework of complete metric spaces. To extend and improve some well-known results of literature, new results for multivalued mappings are obtained as application of established results. We have illustrated an appropria...

There is widespread debate on whether to anonymize author identities in peer review. The key argument for anonymization is to mitigate bias, whereas arguments against anonymization posit various uses of author identities in the review process. The Innovations in Theoretical Computer Science (ITCS) 2023 conference adopted a middle ground by initiall...

The aim of my research is to provide some new multidisciplinary mathematical structures in dealing with fundamental challenges at the heart of Quantum Field Theory. I focus on unexplored interconnections between Pure Mathematics, Dyson--Schwinger Equations and Gauge Field Theories, Theoretical Computer Science and Logic to build some new tools and...

Hyperbolic polynomials is a class of real-roots polynomials that has wide range of applications in theoretical computer science. Each hyperbolic polynomial also induces a hyperbolic cone that is of particular interest in optimization due to its generality, as by choosing the polynomial properly, one can easily recover the classic optimization probl...

This is Book of Abstracts of the Fourth Triennial International Conference and Summer School NUMTA2023 “Numerical Computations: Theory and Algorithms”, 14-20 June 2023, Pizzo (VV), Italy. The Conference is organized by the Department of Computer Engineering, Modeling, Electronics and Systems Science of the University of Calabria, Italy in cooperati...

The knowledge of future partial information in the form of a lookahead to design efficient online algorithms is a theoretically-efficient and realistic approach to solving computational problems. Design and analysis of semi-online algorithms with extra-piece-of-information (EPI) as a new input parameter has gained the attention of the theoretical c...

A Wheeler automaton is a finite state automaton whose states admit a total Wheeler order, reflecting the co-lexicographic order of the strings labeling source-to-node paths. A Wheeler language is a regular language admitting an accepting Wheeler automaton. Wheeler languages admit efficient and elegant solutions to hard problems such as automata com...