Search dblp for Publications

export results for "toc:db/journals/ijfcs/ijfcs4.bht:"

 download as .bib file

@article{DBLP:journals/ijfcs/BloomE93,
  author       = {Stephen L. Bloom and
                  Zolt{\'{a}}n {\'{E}}sik},
  title        = {Erratum: Iteration Algebras},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {1},
  pages        = {99},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000249},
  doi          = {10.1142/S0129054193000249},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/BloomE93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/CrescenziS93,
  author       = {Pierluigi Crescenzi and
                  Riccardo Silvestri},
  title        = {Average Measure, Descriptive Complexity and Approximation of Maximization
                  Problems},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {1},
  pages        = {15--30},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000031},
  doi          = {10.1142/S0129054193000031},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/CrescenziS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/DassowPS93,
  author       = {J{\"{u}}rgen Dassow and
                  Gheorghe Paun and
                  Arto Salomaa},
  title        = {Grammars Based on Patterns},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {1},
  pages        = {1--14},
  year         = {1993},
  url          = {https://doi.org/10.1142/S012905419300002X},
  doi          = {10.1142/S012905419300002X},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/DassowPS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/Dickerson93,
  author       = {Matthew Dickerson},
  title        = {General Polynomial Decomposition and the s-1-Decomposition are NP-Hard},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {2},
  pages        = {147--156},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000109},
  doi          = {10.1142/S0129054193000109},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/Dickerson93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/DiksGL93,
  author       = {Krzysztof Diks and
                  Oscar Garrido and
                  Andrzej Lingas},
  title        = {Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal
                  f-Matchings},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {2},
  pages        = {179--192},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000122},
  doi          = {10.1142/S0129054193000122},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/DiksGL93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/HemaspaandraJV93,
  author       = {Lane A. Hemaspaandra and
                  Sanjay Jain and
                  Nikolai K. Vereshchagin},
  title        = {Banishing Robust Turing Completeness},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {3},
  pages        = {245--265},
  year         = {1993},
  url          = {https://doi.org/10.1142/S012905419300016X},
  doi          = {10.1142/S012905419300016X},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/HemaspaandraJV93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/IbarraJTW93,
  author       = {Oscar H. Ibarra and
                  Tao Jiang and
                  Nicholas Q. Tr{\^{a}}n and
                  Hui Wang},
  title        = {On the Equivalence of Two-Way Pushdown Automata and Counter Machines
                  Over Bounded Languages},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {2},
  pages        = {135--146},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000092},
  doi          = {10.1142/S0129054193000092},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/IbarraJTW93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/Jansen93,
  author       = {Klaus Jansen},
  title        = {Scheduling of Incompatible Jobs on Unrelated Machines},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {4},
  pages        = {275--291},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000183},
  doi          = {10.1142/S0129054193000183},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/Jansen93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/KamareddineN93,
  author       = {Fairouz Kamareddine and
                  Rob Nederpelt},
  title        = {On Stepwise Explicit Substitution},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {3},
  pages        = {197--240},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000146},
  doi          = {10.1142/S0129054193000146},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/KamareddineN93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/KirschenhoferPS93,
  author       = {Peter Kirschenhofer and
                  Helmut Prodinger and
                  Wojciech Szpankowski},
  title        = {Multidimensional Digital Searching and Some New Parameters in Tries},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {1},
  pages        = {69--84},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000055},
  doi          = {10.1142/S0129054193000055},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/KirschenhoferPS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/LaiW93,
  author       = {Tony W. Lai and
                  Derick Wood},
  title        = {A Top-Down Updating Algorithm for Weight-Balanced Trees},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {4},
  pages        = {309--324},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000201},
  doi          = {10.1142/S0129054193000201},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/LaiW93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/LangeZ93,
  author       = {Steffen Lange and
                  Thomas Zeugmann},
  title        = {Learning Recursive Languages with Bounded Mind Changes},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {2},
  pages        = {157--178},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000110},
  doi          = {10.1142/S0129054193000110},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/LangeZ93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/Lisitsa93,
  author       = {Alexei Lisitsa},
  title        = {Complexity of Universal Circumscription},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {3},
  pages        = {241--244},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000158},
  doi          = {10.1142/S0129054193000158},
  timestamp    = {Fri, 03 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/Lisitsa93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/Melnikov93,
  author       = {B. F. Melnikov},
  title        = {The Equality Condition for Infinite Catenations of Two Sets of Finite
                  Words},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {3},
  pages        = {267--274},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000171},
  doi          = {10.1142/S0129054193000171},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/Melnikov93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/MoffatP93,
  author       = {Alistair Moffat and
                  Ola Petersson},
  title        = {Historical Searching},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {1},
  pages        = {85--98},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000067},
  doi          = {10.1142/S0129054193000067},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/MoffatP93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/NakanoN93,
  author       = {Shin{-}Ichi Nakano and
                  Takao Nishizeki},
  title        = {Scheduling File Transfers Under Port and Channe; Constraints},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {2},
  pages        = {101--115},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000079},
  doi          = {10.1142/S0129054193000079},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/NakanoN93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/OlariuS93,
  author       = {Stephan Olariu and
                  Iain A. Stewart},
  title        = {A New Characterization of Unbreakable Graphs},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {3},
  pages        = {193--196},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000134},
  doi          = {10.1142/S0129054193000134},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/OlariuS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/Penczek93,
  author       = {Wojciech Penczek},
  title        = {Temporal Logics for Trace Systems: On Automated Verification},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {1},
  pages        = {31--67},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000043},
  doi          = {10.1142/S0129054193000043},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/Penczek93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/Stewart93,
  author       = {Iain A. Stewart},
  title        = {On Two Approximation Algorithms for the Clique Problem},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {2},
  pages        = {117--133},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000080},
  doi          = {10.1142/S0129054193000080},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/Stewart93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/SymvonisT93,
  author       = {Antonios Symvonis and
                  Spyros Tragoudas},
  title        = {Searching a Pseudo 3-Sided Solid Orthoconvex Grid},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {4},
  pages        = {325--353},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000213},
  doi          = {10.1142/S0129054193000213},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/SymvonisT93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/VincentS93,
  author       = {Millist W. Vincent and
                  Bala Srinivasan},
  title        = {Redundancy and the Justification for Fourth Normal Form in Relational
                  Databases},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {4},
  pages        = {355--365},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000225},
  doi          = {10.1142/S0129054193000225},
  timestamp    = {Sun, 05 Nov 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ijfcs/VincentS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/VollmerW93,
  author       = {Heribert Vollmer and
                  Klaus W. Wagner},
  title        = {The Complexity of Finding Middle Elements},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {4},
  number       = {4},
  pages        = {293--307},
  year         = {1993},
  url          = {https://doi.org/10.1142/S0129054193000195},
  doi          = {10.1142/S0129054193000195},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/VollmerW93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.