Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 34
Volume 34, Number 1, January 2023
- Mingzu Zhang
, Hongxi Liu, Pingping Li:
Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks. 1-10 - Vecdi Aytaç, Tufan Turaci:
Analysis of Vulnerability of Some Transformation Networks. 11-24 - Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Optimal Gathering Over Weber Meeting Nodes in Infinite Grid. 25-49 - Loris Marchal, Samuel McCauley, Bertrand Simon, Frédéric Vivien:
Minimizing I/Os in Out-of-Core Task Tree Scheduling. 51-80
Volume 34, Numbers 2&3, February & April 2023
- Nelma Moreira, Rogério Reis:
Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) - Preface. 81-83 - Stijn Cambie, Michiel de Bondt, Henk Don:
Extremal Binary PFAs with Small Number of States. 85-115 - Luc Edixhoven, Sung-Shik Jongmans:
Balanced-by-Construction Regular and ω-Regular Languages. 117-144 - Fabian Frei, Juraj Hromkovic, Rastislav Královic, Richard Královic:
Two-Way Non-Uniform Finite Automata. 145-162 - Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Integer Weighted Automata on Infinite Words. 163-182 - Viktor Henriksson, Manfred Kufleitner:
Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words. 183-224 - Martin Kutrib, Uwe Meyer:
Reversible Top-Down Syntax Analysis. 225-251 - Sebastian Maneth, Helmut Seidl, Martin Vu:
Definability Results for Top-Down Tree Transducers. 253-287 - Mikhail Mrykhin, Alexander Okhotin:
The Hardest LL(k) Language. 289-319 - Julian Pape-Lange:
Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings. 321-345
Volume 34, Number 4, June 2023
- Lan Lin, Yixun Lin:
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design. 347-361 - Halil Ibrahim Yildirim, Zeynep Nihan Berberler:
Isolated Rupture in Composite Networks. 363-371 - Zhiyao Yang, Pinhui Ke, Zhixiong Chen, Chenhuang Wu:
Results on the Gowers U2 Norm of Generalized Boolean Functions. 373-393 - Hong Zhang, Shuming Zhou, Qifan Zhang:
Component Connectivity of Alternating Group Networks and Godan Graphs. 395-410 - Zsolt Gazdag, Sándor Vágvölgyi:
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited. 411-427 - Jung-Heum Park:
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults. 429-441
Volume 34, Number 5, August 2023
- Meijie Ma, Chaoming Guo, Xiang-Jun Li:
Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube. 443-451 - Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Online and Approximate Network Construction from Bounded Connectivity Constraints. 453-468 - Hong Zhang, Shuming Zhou, Baohua Niu:
Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern. 469-485 - Tetsuo Asano:
Transportation Problem Allowing Sending and Bringing Back. 487-505 - Tayssir Touili, Xin Ye:
Reachability Analysis of Self Modifying Code. 507-536
Volume 34, Number 6, September 2023
- Manfred Droste, George Rahonis, Arto Salomaa:
Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) - Preface. 537-538 - Malte Blattmann, Andreas Maletti:
Compositions with Constant Weighted Extended Tree Transducers. 539-558 - Maria Pittou, George Rahonis:
Modelling Uncertainty in Architectures of Parametric Component-Based Systems. 559-601 - Paulina Paraponiari:
Fuzzy Propositional Configuration Logics. 603-631 - Manfred Droste, Zoltán Fülöp, Dávid Kószó:
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata. 633-653 - Eugenija A. Bondar, David Casas, Mikhail V. Volkov:
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees. 655-690
Volume 34, Number 7, November 2023
- Md. Saidur Rahman, Hsu-Chun Yen:
Special Issue: Graph Algorithms: Theory and Applications - A Special Issue Dedicated to the Memory of Professor Takao Nishizeki - Preface. 691-692 - Tetsuo Asano:
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands. 693-714 - Shin-Ichi Nakano:
Family Trees for Enumeration. 715-736 - Áron Ambrus, Mónika Csikós, Gergely Kiss, János Pach, Gábor Somlai:
Optimal Embedded and Enclosing Isosceles Triangles. 737-760 - Siu-Wing Cheng:
Shortest Journeys in Directed Temporal Graphs. 761-771 - Rahnuma Islam Nishat, Sue Whitesides:
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs. 773-793 - I-Cheng Liao, Hsueh-I Lu:
A Simple 2-Approximation for Maximum-Leaf Spanning Tree. 795-805 - Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter:
Drawing Simultaneously Embedded Graphs with Few Bends. 807-824 - Jian-Xi Shao, Ya-Chun Liang, Chung-Shou Liao:
Online Predictions for Online TSP on the Line. 825-851 - Kazuo Iwama, Shuichi Miyazaki:
Marriage and Roommate. 853-873 - Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini:
k-Planar Placement and Packing of Δ-Regular Caterpillars. 875-902
Volume 34, Number 8, December 2023
- Sebastian Maneth:
Preface. 902 - Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht:
Ambiguity Hierarchies for Weighted Tree Automata. 903-921 - Stefan Hoffmann:
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages. 923-957 - Stefan Hoffmann:
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs. 959-986 - Markus Holzer, Christian Rauch:
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case. 987-1022 - Diana Geneva, Georgi Shopov, Stoyan Mihov:
Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers. 1023-1049 - Cinzia Di Giusto, Laetitia Laversa, Étienne Lozes:
Guessing the Buffer Bound for k-Synchronizability. 1051-1076
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-30 20:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
