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/jcss/jcss23.bht:"
download as .bib file
@article{DBLP:journals/jcss/AielloP81,
author = {Luigia Carlucci Aiello and
Gianfranco Prini},
title = {An Efficient Interpreter for the Lambda-Calculus},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {3},
pages = {383--424},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90073-8},
doi = {10.1016/0022-0000(81)90073-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AielloP81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Back81,
author = {Ralph{-}Johan Back},
title = {On Correct Refinement of Programs},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {1},
pages = {49--68},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90005-2},
doi = {10.1016/0022-0000(81)90005-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Back81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EhrigM81,
author = {Hartmut Ehrig and
Bernd Mahr},
title = {Complexity of Algebraic Implementations for Abstract Data Types},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {2},
pages = {223--253},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90014-3},
doi = {10.1016/0022-0000(81)90014-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/EhrigM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FredmanV81,
author = {Michael L. Fredman and
Dennis J. Volper},
title = {Query Time Versus Redundancy Trade-Offs for Range Queries},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {3},
pages = {355--365},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90071-4},
doi = {10.1016/0022-0000(81)90071-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FredmanV81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Gallier81,
author = {Jean H. Gallier},
title = {Recursion-Closed Algebraic Theories},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {1},
pages = {69--105},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90006-4},
doi = {10.1016/0022-0000(81)90006-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Gallier81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Huet81,
author = {G{\'{e}}rard P. Huet},
title = {A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {1},
pages = {11--21},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90002-7},
doi = {10.1016/0022-0000(81)90002-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Huet81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JosephY81,
author = {Deborah Joseph and
Paul Young},
title = {Independence Results in Computer Science?},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {2},
pages = {205--222},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90013-1},
doi = {10.1016/0022-0000(81)90013-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/JosephY81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Leiss81,
author = {Ernst L. Leiss},
title = {The Complexity of Restricted Regular Expressions and the Synthesis
Problem for Finite Automata},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {3},
pages = {348--354},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90070-2},
doi = {10.1016/0022-0000(81)90070-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Leiss81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Lynch81,
author = {Nancy A. Lynch},
title = {Upper Bounds for Static Resource Allocation in a Distributed System},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {2},
pages = {254--278},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90015-5},
doi = {10.1016/0022-0000(81)90015-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Lynch81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MaurerSW81,
author = {Hermann A. Maurer and
Arto Salomaa and
Derick Wood},
title = {Completeness of Context-Free Grammar Forms},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {1},
pages = {1--10},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90001-5},
doi = {10.1016/0022-0000(81)90001-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MaurerSW81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MeyerP81,
author = {Albert R. Meyer and
Rohit Parikh},
title = {Definability in Dynamic Logic},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {2},
pages = {279--298},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90016-7},
doi = {10.1016/0022-0000(81)90016-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MeyerP81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Nakamura81a,
author = {Katsuhiko Nakamura},
title = {Synchronous to Asynchronous Transformation of Polyautomata},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {1},
pages = {22--37},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90003-9},
doi = {10.1016/0022-0000(81)90003-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Nakamura81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/OvermarsL81,
author = {Mark H. Overmars and
Jan van Leeuwen},
title = {Maintenance of Configurations in the Plane},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {2},
pages = {166--204},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90012-X},
doi = {10.1016/0022-0000(81)90012-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/OvermarsL81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/OyamaguchiIH81,
author = {Michio Oyamaguchi and
Yasuyoshi Inagaki and
Namio Honda},
title = {The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn
or One-Counter Machine},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {3},
pages = {366--382},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90072-6},
doi = {10.1016/0022-0000(81)90072-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/OyamaguchiIH81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PaulSS81,
author = {Wolfgang J. Paul and
Joel I. Seiferas and
Janos Simon},
title = {An Information-Theoretic Approach to Time Bounds for On-Line Computation},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {2},
pages = {108--126},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90009-X},
doi = {10.1016/0022-0000(81)90009-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/PaulSS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Pippenger81a,
author = {Nicholas Pippenger},
title = {Pebbling with an Auxiliary Pushdown},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {2},
pages = {151--165},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90011-8},
doi = {10.1016/0022-0000(81)90011-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Pippenger81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Selman81,
author = {Alan L. Selman},
title = {Some Observations on NP, Real Numbers and P-Selective Sets},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {3},
pages = {326--332},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90068-4},
doi = {10.1016/0022-0000(81)90068-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Selman81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Snyder81,
author = {Lawrence Snyder},
title = {Theft and Conspiracy in the Take-Grant Protection Model},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {3},
pages = {333--347},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90069-6},
doi = {10.1016/0022-0000(81)90069-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Snyder81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Tompa81,
author = {Martin Tompa},
title = {Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity
Properties of Their Circuits},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {1},
pages = {106},
year = {1981},
timestamp = {Fri, 19 Oct 2012 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/Tompa81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Tompa81a,
author = {Martin Tompa},
title = {An Optimal Solution to a Wire-Routing Problem},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {2},
pages = {127--150},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90010-6},
doi = {10.1016/0022-0000(81)90010-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Tompa81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ValkV81,
author = {R{\"{u}}diger Valk and
Guy Vidal{-}Naquet},
title = {Petri Nets and Regular Languages},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {3},
pages = {299--325},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90067-2},
doi = {10.1016/0022-0000(81)90067-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ValkV81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Werschulz81,
author = {Arthur G. Werschulz},
title = {On Maximal Order for Local and Global Numerical Problems},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {1},
pages = {38--48},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90004-0},
doi = {10.1016/0022-0000(81)90004-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Werschulz81.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-26 20:26 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:
