Volume 16, Number 1, February 2005
- Jie Wu, Shuhui Yang: Energy-Efficient Node Scheduling Models In Sensor Networks With Adjustable Ranges. 3-17
- Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Self-Stabilizing Algorithms For Orderings And Colorings. 19-36
- José Alberto Fernández-Zepeda, Daniel Fajardo-Delgado, José Antonio Cárdenas-Haro, Anu G. Bourgeois: Efficient Simulation Of An Acyclic Directed Reconfigurable Model On An Undirected Reconfigurable Model. 55-70
- José Alberto Fernández-Zepeda, Alejandro Estrella-Balderrama, Anu G. Bourgeois: Designing Fault Tolerant Algorithms For Reconfigurable Meshes. 71-88
- Yasuaki Ito, Koji Nakano: FM Screening By The Local Exhaustive Search, With Hardware Acceleration. 89-104
- Kazuyuki Miura, Machiko Azuma, Takao Nishizeki: Canonical Decomposition, Realizer, Schnyder Labeling And Orderly Spanning Trees Of Plane Graphs. 117-141
Volume 16, Number 2, April 2005
- Henri Casanova: Network modeling issues for grid application scheduling. 145-162
- Olivier Beaumont, Arnaud Legrand, Loris Marchal, Yves Robert: Steady-state scheduling on heterogeneous clusters. 163-194
- Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg: An algorithmic model for heterogeneous hyper-clusters: rationale and experience. 195-215
- Pierre-François Dutot, Lionel Eyraud, Grégory Mounié, Denis Trystram: Scheduling on large scale distributed platforms: from models to implementations. 217-237
- Enrique Alba, Fikret Erçal, El-Ghazali Talbi, Albert Y. Zomaya: Guest editorial: nature-inspired distributed computing. 239-240
- Laetitia Vermeulen-Jourdan, Clarisse Dhaenens, El-Ghazali Talbi: Linkage disequilibrium study with a parallel adaptive GA. 241-260
- Lucas A. Wilson, Michelle D. Moore: Cross-pollinating parallel genetic algorithms for multi-objective search and optimization. 261-280
- Albert Y. Zomaya, Gerard Chan: Efficient clustering for parallel tasks execution in distributed systems. 281-299
- Ajay K. Katangur, Somasheker Akkaladevi, Yi Pan, Martin D. Fraser: Routing in optical multistage networks with limited crosstalk using ant colony optimization. 301-320
- Daniel Merkle, Martin Middendorf, Alexander Scheidler: Decentralized packet clustering in router-based networks. 321-341
- Enrique Alba, J. Francisco Chicano: On the behavior of parallel genetic algorithms for optimal placement of antennae in telecommunications. 343-359
- Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba: Approximation algorithms for flexible job shop problems. 361-379
Volume 16, Number 3, June 2005
- Cyril Allauzen, Mehryar Mohri, Brian Roark: The design principles and algorithms of a weighted grammar library. 403-421
- Henning Bordihn, Markus Holzer, Martin Kutrib: Unsolvability levels of operation problems for subclasses of context-free languages. 423-440
- Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën: Brute force determinization of nfas by means of state covers. 441-451
- Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: Finding finite automata that certify termination of string rewriting systems. 471-486
- Yonghua Han, Bin Ma, Kaizhong Zhang: An automata approach to match gapped sequence tags against protein database. 487-497
- Jozef Jirásek, Galina Jirásková, Alexander Szabari: State complexity of concatenation and complementation. 511-529
- Lila Kari, Stavros Konstantinidis, Petr Sosík: Operations on trajectories with applications to coding and bioinformatics. 531-546
- Bryan Krawetz, John Lawrence, Jeffrey Shallit: State complexity and the monoid of transformations of a finite set. 547-563
- Anssi Yli-Jyrä: Approximating dependency grammars through intersection of star-free regular languages. 565-579
- Stanley P. Y. Fung, Francis Y. L. Chin, Hong Shen: Online scheduling of unit jobs with bounded importance ratio. 581-598
- K. Subramani: Cascading random walks. 599-622
Volume 16, Number 4, August 2005
- Cristian Calude: Preface. 623-624
- Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien: The dot-depth and the polynomial hierarchies correspond on the delta levels. 625-644
- Jürgen Dassow, Markus Holzer: Language families defined by a ciliate bio-operation: hierarchies and decision problems. 645-662
- Rudolf Freund: P Systems working in the sequential mode on arrays and strings. 663-682
- Markus Lohrey: Decidability and complexity in automatic monoids. 707-722
- Andreas Maletti: Relating tree series transducers and weighted tree automata. 723-741
- Narad Rampersad: Words avoiding 7/3-powers and the thue-morse morphism. 755-766
- Chloe Rispal, Olivier Carton: Complementation of rational sets on countable scattered linear orderings. 767-786
- Ludwig Staiger: Infinite iterated function systems in cantor space and the hausdorff measure of omega-power languages. 787-802
Volume 16, Number 5, October 2005
- Janusz A. Brzozowski, Helmut Jürgensen: Representation of semiautomata by canonical words and equivalences. 831-850
- Jean-Marc Champarnaud, Franck Guingne, Georges Hansel: Cover transducers for functions with finite domain. 851-865
- Michael Domaratzki, Keith Ellul, Jeffrey Shallit, Ming-wei Wang: Non-uniqueness and radius of cyclic unary NFAs. 883-896
- Michael Domaratzki, Kai Salomaa: Restricted sets of trajectories and decidability of shuffle decompositions. 897-912
- Piotr Faliszewski, Lane A. Hemaspaandra: Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties. 913-928
- Rudolf Freund, Marion Oswald, Andrei Paun: Optimal results for the computational completeness of gemmating (tissue) P systems. 929-942
- Christos A. Kapoutsis: Non-recursive trade-offs for two-way machines. 943-956
- Martin Kutrib: The phenomenon of non-recursive trade-offs. 957-973
- Hing Leung: Descriptional complexity of nfa of different ambiguity. 975-984
- Alexander Okhotin: A characterization of the arithmetical hierarchy by language equations. 985-998
- Libor Polák: Minimalizations of NFA using the universal automaton. 999-1010
- Bettina Sunckel: On the descriptional complexity of metalinear cd grammar systems. 1011-1025
- Lynette van Zijl: Magic numbers for symmetric difference NFAS. 1027-1038
- Lila Kari, Stavros Konstantinidis, Petr Sosík: Bond-free languages: formalizations, maximality and construction methods. 1039-1070
Volume 16, Number 6, December 2005
- Jan Holub: Foreword. 1071-1073
- Amihood Amir: Theoretical issues of searching aerial photographs: a bird's eye view. 1075-1097
- Abdullah N. Arslan, Ömer Egecioglu: Algorithms For The Constrained Longest Common Subsequence Problems. 1099-1109
- Luigi Cinque, Sergio De Agostino, Franco Liberati, Bart J. Westgeest: A simple lossless compression heuristic for grey scale images. 1111-1119
- Marc Fontaine, Stefan Burkhardt, Juha Kärkkäinen: Bdd-based analysis of gapped q-gram Filters. 1121-1134
- Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot: A first approach to finding common motifs with gaps. 1145-1154
- Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: A fully compressed pattern matching algorithm for simple collage systems. 1155-1166
- Alban Mancheron, Christophe Moan: Combinatorial characterization of the language recognized by factor and suffix oracles. 1179-1191
- Ernest Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie: A framework for the dynamic implementation of finite automata for performance enhancement. 1193-1206
- Uli Laube, Maik Weinard: Conditional inequalities and the shortest common superstring problem. 1219-1230
- Jean-Marc Champarnaud, Fabien Coulon: Enumerating nondeterministic automata for a given language without constructing the canonical automaton. 1253-1266
- Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos: Completeness in differential approximation classes. 1267-1295
- N. Variyam Vinodchandran: Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games. 1297-1308
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team