International Conference on Theoretical and Mathematical Foundations of Computer Science
(TMFCS-08)
Orlando, Florida, USA, July 7-10, 2008
Zoran Majkic, Michael Sipser, R.Radha, Daming Wei (Editors)
ISBN: 978-1-60651-006-3
Publisher: ISRST
Website: http://www.PromoteResearch.org
Contents:
Walid Gomaa
The Complexity of Identifying Finite Abelian Groups
1-8
Xiuyuan Yu, Zhonghua Shen, Hui Chen
The rational approximations of a class of continued fractions
9-13
Zoran Majkic
Coalgebraic Specification of Query Computation in Intensional P2P Database Systems
14-23
Zoran Majkic
Abstract Database Category Based on Relational-query Observations
24-32
Haruhiko Sato, Masahito Kurihara
Design and Implementation of Multi-Completion Procedures with Termination Checking
33-40
Michael Hartwig, Somnuk Phon-Amnuaisuk
Regular Languages up to Star Height 1 and the Difference Shrinking Acceptance Probability
41-48
Hsun-Wen Chang, Meng-Chu Kuo
Chromatic Numbers of Kneser-Related Graphs
49-53
Debra Knisley, Jeff Knisley, Duran Williams
Network Properties of (t, r)-regular graphs for small t
54-58
Antonio Malheiro
On Finite Semigroup Cross-Sections and Complete Rewriting Systems
59-63
Frank J. Balbach
On the Universality of Normalized Metrics
64-71
L.Jeganathan, K.Krithivasan, R.Rama
Graph Splicing Systems
72-79
Masaki Murakami
A Graph Rewriting Model of Concurrent Programs with Higher-Order Communication
80-87
D.Bhattacharjee, Bhanu Prasad
On Some New Arithmetical Convolutions-1
88-94
Liquan ZHAO, Ling ZHANG
Model of Granular Computing
95-101
Joana Martinho, Antonio Ravara
Encoding cryptographic primitives in a calculus with polyadic synchronization
102-109
Roman Bazylevych, Bhanu Prasad, Roman Kutelmakh, Lubov Bazylevych
Decomposition and Scanning Optimization Algorithms for TSP
110-116