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/iandc/iandc171.bht:"
download as .bib file
@article{DBLP:journals/iandc/BaldanCM01,
author = {Paolo Baldan and
Andrea Corradini and
Ugo Montanari},
title = {Contextual Petri Nets, Asymmetric Event Structures, and Processes},
journal = {Inf. Comput.},
volume = {171},
number = {1},
pages = {1--49},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.3060},
doi = {10.1006/INCO.2001.3060},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/BaldanCM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeimelGK01,
author = {Amos Beimel and
Felix Geller and
Eyal Kushilevitz},
title = {The Query Complexity of Finding Local Minima in the Lattice},
journal = {Inf. Comput.},
volume = {171},
number = {1},
pages = {69--83},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.3065},
doi = {10.1006/INCO.2001.3065},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BeimelGK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Blieberger01,
author = {Johann Blieberger},
title = {Real-Time Properties of Indirect Recursive Procedures},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {156--182},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.3042},
doi = {10.1006/INCO.2001.3042},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Blieberger01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Chen01,
author = {Zhi{-}Zhong Chen},
title = {Approximating Unweighted Connectivity Problems in Parallel},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {125--136},
year = {2001},
url = {https://doi.org/10.1006/inco.2000.3003},
doi = {10.1006/INCO.2000.3003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Chen01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Epstein01,
author = {Leah Epstein},
title = {Online Variable Sized Covering},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {294--305},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.3087},
doi = {10.1006/INCO.2001.3087},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Epstein01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/EstebanT01,
author = {Juan Luis Esteban and
Jacobo Tor{\'{a}}n},
title = {Space Bounds for Resolution},
journal = {Inf. Comput.},
volume = {171},
number = {1},
pages = {84--97},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.2921},
doi = {10.1006/INCO.2001.2921},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/EstebanT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FleischerRST01,
author = {Rudolf Fleischer and
Kathleen Romanik and
Sven Schuierer and
Gerhard Trippen},
title = {Optimal Robot Localization in Trees},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {224--247},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.2972},
doi = {10.1006/INCO.2001.2972},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/FleischerRST01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FrandsenHM01,
author = {Gudmund Skovbjerg Frandsen and
Johan P. Hansen and
Peter Bro Miltersen},
title = {Lower Bounds for Dynamic Algebraic Problems},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {333--349},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.3046},
doi = {10.1006/INCO.2001.3046},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/FrandsenHM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Goldberg01,
author = {Paul W. Goldberg},
title = {Learning Fixed-Dimension Linear Thresholds from Fragmented Data},
journal = {Inf. Comput.},
volume = {171},
number = {1},
pages = {98--122},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.3059},
doi = {10.1006/INCO.2001.3059},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Goldberg01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HassinP01,
author = {Yehuda Hassin and
David Peleg},
title = {Distributed Probabilistic Polling and Applications to Proportionate
Agreement},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {248--268},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.3088},
doi = {10.1006/INCO.2001.3088},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/HassinP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/IntrigilaSS01,
author = {Benedetto Intrigila and
Ivano Salvo and
Stefano Sorgi},
title = {A Characterization of Weakly Church-Rosser Abstract Reduction Systems
That Are Not Church-Rosser},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {137--155},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.2945},
doi = {10.1006/INCO.2001.2945},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/IntrigilaSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/LodayaW01,
author = {Kamal Lodaya and
Pascal Weil},
title = {Rationality in Algebras with a Series Operation},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {269--293},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.3077},
doi = {10.1006/INCO.2001.3077},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/LodayaW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/MartinO01,
author = {Eric Martin and
Daniel N. Osherson},
title = {Induction by Enumeration},
journal = {Inf. Comput.},
volume = {171},
number = {1},
pages = {50--68},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.2910},
doi = {10.1006/INCO.2001.2910},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/MartinO01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/PalsbergZ01,
author = {Jens Palsberg and
Tian Zhao},
title = {Efficient and Flexible Matching of Recursive Types},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {364--387},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.3090},
doi = {10.1006/INCO.2001.3090},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/PalsbergZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Pudlak01,
author = {Pavel Pudl{\'{a}}k},
title = {Complexity Theory and Genetics: The Computational Power of Crossing
Over},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {201--223},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.2969},
doi = {10.1006/INCO.2001.2969},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Pudlak01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/RabinovichM01,
author = {Alexander Moshe Rabinovich and
Shahar Maoz},
title = {An Infinite Hierarchy of Temporal Logics over Branching Time},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {306--332},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.2970},
doi = {10.1006/INCO.2001.2970},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/RabinovichM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/RoundsZ01,
author = {William C. Rounds and
Guo{-}Qiang Zhang},
title = {Clausal Logic and Logic Programming in Algebraic Domains},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {183--200},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.3073},
doi = {10.1006/INCO.2001.3073},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/RoundsZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ShamirT01,
author = {Adi Shamir and
Boaz Tsaban},
title = {Guaranteeing the Diversity of Number Generators},
journal = {Inf. Comput.},
volume = {171},
number = {2},
pages = {350--363},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.3045},
doi = {10.1006/INCO.2001.3045},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/ShamirT01.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 14:37 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:
