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/ipl/ipl35.bht:"
download as .bib file
@article{DBLP:journals/ipl/AggarwalL90,
author = {Alok Aggarwal and
Frank Thomson Leighton},
title = {A Tight Lower Bound for the Train Reversal Problem},
journal = {Inf. Process. Lett.},
volume = {35},
number = {6},
pages = {301--304},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90032-S},
doi = {10.1016/0020-0190(90)90032-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AggarwalL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AggarwalS90,
author = {Alok Aggarwal and
Subhash Suri},
title = {Computing the Longest Diagonal of a Simple Polygon},
journal = {Inf. Process. Lett.},
volume = {35},
number = {1},
pages = {13--18},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90167-V},
doi = {10.1016/0020-0190(90)90167-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AggarwalS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AhujaZ90,
author = {Mohan Ahuja and
Yahui Zhu},
title = {An O(n log n) Feasibility Algorithm for Preemptive Scheduling of n
Independent Jobs on a Hypercube},
journal = {Inf. Process. Lett.},
volume = {35},
number = {1},
pages = {7--11},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90166-U},
doi = {10.1016/0020-0190(90)90166-U},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AhujaZ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Alon90,
author = {Noga Alon},
title = {Generating Pseudo-Random Permutations and Maximum Flow Algorithms},
journal = {Inf. Process. Lett.},
volume = {35},
number = {4},
pages = {201--204},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90024-R},
doi = {10.1016/0020-0190(90)90024-R},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Alon90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AltmanL90,
author = {Tom Altman and
George Logothetis},
title = {A Note on Ambiguity in Context-Free Grammars},
journal = {Inf. Process. Lett.},
volume = {35},
number = {3},
pages = {111--114},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90058-6},
doi = {10.1016/0020-0190(90)90058-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AltmanL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArikatiR90,
author = {Srinivasa Rao Arikati and
C. Pandu Rangan},
title = {Linear Algorithm for Optimal Path Cover Problem on Interval Graphs},
journal = {Inf. Process. Lett.},
volume = {35},
number = {3},
pages = {149--153},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90064-5},
doi = {10.1016/0020-0190(90)90064-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArikatiR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BajajD90,
author = {Chandrajit L. Bajaj and
Tamal K. Dey},
title = {Polygon Nesting and Robustness},
journal = {Inf. Process. Lett.},
volume = {35},
number = {1},
pages = {23--32},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90169-X},
doi = {10.1016/0020-0190(90)90169-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BajajD90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarnardS90,
author = {David T. Barnard and
David B. Skillicorn},
title = {Pipelining Tree-Structured Algorithms on Simd Architectures},
journal = {Inf. Process. Lett.},
volume = {35},
number = {2},
pages = {79--84},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90110-J},
doi = {10.1016/0020-0190(90)90110-J},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BarnardS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlockW90,
author = {Kenneth Block and
Tai{-}Kuo Woo},
title = {A More Efficient Generalization of Petersons's Mutual Exclusion Algorithm},
journal = {Inf. Process. Lett.},
volume = {35},
number = {5},
pages = {219--222},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90048-3},
doi = {10.1016/0020-0190(90)90048-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BlockW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Boxer90,
author = {Laurence Boxer},
title = {Corrigenda: Common Intersections of Polygons},
journal = {Inf. Process. Lett.},
volume = {35},
number = {1},
pages = {53},
year = {1990},
timestamp = {Sun, 25 Nov 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Boxer90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangHT90,
author = {Maw{-}Shang Chang and
Nen{-}Fu Huang and
Chuan Yi Tang},
title = {An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and
Geographic Neighborhood Graphs},
journal = {Inf. Process. Lett.},
volume = {35},
number = {5},
pages = {255--260},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90054-2},
doi = {10.1016/0020-0190(90)90054-2},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangHT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chin90,
author = {Andrew Chin},
title = {On the Depth Complexity of the Counting Functions},
journal = {Inf. Process. Lett.},
volume = {35},
number = {6},
pages = {325--328},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90036-W},
doi = {10.1016/0020-0190(90)90036-W},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chin90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChingMS90,
author = {Yu{-}Tai Ching and
Kurt Mehlhorn and
Michiel H. M. Smid},
title = {Dynamic Deferred Data Structuring},
journal = {Inf. Process. Lett.},
volume = {35},
number = {1},
pages = {37--40},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90171-S},
doi = {10.1016/0020-0190(90)90171-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChingMS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cimikowski90,
author = {Robert J. Cimikowski},
title = {Finding Hamiltonian Cycles in Certain Planar Graphs},
journal = {Inf. Process. Lett.},
volume = {35},
number = {5},
pages = {249--254},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90053-Z},
doi = {10.1016/0020-0190(90)90053-Z},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cimikowski90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CrochemoreR90,
author = {Maxime Crochemore and
Wojciech Rytter},
title = {Parallel Construction of Minimal Suffix and Factor Automata},
journal = {Inf. Process. Lett.},
volume = {35},
number = {3},
pages = {121--128},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90060-B},
doi = {10.1016/0020-0190(90)90060-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CrochemoreR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Deng90,
author = {Xiaotie Deng},
title = {An Optimal Parallel Algorithm for Linear Programming in the Plane},
journal = {Inf. Process. Lett.},
volume = {35},
number = {4},
pages = {213--217},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90026-T},
doi = {10.1016/0020-0190(90)90026-T},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Deng90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DickersonD90,
author = {Matthew Dickerson and
Robert L. (Scot) Drysdale III},
title = {Fixed-Radius Near Neighbors Search Algorithms for Points and Segments},
journal = {Inf. Process. Lett.},
volume = {35},
number = {5},
pages = {269--273},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90056-4},
doi = {10.1016/0020-0190(90)90056-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DickersonD90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Francez90a,
author = {Nissim Francez},
title = {Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty
Interactions},
journal = {Inf. Process. Lett.},
volume = {35},
number = {5},
pages = {275},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90057-5},
doi = {10.1016/0020-0190(90)90057-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Francez90a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FungNTW90,
author = {Khun Yee Fung and
Tina M. Nicholl and
Robert Endre Tarjan and
Christopher J. Van Wyk},
title = {Simplified Linear-Time Jordan Sorting and Polygon Clipping},
journal = {Inf. Process. Lett.},
volume = {35},
number = {2},
pages = {85--92},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90111-A},
doi = {10.1016/0020-0190(90)90111-A},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FungNTW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GasterenT90,
author = {A. J. M. van Gasteren and
Gerard Tel},
title = {Comments on "On the Proof of a Distributed Algorithm": Always-Tru
is not Invariant},
journal = {Inf. Process. Lett.},
volume = {35},
number = {6},
pages = {277--279},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90027-U},
doi = {10.1016/0020-0190(90)90027-U},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GasterenT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoudaH90,
author = {Mohamed G. Gouda and
Ted Herman},
title = {Stabilizing Unison},
journal = {Inf. Process. Lett.},
volume = {35},
number = {4},
pages = {171--175},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90020-X},
doi = {10.1016/0020-0190(90)90020-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoudaH90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gradel90,
author = {Erich Gr{\"{a}}del},
title = {Simple Interpretations Among Complicated Theories},
journal = {Inf. Process. Lett.},
volume = {35},
number = {5},
pages = {235--238},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90051-X},
doi = {10.1016/0020-0190(90)90051-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gradel90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GriggMR90,
author = {Ken Grigg and
Serge Miguet and
Yves Robert},
title = {Symmetric Matrix-Vector Product on a Ring of Processors},
journal = {Inf. Process. Lett.},
volume = {35},
number = {5},
pages = {239--248},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90052-Y},
doi = {10.1016/0020-0190(90)90052-Y},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GriggMR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Guenther90,
author = {Grant R. Guenther},
title = {Efficient Expansion of Factored Expressions},
journal = {Inf. Process. Lett.},
volume = {35},
number = {2},
pages = {69--72},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90108-A},
doi = {10.1016/0020-0190(90)90108-A},
timestamp = {Sun, 17 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Guenther90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HellersteinKW90,
author = {Lisa Hellerstein and
Philip N. Klein and
Robert Wilber},
title = {On the Time-Space Complexity of Reachability Queries for Preprocessed
Graphs},
journal = {Inf. Process. Lett.},
volume = {35},
number = {5},
pages = {261--267},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90055-3},
doi = {10.1016/0020-0190(90)90055-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HellersteinKW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Herman90,
author = {Ted Herman},
title = {Probabilistic Self-Stabilization},
journal = {Inf. Process. Lett.},
volume = {35},
number = {2},
pages = {63--67},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90107-9},
doi = {10.1016/0020-0190(90)90107-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Herman90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/InverardiN90,
author = {Paola Inverardi and
Monica Nesi},
title = {A Rewriting Strategy to Verify Observational Congruence},
journal = {Inf. Process. Lett.},
volume = {35},
number = {4},
pages = {191--199},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90023-Q},
doi = {10.1016/0020-0190(90)90023-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/InverardiN90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jacob90a,
author = {Jeremy Jacob},
title = {A Model of Reconfiguration in Communicating Sequential Processes},
journal = {Inf. Process. Lett.},
volume = {35},
number = {1},
pages = {19--22},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90168-W},
doi = {10.1016/0020-0190(90)90168-W},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jacob90a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Karner90,
author = {Georg Karner},
title = {A Note on Terminal Balancing of Algebraic Systems},
journal = {Inf. Process. Lett.},
volume = {35},
number = {6},
pages = {291--293},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90030-2},
doi = {10.1016/0020-0190(90)90030-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Karner90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KumarIS90,
author = {Devendra Kumar and
S. Sitharama Iyengar and
Mohan B. Sharma},
title = {Corrigenda: Corrections to a Distributed Depth-First Search Algorithm},
journal = {Inf. Process. Lett.},
volume = {35},
number = {1},
pages = {55--56},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90175-W},
doi = {10.1016/0020-0190(90)90175-W},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KumarIS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kwiatkowska90,
author = {Marta Z. Kwiatkowska},
title = {A Metric for Traces},
journal = {Inf. Process. Lett.},
volume = {35},
number = {3},
pages = {129--135},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90061-2},
doi = {10.1016/0020-0190(90)90061-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kwiatkowska90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LambrichtsNPPT90,
author = {Erik Lambrichts and
Peter Nees and
Jan Paredaens and
Peter Peelman and
Letizia Tanca},
title = {Checking Functional Consistency in Deductive Databases},
journal = {Inf. Process. Lett.},
volume = {35},
number = {3},
pages = {115--120},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90059-7},
doi = {10.1016/0020-0190(90)90059-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LambrichtsNPPT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Launchbury90,
author = {John Launchbury},
title = {Strictness Analysis Aids Inductive Proofs},
journal = {Inf. Process. Lett.},
volume = {35},
number = {3},
pages = {155--159},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90065-6},
doi = {10.1016/0020-0190(90)90065-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Launchbury90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lin90,
author = {Chau{-}Jy Lin},
title = {Parallel Algorithm for Generating Permutations on Linear Array},
journal = {Inf. Process. Lett.},
volume = {35},
number = {4},
pages = {167--170},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90019-T},
doi = {10.1016/0020-0190(90)90019-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lin90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LodiLP90,
author = {Elena Lodi and
Fabrizio Luccio and
Linda Pagli},
title = {Routing in Times Square Mode},
journal = {Inf. Process. Lett.},
volume = {35},
number = {1},
pages = {41--48},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90172-T},
doi = {10.1016/0020-0190(90)90172-T},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LodiLP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LouiS90,
author = {Michael C. Loui and
Milind A. Sohoni},
title = {An Algorithm for Load Balancing in Multiprocessor Systems},
journal = {Inf. Process. Lett.},
volume = {35},
number = {5},
pages = {223--228},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90049-4},
doi = {10.1016/0020-0190(90)90049-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LouiS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lubiw90,
author = {Anna Lubiw},
title = {Counterexample to a Conjecture of Szymanski on Hypercube Routing},
journal = {Inf. Process. Lett.},
volume = {35},
number = {2},
pages = {57--61},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90106-8},
doi = {10.1016/0020-0190(90)90106-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lubiw90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Maes90,
author = {Maurice Maes},
title = {On a Cyclic String-To-String Correction Problem},
journal = {Inf. Process. Lett.},
volume = {35},
number = {2},
pages = {73--78},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90109-B},
doi = {10.1016/0020-0190(90)90109-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Maes90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ManacherMS90,
author = {Glenn K. Manacher and
Terrance A. Mankus and
Carol Joan Smith},
title = {An Optimum Theta (n log n) Algorithm for Finding a Canonical Hamiltonian
Path and a Canonical Hamiltonian Circuit in a Set of Intervals},
journal = {Inf. Process. Lett.},
volume = {35},
number = {4},
pages = {205--211},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90025-S},
doi = {10.1016/0020-0190(90)90025-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ManacherMS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MehlhornN90,
author = {Kurt Mehlhorn and
Stefan N{\"{a}}her},
title = {Bounded Ordered Dictionaries in O(log log {N)} Time and O(n) Space},
journal = {Inf. Process. Lett.},
volume = {35},
number = {4},
pages = {183--189},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90022-P},
doi = {10.1016/0020-0190(90)90022-P},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MehlhornN90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MehlhornNU90,
author = {Kurt Mehlhorn and
Stefan N{\"{a}}her and
Christian Uhrig},
title = {Hidden Line Elimination for Isooriented Rectangels},
journal = {Inf. Process. Lett.},
volume = {35},
number = {3},
pages = {137--143},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90062-3},
doi = {10.1016/0020-0190(90)90062-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MehlhornNU90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mostowski90,
author = {Andrzej Wlodzimierz Mostowski},
title = {Alternating Automata with Start Formulas},
journal = {Inf. Process. Lett.},
volume = {35},
number = {6},
pages = {287--290},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90029-W},
doi = {10.1016/0020-0190(90)90029-W},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mostowski90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Piotrowski90,
author = {Jerzy A. Piotrowski},
title = {A Functional Model of a Simplified Sequential Machine},
journal = {Inf. Process. Lett.},
volume = {35},
number = {3},
pages = {161--166},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90066-7},
doi = {10.1016/0020-0190(90)90066-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Piotrowski90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rubinfeld90,
author = {Ronitt Rubinfeld},
title = {The Cover Time of a Regular Expander is O(n log n)},
journal = {Inf. Process. Lett.},
volume = {35},
number = {1},
pages = {49--51},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90173-U},
doi = {10.1016/0020-0190(90)90173-U},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rubinfeld90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SheuT90,
author = {Jang{-}Ping Sheu and
Jyh{-}Shyan Tang},
title = {Efficient Parallel k Selection Algorithm},
journal = {Inf. Process. Lett.},
volume = {35},
number = {6},
pages = {313--316},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90034-U},
doi = {10.1016/0020-0190(90)90034-U},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SheuT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShmoysW90,
author = {David B. Shmoys and
David P. Williamson},
title = {Analyzing the Held-Karp {TSP} Bound: {A} Monotonicity Property with
Application},
journal = {Inf. Process. Lett.},
volume = {35},
number = {6},
pages = {281--285},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90028-V},
doi = {10.1016/0020-0190(90)90028-V},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShmoysW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sideri90,
author = {Martha Sideri},
title = {On Attribute Grammars Without Atribute Synthesis},
journal = {Inf. Process. Lett.},
volume = {35},
number = {2},
pages = {103--109},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90114-D},
doi = {10.1016/0020-0190(90)90114-D},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sideri90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SiromoneyM90,
author = {Rani Siromoney and
Lisa Mathew},
title = {A Public Key Cryptosystem Based on Lyndon Words},
journal = {Inf. Process. Lett.},
volume = {35},
number = {1},
pages = {33--36},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90170-3},
doi = {10.1016/0020-0190(90)90170-3},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SiromoneyM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Toda90,
author = {Seinosuke Toda},
title = {On the Complexity of Topological Sorting},
journal = {Inf. Process. Lett.},
volume = {35},
number = {5},
pages = {229--233},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90050-8},
doi = {10.1016/0020-0190(90)90050-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Toda90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vardi90,
author = {Moshe Y. Vardi},
title = {Endmarkers can Make a Difference},
journal = {Inf. Process. Lett.},
volume = {35},
number = {3},
pages = {145--148},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90063-4},
doi = {10.1016/0020-0190(90)90063-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vardi90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wand90,
author = {Mitchell Wand},
title = {A Short Proof of the Lexical Addressing Algorithm},
journal = {Inf. Process. Lett.},
volume = {35},
number = {1},
pages = {1--5},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90165-T},
doi = {10.1016/0020-0190(90)90165-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wand90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wang90,
author = {Ching{-}Lin Wang},
title = {Obtaining Lazy Evaluation with Continuations in Scheme},
journal = {Inf. Process. Lett.},
volume = {35},
number = {2},
pages = {93--97},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90112-B},
doi = {10.1016/0020-0190(90)90112-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wang90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wegener90,
author = {Ingo Wegener},
title = {Efficient Simulation of Circuits by Erew Prams},
journal = {Inf. Process. Lett.},
volume = {35},
number = {2},
pages = {99--102},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90113-C},
doi = {10.1016/0020-0190(90)90113-C},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wegener90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuMMM90,
author = {Sun Wu and
Udi Manber and
Gene Myers and
Webb Miller},
title = {An {O(NP)} Sequence Comparison Algorithm},
journal = {Inf. Process. Lett.},
volume = {35},
number = {6},
pages = {317--323},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90035-V},
doi = {10.1016/0020-0190(90)90035-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuMMM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuWT90,
author = {Chwan{-}Hwa John Wu and
Chia{-}Jiu Wang and
Heng{-}Ming Tai},
title = {Application of Exponential Hetero-Associative Memory on Frequency
Classifier},
journal = {Inf. Process. Lett.},
volume = {35},
number = {6},
pages = {305--311},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90033-T},
doi = {10.1016/0020-0190(90)90033-T},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WuWT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YenL90,
author = {Chain{-}Chin Yen and
Richard C. T. Lee},
title = {The Weighted Perfect Domination Problem},
journal = {Inf. Process. Lett.},
volume = {35},
number = {6},
pages = {295--299},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90031-R},
doi = {10.1016/0020-0190(90)90031-R},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YenL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yuan90,
author = {Shyan{-}Ming Yuan},
title = {The Communication Complexity for Decentralized Evaluation of Functions},
journal = {Inf. Process. Lett.},
volume = {35},
number = {4},
pages = {177--182},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90021-O},
doi = {10.1016/0020-0190(90)90021-O},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yuan90.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-29 11:47 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:
