FCS'11
The 2011 International Conference on Foundations of Computer Science
ISBN #: 1-60132-179-1 EDITORS: Hamid R. Arabnia, George A. Gravvanis, Ashu M. G. Solo
SESSION: NOVEL ALGORIHMS AND APPLICATIONS + METHODOLOGIES
Optimization of Out-of-core Data Preparation Methods Identifying Runtime Determining
Tamas Schradi, Akos Dudas, Sandor Juhasz
Effect of Cache Lines in Array-Based Hashing Algorithms
Akos Dudas, Sandor Kolumban, Tamas Schradi
Performance and Quality of Random Number Generators
Victor Du Preez, Mitchell Johnson, Arno Leist, Ken Hawick
Crafting a Lightweight Search Engine
Feng-Jen Yang
A 4 out of n Secret Sharing Scheme in Visual Cryptography without Expansion
Ying-Yu Chen, Justie Su-Tzu Juan
Presenting the Test Cell Algorithm for Solving Sudoku Puzzles
Tom Kigezi
Three Heuristic Algorithms for Generation of Random Polygons by a Given Set of Vertices
Ali Nourollah, Laya Mohammadi
Minimum Pseudo-Triangulation Using Convex Hull Layers
Fahimeh Taherkhani, Ali Nourollah
Generating Sunflower Random Polygons on a Set of Vertices
Laya Mohammadi, Ali Nourollah
The Generation of Pseudo-Triangulated Spiral Polygon Using Convex Hull Layers
Fahimeh Taherkhani, Ali Nourollah
Dynamic LZW for Compressing Large Files
Chung-E Wang
SESSION: THEORY + PROOF + VERIFICATION METHODS + INTERESTING RESULTS
Formal Verification of DES Using the Mizar Proof Checker
Hiroyuki Okazaki, Kenichi Arai, Yasunari Shidama
Angel Rivera
An Automated Deduction of Two Alternate Axiomatic Bases for Lukasiewicz's Sentential Calculus
Jack Horner
An Automated Derivation of Lukasiewicz's CN from the Sentential Calculus of Principia Mathematica
Jack Horner
An Automated Derivation of the Sentential Calculus of Principia Mathematica from Lukasiewicz's CN
Jack Horner
SESSION: GRAPH BASED METHODS AND RELATED ISSUES
Graph Representation of Hierarchical Alvis Model Structure
Leszek Kotulski, Marcin Szpyrka
Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems
Yuichi Asahiro, Hiroshi Eto, Eiji Miyano
Formal Specification of Semantics of UML 2.0 Activity Diagrams by Using Graph Transformation Systems
Somayeh Azizi, Vahid Panahi
SESSION: PROGRAMMING ISSUES AND TOOLS + OS + CONCURRENCY + MODEL
CHECKING
Towards a Multi-Formalism Model Checker Based on SDES Description
Behrang Mehrparvar, Mohammad Abdollahi Azgomi
A Higher-Order Computational Model for Cooperative Constraint Programming
Rafael del Vado Virseda, Fernando Perez Morente
Masaki Murakami
Jamil Ahmed, Sheng Yu
Type Disjointness in the Language of Effective Definitions
Jarred Blount, J. Nelson Rushton
Performance Evaluation of the EXT4 File System A Comparative Study Against EXT3, ReiserFS and JFS
Alireza Ghobadi, Amir Hesam Yaribakht, Sanam Maham, Mohammad Hossein Ghods
SESSION: QUANTUM COMPUTING + AUTOMATA
On the Power of Distributed Bottom-up Tree Automata
Kamala Krithivasan, Ajeesh Ramanujan
Quantum Algorithm for Decomposing Black-Box Finite Abelian Groups
Yong Zhang
Kamala Krithivasan, Sunil K. Sukumaran
Avalanche in States; Combination of Sanpile and Cellular Automata for Generate Random Numbers
Seyed Morteza Hosseini, Hossein Karimi, Majid Vafaei Jahan
The Role of Orthomodularity in the Marsden-Herman Theorem in Quantum Logic
Jack Horner
Requiring Multiplicity for Nondeterministic Automata
Jeffrey Holcomb
An Automated Deduction of the Gudder-Schelp-Beran Theorem from Ortholattice Theory
Jack Horner
SESSION: NOVEL ALGORITHMS + DNA BASED COMPUTING + GAME THEORY + TURING MACHINES
Molecular Solutions for the Maximum K-Facility Dispersion Problem on DNA-based Supercomputing
Nozar Safaei , Babak Dalvand , Saeed Safaei , Vahid Safaei
An Inclusion-Exclusion Algorithm for the k-tour Problem
Haseeb Baluch, Andrzej Lingas
Sub-Exponential Algorithms for 0/1 Knapsack and Bin Packing
Thomas O'Neil
On the Computing Power of Statecharts
Hanlin Lu, Sheng Yu
Playing Challenging Iterated Two-Person Games Well: A Case Study on the Iterated Traveler’s Dilemma
Philip Dasler, Predrag Tosic