yusuke1997/dblp-id-title huggingface dataset:
Pomset semantics is consistenct with data flow semantics
Monotone Algebras, R-Trivial Monoids and a Variety of Tree Languages
Program-size Complexity Computes the Halting Problem
Interviews with the 2022 CONCUR Test-of-Time Award Recipients
Recursiveness of the enumerating functions invreases the inferablity of recursively enumberable sets
On the Computational Power of Simple Dynamics
Interview with Thomas Henzinger President of IST Austria
Recursion vs Replication in Process Calculi: Expressiveness
On a Conjecture of M. Van Lambalgen
The Computation Geometry Column
Dumb-Founded Sets
On the Irregularity of the Duplication Closure
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog
Report on AFL 2023
Algebraic Properties for Free!
Exponential Gaps in our Knowledge
EATCS Distinguished Dissertation Award 2019 - Call for Nominations
The Freudenthal Problem and its Ramifications (Part I)
Proofs by induction in equational theories without constructors
A predicate for separating language classes
Randomness and Metastability in Game Theory and Distributed Computing
On the impact of forgetting on learing machines
Efficient processing of hierarchical graphs for engineering design
The Structural Complexity Column
The Presburger Award 2014 - Call for Nominations
An Invitation to Quantum Computing
The Gödel Price 2013. Call for Nominations
Recent Advances on the Log-Rank Conjecture in Communication Complexity
Some important new facts supporting the development of algebraic specifications
Two kinds of processors are sufficient and large operating alphabets are needed for regular trellis automata languages
On weakly square free words
A remark on the equational calculus for many-sorted algebras with possibly empty carrier sets
Report on HALG 2016/2017
Combinatorial Game Complexity: An Introduction with Poset Games
A note about mergible states in large NFA
Words on Trajectories
A Note on a Parallel Heuristic for Minimum
Symmetry and Anonymity in Shared Memory Concurrent Systems
A remark on a note by M. A. Bednarczyk
Most definitions of trees over an alphabet are wrong
Linear size finite automata for the set of all subwords of a word - an outline of results
Prizes and Prejudice
Morphisms and Primitivity
Boris (Boaz) Trakhtenbrot, 1921-2016
Report on ICE-TCS tenth anniversary
Reversify any sequential algorithm
The set of Lyndon words is not context-free
Dual systems of sequents and tableaux for many-valued logics
Teh Logic of Infons
Decidability Issues for Petri Nets - a survey
Towards the Use of Aesthetics in Decision Making: Kolmogorov Complexity Formalizes Birkhoff's Idea
k-limited ED0L Languages Are Context-Sensitive
Mobile agents in distributed computing: Network exploration
Making Reversible Computing Machines in a Reversible Cellular Space
Busy Beaver Function in LOOP
Introducing the parallel Random Access Machine together with FORTARN 90/95
Linearity of Client/Server Systems
The Division Breakthroughs
Resolution Proofs viewed as Automata
Quo Vadisc? Outcomes of the PODC/DISC Conference model survey
Random Numbers Are Borel Normal
The Presburger Award for Young Scientists 2021 - Call for Nominations
A note on polynomial interpretation
Hardness Results for Cake Cutting
Regular Languages: To Finite Automata and Beyond Succinct Descriptions and Optimal Simulations
A note on Graftings, Rotations, and Distances in Binary Trees
Z. Pawlak, a Precursor of DNA Computing and of Picture Grammars
Polynomial Size Log Depth Circuits: Between NC 1 and AC 1
Examples of CFI-BI-immune and CF-levelable sets in logspace
A scetch of Collage Grammars
Obituary Peter L. Hammer (1936-2006)
Redbelly Blockchain: a Combination of Recent Advances
Mechanizing inductive reasoning
Solomon Marcus, 1925-2016
Ackermann Award 2022 - Call for Nominations
A note on test sets for IR-rational languages
Completeness of many-sorted equational logic revisited
On Slender Languages
The knowledge on information content of problems provides much useful information to circuit designers
On the Metastability of Quadratic Majority Dynamics on Clustered Graphs and its Biological Implications
An elementary proof that upper and lower powerdomain constructions commute
The role of an invited speaker at a conference
Streams are Forever
The Weisfeiler-Lehman Procedure
Concurrency and interleaving are equally fundamental
Obituary Alberto Bertoni (1946-2014)
EATCS Fellows 2018 - Call for Nominations
News from Latin America
ICALP 2017 - Call for Papers
The Formal Language Theory Column
Some Remarks on Morphisms and Primitivity
EATCS Fellows 2022 - Call for Nominations
A Note on Spectral Lower Bound Arguments for Decision Trees
Parametrized Complexity and Subexponential Time (Column: Computational Complexity)
Limiting the team size in cooperating grammar systems
On the Myhill-Nerode theorem theorem for trees
Conjugacies
Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark)
An Elementary Approach Towards Teaching Dynamic Programming
Intersection of Finitely Generated Congruences over the Term Algebra with Equal Trunks
Four Non-Deterministic Programming Exercises
Grammars without context conditions
Algebraic specification of the abstract data type "Continuum" without hidden operations
Distributed Universal Constructions: a Guided Tour
On non-isomorphic NP complete sets
A Unified Approach to Characterizations of Recursively Enumerable Languages
On Resetiting DLBA's
Report on UCNC 2012
Integers, Game Trees and some Unknowns
Report on BCTCS 2018
An answer to an open problem
Recent Progress on Derandomizing Space-Bounded Computation
A simple proof of sufficient conditions for the termination of the disjoint union of term rewriting systems
Know the Person behind the Papers: Anne Driemel
Challenges in Timed Languages: from applied theory to basic theory (Column: Concurrency)
Isomorphism Testing: Perspective and Open Problems
Teaching Design of Algorithms in High Schools by Constructive Induction
ICALP 2022 - 49th EATCS International Colloquium on Automata, Languages and Programming
Type Inference in Mathematics
The representation of a program in the Blum-Shub-Smale theory of computation over an arbitary ring
Computing LCF in linear time
A Review of Graph Grammars and Preview of ICGT 2002: The First International Conference on Graph Transformation
Aldo de Luca (1941 - 2018)
Composition in State-based Replicated Data Types
Nine Open Problems on Conjunctive and Boolean Grammars
Survey of Distributed Decision
Membrane Computing: New Results, New Problems
The EATCS Award 2014 - Call for nominations
Call for Nominations For EATCS - Fellows 2014
Pigeon-hole principle and Booleanmatrix multipication
Thoughts on Paper Publishing in the Digital Age
A note on the translation of SQL tuple calculus
25 Editions of DCFS: Origins and Directions
ICALP 2024 - Call for Papers
Conjugate Words, Cuts of the Deck and Cryptographic Protocols
Notes on the equivalence of some programs
The Alon-Roichman Theorem
The Making of a New Science A Personal Journey Through the Early Years of Theoretical Computer Science
Fixpoint strategies for deductive databases
A Characterization of Recursively Enumerable Languages
Process Algebra Needs Proof Methodology (Columns: Concurrency)
Report on ICALP 2020
Petri Nets and monogenous FIFO nets
The Languages of SAT and n-SAT over Finitely Many Variables are Regular
Fault-Tolerant Logical Network Structures
Normal forms for pure context-free grammars
Speculations on Biology, Information and Complexity
ANDOS: A simple protocol for secret selling of secrets
Report on ICALP 2023
An Omega(log n) time linear cost lower bound for the single function coarsest partition problem
The Origin of Quorum Systems
The Complexity of Valued Constraint Satisfaction
On Minimal Finite Automata
Knuth-Bendix procedure and non-deterministic behaviour - An example
Fairness, part II
A class of nuniversal P Marti-Löf tests
Artificial Algebras
The Art of Uninformed Decisions
Process modalities obtained as fixed points (Part one)
Report on BCTCS 2017
Context-free grammars in Greibach normal forms
Profinite Techniques for Probabilistic Automata
Problems on graphs with bounded decomposability
Relative expressiveness of calculi for reversible concurrency
The Physics of Observation a Perspective for Concurrency Theorists
Derandomization: a brief overview
GETGRATS and APPLIGRAPH: Theory and Applications of Graph Transformation
The Database Theory Column
The Presburger Award 2016 - Call for Nominations
Report on 1st GSSI Summer Meeting on Algorithms
The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin
EATCS-Fellows 2021
On Time-Varying H Systems
Combinatorics on words: a tutorial
Algorithms for Memory Hierarchies (Column: Algorithmics)
The Hausdorff Measure of Regular omega-languages is Computable
Report on CS&P 2011
The Characteristic Algorithmic Approach for Ad-hoc Mobile Networks (Column: Distributed Computing)
20 Years of Modal and Mixed Specifications
EATCS Mini-Track of FM'99
The Problem with Debugging in Current Block-based Programming Environments
Book: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach
Computing with Membranes: An Introduction
Feasibility, sorites and vagueness
The Specification System OBSCURE
A codification of column-convex polyominoes which generates a regular language
How to convince teachers to teach computer science even if informatics was never a part of their own studies
Type Theorie Programming
Removing the Barriers: Overcoming Impostor Phenomenon as a Community
On the reconstruction of simple polygons
Extensions of top-down tree-to-string transducers
Computing by Splicing: How Simple Rules?
Human Visual Perception and Kolmogorov Complexity: Revisited
Note on calculi for a three-valued logic for logic programming.
Obituary: Gregory Tseytin
Average Size of Automata Constructions from Regular Expressions
Obituary Rūsiņš Mārtiņš Freivalds (1942-2016)
Report from IWOCA 2012
On Essential Premises for the Transformation Order
An Overview of the Distributed System Classification and Integration Framework DeCIF
Philippe Flajolet (1948-2011)
Swarm Intelligence Techniques for Optimization and Management Tasks in Sensor Networks
Memory and algebra
Diagonalization
On two different Characterizations of Bisimulation
A "Big-Ideas" Computation Theory Course for the Undergraduate
On a Reference Model for the Formalization and Integration of Software Specification Languages
Report on NCMA 2023
Progress on Polynomial Identity Testing
Understanding Petri Nets Modeling Techniques, Analysis Methods, Case Studies
Quasiperiodic Infinite Words (Columns: Formal Language Theory)
Does Combining Nondeterminism and Probability Make Sense?
A Post's Program for Complexity Theory
How Teaching Informatics Can Contribute to Improving Education in General
The moethod of focing for nondeterministic automata
Complexity in ideals of polynomials: questions on algebraic complexity of circuits and proofs
On a Post's System of Tag
Decision problems solved with the help of the Ehrenfeucht conjecture
Return to Patterns
What is Algebraic in Process Theory?
A Surprising Relationship Between Descriptive Complexity and Proof Complexity
Insertion operations: Closure properties
From Parikh vectors to GO territories
A positive pumping condition for regular sets
Identifying Hostile Nodes in Networks Using Mobile Agents
Report on BCTCS 2021
Hilbertian Deductive Systems, Infon Logic, and Datalog
Hybrid Grammars: The Chomsky-Marcus Case
Gene Assembly in Ciliates Part I. Molecular Operations
NP-Hardness on succinct representation of graphs
An Introduction to Population Protocols
The Ultimate Equivalence Problem for Uniform HDT0L Systems
Atomic actions
In Memoriam Boris Trakhtenbrot, 1921-2016
Education(al) matters: teaching P versus NP
On the question "Is Sigma (between 1 and n) root a1 =< L?"
The Distributed Computing Column Distributed Computing Theory to Date (Part I: Models and an Example)
Parameterized Complexity for Graph Layout Problems
Langford strings are square free
EATCS Fellows 2019 - Call for Nominations
K-Best Enumeration
Contextial Insertion for #3SAT
Wigner's quasidistribution and Dirac's kets
Homotopy and Concurrency
Depth of Functional Compositions
Gene Assembly in Celiates. Part I. Molecular Operations (Column: Natural Computing)
Know the Person behind the Papers: Leslie Ann Goldberg
A Uniform Framework for Problems on Context-Free Grammars
Algorithimic Aspects of the Consecutive-Ones Property
Money Transfer Made Simple: a Specification, a Generic Algorithm, and its Proof
Interview with Paul Spirakis, President of the EATCS
Computing the visibility graphs of n line segments in O(n n ) time
Counting (scattered) Subwords
Universality and Quantum Computing
Knowledge, reasoning and classifiaction: A rough set perspective
6th Workshop on Theory of Transactional Memory
A note on the Chomsky hierarchy
The Value, if any, of Decidability
Process modalities obtained as fixed points (part 2)
Relations over Words and Logic: A Chronology
A Simple Completeness Proof for Early's Algorithm
Integration of the Generic Component Concepts for System Modeling with Adhesive HLR Systems
Polynomial - time algorithms for the factorization of polynomials
Low-Discrepancy Sets For High-Dimensional Rectangles: A Survey
Can quantum computers be useful when there are not yet enough qubits?
A SAT Solver Primer
The DF0L Language Equivalence Problem
A Short Note on the Mutually Beneficial Relationship Between Information Extraction in Database Theory and Classical Formal Language Theory
How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation
Order isomorphism odes not preserve global event independence
Subproblems and NP-Completeness Theory
Undaunted Sets
Formal Modeling and Analysis of Flexible Processes in Mobile Ad-Hoc Networks
Recent Trends in Descriptional Complexity of Formal Languages
Ground Term Rewriting Rules for the Word Problem of Ground Term Equations
Mutual Exclusion vs Consensus: Both Sides of the Same Coin?
The simple, little and slow things count: on parameterized counting complexity
Mechanism Design for Scheduling
Locality-Aware Network Solutions - A survey (Column: Distributed Computing)
A note on termination in combinatiosn of heterogeneous term rewriting systems
What Emil said about the Post correspondance problem
The Presburger Award 2015 - Call for Nominations
On the relevance of high-level net processes, Formal Specification Column
Quantum Programming Languages: Survey and Bibliography
A Short Survey on Watson-Crick Automata
The Counterfeit Coin Problem
The Theory of Transactional Memory
Recent progress in information-based complexity
Decision Algorithms for Subfamilies of Regular Languages using State-Pair Graphs
What if we tried Less Power? Lessons from studying the power of choices in hashing-based data structures
Report on Two events at ICE-TCS, Reykjavik University
The generating function of completely bracketed expressions
Twelve Problems in Resource-Bounded Measure
Abstracts of the EATCS Distinguished Dissertations 2015
The 1966 International Congress of Mathematicians: A micro-memoir
Extending Causal Consistency to any Object Defined by a Sequential Specification
Efficent leader finding in arbitary networks
The Underlying Logic of Hoare Logic
Graph Transformation and Visual Modeling Techniques: Workshop Summary and HowTo
Report on AAAC 2018
Logic on Words
Truth vs. Proof in Computational Complexity
Local Computation in Graphs: The Case of Cellular Edge Local Computations
On the Equivalence Problem of Algebraic Series with Commuting Variables
A week mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] => [L = NL]
Transition Specifications for Dynamic Abstract Data Type
Evolution of Mutating Software
Another tableau based automated theorem prover for classical logic
The EATCS Award 2023 - Call for Nominations
Aqueous Computing: Writing into Fluid Memory
Two Axiomatizations of a Star Semiring Quasi-Variety
Hardness-Randomness Tradeoffs for Algebraic Computation
The EATCS Award 2022 - Laudatio for Patrick Cousot
Characteristic Formulae: From Automata to Logic
A Report from DISC 2005, the 19th International Symposium on Distributed Computing
Quantum Computing and the Hunt for Hidden Symmetry
A note on the language operator "red"
Paradise lost, or paradise regained?
Is Randomness "Native" to Computer Science?
Self-Stabilization from Theory to Practice
No Need to Be Strict: On the Expressiveness of Metric Temporal Logics with (Non-)strict Operators
The Presburger Award for Young Scientists 2022 - Call for Nominations
Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners
Languages for Concurrency
Recent Advances in Approximability of Bimatrix Nash
Recent developments in kernelization: A survey
On induced congruences
A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars
The Computational Complexity Column Time-Space Lower Bounds for Satisfiability
Coaching on New Technologies: Programming Workshop Android Applications for Google Phones
A linear-time algorithm to decide whether a binary word contains an overlap
The Cocke-Younger-Kasami Algorithm (Revised)
Some unsolved problems in modelling self-timed circuits using Petri nets
Obtaining Nielsen Reduced Sets in Free Groups
A Foundation of Computable Analysis
Structure vs Combinatorics in Computational Complexity
A note the expressive power of Prolog
Report on CIAA 2023
The Role of Relativization in Complexity Theory
Computing the connected components of D-ranges
Swarm Intelligence: A Tutorial Account
A brief guide to linear logic
Cayley iff Stone
Dynamic Web Data and Process Calculi
Sets without emtpy convex 6-gons
The "3x + 1" Problem and Finite Automata
On Unique Staisfiability and Randomized Reductions
For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable
The EATCS Award 2017 - Call for Nominations
Boolean Function Complexity Advances and Frontiers
Avoiding Sufficiently Large Binary Patterns
The Distributed Minimum Spanning Tree Problem
Ten years of the European Research Council A view from theoretical computer science
Book Announcement: Modeling and Analysis of Communicating Systems
Algebraic specification of the abstract data type "Continuum"
Jiri Matousek 1963 - 2015
Decision tables - a rough set approach
A proof rule for the "it it" generalized control structure
Footprints of HR in Initial Algebra and Final Coalgebra
Approximate counting using Taylor's theorem: a survey
Injectivity of the Quotient h\g of Two Morphisms and Ambiguity of Linear Grammars
Temporal Hyperproperties
Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen
Know the Person behind the Papers: Robert Cori
EATCS-IPEC Nerode Prize 2020 - Call for Nominations
CID - Computing with Infinite Data
Integration of Specification Techniques for Applications in Engineering 1998-2004 (Column: Formal Specification)
Do Universities Have a Future?
Intergrity Constraint Checking for Updates in Deductive Databases, a different approach
Report on OPCT 2014
Graph Abstraction for a Modal Logic
Report on The EATCS Council Meeting
Correctness of actualization for parameterized implementation concepts based on constructors and abstractors
The Presburger Award for Young Scientists 2018 - Call for Nominations
Linking Algebraic High level Nets and Dynamic Abstract Data
Associative Operators for Language Recognition
The Gödel Prize 2012
On logic and generative AI
Combinatorics of Conservation Laws
A Note on Syndeticity, Recognizable Sets and Cobham's Theorem
Fault-tolerant Distributed Systems in Hardware
IL Systems with Bounded Interactions
A note of omega-regular languages
Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms
Plays, Values, Analysis and The Complexity of Chinese Chess
29th EACSL Annual Conference on Computer Science Logic (CSL 2021)
Some of My Favourite Results in Classic Process Algebra
EATCS Distinguished Dissertation Award 2021 - Call for Nominations
Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other (Column: Formal Language Theory)
New Perspectives of Fairness
Type Systems for Distributed Programs: Session Communication
Conway's Problem and the Communication of Languages
Cover Automata for Finite Language
Unconstrained Church-Turing thesis cannot possibly be true
Learning Boolean Functions under the Uniform
Note on (EOL-EOL) array systems
EATCS Distinguished Dissertation Award 2020 - Call for Nominations
A component Hierarchy of lambda-, and Chain-free Cooperating Distributed Context Free Grammars
Five Proofs of Chernoff's Bound with Applications
A responce to the note by M. Y. Vardi
An overview of Miranda
Iterative Decoding of Low-Density Parity Check Codes
Obituary for Jaco de Bakker, 1939-2012
All action-based behavioural equivalences are undecidable for labelled Petri nets
Another Technique for Proving Completeness of Ground Resolution
Dynamic Abstract Data Types: An informal Proposal
EATCS Fellows' Advice to the Young Theoretical Computer Scientist
Weight-balanced trees are not stratified
On the Shuffle of Regular Timed Languages
Meta-Computational Average-Case Complexity: A New Paradigm Toward Excluding Heuristica
On the power of Yao-Rivest technique
Agreement Graph Dependencies
Some generalizations of Kleene's second fixed-point theorem
The Institution of Order-Sorted Equational Logic
Report on BCTCS & AlgoUK 2019
Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life
Report on BCTCS & AlgoUK 2020
CoFI: The Common Framework Initiative for Algebraic Specification
Primary Types of Instances of the Post Correspondence Problem
Applications of residues for the analysis of parallel systems communicating by fifo channels
Some varieties of iteration theories
Report on ALGO 2015
Optimal packing of similar triangles
Concurrency is more fundamental than interleaving
Kohei Honda (1959-2012)
Addendum to "A note on the closure of EOL languages under erasing homomorphismus"
Towards a More Realistic Definition of Feasibility
Behind the Scenes of TCS+: Talks, Research, and Community Efforts
Gödel Prize 2016 - Call for Nominations
Open and ClosedWords
Networks of Language Processors
Strassen's Algorithm Made (Somewhat) More Natural: A Pedagogical Remark
Programming with SpecTM
Report on BCTCS 2016
Marriages are made in calculation
The Concurrency Column
The Freudenthal Problem and its Ramifications (Part II)
Characterizations of regular languages in low level complexity classes
Chaining introduction with some computer science applications
On domains of tree tranducers
On the Classical Desicion Problem
Selfish Routing in Non-Cooperative Networks: A Survey
Finite variable logics
Testing of an Interactive Online Learning Environment with Focus on Algorithmic Tasks
Note: on the sufficiency of Igarashi's conditions for real-time deterministic context-free-languages
Report on the Magic in Science symposium
Integration Paradigm for Data Type and Process Specification Techniques
A Note on Uniform HDT0L Systems
On special multiples of integers
40th Anniversary of EATCS
Fixpoint techniques in data base recursive logic programs
Fixed Point Theorem and Aperiodic Tilings
Report on DCFS 2017
A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages
On the limits of distributed quantum computing
Noncommutative Arithmetic Circuits meet Finite Automata
Membrane Computing after the Second Brainstorming Week Sevilla, February 2004 (Column: Natural Computing)
Detecting leftmost periodicities
Regular behaviour of concurrent systems
Contextual Generalized Sequential Machines
Space and Width in Propositional Resolution (Column: Computational Complexity)
An Overview of Recent Results for Consensus in Directed Dynamic Networks
A (Centralized) Local Guide
Sorting Short Integers: The Exposition
Interviews with the 2021 CONCUR Test-of-Time Award Recipients
Conjugate Words, Cuts of the Deck and Cryptographic Protocol
Report on DCFS 2022: 24th International Conference on Descriptional Complexity of Formal Systems
Minimization by reversal is not new
Report form the EATCS General Assembly