


default search action
FCS 2007: Las Vegas, Nevada, USA
- Hamid R. Arabnia, Pei Li Zhou: 
 Proceedings of the 2007 International Conference on Foundations of Computer Science, FCS 2007, June 25-28, 2007, Las Vegas, Nevada, USA. CSREA Press 2007, ISBN 1-60132-049-3
Algorithms and Applications
- J. Renze Steenhuisen, Cees Witteveen: 
 Coordinating Planning Agents for Moderately and Tightly-Coupled Tasks. FCS 2007: 3-9
- Katsumi Wasaki, Ken-ichi Arai: 
 A Case Study of Formal Verification for Multi-level Pipeline Logic Circuit by using Mizar Proof Checker. FCS 2007: 10-16
- Jennifer Hui-Chan Tsai, Justie Su-tzu Juan: 
 A Simple Multi-Secret Sharing Scheme to Achieve Both Optimal Improvement Ratios. FCS 2007: 17-20
- Bruno Bauwens, Bart Wyns, Dieter Devlaminck, Georges Otte, Luc Boullart, Patrick Santens: 
 Mutual information and algorithmic information transfer as ideal undirected and directed independence tests. FCS 2007: 21-26
- Andras Farago: 
 Sampling from Independence Systems. FCS 2007: 27-33
- Takeshi Tateishi, Akihiro Fujiwara: 
 Data structures for storing binary numbers in DNA computing. FCS 2007: 34-40
- Emanuele Covino, Giovanni Pani, Daniele Scrimieri: 
 Static Computation of Polynomial-time Functions in C++. FCS 2007: 41-45
- Ying Jin: 
 Rule Update Algorithms for Active Rule Scheduling. FCS 2007: 46-51
- Yijie Han: 
 Maximum Flow with a Faster Way of Computing a Blocking Flow. FCS 2007: 52-56
- Jinshuo Liu, Dengyi Zhang, Shubo Liu, Yu Yao: 
 High Noisy Cell Image Segmentation Using Regional Template. FCS 2007: 57-60
- Chih-Chiang Yu, Yong-Hsian Hsieh, Biing-Feng Wang: 
 Optimal Algorithms for the Segment Location Problem with Range Constraints on Length and Average. FCS 2007: 61-67
- Chekad Sarami: 
 A Mass Formula for Cyclic Self-Orthogonal Codes. FCS 2007: 68-72
- Chekad Sarami: 
 On Classification of Generalized Hadamard Matrices. FCS 2007: 73-78
- Kam Kong: 
 The Majority Rule and String-and-Spinner Implementation of Logic Gates. FCS 2007: 79-81
- Xiaowei Huang, Jie Meng: 
 A Semantic Preorder Combining ST Notion and Fair Testing Semantic. FCS 2007: 82-88
- Nicolas Gauvrit: 
 A Locally Logical Model for Natural Semantics. FCS 2007: 89-93
- J. Ulisses Ferreira: 
 The Probable Decidability of the Halting Problem. FCS 2007: 94-102
Graphs and Networks + Automata + Logic
- Yi-Chun Wang, Justie Su-tzu Juan: 
 A Perfect Secret Sharing Scheme for (r-1, r)-Uniform Hypergraph-Based Access Structures. FCS 2007: 103-109
- Wangsen Feng, Wanling Qu, Hanpin Wang: 
 Lower bounds on the cardinality of maximum matchings in graphs with bounded degrees. FCS 2007: 110-113
- Douglas Harris: 
 Patterns of Protocols. FCS 2007: 114-120
- Ruzayn Quaddoura: 
 Linear Time Recognition Algorithms for Three Variants of Vertex Series Parallel Digraphs. FCS 2007: 121-131
- Anja Remshagen, Klaus Truemper: 
 The Complexity of Futile Questioning. FCS 2007: 132-138
- Zoltán Ésik, Gabriela Martín: 
 An Algebraic Characterization of Wolper's Logic. FCS 2007: 139-143
- Qutaibah M. Malluhi, Sungbum Hong: 
 An Efficient Algorithm for Determining the Relationship between Two Nodes on DAG. FCS 2007: 144-147
- Jaroslav Lajos, Mansur H. Samadzadeh: 
 A Survey and a Taxonomy of Automata-Theoretic Modeling Techniques. FCS 2007: 148-156
Interesting Results, New Models, and Methodologies
- Jerry Potter, Howard Jay Siegel: 
 Prose as a Model of Computation. FCS 2007: 157-163
- Yu-fen Weng, Justie Su-tzu Juan, Yi-Chun Wang: 
 On the Verifiable and Detectable Multi-Use General Perfect Secret Sharing Schemes. FCS 2007: 164-170
- Naveed Ali, Shoab A. Khan, Naveed Sarfraz Khattak: 
 Equivalence Verification of Arithmetic Data Paths With Multiple Word-Length Operands. FCS 2007: 171-176
- Hitoshi Yoshida, Hisayasu Kuroda, Yasumasa Kanada: 
 Parameter Selection for Fast Computation of Pi(x). FCS 2007: 177-182
- Shengyuan Wu: 
 Introduction to Multilevel Mark Coding Theory. FCS 2007: 183-192
Workshop on Pansystems and Computer Science
- Jinghong Pan, Dinghe Guo, Yongli Li, Joe Peili Zhou, Xuemou Wu: 
 Pansystems Relativity: Vitality, Intelligence and Computer. FCS 2007: 193-198
- Xuemou Wu, Dinghe Guo, Dejun Chen, Joe Peili Zhou: 
 Pansystems Extremum Theorems: Cybernetics. FCS 2007: 199-205
- Xiaolu Zhou, Joe Peili Zhou, Jinghong Pan, Xuemou Wu: 
 Pansystems Approach : Relativity, World Systems, Cognition, Linquistics, Aesthetics. FCS 2007: 206-212
- Fang Liu, He Lin: 
 A New View of Difference and Identity Relation in Rough Sets Based on Pansystems Duality Transformation. FCS 2007: 213-218
- Yongli Li, Zhilin Li, Jing Qu, Xiaoyan Wang: 
 The Sorites Paradox from the View of Pansystems. FCS 2007: 219-223
- Aiping Wu, Yongli Li: 
 Research of Reduction from the View of Pansystems. FCS 2007: 224-228
- Zhenfang Li, Yongli Li, Shiqun Tao: 
 The Extending of Panweighted Network in Pansystems and XML-based Realization. FCS 2007: 229-234
- Haixia Li, He Lin, Jiajia Wang: 
 Rough Set Approximation and Rough Set Attribute Reduction Based on Pansystems Topology. FCS 2007: 235-239
- He Lin, Haixia Li: 
 The Insert Taxis Based on Pansystems Topology. FCS 2007: 240-244
- Tao Yang, Yongli Li, Xiaoxia Li: 
 Application of Pansystems Theory in Object-Oriented System. FCS 2007: 245-250
- Haibo Li, Yongli Li, Xinjian Wei: 
 A Rough Set Model of Binary Relation Based on Product and Pansystems. FCS 2007: 251-245
- Wanjing Cai, Pei Li Zhou: 
 A Pansystems Approach to Order-relationship. FCS 2007: 255-261
- Ying Liu, Wanjing Cai: 
 Compare Researches To Rough Sets And Fuzzy Sets from the View. FCS 2007: 262-267
- Yu Jiang, He Lin: 
 A Pansystems Extremum Algorithm for Attribute Reduction Based on Discernibility Matrix. FCS 2007: 268-272
- Dejun Chen, Xiaolu Zhou, Xuemou Wu, Joe Peili Zhou: 
 Modeling Distributed Virtual Enterprise Based on Pansystems Economics. FCS 2007: 273-279
- Xuemou Wu, Pei Li Zhou, Jeffrey Yi-Lin Forrest: 
 Pansystems Exploration: A Transfield Internet-like Approach. FCS 2007: 280-286
- P. L. Zhou, Thalerngsak Kijthaweesinpoon: 
 The Use of Pansystems Relation Operators in Rough Sets. FCS 2007: 287-292
- Pei Li Zhou, Salahadin Mohammed: 
 A Pansystems Approach to Sorting Based on Binary Relations. FCS 2007: 293-299
- Dinghe Guo, Pei Li Zhou, Jinghong Pan: 
 Pansystems Extremum: Scales, Approximation, Equivalence and 0**-Theorems. FCS 2007: 300-312
Theoretical Foundations for Distributed and Concurrent Systems and Computations
- Norman R. Howes: 
 Distributed System Architecture and Specification with TLB. FCS 2007: 313-320
- Mark Burgin, Marc Smith: 
 A Unifying Model of Concurrent Processes. FCS 2007: 321-327
- Mark Burgin: 
 Interactive Hypercomputation. FCS 2007: 328-336
Late Papers
- Toshinori Yamada, Hiroyuki Ishii: 
 Algorithm for Finding a Nash Equilibrium of a Two-Player Game in the Strategic Form Using Convex Hull. FCS 2007: 337-343
- Janusz Jacak, Ireneusz J. Jozwiak, Lucjan Jacak: 
 Application of braid groups for information processing. FCS 2007: 344-348
- S. Q. Zheng, Shaoyang Liu: 
 Hypergraph Algorithms with Network Applications. FCS 2007: 349-355
- Bing Yang, S. Q. Zheng, Enyue Lu: 
 Finding Two Disjoint Paths in a Network with MinSum-MinMin Objective Function. FCS 2007: 356-361
- N. Messaadi, Hajer Bouzaouache, Naceur Benhadj Braiek: 
 Nonlinear Optimization Algorithms for Hybrid Controller Design of Switched Systems. FCS 2007: 362-368
- Masaki Murakami: 
 Compilation of Higher-Order Concurrent Programs into First-Order Programs on Recursive Graph Rewriting Model. FCS 2007: 369-

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


 Google
Google Google Scholar
Google Scholar Semantic Scholar
Semantic Scholar Internet Archive Scholar
Internet Archive Scholar CiteSeerX
CiteSeerX ORCID
ORCID














