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/ijfcs1.bht:"
download as .bib file
@article{DBLP:journals/ijfcs/AgostinoP90,
author = {Sergio De Agostino and
Rossella Petreschi},
title = {Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {2},
pages = {123--130},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000102},
doi = {10.1142/S0129054190000102},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/AgostinoP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/AusielloP90,
author = {Giorgio Ausiello and
Marco Protasi},
title = {Limiting Polynomial Approximation of Complexity Classes},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {2},
pages = {111--122},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000096},
doi = {10.1142/S0129054190000096},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/AusielloP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Barbanera90,
author = {Franco Barbanera},
title = {Combining Term Rewriting and Type Assignment Systems},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {3},
pages = {165--184},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000138},
doi = {10.1142/S0129054190000138},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Barbanera90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BarbutiM90,
author = {Roberto Barbuti and
Maurizio Martelli},
title = {Recognizing Non-Floundering Logic Programs and Goals},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {2},
pages = {151--164},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000126},
doi = {10.1142/S0129054190000126},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BarbutiM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BovetIC90,
author = {Daniel P. Bovet and
Miriam Di Ianni and
Pierluigi Crescenzi},
title = {Deadlock Prediction in the Case of Dynamic Routing},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {3},
pages = {185--200},
year = {1990},
url = {https://doi.org/10.1142/S012905419000014X},
doi = {10.1142/S012905419000014X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BovetIC90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BruschiJY90,
author = {Danilo Bruschi and
Deborah Joseph and
Paul Young},
title = {Strong Separations for the Boolean Hierarchy over {RP}},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {3},
pages = {201--218},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000151},
doi = {10.1142/S0129054190000151},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BruschiJY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/CherubiniCCM90,
author = {Alessandra Cherubini and
Claudio Citrini and
Stefano Crespi{-}Reghizzi and
Dino Mandrioli},
title = {Breath and Depth Grammars and Deque Automata},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {3},
pages = {219--232},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000163},
doi = {10.1142/S0129054190000163},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/CherubiniCCM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Comon90,
author = {Hubert Comon},
title = {Solving Symbolic Ordering Constraints},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {4},
pages = {387--412},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000278},
doi = {10.1142/S0129054190000278},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Comon90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Costantini90,
author = {Stefania Costantini},
title = {Semantics of a Metalogic Programming Language},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {3},
pages = {233--248},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000175},
doi = {10.1142/S0129054190000175},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Costantini90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/DrosteG90,
author = {Manfred Droste and
R{\"{u}}diger G{\"{o}}bel},
title = {Universal Information Systems},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {4},
pages = {413--424},
year = {1990},
url = {https://doi.org/10.1142/S012905419000028X},
doi = {10.1142/S012905419000028X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/DrosteG90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/FachiniGMS90,
author = {Emanuela Fachini and
Jozef Gruska and
Andrea Maggiolo{-}Schettini and
Davide Sangiorgi},
title = {Simulation of Systolic Tree Automata on Trellis Automata},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {2},
pages = {87--110},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000084},
doi = {10.1142/S0129054190000084},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/FachiniGMS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/FalaschiGLM90,
author = {Moreno Falaschi and
Maurizio Gabbrielli and
Giorgio Levi and
Masaki Murakami},
title = {Nested Guarded Horn Clauses},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {3},
pages = {249--264},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000187},
doi = {10.1142/S0129054190000187},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/FalaschiGLM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/FarmerW90,
author = {William M. Farmer and
Ronald J. Watro},
title = {Redex Capturing in Term Graph Rewriting},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {4},
pages = {369--386},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000266},
doi = {10.1142/S0129054190000266},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/FarmerW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Goldwurm90,
author = {Massimiliano Goldwurm},
title = {Some Limit Distributions in Analysis of Algorithms for Problems on
Trace Languages},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {3},
pages = {265--276},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000199},
doi = {10.1142/S0129054190000199},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Goldwurm90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GorrieriM90,
author = {Roberto Gorrieri and
Ugo Montanari},
title = {Towards Hierarchical Description of Systems: {A} Proof System for
Strong Prefixing},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {3},
pages = {277--294},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000205},
doi = {10.1142/S0129054190000205},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/GorrieriM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Gradel90,
author = {Erich Gr{\"{a}}del},
title = {On the Notion of Linear Time Computability},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {3},
pages = {295--308},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000217},
doi = {10.1142/S0129054190000217},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Gradel90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KatajainenM90,
author = {Jyrki Katajainen and
Erkki M{\"{a}}kinen},
title = {Tree Compression and Optimization with Applications},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {4},
pages = {425--448},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000291},
doi = {10.1142/S0129054190000291},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KatajainenM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KenyonY90,
author = {Claire Kenyon and
Andrew Chi{-}Chih Yao},
title = {On Evaluating Boolean Functions with Unreliable Tests},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {1},
pages = {1--10},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000023},
doi = {10.1142/S0129054190000023},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KenyonY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KorahK90,
author = {A. P. Korah and
M. R. Kaimal},
title = {Dynamic Optimal Binary Search Tree},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {4},
pages = {449--464},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000308},
doi = {10.1142/S0129054190000308},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KorahK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/LiC90,
author = {Keqin Li and
Kam{-}Hoi Cheng},
title = {Generalized First-Fit Algorithms in Two and Three Dimensions},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {2},
pages = {131--150},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000114},
doi = {10.1142/S0129054190000114},
timestamp = {Fri, 06 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/LiC90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/McNaughton90,
author = {Robert McNaughton},
title = {The Development of Formal Language Theory Since 1956 (Review Paper)},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {4},
pages = {355--368},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000254},
doi = {10.1142/S0129054190000254},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/McNaughton90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Mignosi90,
author = {Filippo Mignosi},
title = {Sturmian Words and Ambigous Context-Free Languages},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {3},
pages = {309--324},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000229},
doi = {10.1142/S0129054190000229},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Mignosi90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/PipernoT90,
author = {Adolfo Piperno and
Enrico Tronci},
title = {Regular Systems in lambda-Calculus},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {3},
pages = {325--340},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000230},
doi = {10.1142/S0129054190000230},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/PipernoT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Preparata90,
author = {Franco P. Preparata},
title = {Planar Point Location Revisited (Review Paper)},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {1},
pages = {71--86},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000072},
doi = {10.1142/S0129054190000072},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Preparata90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Rosolini90,
author = {Giuseppe Rosolini},
title = {About Modest Sets},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {3},
pages = {341--354},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000242},
doi = {10.1142/S0129054190000242},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Rosolini90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/SaoudiMS90,
author = {Ahmed Saoudi and
David E. Muller and
Paul E. Schupp},
title = {On the Complexity of omega-Tree Sets and Nerode Theorem},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {1},
pages = {11--22},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000035},
doi = {10.1142/S0129054190000035},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/SaoudiMS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Subrahmanian90,
author = {V. S. Subrahmanian},
title = {A Ring-Theoretic Basis for Logic Programming},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {1},
pages = {23--48},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000047},
doi = {10.1142/S0129054190000047},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Subrahmanian90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Subrahmanian90a,
author = {V. S. Subrahmanian},
title = {Errata: {A} Ring-Theoretic Basis for Logic Programming},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {4},
pages = {465},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000321},
doi = {10.1142/S0129054190000321},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Subrahmanian90a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Suchenek90,
author = {Marek A. Suchenek},
title = {Applications of Lyndon Homomorphism Theorems to the Theory of Minimal
Models},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {1},
pages = {49--60},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000059},
doi = {10.1142/S0129054190000059},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Suchenek90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Wei90,
author = {W.{-}D. Wei},
title = {On {A} Personnel Assignment Problem},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {1},
pages = {61--70},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000060},
doi = {10.1142/S0129054190000060},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Wei90.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-05-27 09:43 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:
