External Links

    Journal: Int. J. Found. Comput. Sci.

    Volume 7, Issue 4

    309 -- 0Satoshi Kobayashi, Takashi Yokomori. Families of Noncounting Languages and Their Learnability from Positive Data
    329 -- 0Ioan I. Macarie. A Note of Multihead Finite-State Automata
    339 -- 0Manindra Agrawal, Srinivasan Venkatesh. On the Isomorphism Conjecture for 2-DFA Reductions
    353 -- 358William Klostermeyer. Scheduling Two Salesmen in a Network
    359 -- 0Jan A. Plaza. On the Propositional SLDNF-Resolution

    Volume 7, Issue 3

    187 -- 0Juris Viksna. Inductive Inference of Limiting Programs with Bounded Number of Mind Changes
    209 -- 226Ratko Orlandic, Hosam M. Mahmoud. Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis
    227 -- 240Lin Chen, René Schott. Optimal Operations on Red-Black Trees
    241 -- 252Salvatore Caporaso. Safe Turing Machines, Grzegorczyk Classes and Polytime
    253 -- 292Luca Breveglieri, Alessandra Cherubini, Claudio Citrini, Stefano Crespi-Reghizzi. Multi-Push-Down Languages and Grammars
    293 -- 299Helmut Prodinger. Depth and Path Length of Heap Ordered Trees

    Volume 7, Issue 2

    95 -- 110Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe. Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs
    111 -- 120Ton Kloks. Treewidth of Circle Graphs
    121 -- 136Gautam Das, Paul J. Heffernan. Constructing Degree-3 Spanners with Other Sparseness Properties
    137 -- 150Rudolf Fleischer. A Simple Balanced Search Tree with O(1) Worst-Case Update Time
    151 -- 160Keijo Ruohonen. An Effective Cauchy-Peano Existence Theorem for Unique Solutions
    161 -- 168Raymond Greenlaw. Subtree Isomorphism is in DLOG for Nested Trees
    169 -- 0Kim S. Larsen, Rolf Fagerberg. Efficient Rebalancing of B-Trees with Relaxed Balance

    Volume 7, Issue 1

    1 -- 9David Sankoff, Gopal Sundaram, John D. Kececioglu. Steiner Points in the Space of Genome Rearrangements
    11 -- 22Richa Agarwala, David Fernández-Baca. Simple Algorithms for Perfect Phylogeny and Triangulating Colored Graphs
    23 -- 0Martin Fürer, W. Miller. Alignment-to-Alignment Editing with Move Gap Operations
    43 -- 58Kaizhong Zhang, Jason Tsong-Li Wang, Dennis Shasha. On the Editing Distance Between Undirected Acyclic Graphs
    59 -- 86Liz Hanks, Ron Cytron, Will D. Gillett. On Finding Topologically Valid Matchings in Restriction-Fragment Maps
    87 -- 93Art M. Duval, William F. Smyth. Covering a Circular String with Substrings of Fixed Length
    runs on