default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 24
Volume 24, Number 1, January 2013
- Alex Potanin
, Taso Viglas:
Preface. 1-2 - Peter Floderus, Andrzej Lingas, Mia Persson:
Towards More Efficient Infection and Fire Fighting. 3-14 - Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy-Efficient Threshold Circuits Computing mod Functions. 15-30 - John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy:
Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. 31-50 - Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Minimum Mosaic Inference of a Set of Recombinants. 51-66 - N. S. Narayanaswamy, N. Sadagopan:
A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation. 67-94
- Marcin Bienkowski, Pawel Zalewski:
(1, 2)-Hamiltonian Completion on a Matching. 95-108 - Martin R. Ehmsen, Kim S. Larsen:
A Technique for Exact Computation of precoloring Extension on Interval Graphs. 109-122 - Fabien Durand:
Decidability of Uniform Recurrence of Morphic Sequences. 123-146 - Arto Salomaa:
Functional Constructions between reaction Systems and Propositional Logic. 147-160
Volume 24, Number 2, February 2013
- Giorgio Delzanno, Igor Potapov:
Preface. 161-164 - Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar:
The Complexity of Coverage. 165-186 - Parosh Aziz Abdulla, Jonathan Cederberg, Tomás Vojnar:
Monotonic Abstraction for Programs with Multiply-Linked Structures. 187-210 - Alessandro Carioni, Silvio Ghilardi, Silvio Ranise:
Automated Termination in Model-Checking Modulo Theories. 211-232 - Laurent Fribourg, Ulrich Kühne:
Parametric Verification and Test Coverage for Hybrid Automata using the inverse Method. 233-250 - Vladimir V. Gusev:
Lower Bounds for the Length of Reset Words in Eulerian Automata. 251-262 - Malcolm Mumme, Gianfranco Ciardo:
An Efficient Fully Symbolic Bisimulation Algorithm for Non-Deterministic Systems. 263-282 - Nataliya Skrypnyuk, Flemming Nielson:
Reachability for Finite-State Process Algebras using Horn Clauses. 283-
Volume 24, Number 3, April 2013
- Goksen Bacak-Turan, Alpay Kirlangic:
Neighbor Integrity of Transformation Graphs. 303-318 - Tomás Masopust:
A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata. 319-328 - Javad Akbari Torkestani:
A Learning Automata-Based Algorithm to the Stochastic Min-Degree Constrained Minimum Spanning Tree Problem. 329-348 - Houguang Yue:
From Computing to Interaction: on the Expressiveness of Asynchronous pi-Calculus. 349-374 - S. P. Tiwari, Shambhu Sharan, Anupam K. Singh:
On coverings of Products of Rough Transformation Semigroups. 375-392 - K. G. Subramanian, Kalpana Mahalingam, Rosni Abdullah, Atulya K. Nagar:
Two-Dimensional Digitized Picture Arrays and Parikh Matrices. 393-408 - Ziran Tu, Yupeng Jiang, Xiangyong Zeng:
Constructing odd Variable Boolean Functions with Optimal Algebraic Immunity. 409-
Volume 24, Number 4, June 2013
- Alessio Lomuscio, Ben Strulo, Nigel G. Walker, Peng Wu:
Assume-Guarantee Reasoning with Local Specifications. 419-444 - Szilárd Zsolt Fazekas, Robert Mercas:
A Note on the Decidability of subword inequalities. 445-452 - Friedrich Otto:
On Centralized Parallel Communicating Grammar Systems with Context-Sensitive Components. 453-472 - Sudipta Pathak, Sanguthevar Rajasekaran, Marius Nicolae:
Ems1: an Elegant Algorithm for Edit Distance Based Motif Search. 473-486 - Mark Burgin, Cristian S. Calude, Elena Calude:
Inductive Complexity Measures for Mathematical Problems. 487-500 - Katalin Anna Lázár:
A Bridge between Self-Organizing Networks and Grammar Systems Theory. 501-518 - Antonios Kalampakas, Olympia Louscou-Bozapalidou:
Minimization of Planar Directed Acyclic Graph Algebras. 519-532 - Han Cai, Xiangyong Zeng, Xiaohu Tang, Lei Hu:
New Optimal frequency Hopping sequence Sets from Balanced Nested difference Packings of Partition-Type. 533-
Volume 24, Number 5, August 2013
- Marian Gheorghe, Gheorghe Paun, Mario J. Pérez-Jiménez, Grzegorz Rozenberg:
Research Frontiers of membrane Computing: Open Problems and Research Topics. 547-624 - Ashok Kumar Das, Santanu Chatterjee, Jamuna Kanta Sing:
A Novel Efficient Access Control Scheme for Large-Scale Distributed Wireless Sensor Networks. 625-654 - Andreas Darmann:
Popular Spanning Trees. 655-678 - Yo-Sub Han:
An Improved Prefix-Free Regular-Expression Matching. 679-
Volume 24, Number 6, September 2013
- Nelma Moreira, Rogério Reis:
Preface. 689-690 - Janusz A. Brzozowski:
In Search of Most Complex Regular Languages. 691-708 - José Nuno Oliveira:
Weighted Automata as Coalgebras in Categories of Matrices. 709-728 - Mikhail V. Berlinkov:
Synchronizing quasi-Eulerian and quasi-One-Cluster Automata. 729-746 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Strict Local Testability with Consensus Equals Regularity, and Other Properties. 747-764 - Fedor M. Fominykh, Pavel V. Martyugin, Mikhail V. Volkov:
P(L)Aying for Synchronization. 765-780 - Daniel Goc, Dane Henshall, Jeffrey O. Shallit:
Automatic Theorem-Proving in Combinatorics on Words. 781-798 - Oscar H. Ibarra, Nicholas Q. Trân:
How to synchronize the Heads of a Multitape Automaton. 799-814 - Artur Jez, Andreas Maletti:
Hyper-Minimization for Deterministic Tree Automata. 815-830 - Martin Kutrib, Friedrich Otto:
On the Descriptional Complexity of the Window Size for Deleting Restarting Automata. 831-846 - Mehryar Mohri:
On the Disambiguation of Finite Automata and Functional Transducers. 847-862 - Daniel Prusa, Frantisek Mráz:
Restarting Tiling Automata. 863-878
- En Zhang, Yongquan Cai:
Rational Multi-Secret Sharing Scheme in Standard Point-to-Point Communication Networks. 879-898 - Guangyan Zhou, Zongsheng Gao:
A New Upper Bound for Random (2 + P)-SAT by Flipping Two Variables. 899-912 - Prabhu M. Santhosh:
Self stabilization in Distributed Knot Detection. 913-920 - Jing Li, Di Liu, Jun Yuan:
The Super Spanning Connectivity and Super Spanning laceability of Tori with Faulty Elements. 921-
Volume 24, Number 7, November 2013
- Hsu-Chun Yen, Oscar H. Ibarra:
Preface. 941-944 - Arto Salomaa, Kai Salomaa, Andrew L. Szilard:
Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012. 945-954 - Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec:
Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ. 955-978 - Kazuo Iwama, Harumichi Nishimura:
Recovering Strings in Oracles: Quantum and Classic. 979-994 - Erzsébet Csuhaj-Varjú:
P and DP Automata: Unconventional versus Classical Automata. 995-1008 - Janusz A. Brzozowski, Hellis Tamm:
Complexity of atoms of Regular Languages. 1009-1028 - Zoltán Ésik, Satoshi Okawa:
On Context-Free Languages of Scattered Words. 1029-1048 - Tommi Lehtinen, Alexander Okhotin:
Homomorphisms Preserving Deterministic Context-Free Languages. 1049-1066 - Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
The Edit-Distance between a Regular Language and a Context-Free Language. 1067-1082 - Markus Holzer, Sebastian Jakobi:
From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors. 1083-1098 - Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Unambiguous constrained Automata. 1099-1116 - Markus L. Schmid:
Inside the Class of regex Languages. 1117-1134 - Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela:
Fine and Wilf's Theorem for k-Abelian Periods. 1135-1152 - Alexandre Blondin Massé, Sarah Desmeules, Sébastien Gaboury, Sylvain Hallé:
Multipseudoperiodic Words. 1153-1166 - Viliam Geffert, Dana Pardubská:
Unary Coded NP-Complete Languages in Aspace(log log n). 1167-
Volume 24, Number 8, December 2013
- Simon Ware, Robi Malik:
Compositional Verification of the generalized Nonblocking Property using Abstraction and Canonical Automata. 1183-1208 - Zhengbang Zha, Lei Hu:
Constructing New APN Functions from known PN Functions. 1209-1220 - Stephen A. Fenner, Yong Zhang:
On the Complexity of the Hidden Subgroup Problem. 1221-1234 - Yunchao Wei, Fuguang Chen:
Generalized connectivity of (n, k)-Star graphs. 1235-1242 - Abuzer Yakaryilmaz, A. C. Cem Say:
Tight Bounds for the Space Complexity of Nonregular Language Recognition by Real-Time Machines. 1243-1254 - Hermann Gruber, Markus Holzer:
Provably Shorter Regular Expressions from Finite Automata. 1255-1280 - Sebastian Deorowicz, Agnieszka Danek:
Bit-Parallel Algorithms for the Merged Longest Common Subsequence Problem. 1281-1298 - Rolf Harren, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Rob van Stee:
Two for One: Tight Approximation of 2D Bin Packing. 1299-1328 - Aysun Ozan Aytaç, Hanife Aksu:
Some Results for the rupture Degree. 1329-1338 - Kenya Ueno:
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds. 1339-
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 2025-11-29 00:09 CET 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:
