Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/ipl/ipl25.bht:"
@article{DBLP:journals/ipl/AlexandridisT87, author = {Nikitas A. Alexandridis and P. D. Tsanakas}, title = {An Encoding Scheme for the Efficient Representation of Hierarchical Structures}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {199--206}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90133-5}, doi = {10.1016/0020-0190(87)90133-5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AlexandridisT87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Apostolico87, author = {Alberto Apostolico}, title = {Remark on the Hsu-Du New Algorithm for the Longest Common Subsequence Problem}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {235--236}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90167-0}, doi = {10.1016/0020-0190(87)90167-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Apostolico87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Appel87, author = {Andrew W. Appel}, title = {Garbage Collection can be Faster than Stack Allocation}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {275--279}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90175-X}, doi = {10.1016/0020-0190(87)90175-X}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Appel87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AtallahB87, author = {Mikhail J. Atallah and Chandrajit L. Bajaj}, title = {Efficient Algorithms for Common Transversals}, journal = {Inf. Process. Lett.}, volume = {25}, number = {2}, pages = {87--91}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90226-2}, doi = {10.1016/0020-0190(87)90226-2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AtallahB87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AutebertFG87, author = {Jean{-}Michel Autebert and Philippe Flajolet and Joaquim Gabarr{\'{o}}}, title = {Prefixes of Infinite Words and Ambiguous Context-Free Languages}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {211--216}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90162-1}, doi = {10.1016/0020-0190(87)90162-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AutebertFG87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Babaoglu87, author = {{\"{O}}zalp Babaoglu}, title = {Stopping Times of Distributed Consensus Protocols: {A} Probabilistic Analysis}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {163--169}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90127-X}, doi = {10.1016/0020-0190(87)90127-X}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Babaoglu87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Baeza-Yates87, author = {Ricardo A. Baeza{-}Yates}, title = {Some Average Measures in m-ary Search Trees}, journal = {Inf. Process. Lett.}, volume = {25}, number = {6}, pages = {375--382}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90215-8}, doi = {10.1016/0020-0190(87)90215-8}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Baeza-Yates87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BhattC87, author = {Sandeep N. Bhatt and Stavros S. Cosmadakis}, title = {The Complexity of Minimizing Wire Lengths in {VLSI} Layouts}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {263--267}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90173-6}, doi = {10.1016/0020-0190(87)90173-6}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BhattC87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BoppanaHZ87, author = {Ravi B. Boppana and Johan H{\aa}stad and Stathis Zachos}, title = {Does co-NP Have Short Interactive Proofs?}, journal = {Inf. Process. Lett.}, volume = {25}, number = {2}, pages = {127--132}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90232-8}, doi = {10.1016/0020-0190(87)90232-8}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/BoppanaHZ87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Broy87, author = {Manfred Broy}, title = {Predicative Specifications for Functional Programs Describing Communication Networks}, journal = {Inf. Process. Lett.}, volume = {25}, number = {2}, pages = {93--101}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90227-4}, doi = {10.1016/0020-0190(87)90227-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Broy87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BrustmannW87, author = {Bettina Brustmann and Ingo Wegener}, title = {The Complexity of Symmetric Functions in Bounded-Depth Circuits}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {217--219}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90163-3}, doi = {10.1016/0020-0190(87)90163-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BrustmannW87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Buda87, author = {Anatoliy O. Buda}, title = {Multiprocessor Automata}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {257--261}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90172-4}, doi = {10.1016/0020-0190(87)90172-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Buda87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Calude87, author = {Cristian Calude}, title = {Super-Exponentials Nonprimitive Recursive, but Rudimentary}, journal = {Inf. Process. Lett.}, volume = {25}, number = {5}, pages = {311--316}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90205-5}, doi = {10.1016/0020-0190(87)90205-5}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Calude87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChangIRB87, author = {Jik H. Chang and Oscar H. Ibarra and Bala Ravikumar and Leonard Berman}, title = {Some Observations Concerning Alternating Turing Machines Using Small Space}, journal = {Inf. Process. Lett.}, volume = {25}, number = {1}, pages = {1--9}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90085-8}, doi = {10.1016/0020-0190(87)90085-8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChangIRB87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChungC87, author = {Tae{-}Choong Chung and Jung Wan Cho}, title = {History Sensitive String for Multiple Alphabets}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {183--188}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90130-X}, doi = {10.1016/0020-0190(87)90130-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChungC87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CybenkoKV87, author = {George Cybenko and David W. Krumme and K. N. Venkataraman}, title = {Fixed Hypercube Embedding}, journal = {Inf. Process. Lett.}, volume = {25}, number = {1}, pages = {35--39}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90090-1}, doi = {10.1016/0020-0190(87)90090-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CybenkoKV87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Dillencourt87a, author = {Michael B. Dillencourt}, title = {A Non-Hamiltonian, Nondegenerate Delaunay Triangulation}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {149--151}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90124-4}, doi = {10.1016/0020-0190(87)90124-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Dillencourt87a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FischerI87, author = {Michael J. Fischer and Neil Immerman}, title = {Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {175--181}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90129-3}, doi = {10.1016/0020-0190(87)90129-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FischerI87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FriedbergP87, author = {Stuart A. Friedberg and Gary L. Peterson}, title = {An Efficient Solution to the Mutual Exclusion Problem Using Weak Semaphores}, journal = {Inf. Process. Lett.}, volume = {25}, number = {5}, pages = {343--348}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90210-9}, doi = {10.1016/0020-0190(87)90210-9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FriedbergP87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FriesMNT87, author = {Otfried Fries and Kurt Mehlhorn and Stefan N{\"{a}}her and Athanasios K. Tsakalidis}, title = {A log log n Data Structure for Three-Sided Range Queries}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {269--273}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90174-8}, doi = {10.1016/0020-0190(87)90174-8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FriesMNT87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Frieze87, author = {Alan M. Frieze}, title = {Parallel Algorithms for Finding Hamilton Cycles in Random Graphs}, journal = {Inf. Process. Lett.}, volume = {25}, number = {2}, pages = {111--117}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90229-8}, doi = {10.1016/0020-0190(87)90229-8}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Frieze87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GoldbergP87, author = {Andrew V. Goldberg and Serge A. Plotkin}, title = {Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {241--245}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90169-4}, doi = {10.1016/0020-0190(87)90169-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/GoldbergP87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Gries87, author = {David Gries}, title = {A Note on Graham's Convex Hull Algorithm}, journal = {Inf. Process. Lett.}, volume = {25}, number = {5}, pages = {323--328}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90207-9}, doi = {10.1016/0020-0190(87)90207-9}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Gries87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GriesPS87, author = {David Gries and Adriano Pascoletti and Luigi Sbriz}, title = {Horner's Rule and the Computation of Linear Recurrences}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {237--240}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90168-2}, doi = {10.1016/0020-0190(87)90168-2}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/GriesPS87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Hamlet87, author = {Richard G. Hamlet}, title = {Probable Correctness Theory}, journal = {Inf. Process. Lett.}, volume = {25}, number = {1}, pages = {17--25}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90088-3}, doi = {10.1016/0020-0190(87)90088-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Hamlet87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HoareHS87, author = {C. A. R. Hoare and Jifeng He and Jeff W. Sanders}, title = {Prespecification in Data Refinement}, journal = {Inf. Process. Lett.}, volume = {25}, number = {2}, pages = {71--76}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90224-9}, doi = {10.1016/0020-0190(87)90224-9}, timestamp = {Mon, 21 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/HoareHS87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HowellRY87, author = {Rodney R. Howell and Louis E. Rosier and Hsu{-}Chun Yen}, title = {An O(n(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems}, journal = {Inf. Process. Lett.}, volume = {25}, number = {1}, pages = {27--33}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90089-5}, doi = {10.1016/0020-0190(87)90089-5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HowellRY87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HyslopL87, author = {Gary A. Hyslop and Edmund A. Lamagna}, title = {Performance of Distributive Partitioned Sort in a Demand Paging Environment}, journal = {Inf. Process. Lett.}, volume = {25}, number = {1}, pages = {61--64}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90094-9}, doi = {10.1016/0020-0190(87)90094-9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HyslopL87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Jedrzejowicz87, author = {Joanna Jedrzejowicz}, title = {Nesting of Shuffle Closure is Important}, journal = {Inf. Process. Lett.}, volume = {25}, number = {6}, pages = {363--368}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90213-4}, doi = {10.1016/0020-0190(87)90213-4}, timestamp = {Fri, 27 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Jedrzejowicz87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KatajainenNT87, author = {Jyrki Katajainen and Olli Nevalainen and Jukka Teuhola}, title = {A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs}, journal = {Inf. Process. Lett.}, volume = {25}, number = {2}, pages = {77--86}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90225-0}, doi = {10.1016/0020-0190(87)90225-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KatajainenNT87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Kawai87, author = {Satoru Kawai}, title = {Local Authentication in Insecure Environments}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {171--174}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90128-1}, doi = {10.1016/0020-0190(87)90128-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Kawai87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Kelter87, author = {Udo Kelter}, title = {The Complexity of Strict Serializability Revisited}, journal = {Inf. Process. Lett.}, volume = {25}, number = {6}, pages = {407--412}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90220-1}, doi = {10.1016/0020-0190(87)90220-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Kelter87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Kemp87, author = {Rainer Kemp}, title = {A Note on the Number of Leftist Trees}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {227--232}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90165-7}, doi = {10.1016/0020-0190(87)90165-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Kemp87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KirsigL87, author = {Bernd Kirsig and Klaus{-}J{\"{o}}rn Lange}, title = {Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n)}, journal = {Inf. Process. Lett.}, volume = {25}, number = {1}, pages = {13--15}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90087-1}, doi = {10.1016/0020-0190(87)90087-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KirsigL87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Klapper87, author = {Andrew Klapper}, title = {A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {159--161}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90126-8}, doi = {10.1016/0020-0190(87)90126-8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Klapper87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Kobuchi87, author = {Youichi Kobuchi}, title = {A Note on Symmetrical Cellular Spaces}, journal = {Inf. Process. Lett.}, volume = {25}, number = {6}, pages = {413--416}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90221-3}, doi = {10.1016/0020-0190(87)90221-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Kobuchi87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KrauseLV87, author = {Kadri Krause and Lawrence L. Larmore and Dennis J. Volper}, title = {Packing Items from a Triangular Distribution}, journal = {Inf. Process. Lett.}, volume = {25}, number = {6}, pages = {351--362}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90212-2}, doi = {10.1016/0020-0190(87)90212-2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KrauseLV87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KundeS87, author = {Manfred Kunde and Horst Steppat}, title = {On the Worst-Case Ratio of a Compound Multiprocessor Scheduling Algorithm}, journal = {Inf. Process. Lett.}, volume = {25}, number = {6}, pages = {389--396}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90217-1}, doi = {10.1016/0020-0190(87)90217-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KundeS87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LaiY87, author = {Ten{-}Hwang Lai and Tao H. Yang}, title = {On Distributed Snapshots}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {153--158}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90125-6}, doi = {10.1016/0020-0190(87)90125-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LaiY87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LakshmananMT87, author = {K. B. Lakshmanan and N. Meenakshi and Krishnaiyan Thulasiraman}, title = {A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search}, journal = {Inf. Process. Lett.}, volume = {25}, number = {2}, pages = {103--109}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90228-6}, doi = {10.1016/0020-0190(87)90228-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LakshmananMT87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Laumond87, author = {Jean{-}Paul Laumond}, title = {Obstacle Growing in a Nonpolygonal World}, journal = {Inf. Process. Lett.}, volume = {25}, number = {1}, pages = {41--50}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90091-3}, doi = {10.1016/0020-0190(87)90091-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Laumond87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Levcopoulos87, author = {Christos Levcopoulos}, title = {An {\textbackslash}Omega({\textbackslash}sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {247--251}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90170-0}, doi = {10.1016/0020-0190(87)90170-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Levcopoulos87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Maley87, author = {F. Miller Maley}, title = {An Observation Concerning Constraint-Based Compaction}, journal = {Inf. Process. Lett.}, volume = {25}, number = {2}, pages = {119--122}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90230-4}, doi = {10.1016/0020-0190(87)90230-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Maley87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Martinek87, author = {Jerzy R. Nawrocki and J. Martinek}, title = {A Storage Allocation Method with Invalidating Dangling References}, journal = {Inf. Process. Lett.}, volume = {25}, number = {5}, pages = {305--310}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90204-3}, doi = {10.1016/0020-0190(87)90204-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Martinek87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Melkman87, author = {Avraham A. Melkman}, title = {On-Line Construction of the Convex Hull of a Simple Polyline}, journal = {Inf. Process. Lett.}, volume = {25}, number = {1}, pages = {11--12}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90086-X}, doi = {10.1016/0020-0190(87)90086-X}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Melkman87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MintsT87, author = {Grigori Mints and Enn Tyugu}, title = {Corrigendum: Semantics of a Declarative Language}, journal = {Inf. Process. Lett.}, volume = {25}, number = {2}, pages = {139}, year = {1987}, timestamp = {Thu, 20 Nov 2003 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/MintsT87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Moran87, author = {Shlomo Moran}, title = {Generalized Lower Bounds Derived from Hastad's Main Lemma}, journal = {Inf. Process. Lett.}, volume = {25}, number = {6}, pages = {383--388}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90216-X}, doi = {10.1016/0020-0190(87)90216-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Moran87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Morris87, author = {Joseph M. Morris}, title = {Varieties of Weakest Liberal Preconditions}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {207--210}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90134-7}, doi = {10.1016/0020-0190(87)90134-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Morris87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Naor87, author = {Joseph Naor}, title = {A Fast Parallel Coloring of Planar Graphs with Five Colors}, journal = {Inf. Process. Lett.}, volume = {25}, number = {1}, pages = {51--53}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90092-5}, doi = {10.1016/0020-0190(87)90092-5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Naor87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Ochmanski87, author = {Edward Ochmanski}, title = {Inevitability in Concurrent Systems}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {221--225}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90164-5}, doi = {10.1016/0020-0190(87)90164-5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Ochmanski87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Pallo87, author = {Jean Marcel Pallo}, title = {On the Rotation Distance in the Lattice of Binary Trees}, journal = {Inf. Process. Lett.}, volume = {25}, number = {6}, pages = {369--374}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90214-6}, doi = {10.1016/0020-0190(87)90214-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Pallo87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Peper87, author = {F. Peper}, title = {Determining Connected Components in Linear Time by a linear Number of Processors}, journal = {Inf. Process. Lett.}, volume = {25}, number = {6}, pages = {401--406}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90219-5}, doi = {10.1016/0020-0190(87)90219-5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Peper87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/RaghavanV87, author = {Vijay Raghavan and Shankar M. Venkatesan}, title = {On Bounds for a Board Covering Problem}, journal = {Inf. Process. Lett.}, volume = {25}, number = {5}, pages = {281--284}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90201-8}, doi = {10.1016/0020-0190(87)90201-8}, timestamp = {Thu, 29 Mar 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/RaghavanV87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/RaviH87, author = {S. S. Ravi and Harry B. Hunt III}, title = {An Application of the Planar Separator Theorem to Counting Problems}, journal = {Inf. Process. Lett.}, volume = {25}, number = {5}, pages = {317--322}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90206-7}, doi = {10.1016/0020-0190(87)90206-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/RaviH87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Rayward-Smith87, author = {Victor J. Rayward{-}Smith}, title = {The Complexity of Preemptive Scheduling Given Interprocessor Communication Delays}, journal = {Inf. Process. Lett.}, volume = {25}, number = {2}, pages = {123--125}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90231-6}, doi = {10.1016/0020-0190(87)90231-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Rayward-Smith87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Reichling87, author = {Matthias Reichling}, title = {A Simplified Solution of the n Queens Problem}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {253--255}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90171-2}, doi = {10.1016/0020-0190(87)90171-2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Reichling87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Reif87, author = {John H. Reif}, title = {A Topological Approach to Dynamic Graph Connectivity}, journal = {Inf. Process. Lett.}, volume = {25}, number = {1}, pages = {65--70}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90095-0}, doi = {10.1016/0020-0190(87)90095-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Reif87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/SaloweS87, author = {Jeffrey S. Salowe and William L. Steiger}, title = {Stable Unmerging in Linear Time and Constant Space}, journal = {Inf. Process. Lett.}, volume = {25}, number = {5}, pages = {285--294}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90202-X}, doi = {10.1016/0020-0190(87)90202-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/SaloweS87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/SurosM87, author = {Rina Suros and Eur{\'{\i}}pides Montagne}, title = {Fitted Diagonals for Reducing {I/O} Bandwidth in Systolic Systems}, journal = {Inf. Process. Lett.}, volume = {25}, number = {5}, pages = {335--342}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90209-2}, doi = {10.1016/0020-0190(87)90209-2}, timestamp = {Fri, 14 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/SurosM87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Tennent87a, author = {Robert D. Tennent}, title = {Quantification in Algol-Like Languages}, journal = {Inf. Process. Lett.}, volume = {25}, number = {2}, pages = {133--137}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90233-X}, doi = {10.1016/0020-0190(87)90233-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Tennent87a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Toyama87, author = {Yoshihito Toyama}, title = {Counterexamples to Termination for the Direct Sum of Term Rewriting Systems}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {141--143}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90122-0}, doi = {10.1016/0020-0190(87)90122-0}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Toyama87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Tse87, author = {T. H. Tse}, title = {On the Detection of Unstructuredness in Flowgraphs}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {189--193}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90131-1}, doi = {10.1016/0020-0190(87)90131-1}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Tse87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/VenkateshRL87, author = {K. Venkatesh and Thiruvengadam Radhakrishnan and Hon Fung Li}, title = {Optimal Checkpointing and Local Recording for Domino-Free Rollback Recovery}, journal = {Inf. Process. Lett.}, volume = {25}, number = {5}, pages = {295--304}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90203-1}, doi = {10.1016/0020-0190(87)90203-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/VenkateshRL87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Verjus87, author = {Jean{-}Pierre Verjus}, title = {On the Proof of a Distributed Algorithm}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {145--147}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90123-2}, doi = {10.1016/0020-0190(87)90123-2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Verjus87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Vrto87, author = {Imrich Vrto}, title = {The Area-Time Complexity of the {VLSI} Counter}, journal = {Inf. Process. Lett.}, volume = {25}, number = {6}, pages = {397--400}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90218-3}, doi = {10.1016/0020-0190(87)90218-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Vrto87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/WangT87, author = {Cao An Wang and Yung H. Tsin}, title = {An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane}, journal = {Inf. Process. Lett.}, volume = {25}, number = {1}, pages = {55--60}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90093-7}, doi = {10.1016/0020-0190(87)90093-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/WangT87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Wiltink87, author = {J. G. Wiltink}, title = {A Deficiency of Natural Deduction}, journal = {Inf. Process. Lett.}, volume = {25}, number = {4}, pages = {233--234}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90166-9}, doi = {10.1016/0020-0190(87)90166-9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Wiltink87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ZhuC87, author = {Yun{-}zhou Zhu and To{-}Yat Cheung}, title = {A New Distributed Breadth-First-Search Algorithm}, journal = {Inf. Process. Lett.}, volume = {25}, number = {5}, pages = {329--334}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90208-0}, doi = {10.1016/0020-0190(87)90208-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ZhuC87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Zobel87, author = {Dieter Z{\"{o}}bel}, title = {Transformations for Communication Fairness in {CSP}}, journal = {Inf. Process. Lett.}, volume = {25}, number = {3}, pages = {195--198}, year = {1987}, url = {https://doi.org/10.1016/0020-0190(87)90132-3}, doi = {10.1016/0020-0190(87)90132-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Zobel87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.