Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/ipl/ipl59.bht:"
@article{DBLP:journals/ipl/AgostinoS96, author = {Sergio De Agostino and James A. Storer}, title = {On-Line Versus Off-Line Computation in Dynamic Text Compression}, journal = {Inf. Process. Lett.}, volume = {59}, number = {3}, pages = {169--174}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00068-3}, doi = {10.1016/0020-0190(96)00068-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AgostinoS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AlonBF96, author = {Noga Alon and Phillip G. Bradford and Rudolf Fleischer}, title = {Matching Nuts and Bolts Faster}, journal = {Inf. Process. Lett.}, volume = {59}, number = {3}, pages = {123--127}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00104-4}, doi = {10.1016/0020-0190(96)00104-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AlonBF96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AlstrupCJ96, author = {Stephen Alstrup and Jens Clausen and Kristian J{\o}rgensen}, title = {An O({\(\vert\)}V{\(\vert\)}*{\(\vert\)}E{\(\vert\)}) Algorithm for Finding Immediate Multiple-Vertex Dominators}, journal = {Inf. Process. Lett.}, volume = {59}, number = {1}, pages = {9--11}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00085-3}, doi = {10.1016/0020-0190(96)00085-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AlstrupCJ96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Alsuwaiyel96, author = {Muhammad H. Alsuwaiyel}, title = {Finding a Shortest Hamiltonian Path Inside a Simple Polygon}, journal = {Inf. Process. Lett.}, volume = {59}, number = {4}, pages = {207--210}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00103-2}, doi = {10.1016/0020-0190(96)00103-2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Alsuwaiyel96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AranhaR96, author = {Rohan F. M. Aranha and C. Pandu Rangan}, title = {An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph}, journal = {Inf. Process. Lett.}, volume = {59}, number = {3}, pages = {145--150}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00102-0}, doi = {10.1016/0020-0190(96)00102-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AranhaR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AthithanR96, author = {G. Athithan and T. Sony Roy}, title = {Hyperspherical Neighbourhoods and Pattern Recognition Using Neural Networks}, journal = {Inf. Process. Lett.}, volume = {59}, number = {4}, pages = {223--228}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00086-5}, doi = {10.1016/0020-0190(96)00086-5}, timestamp = {Fri, 11 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AthithanR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Baeza-YatesF96, author = {Ricardo A. Baeza{-}Yates and Luis O. Fuentes}, title = {A Framework to Animate String Algorithms}, journal = {Inf. Process. Lett.}, volume = {59}, number = {5}, pages = {241--244}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00117-2}, doi = {10.1016/0020-0190(96)00117-2}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Baeza-YatesF96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Baeza-YatesP96, author = {Ricardo A. Baeza{-}Yates and Chris H. Perleberg}, title = {Fast and Practical Approximate String Matching}, journal = {Inf. Process. Lett.}, volume = {59}, number = {1}, pages = {21--27}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00083-X}, doi = {10.1016/0020-0190(96)00083-X}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Baeza-YatesP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BaierM96, author = {Christel Baier and Mila E. Majster{-}Cederbaum}, title = {Denotational Linear Time Semantics and Sequential Composition}, journal = {Inf. Process. Lett.}, volume = {59}, number = {3}, pages = {135--143}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00101-9}, doi = {10.1016/0020-0190(96)00101-9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BaierM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Barrera96, author = {Antonio Hern{\'{a}}ndez{-}Barrera}, title = {Algorithms for Deciding the Containment of Polygons}, journal = {Inf. Process. Lett.}, volume = {59}, number = {5}, pages = {261--265}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(09)60016-8}, doi = {10.1016/0020-0190(09)60016-8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Barrera96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Barth96, author = {Dominique Barth}, title = {Optimal Broadcasting in the Back to Back d-ary Trees}, journal = {Inf. Process. Lett.}, volume = {59}, number = {2}, pages = {85--89}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00071-3}, doi = {10.1016/0020-0190(96)00071-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Barth96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Bernasconi96, author = {Anna Bernasconi}, title = {Sensitivity vs. Block Sensitivity (an Average-Case Study)}, journal = {Inf. Process. Lett.}, volume = {59}, number = {3}, pages = {151--157}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00105-6}, doi = {10.1016/0020-0190(96)00105-6}, timestamp = {Sat, 23 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Bernasconi96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BolligLW96, author = {Beate Bollig and Martin L{\"{o}}bbing and Ingo Wegener}, title = {On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams}, journal = {Inf. Process. Lett.}, volume = {59}, number = {5}, pages = {233--239}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00119-6}, doi = {10.1016/0020-0190(96)00119-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BolligLW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BorchertL96, author = {Bernd Borchert and Antoni Lozano}, title = {Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept}, journal = {Inf. Process. Lett.}, volume = {59}, number = {4}, pages = {211--215}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00096-8}, doi = {10.1016/0020-0190(96)00096-8}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BorchertL96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Bshouty96, author = {Nader H. Bshouty}, title = {A Subexponential Exact Learning Algorithm for {DNF} Using Equivalence Queries}, journal = {Inf. Process. Lett.}, volume = {59}, number = {1}, pages = {37--39}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00077-4}, doi = {10.1016/0020-0190(96)00077-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Bshouty96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChungM96, author = {Soon Myoung Chung and Pyeong S. Mah}, title = {Semantics-Based Transaction Management for Multidatabase Systems}, journal = {Inf. Process. Lett.}, volume = {59}, number = {2}, pages = {109--115}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00098-1}, doi = {10.1016/0020-0190(96)00098-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChungM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CzumajDP96, author = {Artur Czumaj and Krzysztof Diks and Teresa M. Przytycka}, title = {Parallel Maximum Independent Set in Convex Bipartite Graphs}, journal = {Inf. Process. Lett.}, volume = {59}, number = {6}, pages = {289--294}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00131-7}, doi = {10.1016/0020-0190(96)00131-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CzumajDP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DeinekoW96, author = {Vladimir G. Deineko and Gerhard J. Woeginger}, title = {The Convex-Hull-and-k-Line Travelling Salesman Problem}, journal = {Inf. Process. Lett.}, volume = {59}, number = {6}, pages = {295--301}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00125-1}, doi = {10.1016/0020-0190(96)00125-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/DeinekoW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DuntenJS96, author = {Brian Dunten and Julie Jones and Jonathan Sorenson}, title = {A Space-Efficient Fast Prime Number Sieve}, journal = {Inf. Process. Lett.}, volume = {59}, number = {2}, pages = {79--84}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00099-3}, doi = {10.1016/0020-0190(96)00099-3}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/DuntenJS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Fujito96, author = {Toshihiro Fujito}, title = {A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach}, journal = {Inf. Process. Lett.}, volume = {59}, number = {2}, pages = {59--63}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00094-4}, doi = {10.1016/0020-0190(96)00094-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Fujito96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GhoshG96, author = {Sukumar Ghosh and Arobinda Gupta}, title = {An Exercise in Fault-Containment: Self-Stabilizing Leader Election}, journal = {Inf. Process. Lett.}, volume = {59}, number = {5}, pages = {281--288}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00121-4}, doi = {10.1016/0020-0190(96)00121-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/GhoshG96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GlaisterS96, author = {Ian Glaister and Jeffrey O. Shallit}, title = {A Lower Bound Technique for the Size of Nondeterministic Finite Automata}, journal = {Inf. Process. Lett.}, volume = {59}, number = {2}, pages = {75--77}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00095-6}, doi = {10.1016/0020-0190(96)00095-6}, timestamp = {Mon, 09 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/GlaisterS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GoltzW96, author = {Ursula Goltz and Heike Wehrheim}, title = {Modelling Causality via Action Dependencies in Branching Time Semantics}, journal = {Inf. Process. Lett.}, volume = {59}, number = {4}, pages = {179--184}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00111-1}, doi = {10.1016/0020-0190(96)00111-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/GoltzW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HenzingerW96, author = {Monika Rauch Henzinger and David P. Williamson}, title = {On the Number of Small Cuts in a Graph}, journal = {Inf. Process. Lett.}, volume = {59}, number = {1}, pages = {41--44}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00079-8}, doi = {10.1016/0020-0190(96)00079-8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HenzingerW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HoWJ96, author = {Ting{-}Yem Ho and Yue{-}Li Wang and Ming{-}Tsan Juan}, title = {A Linear Time Algorithm for Finding all Hinge Vertices of a Permutation Graph}, journal = {Inf. Process. Lett.}, volume = {59}, number = {2}, pages = {103--107}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00092-0}, doi = {10.1016/0020-0190(96)00092-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HoWJ96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HolsztynskiK96, author = {Wlodzimierz Holsztynski and Waldemar W. Koczkodaj}, title = {Convergence of Inconsistency Algorithms for the Pairwise Comparisons}, journal = {Inf. Process. Lett.}, volume = {59}, number = {4}, pages = {197--202}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00113-5}, doi = {10.1016/0020-0190(96)00113-5}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HolsztynskiK96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HowardV96, author = {Paul G. Howard and Jeffrey Scott Vitter}, title = {Parallel Lossless Image Compression Using Huffman and Arithmetic Coding}, journal = {Inf. Process. Lett.}, volume = {59}, number = {2}, pages = {65--73}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00090-7}, doi = {10.1016/0020-0190(96)00090-7}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/HowardV96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/IvkovicL96, author = {Zoran Ivkovic and Errol L. Lloyd}, title = {A Fundamental Restriction on Fully Dynamic Maintenance of Bin Packing}, journal = {Inf. Process. Lett.}, volume = {59}, number = {4}, pages = {229--232}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00112-3}, doi = {10.1016/0020-0190(96)00112-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/IvkovicL96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KuoH96, author = {Yu{-}Chen Kuo and Shing{-}Tsaan Huang}, title = {A Simple Scheme to Construct k-Coteries with O(sqrt(N)) Uniform Quorum Sizes}, journal = {Inf. Process. Lett.}, volume = {59}, number = {1}, pages = {31--36}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00089-0}, doi = {10.1016/0020-0190(96)00089-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KuoH96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MadanlalVR96, author = {M. S. Madanlal and G. Venkatesan and C. Pandu Rangan}, title = {Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs}, journal = {Inf. Process. Lett.}, volume = {59}, number = {2}, pages = {97--102}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00078-6}, doi = {10.1016/0020-0190(96)00078-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MadanlalVR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Manku96, author = {Gurmeet Singh Manku}, title = {A Linear Time Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem}, journal = {Inf. Process. Lett.}, volume = {59}, number = {1}, pages = {1--7}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00088-9}, doi = {10.1016/0020-0190(96)00088-9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Manku96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Marchetti-SpaccamelaNR96, author = {Alberto Marchetti{-}Spaccamela and Umberto Nanni and Hans Rohnert}, title = {Maintaining a Topological Order Under Edge Insertions}, journal = {Inf. Process. Lett.}, volume = {59}, number = {1}, pages = {53--58}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00075-0}, doi = {10.1016/0020-0190(96)00075-0}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Marchetti-SpaccamelaNR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MelkmanS96, author = {Avraham A. Melkman and Solomon Eyal Shimony}, title = {Algorithms for Parsimonious Complete Sets in Directed Graphs}, journal = {Inf. Process. Lett.}, volume = {59}, number = {6}, pages = {335--339}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00123-8}, doi = {10.1016/0020-0190(96)00123-8}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MelkmanS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MorganM96, author = {Carroll Morgan and Annabelle McIver}, title = {Unifying wp and wlp}, journal = {Inf. Process. Lett.}, volume = {59}, number = {3}, pages = {159--163}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00093-2}, doi = {10.1016/0020-0190(96)00093-2}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/MorganM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MoriyaY96, author = {Tetsuo Moriya and Hideki Yamasaki}, title = {Literal Shuffle on omega-Languages}, journal = {Inf. Process. Lett.}, volume = {59}, number = {3}, pages = {165--168}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00091-9}, doi = {10.1016/0020-0190(96)00091-9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MoriyaY96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/NagumoLW96, author = {Hideo Nagumo and Mi Lu and Karan L. Watson}, title = {On-Line Longest Fragment First Parsing Algorithm}, journal = {Inf. Process. Lett.}, volume = {59}, number = {2}, pages = {91--96}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00066-X}, doi = {10.1016/0020-0190(96)00066-X}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/NagumoLW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/NatschlagerS96, author = {Thomas Natschl{\"{a}}ger and Michael Schmitt}, title = {Exact VC-Dimension of Boolean Monomials}, journal = {Inf. Process. Lett.}, volume = {59}, number = {1}, pages = {19--20}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00084-1}, doi = {10.1016/0020-0190(96)00084-1}, timestamp = {Wed, 20 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/NatschlagerS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/NatschlagerS96a, author = {Thomas Natschl{\"{a}}ger and Michael Schmitt}, title = {Erratum: Exact VC-Dimension of Boolean Monomials}, journal = {Inf. Process. Lett.}, volume = {60}, number = {2}, pages = {107}, year = {1996}, url = {https://doi.org/10.1016/S0020-0190(96)00160-3}, doi = {10.1016/S0020-0190(96)00160-3}, timestamp = {Wed, 20 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/NatschlagerS96a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Nielsen96, author = {Frank Nielsen}, title = {Output-Sensitive Peeling of Convex and Maximal Layers}, journal = {Inf. Process. Lett.}, volume = {59}, number = {5}, pages = {255--259}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00116-0}, doi = {10.1016/0020-0190(96)00116-0}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Nielsen96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Panaite96, author = {Petrisor Panaite}, title = {Hypercube Permutations Routable Under all Dimension Orderings}, journal = {Inf. Process. Lett.}, volume = {59}, number = {4}, pages = {185--189}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00109-3}, doi = {10.1016/0020-0190(96)00109-3}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Panaite96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Paun96, author = {Gheorghe Paun}, title = {Splicing Systems with Targets are Computationally Universal}, journal = {Inf. Process. Lett.}, volume = {59}, number = {3}, pages = {129--133}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00097-X}, doi = {10.1016/0020-0190(96)00097-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Paun96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/PlandowskiRS96, author = {Wojciech Plandowski and Wojciech Rytter and Tomasz Szymacha}, title = {Parallel Tree-Contraction and Fibonacci Numbers}, journal = {Inf. Process. Lett.}, volume = {59}, number = {5}, pages = {267--271}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00118-4}, doi = {10.1016/0020-0190(96)00118-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/PlandowskiRS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/PriscoPP96, author = {Roberto De Prisco and Giuseppe Parlati and Giuseppe Persiano}, title = {A Note on the Expected Path Length of Trees with Known Fringe}, journal = {Inf. Process. Lett.}, volume = {59}, number = {6}, pages = {309--315}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00129-9}, doi = {10.1016/0020-0190(96)00129-9}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/PriscoPP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Rescigno96, author = {Adele A. Rescigno}, title = {On the Communication Complexity of Polling}, journal = {Inf. Process. Lett.}, volume = {59}, number = {6}, pages = {317--323}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00127-5}, doi = {10.1016/0020-0190(96)00127-5}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Rescigno96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/RomijnV96, author = {Judi Romijn and Frits W. Vaandrager}, title = {A Note on Fairness in {I/O} Automata}, journal = {Inf. Process. Lett.}, volume = {59}, number = {5}, pages = {245--250}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00122-6}, doi = {10.1016/0020-0190(96)00122-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/RomijnV96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Santos96, author = {Francisco Santos}, title = {Inscribing a Symmetric Body in an Ellipse}, journal = {Inf. Process. Lett.}, volume = {59}, number = {4}, pages = {175--178}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00110-X}, doi = {10.1016/0020-0190(96)00110-X}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Santos96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Seidl96, author = {Helmut Seidl}, title = {Fast and Simple Nested Fixpoints}, journal = {Inf. Process. Lett.}, volume = {59}, number = {6}, pages = {303--308}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00130-5}, doi = {10.1016/0020-0190(96)00130-5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Seidl96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ShenR96, author = {Hong Shen and Sarnath Ramnath}, title = {Optimal Parallel Selection in Sorted Matrices}, journal = {Inf. Process. Lett.}, volume = {59}, number = {3}, pages = {117--122}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00100-7}, doi = {10.1016/0020-0190(96)00100-7}, timestamp = {Wed, 20 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ShenR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Szepietowski96, author = {Andrzej Szepietowski}, title = {The Element Distinctness Problem on One-Tape Turing Machines}, journal = {Inf. Process. Lett.}, volume = {59}, number = {4}, pages = {203--206}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00108-1}, doi = {10.1016/0020-0190(96)00108-1}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Szepietowski96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/TanakaNB96, author = {Keisuke Tanaka and Tetsuro Nishino and Robert Beals}, title = {Negation-Limited Circuit Complexity of Symmetric Functions}, journal = {Inf. Process. Lett.}, volume = {59}, number = {5}, pages = {273--279}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00115-9}, doi = {10.1016/0020-0190(96)00115-9}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/TanakaNB96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Tokunaga96, author = {Shin{-}ichi Tokunaga}, title = {Intersection Number of Two Connected Geometric Graphs}, journal = {Inf. Process. Lett.}, volume = {59}, number = {6}, pages = {331--333}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00124-X}, doi = {10.1016/0020-0190(96)00124-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Tokunaga96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Tseng96, author = {Yu{-}Chee Tseng}, title = {Embedding a Ring in a Hypercube with Both Faulty Links and Faulty Nodes}, journal = {Inf. Process. Lett.}, volume = {59}, number = {4}, pages = {217--222}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00114-7}, doi = {10.1016/0020-0190(96)00114-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Tseng96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/TuranV96, author = {Gy{\"{o}}rgy Tur{\'{a}}n and Farrokh Vatan}, title = {A Size-Depth Trade-Off for the Analog Computation of Boolean Functions}, journal = {Inf. Process. Lett.}, volume = {59}, number = {5}, pages = {251--254}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00120-2}, doi = {10.1016/0020-0190(96)00120-2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/TuranV96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Ustimenko96, author = {A. P. Ustimenko}, title = {Algebra of Two-Level Cause-Effect Structures}, journal = {Inf. Process. Lett.}, volume = {59}, number = {6}, pages = {325--330}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00128-7}, doi = {10.1016/0020-0190(96)00128-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Ustimenko96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/WangF96, author = {Xiadong Wang and Qingxiang Fu}, title = {A Frame for General Divide-and-Conquer Recurrences}, journal = {Inf. Process. Lett.}, volume = {59}, number = {1}, pages = {45--51}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00076-2}, doi = {10.1016/0020-0190(96)00076-2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/WangF96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/WatjenS96, author = {Dietmar W{\"{a}}tjen and Heike Spilker}, title = {Decidability Results Concerning k-limited {ED0L} Systems}, journal = {Inf. Process. Lett.}, volume = {59}, number = {1}, pages = {13--17}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00081-6}, doi = {10.1016/0020-0190(96)00081-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/WatjenS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/YoungW96, author = {Christopher H. Young and Philip A. Wilsey}, title = {A Distributed Method to Bound Rollback Lengths for Fossil Collection in Time Warp Simulators}, journal = {Inf. Process. Lett.}, volume = {59}, number = {4}, pages = {191--196}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00107-X}, doi = {10.1016/0020-0190(96)00107-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/YoungW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Zwick96, author = {Uri Zwick}, title = {On the Number of ANDs Versus the Number of ORs in Monotone Boolean Circuits}, journal = {Inf. Process. Lett.}, volume = {59}, number = {1}, pages = {29--30}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00080-4}, doi = {10.1016/0020-0190(96)00080-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Zwick96.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.