Conferences in DBLP
(fcs) Mark Burgin , Paul Zellweger A Unified Apporach to Data Representation. [Citation Graph (0, 0)][DBLP ] Conf ] Nick Antonopoulos , James Salter , Roger M. A. Peel A Multi-Ring Method for Efficient Multi-Dimensional Data Lookup in P2P Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas O'Neil A Clause-Based Reduction from k-SAT to CLIQUE. [Citation Graph (0, 0)][DBLP ] Conf ] Houssain Kettani K-Map Analysis of Digital Circuits with Uncertain Inputs. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Burgin Superrecursive Hierarchies of Algorithmic Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Chien-Yuan Chen , Chih-Cheng Hsueh Multiplication Algorithm on Quantum Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Chia-wei Lee , Justie Su-tzu Juan On-line Ranking Algorithms for Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Mizue Ushijima , Akihiro Fujiwara Sorting algorithms based on the odd-even transposition sort and the shearsort with DNA strands. [Citation Graph (0, 0)][DBLP ] Conf ] Bala Ravikumar , Greg Cooper Fibonacci Search Algorithm for Finding Extremum Using Unary Predicates. [Citation Graph (0, 0)][DBLP ] Conf ] Bob P. Weems , Yongsheng Bai Finding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Andras Farago Finding Dense Subgraphs Efficiently. [Citation Graph (0, 0)][DBLP ] Conf ] Rusins Freivalds , Renate Praude , Lelde Lace Some Graph Problems with Equivalent Lower Bounds for Query Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Khalil Djelloul Complete First-Order Axiomatization of the Construction of Trees On an Ordered Set. [Citation Graph (0, 0)][DBLP ] Conf ] Andras Farago Almost Surely Almost Exact Optimization in Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Chien Yang , Jimmy J. M. Tan , Lih-Hsing Hsu Cycles in Highly Faulty Hypercubes. [Citation Graph (0, 0)][DBLP ] Conf ] Jutapuck Pugsee , Wanchai Rivepiboon Meaning Analysis of Sentences Using Phrase Structure Grammar with Sentence Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Marc L. Smith Unifying Theories of Programming: CSP + Lazy Observation = True Concurrency. [Citation Graph (0, 0)][DBLP ] Conf ] Akihiro Fujiwara , Kota Atsuyama A Procedure for Computing 0-1 Integer Programming with DNA Strands. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Vignéras , Serge Chaumette Behavior Model of Mobile Agent Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Mahjoub Langar , Mohamed Mejri Formal and Efficient Enforcement of Security Policies. [Citation Graph (0, 0)][DBLP ] Conf ] Yuqing Zhang , Chunling Wang , Shimin Wei Using SMV for Cryptographic Protocol Analysis: A Case Study. [Citation Graph (0, 0)][DBLP ] Conf ] Wei-Hua He , Chih-Wen Wang , Tzong-Chen Wu Joint Window Nonadjacent Form. [Citation Graph (0, 0)][DBLP ] Conf ] Laura Mancinska , Maris Ozols , Renate Praude , Agnese Zalcmane Limitations of Non-Deterministic Finite Automata Imposed by One Letter Input Alphabet. [Citation Graph (0, 0)][DBLP ] Conf ] Raitis Ozols , Rusins Freivalds , Laura Mancinska , Maris Ozols Size of Nondeterministic and Deterministic Automata for Certain Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Rusins Freivalds , Elina Kalnina , Rihards Opmanis , Agnese Zalcmane Combinatorial Block Designs for Quantum Computing Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Fouad El-Aker Improving Radix Sort Best Case Runtime. [Citation Graph (0, 0)][DBLP ] Conf ] Fouad El-Aker The Constrained Greedy Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] 