FCS 2009:
Las Vegas,
Nevada,
USA
Hamid R. Arabnia, George A. Gravvanis (Eds.):
Proceedings of the 2009 International Conference on Foundations of Computer Science, FCS 2009, July 13-16, 2009, Las Vegas Nevada, USA.
CSREA Press 2009, ISBN 1-60132-103-1 
Novel Algorihms and Applications + Methodologies
- Quoc-Nam Tran, Giridhar Hariharan:
Using Model Checking for Decision Making in Computer Games.
3-8
- Srinivas Vamsi Parasa, Kumar Eswaran:
Quantum Pseudo-Fractional Fourier Transform and Its Application to Quantum Phase Estimation.
9-15
- Wit Forys, Piotr Oprocha:
Pseudo-Random Walks On Graphs And Cryptography.
16-19
- Hirofumi Tagawa, Akihiro Fujiwara:
Dictionary Operations in Membrane Computing.
20-26
- Jyh-Shyan Lin, Fu-Kuo Tseng, Rong-Jaye Chen:
An Analysis of Hierarchical Identity-Based Cryptosystems.
27-31
- Saeed Safaei, Babak Dalvand, Babak Esmaeili, Vahid Safaei:
Molecular Solutions for the Minimum Edge Dominating Set Problem on DNA-based Supercomputing.
32-36
- Nitin Chanderwal, Gitanjali Chauhan, Vivek Kumar Sehgal, Rohit Sharma, Abhishek Gupta, Aditya Patel, Amanpreet Singh Arora, Aprajita Gupta, Utkarsh Shrivastava, Rajan Vaish:
A Single Tape Deterministic Turing Machine of Adaptive Deterministic Routing Algorithm Designed for Torus Network.
37-40
- Yuichiro Tokumaru, Akihiro Fujiwara:
Procedures for Floating Point Operations with DNA Molecules.
41-46
- Nitin Chanderwal, Gitanjali Chauhan, Rohit Sharma, Vivek Kumar Sehgal, Rohit Verma, Gaurav Kumar, Utkarsh Shrivastava, Rajan Vaish:
Single Tape Deterministic Turing Machine of Routing Algorithms Designed for Torus Network.
47-52
- Sandy Stevens Tickodri-Togboa:
A Methodology for the Construction of Generating Functions and its Application to Bessel Functions.
53-58
Formal Methods and Logic
- Kenneth A. Hawick:
Spectral Analysis of Attractors in Random Boolean Network Models.
61-67
- Yijie Han:
Tight Bound for Matching.
68-74
- Arno Leist, Kenneth A. Hawick:
Circuits as a Classifier for Small-World Network Models.
75-81
- Bhupinder Singh Anand:
The Significance of Aristotle's Particularisation in the Foundations of Mathematics, Logic and Computability: Cohen and the Axiom of Choice.
82-86
- Adnan Abu Mahfouz, Gerhard Hancke:
An Efficient Method for Finding Square Roots for Elliptic Curves over OEF.
87-91
- Vitit Kantabutra:
An Infinite Class of Non-Hamiltonian Voronoi Duals Based on Regular Polygons.
92-94
- Bhupinder Singh Anand:
The Significance of Aristotle's Particularisation in the Foundations of Mathematics, Logic and Computability: Rosser and Formally Undecidable Arithmetical Propositions.
95-99
Theory
- Brian Cloteaux, Desh Ranjan:
Lower Bounds for Accessing Information on Pure Pointer Machines.
103-107
- Ryszard Janicki, Nadezhda Zubkova:
On Closure Operator for Interval Order Structures.
108-114
- Thomas O'Neil:
The Importance of Symmetric Representation.
115-119
- Joe DeMaio, William Faust:
Domination and Independence on the Rectangular Torus by Rooks and Bishops.
120-125
- Yangjun Chen:
Decomposing a Partially Ordered Set into Chains.
126-132
- Yean-Ru Chen, To-Yu Chen, Pao-Ann Hsiung, Sao-Jie Chen, Yu Hen Hu:
Compositional Automata Reduction with Non-critical Path Slicing.
133-138
- Li-Gang Wu, Lei Fan:
Cartesian Closed Categories of R-Posets.
139-144
- Zied Bouyahia, Monia Bellalouna, Khaled Ghédira, Patrick Jaillet:
A Priori Strategies for the Probabilistic Total Weighted Flowtime on Parallel Identical Machines Problem.
145-151
Late Papers
Copyright © Mon Mar 15 03:36:48 2010
by Michael Ley (ley@uni-trier.de)
