default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 21
Volume 21, Number 1, February 2010
- Etsuro Moriya, Friedrich Otto:
On Alternating Phrase-Structure Grammars. 1-25 - Klaus Jansen, Roberto Solis-Oba:
Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints. 27-49 - Yung-Hsing Peng, Chang-Biau Yang, Kuo-Tsung Tseng, Kuo-Si Huang:
An Algorithm and Applications to Sequence Alignment with Weighted Constraints. 51-59 - Ching-Lueh Chang, Yuh-Dauh Lyuu
:
Efficient Testing of Forecasts. 61-72 - Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang:
Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2M, 2). 73-90 - Arto Salomaa, Sheng Yu:
Subword Occurrences, Parikh Matrices and Lyndon Images. 91-111
Volume 21, Number 2, April 2010
- Kedar S. Namjoshi, Tomohiro Yoneda:
Preface. - Geng-Dian Huang, Bow-Yaw Wang:
Complete SAT-Based Model Checking for Context-Free Processes. 115-134 - Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the Efficient Computation of the Minimal Coverability Set of Petri Nets. 135-165 - Orna Kupferman, Yoad Lustig:
Latticed Simulation Relations and Games. 167-189 - Scott Little, David Walter, Kevin R. Jones, Chris J. Myers, Alper Sen:
Analog/Mixed-Signal Circuit Verification Using Models Generated from Simulation Traces. 191-210 - Edith Elkind, Blaise Genest, Doron A. Peled, Paola Spoletini:
Quantifying the Discord: Order Discrepancies in Message Sequence Charts. 211-233 - Laura Recalde, Serge Haddad, Manuel Silva Suárez:
Continuous Petri Nets: Expressive Power and Decidability Issues. 235-256
Volume 21, Number 3, June 2010
- Andreas Maletti, Catalin Ionut Tîrnauca:
Properties of Quasi-Relabeling Tree Bimorphisms. 257-276 - Oliver Friedmann:
The Stevens-Stirling-Algorithm for Solving Parity Games Locally Requires Exponential Time. 277-287 - Henning Schnoor:
The Complexity of Model Checking for Boolean Formulas. 289-309 - Aysun Ozan Aytaç, Zeynep Nihan Odabas:
Computing the rupture Degree in Composite Graphs. 311-319 - Yen-Wu Ti, Ching-Lueh Chang, Yuh-Dauh Lyuu, Alexander Shen:
Sets of k-Independent Strings. 321-327 - Mihaela Paun, Nichamon Naksinehaboon, Raja Nassar, Chokchai Leangsuksun, Stephen L. Scott, Narate Taerat:
Incremental Checkpoint Schemes for Weibull Failure Distribution. 329-344 - Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg:
Combinatorics of Life and Death for Reaction Systems. 345-356 - Hans Kellerer, Vitaly A. Strusevich:
Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack. 357-383 - Jacir Luiz Bordim, Akihiro Fujiwara, Koji Nakano:
Preface. 385-386 - Martti Forsell:
On the Performance and Cost of Some PRAM Models on CMP Hardware. 387-404 - Yasuaki Ito, Koji Nakano:
Low-Latency Connected Component Labeling Using an FPGA. 405-425 - Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The Space Complexity of Leader Election in Anonymous Networks. 427-440 - Stefan D. Bruda, Yuanqiao Zhang:
Collapsing the Hierarchy of Parallel Computational Models. 441-457 - Sayaka Kamei, Hirotsugu Kakugawa:
A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set. 459-476
Volume 21, Number 4, August 2010
- Masami Ito:
Preface. - Anil Ada:
On the Non-Deterministic Communication Complexity of Regular Languages. 479-493 - Frédérique Bassino, Laura Giambruno, Cyril Nicaud:
The Average State Complexity of Rational Operations on Finite Languages. 495-516 - Ondrej Klíma, Libor Polák:
Hierarchies of Piecewise Testable Languages. 517-533 - Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera:
Number of Occurrences of powers in Strings. 535-547 - Erzsébet Csuhaj-Varjú, Jürgen Dassow, György Vaszil:
Variants of Competence-Based Derivations in CD Grammar Systems. 549-569 - Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison:
Tree Automata with Global Constraints. 571-596 - Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit:
Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time. 597-618 - Jens Glöckler:
A Taxonomy of Deterministic Forgetting Automata. 619-631 - Stepan Holub, Dirk Nowotka:
On the Relation between Periodicity and Unbordered Factors of Finite Words. 633-645 - Roberto Mantaci, Sabrina Mantaci, Antonio Restivo:
Balance Properties and Distribution of Squares in Circular Words. 647-664 - Rémi Morin:
Unambiguous Shared-Memory Systems. 665-685
Volume 21, Number 5, October 2010
- Erzsébet Csuhaj-Varjú, Zoltán Ésik:
Preface. 687-688 - Sergey A. Afonin, Elena Khazova:
On the Structure of Finitely Generated Semigroups of Unary Regular Languages. 689-704 - Francine Blanchet-Sadri, Taktin Oey, Timothy D. Rankin:
Fine and Wilf's Theorem for Partial Words with Arbitrarily Many Weak Periods. 705-722 - Jürgen Dassow, Ralf Stiebe, Bianca Truthe:
Generative Capacity of Subregularly Tree Controlled Grammars. 723-740 - Michael Kaminski, Daniel Zeitlin:
Finite-Memory Automata with Non-Deterministic Reassignment. 741-760 - Ondrej Klíma, Libor Polák:
Literally Idempotent Languages and their Varieties - Two Letter Case. 761-780 - Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto:
On Stateless Two-Pushdown Automata and Restarting Automata. 781-798 - Tommi Lehtinen, Alexander Okhotin:
Boolean Grammars and GSM Mappings. 799-815 - Markus Lohrey:
Compressed Membership Problems for Regular Expressions and Hierarchical Automata. 817-841 - Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Sublinearly Space Bounded Iterative Arrays. 843-858 - Florin Manea, Victor Mitrana, Takashi Yokomori:
Some Remarks on the Hairpin Completion. 859-872
Volume 21, Number 6, December 2010
- Oscar H. Ibarra, Hsu-Chun Yen:
Preface. 873-874 - Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
One-Space Bounded Algorithms for Two-Dimensional Bin Packing. 875-891 - Anna Adamaszek, Artur Czumaj, Andrzej Lingas:
Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k. 893-904 - Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density. 905-924 - Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao:
Finding All Approximate Gapped Palindromes. 925-939 - Tomoyuki Yamakami:
The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata. 941-962 - Paul C. Bell, Igor Potapov:
On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups. 963-978 - Cheng-Chi Lee, Rui-Xiang Chang, Hsien-Ju Ko:
Improving Two Novel Three-Party Encrypted Key Exchange Protocols with Perfect Forward Secrecy. 979-991 - Radu-Florian Atanasiu:
Parikh Matrix Mapping and Languages. 993-1004 - Ming Xu, Liangyu Chen, Zhenbing Zeng, Zhi-Bin Li:
Termination Analysis of Linear Loops. 1005-1019 - Adrian Atanasiu:
Parikh Matrices, Amiability and Istrail Morphism. 1021-1033 - Alberto Apostolico, Claudia Tagliacollo:
Optimal Extraction of Irredundant Motif Bases. 1035-1047 - Yanli Ren, Dawu Gu, Shuozhong Wang, Xinpeng Zhang:
Hierarchical Identity-Based Proxy Re-Encryption without Random Oracles. 1049-1063 - Tomi Kärki:
A New Proof of the Three-Squares Lemma for Partial Words with One Hole. 1065-1071 - Junping Zhou, Ping Huang, Minghao Yin, Chunguang Zhou:
Phase Transitions of EXPSPACE-Complete Problems. 1073-1088 - Vamsi Kundeti, Sanguthevar Rajasekaran:
On the Hardness of the Border Length Minimization Problem on a Rectangular Array. 1089-1100
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-04-17 23:12 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:
