default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 29
Volume 29, Number 1, January 2018
- Vojtech Vorel:
On Basic Properties of Jumping Finite Automata. 1-16 - Martin Lück:
Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic. 17-62 - Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié
, Denis Trystram:
A Family of Scheduling Algorithms for Hybrid Parallel Platforms. 63-90 - Nianfeng Lin, Damei Lü, Jinhua Wang:
L(2, 1)-Edge-Labelings of the Edge-Path-Replacement of a Graph. 91-100 - Alejandro López-Ortiz, Cynthia B. Pérez, Jazmín Romero:
Arbitrary Overlap Constraints in Graph Packing Problems. 101-122 - Ghajendran Poovanandran, Wen Chean Teh:
On M-Equivalence and Strong M-Equivalence for Parikh Matrices. 123-138
Volume 29, Number 2, February 2018
- Igor Potapov, Pavel Semukhin:
Preface. 139-142 - Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto:
Diverse Palindromic Factorization is NP-Complete. 143-164 - Dietmar Berwanger, Marie van den Bogaard:
Consensus Game Acceptors and Iterated Transductions. 165-186 - Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác:
On the Size of Two-Way Reasonable Automata for the Liveness Problem. 187-212 - Christopher Czyba, Wolfgang Thomas, Christopher Spinrath:
Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change. 213-232 - Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Density of Context-Free and Counter Languages. 233-250 - Markus Holzer, Sebastian Jakobi, Martin Kutrib:
Minimal Reversible Deterministic Finite Automata. 251-270 - Ismaël Jecker, Emmanuel Filiot:
Multi-Sequential Word Relations. 271-296 - Ines Klimann, Matthieu Picantin, Dmytro Savchuk:
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group. 297-314 - Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Neighbourhoods and Approximate Pattern Matching. 315-329
Volume 29, Number 3, April 2018
- Michelangelo Bucci, Gwénaël Richomme:
Greedy Palindromic Lengths. 331-356 - Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, László Tóth:
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes. 357-376 - Parisa Derakhshan, Walter Hussak:
Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs. 377-390 - Pardis Kavand, Ali Mohades:
A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon. 391-402 - Somnath Bera, Kalpana Mahalingam, K. G. Subramanian:
Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator. 403-414 - Luan Carlos de Sena Monteiro Ozelim, André Luís Brasil Cavalcante:
The Iota-Delta Function as an Alternative to Boolean Formalism. 415-424 - Masaki Nakanishi:
Quantum Pushdown Automata with Garbage Tape. 425-446 - Zeynep Nihan Berberler, Esin Yigit:
Link Vulnerability in Networks. 447-456
Volume 29, Number 4, June 2018
- Jarkko Kari, Alexander Okhotin:
Preface. 457-459 - Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
Algorithms and Bounds for L-Drawings of Directed Graphs. 461-480 - Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev:
A Combinatorial Model of Two-Sided Search. 481-504 - Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano:
Online Minimum Spanning Tree with Advice. 505-527 - Olivier Bournez, Oleksiy Kurganskyy, Igor Potapov:
Reachability Problems for One-Dimensional Piecewise Affine Maps. 529-549 - Elisabet Burjons, Juraj Hromkovic, Rastislav Královic, Richard Královic, Xavier Muñoz, Walter Unger:
Online Graph Coloring Against a Randomized Adversary. 551-569 - Maciej Gazda, Tim A. C. Willemse:
Cooking Your Own Parity Game Preorders Through Matching Plays. 571-590 - Jan Clemens Gehrke, Klaus Jansen, Stefan E. J. Kraft, Jakob Schikowski:
A PTAS for Scheduling Unrelated Machines of Few Different Types. 591-621 - Heikki Hyyrö, Shunsuke Inenaga:
Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions. 623-645 - Dmitry Kravchenko, Nikolajs Nahimovs, Alexander Rivosh:
Grover's Search with Faults on Some Marked Elements. 647-662 - Kent Kwee, Friedrich Otto:
Nondeterministic Ordered Restarting Automata. 663-685 - Nikolajs Nahimovs, Alexander Rivosh:
Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations. 687-700
Volume 29, Number 5, August 2018
- Alexandre Blondin Massé, Srecko Brlek, Christophe Reutenauer:
Preface. 701-704 - Valérie Berthé, Francesco Dolce, Fabien Durand, Julien Leroy, Dominique Perrin:
Rigidity and Substitutive Dendric Words. 705-720 - Émilie Charlier, Wolfgang Steiner:
Permutations and Negative Beta-Shifts. 721-740 - Cédric Chauve, Julien Courtiel, Yann Ponty:
Counting, Generating, Analyzing and Sampling Tree Alignments. 741-767 - Nicolas Bedon:
Complementation of Branching Automata for Scattered and Countable N-Free Posets. 769-799 - Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier:
Aperiodic String Transducers. 801-824 - Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela:
Degrees of Infinite Words, Polynomials and Atoms. 825-843 - Daniil Gasnikov, Arseny M. Shur:
Square-Free Partial Words with Many Wildcards. 845-860 - Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej:
Operations on Unambiguous Finite Automata. 861-876 - Andreas Maletti:
Compositions of Tree-to-Tree Statistical Machine Translation Models. 877-892 - Florin Manea, Dirk Nowotka, Markus L. Schmid:
On the Complexity of Solving Restricted Word Equations. 893-909 - Henryk Michalewski, Michal Skrzypczak:
On the Strength of Unambiguous Tree Automata. 911-933 - Dirk Nowotka, Aleksi Saarela:
One-Variable Word Equations and Three-Variable Constant-Free Word Equations. 935-950
Volume 29, Number 6, September 2018
- Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi:
An Efficient Algorithm for the Construction of the Equation Tree Automaton. 951-978 - Andreas Darmann, Janosch Döcker, Britta Dorn:
The Monotone Satisfiability Problem with Bounded Variable Appearances. 979-993 - Shuli Zhao, Weihua Yang, Shurong Zhang, Liqiong Xu:
Component Edge Connectivity of Hypercubes. 995-1001 - Yu-Liang Liu, Jou-Ming Chang:
Realizing Exchanged Crossed Cube Communication Patterns on Linear Array WDM Optical Networks. 1003-1021 - HeeWon Chung, Myungsun Kim:
Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications. 1023-1044 - Younes Guellouma, Hadda Cherroun:
From Tree Automata to Rational Tree Expressions. 1045-1062 - Caixue Zhou, Guangyong Gao, Zongmin Cui, Zhiqiang Zhao:
Certificate-Based Generalized Ring Signcryption Scheme. 1063-1088
Volume 29, Number 7, November 2018
- Meng Zhang, Yi Zhang:
Space-Efficient Representations for Glushkov Automata. 1089-1105 - Hong Wang, Jie Guan, Lin Ding:
On Equivalence Relations of State Diagram of Cascade Connection of an LFSR into an NFSR. 1107-1117 - Ömür Kivanç Kürkçü, Ersin Aslan:
A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs. 1119-1142 - Minjia Shi, Hongwei Zhu, Liqin Qian, Patrick Solé:
On Self-Dual Four Circulant Codes. 1143-1150 - Canan Çiftçi, Aysun Aytaç:
Exponential Independence Number of Some Graphs. 1151-1164 - Wen Chean Teh:
Compositions of Functions and Permutations Specified by Minimal Reaction Systems. 1165-1179 - Shuo Yan, Yun-Yong Zhang, Binfeng Yan, Lin Yan, Jinfeng Kou:
Data Associations Between Two Hierarchy Trees. 1181-1201 - Toshihiro Koga:
Context-Freeness of Parsing Expression Languages is Undecidable. 1203-1213 - Mehdy Roayaei, Mohammadreza Razzazi:
Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs. 1215-1230 - Mostafa Nouri Baygi:
The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem. 1231-1245
Volume 29, Number 8, December 2018
- Costas S. Iliopoulos, Fatima Vayani:
Preface. 1247-1248 - Kamil Salikhov:
Improved Compression of DNA Sequencing Data with Cascading Bloom Filters. 1249-1255 - Andreas Poyias, Simon J. Puglisi, Rajeev Raman:
m-Bonsai: A Practical Compact Dynamic Trie. 1257-1278 - Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi:
Bidirectional Variable-Order de Bruijn Graphs. 1279-1295 - Andreia Sofia Teixeira, Francisco Fernandes, Alexandre P. Francisco:
SpliceTAPyR - An Efficient Method for Transcriptome Alignment. 1297-1310 - Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Jakub Radoszewski:
Palindromic Decompositions with Gaps and Errors. 1311-1329 - Carl Barton, Chang Liu, Solon P. Pissis:
Fast Average-Case Pattern Matching on Weighted Sequences. 1331-1343 - Maryam Abdollahyan, Greg Elgar, Fabrizio Smeraldi:
Identifying Potential Regulatory Elements by Transcription Factor Binding Site Alignment Using Partial Order Graphs. 1345-1354 - Jamie J. Alnasir, Hugh P. Shanahan:
Transcriptomics: Quantifying Non-Uniform Read Distribution Using MapReduce. 1355-1372
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 2026-05-01 23:26 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:
