Volume 20, Number 1, February 2009
- Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. 3-23
- Heidi Gebauer, Yoshio Okamoto: Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes. 25-44
- Regant Y. S. Hung, Hing-Fung Ting: A Near-Optimal Broadcasting Protocol for Mobile Video-on-Demand. 45-55
- Damien Vergnaud: New Extensions of Pairing-Based Signatures into Universal (Multi) Designated Verifier Signatures. 109-133
- Virgil Nicolae Serbanuta: On Parikh Matrices, Ambiguity, and PRINTS. 151-165
- Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk: Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. 167-183
Volume 20, Number 2, April 2009
- Torsten Stüber, Heiko Vogler, Zoltán Fülöp: Decomposition of Weighted multioperator Tree Automata. 221-245
- Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich: Single Machine Scheduling with Controllable Processing Times by submodular Optimization. 247-269
- Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg: Reduction Graphs from Overlap Graphs for Gene Assembly in Ciliates. 271-291
- Katalin Anna Lázár, Erzsébet Csuhaj-Varjú, András Lörincz, György Vaszil: Dynamically formed Clusters of Agents in Eco-Grammar Systems. 293-311
- Tomás Masopust: On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components. 331-340
- Ondrej Zajícek: A Note on Scheduling Parallel Unit Jobs on Hypercubes. 341-349
- Cheng-Chi Lee, Min-Shiang Hwang, Shiang-Feng Tzeng: A New Convertible Authenticated Encryption Scheme Based on the ElGamal Cryptosystem. 351-359
- Danny Z. Chen, Mark A. Healy, Chao Wang, Bin Xu: Geometric Algorithms for the Constrained 1-d k-Means Clustering Problems and IMRT Applications. 361-377
Volume 20, Number 3, June 2009
- Petr Sosík: Preface. 379-380
- Dorel Lucanu: Rewriting Logic-Based Semantics of P Systems and the Maximal Concurrency. 395-410
- Thomas Hinze, Raffael Faßler, Thorsten Lenser, Peter Dittrich: Register Machine Computations on Binary Numbers by oscillating and Catalytic Chemical reactions Modelled Using Mass-Action kinetics. 411-426
- Francisco José Romero-Campero, Jamie Twycross, Miguel Cámara, Malcolm Bennett, Marian Gheorghe, Natalio Krasnogor: Modular Assembly of Cell Systems Biology Models Using P Systems. 427-442
- Clemens Heuberger, Helmut Prodinger: Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations. 443-453
- Vladimir Rogojin: Successful Elementary Gene Assembly Strategies. 455-477
- Christian Glaßer, Alan L. Selman, Liyu Zhang: The Informational Content of Canonical Disjoint NP-Pairs. 501-522
- Josef Sprojcar: Proposal of a Semiformal Model of Anonymous Communication. 523-548
- Haydeh Ahrabian, Abbas Nowzari-Dalini, Fatemeh Zare-Mirakabad: A Constant Time Algorithm for DNA Add. 549-558
Volume 20, Number 4, August 2009
- Markus Holzer, Martin Kutrib: Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity. 563-580
- Hsu-Chun Yen: Path Decomposition and Semilinearity of Petri Nets. 581-596
- Ryan Dixon, Ömer Egecioglu, Timothy Sherwood: Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching. 597-612
- Giovanni Pighizzini: Deterministic Pushdown Automata and Unary Languages. 629-645
- Marco Almeida, Nelma Moreira, Rogério Reis: Antimirov and Mosses's Rewrite System Revisited. 669-684
- Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar: Composed Bisimulation for Tree Automata. 685-700
- Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda: A Run-Time Efficient Implementation of Compressed Pattern Matching Automata. 717-733
- Andrew Badr: HYPER-MINIMIZATION IN O(n2). 735-746
- Yih-Kuen Tsay, Bow-Yaw Wang: Automated Compositional Reasoning of Intuitionistically Closed Regular Properties. 747-762
- Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne: An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical. 763-774
Volume 20, Number 5, October 2009
- Parosh Aziz Abdulla, Giorgio Delzanno, Noomene Ben Henda, Ahmed Rezine: Monotonic Abstraction: on Efficient Verification of Parameterized Systems. 779-801
- Juhani Karhumäki: On the Power of Cooperating Morphisms via Reachability Problems. 803-818
- Étienne André, Thomas Chatain, Laurent Fribourg, Emmanuelle Encrenaz: An Inverse Method for Parametric Timed Automata. 819-836
- Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko: Handling Non Left-Linear Rules when Completing Tree Automata. 837-849
- Ingo Felscher, Wolfgang Thomas: Compositionality and Reachability with Conditions on Path Lengths. 851-868
- Pavel Martyugin: The Length of Subset Reachability in Nondeterministic Automata. 887-900
- Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk: The Complexity of Satisfiability for Fragments of CTL and CTL*. 901-918
- Dragos Cvetkovic, Tatjana Davidovic: Multiprocessor Interconnection Networks with Small tightness. 941-963
Volume 20, Number 6, December 2009
- Jan Holub: Foreword. 965-966
- William F. Smyth, Shu Wang: An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. 985-1004
- Pawel Baturo, Marcin Piatkowski, Wojciech Rytter: Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. 1005-1023
- Matthias Gallé, Pierre Peterlongo, François Coste: In-Place Update of Suffix Array while Recoding Words. 1025-1045
- Manolis Christodoulakis, Gerhard Brey: Edit Distance with Combinations and Splits and its Applications in OCR Name Matching. 1047-1068
- Wikus Coetser, Derrick G. Kourie, Bruce W. Watson: On Regular Expression Hashing to Reduce FA Size. 1069-1086
- Domenico Cantone, Salvatore Cristofaro, Simone Faro: New Efficient Bit-Parallel Algorithms for the (delta, alpha)-Matching Problem with Applications in Music Information Retrieval. 1087-1108
- Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara: Average Value of Sum of Exponents of Runs in a String. 1135-1146
- Yumei Huo, Joseph Y.-T. Leung, Xin Wang: Preemptive Scheduling Algorithms with Nested Processing Set restriction. 1147-1160
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-17T203403 by the dblp team