FCS 2005: Las Vegas, Nevada, USA

Hamid R. Arabnia, Rose Joshua (Eds.): Proceedings of The 2005 International Conference on Foundations of Computer Science, FCS 2005, Las Vegas, Nevada, USA, June 27-30, 2005. CSREA Press 2005, ISBN 1-932415-71-8 BibTeX

Optimization

Mark Burgin, Paul Zellweger: A Unified Apporach to Data Representation. 3-9 BibTeX
Nick Antonopoulos, James Salter, Roger M. A. Peel: A Multi-Ring Method for Efficient Multi-Dimensional Data Lookup in P2P Networks. 10-16 BibTeX
Thomas O'Neil: A Clause-Based Reduction from k-SAT to CLIQUE. 17-23 BibTeX
Houssain Kettani: K-Map Analysis of Digital Circuits with Uncertain Inputs. 24-30 BibTeX

Algorithms

Mark Burgin: Superrecursive Hierarchies of Algorithmic Problems. 31-37 BibTeX
Chien-Yuan Chen, Chih-Cheng Hsueh: Multiplication Algorithm on Quantum Computation. 38-45 BibTeX
Chia-wei Lee, Justie Su-tzu Juan: On-line Ranking Algorithms for Trees. 46-51 BibTeX
Mizue Ushijima, Akihiro Fujiwara: Sorting algorithms based on the odd-even transposition sort and the shearsort with DNA strands. 52-58 BibTeX
Bala Ravikumar, Greg Cooper: Fibonacci Search Algorithm for Finding Extremum Using Unary Predicates. 59-63 BibTeX
Bob P. Weems, Yongsheng Bai: Finding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input Sequences. 64-72 BibTeX

Data Structures

Andras Farago: Finding Dense Subgraphs Efficiently. 73-79 BibTeX
Rusins Freivalds, Renate Praude, Lelde Lace: Some Graph Problems with Equivalent Lower Bounds for Query Complexity. 80-86 BibTeX
Khalil Djelloul: Complete First-Order Axiomatization of the Construction of Trees On an Ordered Set. 87-93 BibTeX
Andras Farago: Almost Surely Almost Exact Optimization in Random Graphs. 94-100 BibTeX
Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu: Cycles in Highly Faulty Hypercubes. 101-110 BibTeX

Languages & Programming

Jutapuck Pugsee, Wanchai Rivepiboon: Meaning Analysis of Sentences Using Phrase Structure Grammar with Sentence Structures. 111-117 BibTeX
Marc L. Smith: Unifying Theories of Programming: CSP + Lazy Observation = True Concurrency. 118-124 BibTeX
Akihiro Fujiwara, Kota Atsuyama: A Procedure for Computing 0-1 Integer Programming with DNA Strands. 125-134 BibTeX

Research

Pierre Vignéras, Serge Chaumette: Behavior Model of Mobile Agent Systems. 135-142 BibTeX
Mahjoub Langar, Mohamed Mejri: Formal and Efficient Enforcement of Security Policies. 143-149 BibTeX
Yuqing Zhang, Chunling Wang, Shimin Wei: Using SMV for Cryptographic Protocol Analysis: A Case Study. 150-153 BibTeX
Wei-Hua He, Chih-Wen Wang, Tzong-Chen Wu: Joint Window Nonadjacent Form. 154-160 BibTeX
Laura Mancinska, Maris Ozols, Renate Praude, Agnese Zalcmane: Limitations of Non-Deterministic Finite Automata Imposed by One Letter Input Alphabet. 161-168 BibTeX

Late Papers

Raitis Ozols, Rusins Freivalds, Laura Mancinska, Maris Ozols: Size of Nondeterministic and Deterministic Automata for Certain Languages. 169-175 BibTeX
Rusins Freivalds, Elina Kalnina, Rihards Opmanis, Agnese Zalcmane: Combinatorial Block Designs for Quantum Computing Problems. 176-182 BibTeX
Fouad El-Aker: Improving Radix Sort Best Case Runtime. 183-189 BibTeX
Fouad El-Aker: The Constrained Greedy Algorithm. 190- BibTeX