default search action
FCS 2005: Las Vegas, Nevada, USA
- Hamid R. Arabnia, Rose Joshua:
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
Optimization
- Mark Burgin, Paul Zellweger:
A Unified Apporach to Data Representation. FCS 2005: 3-9 - Nick Antonopoulos, James Salter, Roger M. A. Peel:
A Multi-Ring Method for Efficient Multi-Dimensional Data Lookup in P2P Networks. FCS 2005: 10-16 - Thomas O'Neil:
A Clause-Based Reduction from k-SAT to CLIQUE. FCS 2005: 17-23 - Houssain Kettani:
K-Map Analysis of Digital Circuits with Uncertain Inputs. FCS 2005: 24-30
Algorithms
- Mark Burgin:
Superrecursive Hierarchies of Algorithmic Problems. FCS 2005: 31-37 - Chien-Yuan Chen, Chih-Cheng Hsueh:
Multiplication Algorithm on Quantum Computation. FCS 2005: 38-45 - Chia-Wei Lee, Justie Su-tzu Juan:
On-line Ranking Algorithms for Trees. FCS 2005: 46-51 - Mizue Ushijima, Akihiro Fujiwara:
Sorting algorithms based on the odd-even transposition sort and the shearsort with DNA strands. FCS 2005: 52-58 - Bala Ravikumar, Greg Cooper:
Fibonacci Search Algorithm for Finding Extremum Using Unary Predicates. FCS 2005: 59-63 - Bob P. Weems, Yongsheng Bai:
Finding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input Sequences. FCS 2005: 64-72
Data Structures
- Andras Farago:
Finding Dense Subgraphs Efficiently. FCS 2005: 73-79 - Rusins Freivalds, Renate Praude, Lelde Lace:
Some Graph Problems with Equivalent Lower Bounds for Query Complexity. FCS 2005: 80-86 - Khalil Djelloul:
Complete First-Order Axiomatization of the Construction of Trees On an Ordered Set. FCS 2005: 87-93 - Andras Farago:
Almost Surely Almost Exact Optimization in Random Graphs. FCS 2005: 94-100 - Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Cycles in Highly Faulty Hypercubes. FCS 2005: 101-110
Languages & Programming
- Jutapuck Pugsee, Wanchai Rivepiboon:
Meaning Analysis of Sentences Using Phrase Structure Grammar with Sentence Structures. FCS 2005: 111-117 - Marc L. Smith:
Unifying Theories of Programming: CSP + Lazy Observation = True Concurrency. FCS 2005: 118-124 - Akihiro Fujiwara, Kota Atsuyama:
A Procedure for Computing 0-1 Integer Programming with DNA Strands. FCS 2005: 125-134
Research
- Pierre Vignéras, Serge Chaumette:
Behavior Model of Mobile Agent Systems. FCS 2005: 135-142 - Mahjoub Langar, Mohamed Mejri:
Formal and Efficient Enforcement of Security Policies. FCS 2005: 143-149 - Yuqing Zhang, Chunling Wang, Shimin Wei:
Using SMV for Cryptographic Protocol Analysis: A Case Study. FCS 2005: 150-153 - Wei-Hua He, Chih-Wen Wang, Tzong-Chen Wu:
Joint Window Nonadjacent Form. FCS 2005: 154-160 - Laura Mancinska, Maris Ozols, Renate Praude, Agnese Zalcmane:
Limitations of Non-Deterministic Finite Automata Imposed by One Letter Input Alphabet. FCS 2005: 161-168
Late Papers
- Raitis Ozols, Rusins Freivalds, Laura Mancinska, Maris Ozols:
Size of Nondeterministic and Deterministic Automata for Certain Languages. FCS 2005: 169-175 - Rusins Freivalds, Elina Kalnina, Rihards Opmanis, Agnese Zalcmane:
Combinatorial Block Designs for Quantum Computing Problems. FCS 2005: 176-182 - Fouad El-Aker:
Improving Radix Sort Best Case Runtime. FCS 2005: 183-189 - Fouad El-Aker:
The Constrained Greedy Algorithm. FCS 2005: 190-
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.
last updated on 2024-12-19 22:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: