Volume 8, Number 1, 2003
Volume 8, Number 2, 2003
Selected Papers of the Workshop Weighted Automata:
Theory and Applications (Dresden University of Technology, Germany, March 4-8, 2002)
Volume 8, Number 3, 2003
- M. Sakthi Balan, Kamala Krithivasan, Madhu Mutyam:
Some Variants in Communication of Parallel Communicating Pushdown Automata.
401-416
- Björn Borchardt, Heiko Vogler:
Determinization of Finite State Weighted Tree Automata.
417-463
- Flavio D'Alessandro:
On the Complexity of Simon Automata over the Dyck Language.
465-476
- Mark Daley, Oscar H. Ibarra, Lila Kari, Ian McQuillan, Koji Nakano:
The ld and dlad Bio-Operations on Formal Languages.
477-498
- Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski:
Computing Raster Images from Grid Picture Grammars.
499-519
- Chen-Ming Fan, Huei-Jan Shyr:
Languages Related to the Properties of Disjunctivity and Code.
521-538
- Balázs Imreh, Csanád Imreh, Masami Ito:
On Monotonic Directable Nondeterministic Automata.
539-547
Volume 8, Number 4, 2003
Selected Papers of the Thirteenth Australasian Workshop on Combinatorial Algorithms (Kingfisher Bay Resort, Fraser Island, Queensland, Australia, July 7-10, 2002)
- Diane Donovan, Costas S. Iliopoulos, Mirka Miller:
Editorial.
555
- Sergey Bereg, Andrei Kelarev:
An Algorithm for Analysis of Images in Spatial Information Systems.
557-565
- Nicholas J. Cavenagh:
Latin Trade Algorithms and the Smallest Critical Set in a Latin Square.
567-578
- Frantisek Franek, William F. Smyth, Yudong Tang:
Computing All Repeats Using Suffix Arrays.
579-591
- Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao:
Computing Quasi Suffix Arrays.
593-606
- George Lagogiannis, Christos Makris, Yannis Panagis, Spyros Sioutas, Kostas Tsichlas:
New Dynamic Balanced Search Trees with Worst-Case Constant Update Time.
607-632
- George Lagogiannis, Christos Makris, Yannis Panagis, Spyros Sioutas, Kostas Tsichlas:
Rectangle Enclosure Reporting in Linear Space Revisited.
633-645
- Arnaud Lefebvre, Thierry Lecroq, Joël Alexandre:
An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle.
647-657
- Charles Curtis Lindner:
A Small Embedding for Partial 4-Cycle Systems when the Leave is Small.
659-662
- Prabhu Manyem, Rhonda L. Salt, Marc Simon Visser:
Approximation Lower Bounds in Online LIB Bin Packing and Covering.
663-674
- A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro:
Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs.
675-681
Last update Sat May 18 20:38:52 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
