International Journal of Foundations of Computer Science, Volume 13

Volume 13, Number 1, February 2002

• Sheng Yu:
  Implementation and Application of Automata - Editor's Foreword. 1-3
  
• David Harel, Hillel Kugler:
  Synthesizing State-Based Object Systems from LSC Specifications. 5-51
  
• Anne Bergeron, Sylvie Hamel:
  Vector Algorithms for Approximate String Matching. 53-66
  
• Anne Brüggemann-Klein, Derick Wood:
  The Regularity of Two-Way Nondeterministic Tree Automata Languages. 67-81
  
• Cezar Câmpeanu, Andrei Paun, Sheng Yu:
  An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. 83-97
  
• Jean-Marc Champarnaud:
  Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions. 99-113
  
• Oscar H. Ibarra:
  Verification in Queue-Connected Multicounter Machines. 115-127
  
• Mehryar Mohri:
  Generic e-Removal and Input e-Normalization Algorithms for Weighted Transducers. 129-143
  
• Giovanni Pighizzini, Jeffrey Shallit:
  Unary Language Operations, State Complexity and Jacobsthal's Function. 145-159
  

Volume 13, Number 2, April 2002

• Siu-Wing Cheng, Tamal K. Dey:
  Volume and Surface Triangulations - Preface. 161-162
  
• Olivier Devillers:
  The Delaunay Hierarchy. 163-180
  
• Olivier Devillers, Sylvain Pion, Monique Teillaud:
  Walking in a Triangulation. 181-199
  
• Alper Üngör, Alla Sheffer:
  Pitching Tents in Space-Time: Mesh Generation for Discontinuous Galerkin Method. 201-221
  
• Herbert Edelsbrunner, Damrong Guoy:
  Sink Insertion for Mesh Improvement. 223-242
  
• Wei Xu, Richard Hammersley, Karen Lu, Donald S. Fussell:
  Lossless Subdivision-Based Multiresolution Representation of Arbitrary Triangle Meshes Using Kite Trees. 243-260
  
• Guoliang Xu, Chandrajit L. Bajaj, Susan Evans:
  C¹ Modeling with Hybrid Multiple-Sided A-Patches. 261-284
  
• William H. Frey:
  Boundary Triangulations Approximating Developable Surfaces that Interpolate a Close Space Curve. 285-302
  
• Oswin Aichholzer, Lyuba Alboul, Ferran Hurtado:
  On Flips in Polyhedral Surfaces. 303-311
  

Volume 13, Number 3, June 2002

• P. S. Thiagarajan, Roland H. C. Yap:
  5th Asian Computing Science Conference - Preface. 313-314
  
• Jerry den Hartog, Erik P. de Vink:
  Verifying Probabilistic Programs Using a Hoare Like Logic. 315-340
  
• Jesper G. Henriksen:
  An Expressive Extension of TLC. 341-360
  
• Fairouz Kamareddine, François Monin:
  An Extension of an Automated Termination Method of Recursive Functions. 361-386
  
• Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan:
  Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. 387-403
  

• Edward Y. C. Cheng, Sartaj Sahni:
  Gate Resizing to Reduce Power Consumption. 405-429
  
• Marcus Hutter:
  The Fastest and Shortest Algorithm for all Well-Defined Problems. 431-443
  
• Hans Zantema, Hans L. Bodlaender:
  Sizes of Ordered Decision Trees. 445-458
  
• Karel Culik II, Juhani Karhumäki, Jarkko Kari:
  A Note on Synchronized Automata and Road Coloring Problem. 459-471
  

Volume 13, Number 4, August 2002

• Charles X. Ling, Nick Cercone:
  Editorial Notes. 473-475
  
• András Lörincz, István Kókai, Attila Meretei:
  Intelligent High-Performance Crawlers Used to Reveal Topic-Specific Structure of WWW. 477-495
  
• Vladimir Estivill-Castro, Jianhua Yang:
  Clustering Web Visitors by Fast, Robust and Convergent Algorithms. 497-520
  
• Wen Gao, Shi Wang, Bin Liu:
  A Dynamic Recommendation System Based on Log Mining. 521-530
  
• Vincent T. Y. Ng, Mok Kwan Ho:
  An Intelligent Agent for Web Advertisements. 531-554
  
• Ning Zhong:
  Representation and Construction of Ontologies for Web Intelligence. 555-570
  

• Nils Klarlund, Anders Møller, Michael I. Schwartzbach:
  MONA Implementation Secrets. 571-586
  
• Jürgen Schmidhuber:
  Hierarchies of Generalized Kolmogorov Complexities and Nonenumerable Universal Measures Computable in the Limit. 587-612
  
• Renaud Lepère, Denis Trystram, Gerhard J. Woeginger:
  Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints. 613-627
  

Volume 13, Number 5, October 2002

• Jesús Mario Bilbao, J. R. Fernández, J. J. López:
  On the Complexity of Computing Values of Restricted Games. 633-651
  
• Qizhi Fang, Shanfeng Zhu:
  Linear and Integer Programming Techniques for Cooperative Games. 653-666
  
• Weijia Jia, Zhibin Sun:
  On Computational Complexity of Hierarchical Optimization. 667-670
  
• Xiaoguang Yang, Shuo Tao, Rongjun Liu, Mao-cheng Cai:
  Complexity of Scenario-Based Portfolio Optimization Problem with VaR Objective. 671-679
  
• Xiaotie Deng, Zhongfei Li, Shouyang Wang:
  Computational Complexity of Arbitrage in Frictional Security Market. 681-684
  
• Jiwu Shu, Yonggen Gu, Weimin Zheng:
  A Novel Numerical Approach of Computing American Option. 685-693
  

• Emmanuelle Anceaume:
  Efficient Solution to Uniform Atomic Broadcast. 695-717
  
• Nicoletta De Francesco, Antonella Santone:
  A Formula-Driven Modular Attack on State Explosion. 719-731
  
• Carlos Martín-Vide, Alexandru Mateescu, Victor Mitrana:
  Parallel Finite Automata Systems Communicating by States. 733-749
  
• Abdullah N. Arslan, Ömer Egecioglu:
  Approximation Algorithms for Local Alignment with Length Constraints. 751-767
  
• Juha Honkala:
  Remarks Concerning the D0L w-Equivalence Problem. 769-777
  

Volume 13, Number 6, December 2002

• Andrei Paun, Gheorghe Paun, Grzegorz Rozenberg:
  Computing by Communication in Networks of Membranes. 779-798
  
• Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi:
  Shuffle Decompositions of Regular Languages. 799-816
  
• Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu:
  A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. 817-827
  
• Nicholas Tran:
  On Universally Polynomial Context-Free Languages. 829-835
  
• Andrea Mantler, Helen Cameron:
  Constructing Red-Black Tree Shapes. 837-863
  
• Emmanuelle Anceaume, Jean-Michel Hélary, Michel Raynal:
  A Note on the Determination of the Immediate Predecessors in a Distributed Computation. 865-872
  
• Nadia Nedjah, Luiza de Macedo Mourelle:
  Pattern Matching Code Minimization in Rewriting-Based Programming Languages. 873-887
  
• Michalis Faloutsos, Rajesh Pankaj, Kenneth C. Sevcik:
  The Effect of Asymmetry on the On-Line Multicast Routing Problem. 889-910
  
• Zhe Dang, Oscar H. Ibarra:
  The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications. 911-936
  

Last update Mon May 20 01:02:41 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page