default search action
International Journal of Foundations of Computer Science, Volume 25
Volume 25, Number 1, January 2014
- Jia Fan, Yuliang Zheng
, Xiaohu Tang:
A New Construction of Identity-Based Signcryption without Random Oracles. 1-24 - George Lagogiannis:
Parent Queries over Dynamic Balanced Parenthesis Strings. 25-58 - Xiang-Lan Cao, Elkin Vumar:
Super Edge connectivity of Kronecker Products of graphs. 59-66 - Haejae Jung:
A Simple Array Version of M-Heap. 67-88 - Alexander Golovnev:
Approximating Asymmetric TSP in exponential Time. 89-100 - Galina Jirásková
The Ranges of State Complexities for Complement, Star, and Reversal of Regular Languages. 101-
Volume 25, Number 2, February 2014
- Jheng-Cheng Chen, Chia-Jui Lai, Chang-Hsiung Tsai:
A Three-Round Adaptive Diagnostic Algorithm in a Distributed System Modeled by Dual-Cubes. 125-140 - Natasa Jonoska, Daria Karpenko:
Active Tile Self-assembly, Part 1: Universality at temperature 1. 141-164 - Natasa Jonoska, Daria Karpenko:
Active Tile Self-assembly, Part 2: Self-Similar Structures and Structural Recursion. 165-194 - Eric Wang, Cewei Cui, Zhe Dang, Thomas R. Fischer, Linmin Yang:
Zero-Knowledge Blackbox Testing: where are the Faults? 195-218 - Pai-Chou Wang:
Dynamic Reducts Generation using Cascading Hashes. 219-
Volume 25, Number 3, April 2014
- Andrzej Pelc, Anas Tiane:
Efficient Grid Exploration with a stationary Token. 247-262 - Jing Zhang, Xiaofan Yang, Cui Yu, Li He:
The Congestion of generalized Cube Communication Pattern in Linear Array Network. 263-274 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Zoom Structures and reaction Systems Yield Exploration Systems. 275-306 - Yoshiyuki Yamamoto, Kouichi Hirata
Tractable and Intractable variations of Unordered Tree Edit Distance. 307-330 - Nhat X. Lam, Min Kyung An
Broadcast Scheduling Problem in SINR Model. 331-342 - Yu Zhou, Lin Wang, Weiqiong Wang, Xinfeng Dong, Xiaoni Du:
One Sufficient and Necessary Condition on Balanced Boolean Functions with σf = 22n + 2n+3(n ≥ 3). 343-354 - Amr Elmasry, Yung H. Tsin:
On Finding Sparse Three-Edge-Connected and Three-Vertex-Connected Spanning subgraphs. 355-368
Volume 25, Number 4, June 2014
- Alberto Dennunzio, Luca Manzoni
Preface. 369-372 - Edwin J. Beggs, José Félix Costa
An analogue-Digital Church-Turing Thesis. 373-390 - Erzsébet Csuhaj-Varjú, György Vaszil:
P Automata with Restricted Power. 391-408 - Dima Grigoriev, Vladimir Shpilrain:
Yao's Millionaires' Problem and Decoy-Based Public Key Encryption by Classical Physics. 409-418 - Lila Kari, Steffen Kopecki, Amirhossein Simjour:
Hypergraph Automata: a Theoretical Model for patterned Self-assembly. 419-440 - Luca Manzoni
Simple reaction Systems and their Classification. 441-458 - Jennifer E. Padilla, Matthew J. Patitz
Asynchronous signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient assembly of Shapes. 459-488 - Benjamin Russell, Susan Stepney
Applications of Finsler Geometry to Speed Limits to Quantum Information Processing. 489-506 - Andreas Voigt, Rinaldo Greiner, Merle Allerdißen, Andreas Richter
Towards Computation with Microchemomechanical Systems. 507-
Volume 25, Number 5, August 2014
- Ning Ding, Yan Lan, Xin Chen, György Dósa, He Guo, Xin Han:
Online Minimum makespan Scheduling with a Buffer. 525-536 - Jia Zheng, Baofeng Wu, Yufu Chen, Zhuojun Liu:
Constructing 2M-variable Boolean Functionswith Optimal Algebraic Immunity Based on Polar Decomposition of. 537-552 - Yinkui Li, Zongtian Wei, Xiaokui Yue, Erqiang Liu:
Tenacity of total graphs. 553-562 - Partha Sarathi Mandal
A Statistical Approach towards Secure Location Verification in noisy Wireless channels. 563-584 - Tim Boykett
ℐ2 radical in Automata nearrings. 585-596 - Gennaro Cordasco
On Scheduling Series-Parallel DAGs to Maximize Area. 597-622 - Taha Ghasemi, Hossein Ghasemalizadeh, Mohammadreza Razzazi
An Algorithmic Framework for Solving Geometric Covering Problems - with Applications. 623-640 - Manfred Droste, Bundit Pibaljommee:
Weighted Nested Word Automata and Logics over Strong bimonoids. 641-
Volume 25, Number 6, September 2014
- Junping Zhou, Weihua Su, Jianan Wang:
New Worst-Case upper Bound for Counting Exact Satisfiability. 667-678 - Pedro García, Damián López
Efficient Deterministic Finite Automata Split-Minimization derived from Brzozowski's Algorithm. 679-696 - Haijun Yang, Minqiang Li, Qinghua Zheng:
Performance Analysis of Grid Architecture via Queueing Theory. 697-722 - Chiao-Wei Chiu, Kuo-Si Huang, Chang-Biau Yang, Chiou-Ting Tseng:
An Adaptive Heuristic Algorithm with the Probabilistic Safety Vector for Fault-Tolerant Routing on the (n, k)-Star Graph. 723-744 - Lin Chen
Online Scheduling of mixed CPU-GPU jobs. 745-762 - Deng Tang
A class of 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Good Behavior against Fast Algebraic Attacks. 763-780 - Tamar Aizikowitz, Michael Kaminski:
Linear Conjunctive Grammars and One-turn Synchronized Alternating Pushdown Automata. 781-
Volume 25, Number 7, November 2014
- Helmut Jürgensen, Rogério Reis
Preface. 803-806 - Janusz A. Brzozowski, Baiyu Li:
Syntactic Complexity of ℛ- and 풥-Trivial Regular Languages. 807-822 - Daniel Goc, Alexandros Palioudakis, Kai Salomaa:
Nondeterministic State Complexity of Proportional Removals. 823-836 - Markus Holzer
Nondeterministic Biautomata and their Descriptional Complexity. 837-856 - Klaus Sutner:
Iteration of Invertible Transductions. 857-876 - Martin Kutrib
Simulations of Unary One-Way Multi-Head Finite Automata. 877-896 - Giovanni Pighizzini
Limited Automata and Regular Languages. 897-916 - Cezar Câmpeanu
Descriptional Complexity in encoded Blum Static Complexity Spaces. 917-
Volume 25, Number 8, December 2014
- Marie-Pierre Béal, Olivier Carton
Preface. 933-936 - Arseny M. Shur:
Languages with a Finite antidictionary: some growth Questions. 937-954 - Manfred Droste, Heiko Vogler:
The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages. 955-970 - Tony Tan, Domagoj Vrgoc:
Regular Expressions for Querying Data graphs. 971-986 - Ugur Küçük, A. C. Cem Say
Finite Automata with Advice Tapes. 987-1000 - Zoltán Ésik, Szabolcs Iván
Operational Characterization of Scattered MCFLs. 1001-1016 - Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Prefix Picture codes: a Decidable class of Two-Dimensional codes. 1017-1032 - Joel D. Day, Daniel Reidenbach, Johannes C. Schneider:
On the Dual Post Correspondence Problem. 1033-1048 - Jürgen Dassow, Florin Manea, Robert Mercas
Inner Palindromic Closure. 1049-1064 - Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro:
On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages. 1065-1082 - Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan:
Adjacent Ordered Multi-Pushdown Systems. 1083-1096 - Daniel Goc, Narad Rampersad, Michel Rigo
On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving). 1097-1110 - Vincent Carnino, Sylvain Lombardy:
Factorizations and Universal Automaton of omega Languages. 1111-1126 - Oscar H. Ibarra, Bala Ravikumar:
Some Decision Questions Concerning the Time Complexity of Language Acceptors. 1127-1140 - Martin Kutrib
Stateless One-Way Multi-Head Finite Automata with Pebbles. 1141-1160 - Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
Sorting conjugates and Suffixes of Words in a Multiset. 1161-
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-12-15 01:16 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: