Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/ijfcs/ijfcs7.bht:"
download as .bib file
@article{DBLP:journals/ijfcs/AgarwalaF96,
author = {Richa Agarwala and
David Fern{\'{a}}ndez{-}Baca},
title = {Simple Algorithms for Perfect Phylogeny and Triangulating Colored
Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {1},
pages = {11--22},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000038},
doi = {10.1142/S0129054196000038},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/AgarwalaF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/AgrawalV96,
author = {Manindra Agrawal and
Srinivasan Venkatesh},
title = {On the Isomorphism Conjecture for 2-DFA Reductions},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {4},
pages = {339--352},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000245},
doi = {10.1142/S0129054196000245},
timestamp = {Thu, 21 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/AgrawalV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BreveglieriCCC96,
author = {Luca Breveglieri and
Alessandra Cherubini and
Claudio Citrini and
Stefano Crespi{-}Reghizzi},
title = {Multi-Push-Down Languages and Grammars},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {3},
pages = {253--292},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000191},
doi = {10.1142/S0129054196000191},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BreveglieriCCC96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Caporaso96,
author = {Salvatore Caporaso},
title = {Safe Turing Machines, Grzegorczyk Classes and Polytime},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {3},
pages = {241--252},
year = {1996},
url = {https://doi.org/10.1142/S012905419600018X},
doi = {10.1142/S012905419600018X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Caporaso96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ChenS96,
author = {Lin Chen and
Ren{\'{e}} Schott},
title = {Optimal Operations on Red-Black Trees},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {3},
pages = {227--240},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000178},
doi = {10.1142/S0129054196000178},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/ChenS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/DasH96,
author = {Gautam Das and
Paul J. Heffernan},
title = {Constructing Degree-3 Spanners with Other Sparseness Properties},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {2},
pages = {121--136},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000105},
doi = {10.1142/S0129054196000105},
timestamp = {Wed, 08 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/DasH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/DuvalS96,
author = {Art M. Duval and
William F. Smyth},
title = {Covering a Circular String with Substrings of Fixed Length},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {1},
pages = {87--93},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000075},
doi = {10.1142/S0129054196000075},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/DuvalS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Fleischer96,
author = {Rudolf Fleischer},
title = {A Simple Balanced Search Tree with {O(1)} Worst-Case Update Time},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {2},
pages = {137--150},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000117},
doi = {10.1142/S0129054196000117},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Fleischer96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/FurerM96,
author = {Martin F{\"{u}}rer and
Webb Miller},
title = {Alignment-to-Alignment Editing with "Move Gap" Operations},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {1},
pages = {23--42},
year = {1996},
url = {https://doi.org/10.1142/S012905419600004X},
doi = {10.1142/S012905419600004X},
timestamp = {Mon, 16 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/FurerM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Greenlaw96,
author = {Raymond Greenlaw},
title = {Subtree Isomorphism is in {DLOG} for Nested Trees},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {2},
pages = {161--168},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000130},
doi = {10.1142/S0129054196000130},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Greenlaw96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HanksCG96,
author = {Liz Hanks and
Ron Cytron and
Will D. Gillett},
title = {On Finding Topologically Valid Matchings in Restriction-Fragment Maps},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {1},
pages = {59--86},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000063},
doi = {10.1142/S0129054196000063},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/HanksCG96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Kloks96,
author = {Ton Kloks},
title = {Treewidth of Circle Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {2},
pages = {111--120},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000099},
doi = {10.1142/S0129054196000099},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/Kloks96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Klostermeyer96,
author = {William Klostermeyer},
title = {Scheduling Two Salesmen in a Network},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {4},
pages = {353--358},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000257},
doi = {10.1142/S0129054196000257},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Klostermeyer96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KobayashiY96,
author = {Satoshi Kobayashi and
Takashi Yokomori},
title = {Families of Noncounting Languages and Their Learnability from Positive
Data},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {4},
pages = {309--328},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000221},
doi = {10.1142/S0129054196000221},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KobayashiY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/LarsenF96,
author = {Kim S. Larsen and
Rolf Fagerberg},
title = {Efficient Rebalancing of B-Trees with Relaxed Balance},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {2},
pages = {169--186},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000142},
doi = {10.1142/S0129054196000142},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/LarsenF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Macarie96,
author = {Ioan I. Macarie},
title = {A Note of Multihead Finite-State Automata},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {4},
pages = {329--338},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000233},
doi = {10.1142/S0129054196000233},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Macarie96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/OrlandicM96,
author = {Ratko Orlandic and
Hosam M. Mahmoud},
title = {Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: {A} Comparative
Analysis},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {3},
pages = {209--226},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000166},
doi = {10.1142/S0129054196000166},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/OrlandicM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Plaza96,
author = {Jan A. Plaza},
title = {On the Propositional SLDNF-Resolution},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {4},
pages = {359},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000269},
doi = {10.1142/S0129054196000269},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Plaza96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Prodinger96,
author = {Helmut Prodinger},
title = {Depth and Path Length of Heap Ordered Trees},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {3},
pages = {293--299},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000208},
doi = {10.1142/S0129054196000208},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Prodinger96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Ripphausen-LipaWW96,
author = {Heike Ripphausen{-}Lipa and
Dorothea Wagner and
Karsten Weihe},
title = {Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar
Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {2},
pages = {95--110},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000087},
doi = {10.1142/S0129054196000087},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Ripphausen-LipaWW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Ruohonen96,
author = {Keijo Ruohonen},
title = {An Effective Cauchy-Peano Existence Theorem for Unique Solutions},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {2},
pages = {151--160},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000129},
doi = {10.1142/S0129054196000129},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Ruohonen96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/SankoffSK96,
author = {David Sankoff and
Gopal Sundaram and
John D. Kececioglu},
title = {Steiner Points in the Space of Genome Rearrangements},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {1},
pages = {1--9},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000026},
doi = {10.1142/S0129054196000026},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/SankoffSK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Viksna96,
author = {Juris Viksna},
title = {Inductive Inference of Limiting Programs with Bounded Number of Mind
Changes},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {3},
pages = {187--208},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000154},
doi = {10.1142/S0129054196000154},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Viksna96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Wong96,
author = {P.{-}K. Wong},
title = {An Algorithm for Finding a Maximum Cycle of Bipartite Graphs with
Large Degrees},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {4},
pages = {301--308},
year = {1996},
url = {https://doi.org/10.1142/S012905419600021X},
doi = {10.1142/S012905419600021X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Wong96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ZhangWS96,
author = {Kaizhong Zhang and
Jason Tsong{-}Li Wang and
Dennis E. Shasha},
title = {On the Editing Distance Between Undirected Acyclic Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {1},
pages = {43--58},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000051},
doi = {10.1142/S0129054196000051},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/ZhangWS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-25 04:17 CEST from data curated 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:
