- 2002
- Oswin Aichholzer, Lyuba Alboul, Ferran Hurtado:
On Flips in Polyhedral Surfaces. Int. J. Found. Comput. Sci. 13(2): 303-311 (2002) - Emmanuelle Anceaume:
Efficient Solution to Uniform Atomic Broadcast. Int. J. Found. Comput. Sci. 13(5): 695-717 (2002) - Emmanuelle Anceaume, Jean-Michel Hélary, Michel Raynal:
A Note on the Determination of the Immediate Predecessors in a Distributed Computation. Int. J. Found. Comput. Sci. 13(6): 865-872 (2002) - Abdullah N. Arslan, Ömer Egecioglu:
Approximation Algorithms for Local Alignment with Length Constraints. Int. J. Found. Comput. Sci. 13(5): 751-767 (2002) - Anne Bergeron, Sylvie Hamel:
Vector Algorithms for Approximate String Matching. Int. J. Found. Comput. Sci. 13(1): 53-66 (2002) - Jesús Mario Bilbao, Julio Rodrigo Fernández García, J. J. López:
On the Complexity of Computing Values of Restricted Games. Int. J. Found. Comput. Sci. 13(5): 633-651 (2002) - Anne Brüggemann-Klein, Derick Wood:
The Regularity of Two-Way Nondeterministic Tree Automata Languages. Int. J. Found. Comput. Sci. 13(1): 67-81 (2002) - Cezar Câmpeanu, Andrei Paun, Sheng Yu:
An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. Int. J. Found. Comput. Sci. 13(1): 83-97 (2002) - Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi:
Shuffle Decompositions of Regular Languages. Int. J. Found. Comput. Sci. 13(6): 799-816 (2002) - Jean-Marc Champarnaud:
Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions. Int. J. Found. Comput. Sci. 13(1): 99-113 (2002) - Siu-Wing Cheng, Tamal K. Dey:
Volume and Surface Triangulations - Preface. Int. J. Found. Comput. Sci. 13(2): 161-162 (2002) - Edward Y. C. Cheng, Sartaj Sahni:
Gate Resizing to Reduce Power Consumption. Int. J. Found. Comput. Sci. 13(3): 405-429 (2002) - Karel Culík II, Juhani Karhumäki, Jarkko Kari:
A Note on Synchronized Automata and Road Coloring Problem. Int. J. Found. Comput. Sci. 13(3): 459-471 (2002) - Zhe Dang, Oscar H. Ibarra:
The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications. Int. J. Found. Comput. Sci. 13(6): 911-936 (2002) - Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu:
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. Int. J. Found. Comput. Sci. 13(6): 817-827 (2002) - Xiaotie Deng, Zhongfei Li, Shouyang Wang:
Computational Complexity of Arbitrage in Frictional Security Market. Int. J. Found. Comput. Sci. 13(5): 681-684 (2002) - Olivier Devillers:
The Delaunay Hierarchy. Int. J. Found. Comput. Sci. 13(2): 163-180 (2002) - Olivier Devillers, Sylvain Pion, Monique Teillaud:
Walking in a Triangulation. Int. J. Found. Comput. Sci. 13(2): 181-199 (2002) - Herbert Edelsbrunner, Damrong Guoy:
Sink Insertion for Mesh Improvement. Int. J. Found. Comput. Sci. 13(2): 223-242 (2002) - Vladimir Estivill-Castro, Jianhua Yang:
Clustering Web Visitors by Fast, Robust and Convergent Algorithms. Int. J. Found. Comput. Sci. 13(4): 497-520 (2002) - Michalis Faloutsos, Rajesh Pankaj, Kenneth C. Sevcik:
The Effect of Asymmetry on the On-Line Multicast Routing Problem. Int. J. Found. Comput. Sci. 13(6): 889-910 (2002) - Qizhi Fang, Shanfeng Zhu:
Linear and Integer Programming Techniques for Cooperative Games. Int. J. Found. Comput. Sci. 13(5): 653-666 (2002) - Nicoletta De Francesco, Antonella Santone:
A Formula-Driven Modular Attack on State Explosion. Int. J. Found. Comput. Sci. 13(5): 719-731 (2002) - William H. Frey:
Boundary Triangulations Approximating Developable Surfaces that Interpolate a Close Space Curve. Int. J. Found. Comput. Sci. 13(2): 285-302 (2002) - Wen Gao, Shi Wang, Bin Liu:
A Dynamic Recommendation System Based on Log Mining. Int. J. Found. Comput. Sci. 13(4): 521-530 (2002) - David Harel, Hillel Kugler:
Synthesizing State-Based Object Systems from LSC Specifications. Int. J. Found. Comput. Sci. 13(1): 5-51 (2002) - Jerry den Hartog, Erik P. de Vink:
Verifying Probabilistic Programs Using a Hoare Like Logic. Int. J. Found. Comput. Sci. 13(3): 315-340 (2002) - Jesper G. Henriksen:
An Expressive Extension of TLC. Int. J. Found. Comput. Sci. 13(3): 341-360 (2002) - Juha Honkala:
Remarks Concerning the D0L w-Equivalence Problem. Int. J. Found. Comput. Sci. 13(5): 769-777 (2002) - Marcus Hutter:
The Fastest and Shortest Algorithm for all Well-Defined Problems. Int. J. Found. Comput. Sci. 13(3): 431-443 (2002)