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/iandc123.bht:"
download as .bib file
@article{DBLP:journals/iandc/Palsberg96,
author = {Jens Palsberg},
title = {Erratum: "Efficient Inference of Object Types" Volume123, Number 2
(1995), pages 198-209},
journal = {Inf. Comput.},
volume = {126},
number = {1},
pages = {103--104},
year = {1996},
url = {https://doi.org/10.1006/inco.1996.0038},
doi = {10.1006/INCO.1996.0038},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Palsberg96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AttiyaDW95,
author = {Hagit Attiya and
Shlomi Dolev and
Jennifer L. Welch},
title = {Connection Management Without Retaining Information},
journal = {Inf. Comput.},
volume = {123},
number = {2},
pages = {155--171},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1165},
doi = {10.1006/INCO.1995.1165},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AttiyaDW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BastH95,
author = {Hannah Bast and
Torben Hagerup},
title = {Fast Parallel Space Allocation, Estimation and Integer Sorting},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {72--110},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1159},
doi = {10.1006/INCO.1995.1159},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BastH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeckerDW95,
author = {Bernd Becker and
Rolf Drechsler and
Ralph Werchner},
title = {On the Relation between BDDs and FDDs},
journal = {Inf. Comput.},
volume = {123},
number = {2},
pages = {185--197},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1167},
doi = {10.1006/INCO.1995.1167},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BeckerDW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BerkmanIP95,
author = {Omer Berkman and
Costas S. Iliopoulos and
Kunsoo Park},
title = {The Subtree Max Gap Problem with Application to Parallel String Covering},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {127--137},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1162},
doi = {10.1006/INCO.1995.1162},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BerkmanIP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BiochI95,
author = {Jan C. Bioch and
Toshihide Ibaraki},
title = {Complexity of Identification and Dualization of Positive Boolean Functions},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {50--63},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1157},
doi = {10.1006/INCO.1995.1157},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BiochI95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Bshouty95,
author = {Nader H. Bshouty},
title = {Exact Learning Boolean Function via the Monotone Theory},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {146--153},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1164},
doi = {10.1006/INCO.1995.1164},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Bshouty95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/CaiCDF95,
author = {Liming Cai and
Jianer Chen and
Rodney G. Downey and
Michael R. Fellows},
title = {On the Structure of Parameterized Problems in {NP}},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {38--49},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1156},
doi = {10.1006/INCO.1995.1156},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/CaiCDF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DawarH95,
author = {Anuj Dawar and
Lauri Hella},
title = {The expressive Power of Finitely Many Generalized Quantifiers},
journal = {Inf. Comput.},
volume = {123},
number = {2},
pages = {172--184},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1166},
doi = {10.1006/INCO.1995.1166},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/DawarH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FarachT95,
author = {Martin Farach and
Mikkel Thorup},
title = {Fast Comparison of Evolutionary Trees},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {29--37},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1155},
doi = {10.1006/INCO.1995.1155},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/FarachT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FortnowL95,
author = {Lance Fortnow and
Sophie Laplante},
title = {Circuit Lower Bounds {\`{a}} la Kolmogorov},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {121--126},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1161},
doi = {10.1006/INCO.1995.1161},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/FortnowL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FreivaldsKS95,
author = {Rusins Freivalds and
Efim B. Kinber and
Carl H. Smith},
title = {On the Intrinsic Complexity of Learning},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {64--71},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1158},
doi = {10.1006/INCO.1995.1158},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/FreivaldsKS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HromkovicKSW95,
author = {Juraj Hromkovic and
Ralf Klasing and
Elena St{\"{o}}hr and
Hubert Wagener},
title = {Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and
Planar Graphs},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {17--28},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1154},
doi = {10.1006/INCO.1995.1154},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/HromkovicKSW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/JanickiK95,
author = {Ryszard Janicki and
Maciej Koutny},
title = {Semantics of Inhibitor Nets},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {1--16},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1153},
doi = {10.1006/INCO.1995.1153},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/JanickiK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/KinberS95,
author = {Efim B. Kinber and
Frank Stephan},
title = {Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity},
journal = {Inf. Comput.},
volume = {123},
number = {2},
pages = {224--241},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1170},
doi = {10.1006/INCO.1995.1170},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/KinberS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/LuccioP95,
author = {Fabrizio Luccio and
Linda Pagli},
title = {Approximate Matching for Two Families of Trees},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {111--120},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1160},
doi = {10.1006/INCO.1995.1160},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/LuccioP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Palsberg95,
author = {Jens Palsberg},
title = {Efficient Inference of Object Types},
journal = {Inf. Comput.},
volume = {123},
number = {2},
pages = {198--209},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1168},
doi = {10.1006/INCO.1995.1168},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Palsberg95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/PelegW95,
author = {David Peleg and
Avishai Wool},
title = {The Availability of Quorum Systems},
journal = {Inf. Comput.},
volume = {123},
number = {2},
pages = {210--223},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1169},
doi = {10.1006/INCO.1995.1169},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/PelegW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Takada95,
author = {Yuji Takada},
title = {A Hierarchy of Language Families Learnable by Regular Language Learning},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {138--145},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1163},
doi = {10.1006/INCO.1995.1163},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Takada95.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-07-17 05:27 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:
