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/ipl22.bht:"
download as .bib file
@article{DBLP:journals/ipl/AizawaN86,
author = {Kunio Aizawa and
Akira Nakamura},
title = {Direction-Independent Application of Productions on Two-Dimensional
Arrays},
journal = {Inf. Process. Lett.},
volume = {22},
number = {6},
pages = {295--301},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90069-4},
doi = {10.1016/0020-0190(86)90069-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AizawaN86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlankoS86,
author = {Timo O. Alanko and
R. L. Smelianski},
title = {On the Calculation of Control Transition Probabilities in a Program},
journal = {Inf. Process. Lett.},
volume = {22},
number = {5},
pages = {273--276},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90106-7},
doi = {10.1016/0020-0190(86)90106-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlankoS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ambos-Spies86,
author = {Klaus Ambos{-}Spies},
title = {Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super
Sparse Sets},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {113--117},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90054-2},
doi = {10.1016/0020-0190(86)90054-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ambos-Spies86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AptK86,
author = {Krzysztof R. Apt and
Dexter Kozen},
title = {Limits for Automatic Verification of Finite-State Concurrent Systems},
journal = {Inf. Process. Lett.},
volume = {22},
number = {6},
pages = {307--309},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90071-2},
doi = {10.1016/0020-0190(86)90071-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AptK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AroraRG86,
author = {R. K. Arora and
S. P. Rana and
M. N. Gupta},
title = {Distributed Termination Detection Algorithm for Distributed Computations},
journal = {Inf. Process. Lett.},
volume = {22},
number = {6},
pages = {311--314},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90072-4},
doi = {10.1016/0020-0190(86)90072-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AroraRG86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Aurenhammer86,
author = {Franz Aurenhammer},
title = {The One-Dimensional Weighted Voronoi Diagram},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {119--123},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90055-4},
doi = {10.1016/0020-0190(86)90055-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Aurenhammer86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaumgartenO86,
author = {Bernd Baumgarten and
Peter Ochsenschl{\"{a}}ger},
title = {On Termination and Phase Changes in the Presence of Unreliable Communication},
journal = {Inf. Process. Lett.},
volume = {22},
number = {1},
pages = {15--20},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90036-0},
doi = {10.1016/0020-0190(86)90036-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaumgartenO86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bernstein86,
author = {Herbert J. Bernstein},
title = {Determining the Shape of a Convex n-Sided Polygon by Using 2n+k Tactile
Probes},
journal = {Inf. Process. Lett.},
volume = {22},
number = {5},
pages = {255--260},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90103-1},
doi = {10.1016/0020-0190(86)90103-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bernstein86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Berstel86,
author = {Jean Berstel},
title = {Every Iterated Morphism Yields a co-CFL},
journal = {Inf. Process. Lett.},
volume = {22},
number = {1},
pages = {7--9},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90034-7},
doi = {10.1016/0020-0190(86)90034-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Berstel86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BourretO86,
author = {Paul Bourret and
R. Souza de Oliveira},
title = {Lower and Upper Bounds of the Sizes of Domains: Estimates and Experiments},
journal = {Inf. Process. Lett.},
volume = {22},
number = {5},
pages = {247--253},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90102-X},
doi = {10.1016/0020-0190(86)90102-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BourretO86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Carlsson86,
author = {Svante Carlsson},
title = {Splitmerge - {A} Fast Stable Merging Algorithm},
journal = {Inf. Process. Lett.},
volume = {22},
number = {4},
pages = {189--192},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90026-8},
doi = {10.1016/0020-0190(86)90026-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Carlsson86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CarpiL86,
author = {Arturo Carpi and
Aldo de Luca},
title = {Square-Free Words on Partially Commutative Free Monoids},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {125--131},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90056-6},
doi = {10.1016/0020-0190(86)90056-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CarpiL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chatelin86,
author = {Philippe Chatelin},
title = {On Transformations of Algorithms to Multiply 2*2 Matrices},
journal = {Inf. Process. Lett.},
volume = {22},
number = {1},
pages = {1--5},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90033-5},
doi = {10.1016/0020-0190(86)90033-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chatelin86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen86,
author = {Lin Chen},
title = {{O(1)} Space Complexity Deletion for {AVL} Trees},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {147--149},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90061-X},
doi = {10.1016/0020-0190(86)90061-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChoiK86,
author = {Key{-}Sun Choi and
Gil{-}Chang Kim},
title = {A Controlled Quantification in Parsing of Montague Grammar},
journal = {Inf. Process. Lett.},
volume = {22},
number = {4},
pages = {207--216},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90030-X},
doi = {10.1016/0020-0190(86)90030-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChoiK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cialdea86,
author = {Marta Cialdea},
title = {Some Remarks on the Possibility of Extending Resolution Proof Procedures
to Intuitionistic Logic},
journal = {Inf. Process. Lett.},
volume = {22},
number = {2},
pages = {87--90},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90146-8},
doi = {10.1016/0020-0190(86)90146-8},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cialdea86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Clarkson86,
author = {Kenneth L. Clarkson},
title = {Linear Programming in O(n * (3{\_}d){\_}2) Time},
journal = {Inf. Process. Lett.},
volume = {22},
number = {1},
pages = {21--24},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90037-2},
doi = {10.1016/0020-0190(86)90037-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Clarkson86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CockayneH86,
author = {Ernest J. Cockayne and
Denton E. Hewgill},
title = {Exact Computation of Steiner Minimal Trees in the Plane},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {151--156},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90062-1},
doi = {10.1016/0020-0190(86)90062-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CockayneH86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CodenottiL86,
author = {Bruno Codenotti and
Grazia Lotti},
title = {A Note on the {VLSI} Counter},
journal = {Inf. Process. Lett.},
volume = {22},
number = {4},
pages = {193--195},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90027-X},
doi = {10.1016/0020-0190(86)90027-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CodenottiL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dai86,
author = {Ke{-}Chang Dai},
title = {EDISON-80, a Language for Modular Programming of Parallel Processes},
journal = {Inf. Process. Lett.},
volume = {22},
number = {2},
pages = {61--72},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90142-0},
doi = {10.1016/0020-0190(86)90142-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Dai86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dehne86,
author = {Frank K. H. A. Dehne},
title = {O(n(1/2)) Algorithms for the Maximal Elements and {ECDF} Searching
Problem on a Mesh-Connected Parallel Computer},
journal = {Inf. Process. Lett.},
volume = {22},
number = {6},
pages = {303--306},
year = {1986},
timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Dehne86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Evans86,
author = {John B. Evans},
title = {Experiments with Trees of the Storage and Retrieval of Future Events},
journal = {Inf. Process. Lett.},
volume = {22},
number = {5},
pages = {237--242},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90100-6},
doi = {10.1016/0020-0190(86)90100-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Evans86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GajewskaT86,
author = {H. Gajewska and
Robert Endre Tarjan},
title = {Deques with Heap Order},
journal = {Inf. Process. Lett.},
volume = {22},
number = {4},
pages = {197--200},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90028-1},
doi = {10.1016/0020-0190(86)90028-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GajewskaT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gire86,
author = {Fran{\c{c}}oise Gire},
title = {Two Decidability Problems for Infinite Words},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {135--140},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90058-X},
doi = {10.1016/0020-0190(86)90058-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gire86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoralcikK86,
author = {Pavel Goralcik and
V{\'{a}}clav Koubek},
title = {Verifying Nonrigidity},
journal = {Inf. Process. Lett.},
volume = {22},
number = {2},
pages = {91--95},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90147-X},
doi = {10.1016/0020-0190(86)90147-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoralcikK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrigoriadisK86,
author = {Michael D. Grigoriadis and
Bahman Kalantari},
title = {A Lower Bound to the Complexity of Euclidean and Rectilinear Matching
Algorithms},
journal = {Inf. Process. Lett.},
volume = {22},
number = {2},
pages = {73--76},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90143-2},
doi = {10.1016/0020-0190(86)90143-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrigoriadisK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuptaS86,
author = {Gopal K. Gupta and
Bala Srinivasan},
title = {Approximate Storage Utilization of B-Trees},
journal = {Inf. Process. Lett.},
volume = {22},
number = {5},
pages = {243--246},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90101-8},
doi = {10.1016/0020-0190(86)90101-8},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuptaS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GusfieldP86,
author = {Dan Gusfield and
Leonard Pitt},
title = {Equivalent Approximation Algorithms for Node Cover},
journal = {Inf. Process. Lett.},
volume = {22},
number = {6},
pages = {291--294},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90068-2},
doi = {10.1016/0020-0190(86)90068-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GusfieldP86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hambury86,
author = {M. C. Hambury},
title = {Two Tagless Variations on the Deutsch-Schorr-Waite Algorithm},
journal = {Inf. Process. Lett.},
volume = {22},
number = {4},
pages = {179--183},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90024-4},
doi = {10.1016/0020-0190(86)90024-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hambury86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HanataniF86,
author = {Yoshito Hanatani and
Ronald Fagin},
title = {A Simple Characterization of Database Dependency Implication},
journal = {Inf. Process. Lett.},
volume = {22},
number = {6},
pages = {281--283},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90066-9},
doi = {10.1016/0020-0190(86)90066-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HanataniF86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hattori86,
author = {Yoshio Hattori},
title = {Nonisomorphic Graphs with the Same T-Polynomial},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {133--134},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90057-8},
doi = {10.1016/0020-0190(86)90057-8},
timestamp = {Thu, 15 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hattori86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Highnam86,
author = {Peter T. Highnam},
title = {Optimal Algorithms for Finding the Symmetries of a Planar Point Set},
journal = {Inf. Process. Lett.},
volume = {22},
number = {5},
pages = {219--222},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90097-9},
doi = {10.1016/0020-0190(86)90097-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Highnam86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hughes86,
author = {R. John M. Hughes},
title = {A Novel Representation of Lists and its Application to the Function
"reverse"},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {141--144},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90059-1},
doi = {10.1016/0020-0190(86)90059-1},
timestamp = {Tue, 08 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Hughes86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IsraelI86,
author = {Amos Israeli and
Alon Itai},
title = {A Fast and Simple Randomized Parallel Algorithm for Maximal Matching},
journal = {Inf. Process. Lett.},
volume = {22},
number = {2},
pages = {77--80},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90144-4},
doi = {10.1016/0020-0190(86)90144-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IsraelI86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IsraeliS86,
author = {Amos Israeli and
Yossi Shiloach},
title = {An Improved Parallel Algorithm for Maximal Matching},
journal = {Inf. Process. Lett.},
volume = {22},
number = {2},
pages = {57--60},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90141-9},
doi = {10.1016/0020-0190(86)90141-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IsraeliS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JacobsB86,
author = {C. T. M. Jacobs and
Peter van Emde Boas},
title = {Two Results on Tables},
journal = {Inf. Process. Lett.},
volume = {22},
number = {1},
pages = {43--48},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90041-4},
doi = {10.1016/0020-0190(86)90041-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JacobsB86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JaumardM86,
author = {Brigitte Jaumard and
Michel Minoux},
title = {An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case
Complexity Result for a Class of Sparse Graphs},
journal = {Inf. Process. Lett.},
volume = {22},
number = {4},
pages = {163--169},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90021-9},
doi = {10.1016/0020-0190(86)90021-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JaumardM86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kallay86,
author = {Michael Kallay},
title = {Convex Hull Made Easy},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {161},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90064-5},
doi = {10.1016/0020-0190(86)90064-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kallay86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Keil86,
author = {J. Mark Keil},
title = {Total Domination in Interval Graphs},
journal = {Inf. Process. Lett.},
volume = {22},
number = {4},
pages = {171--174},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90022-0},
doi = {10.1016/0020-0190(86)90022-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Keil86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Keller86,
author = {Arthur M. Keller},
title = {Set-Theoretic Problems of Null Completion in Relational Databases},
journal = {Inf. Process. Lett.},
volume = {22},
number = {5},
pages = {261--265},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90104-3},
doi = {10.1016/0020-0190(86)90104-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Keller86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kriauciukas86,
author = {Valentinas Kriauciukas},
title = {Tree-Like Parse and Polynomial Subclasses of Search Problems},
journal = {Inf. Process. Lett.},
volume = {22},
number = {1},
pages = {49--54},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90042-6},
doi = {10.1016/0020-0190(86)90042-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kriauciukas86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Krivanek86,
author = {Mirko Kriv{\'{a}}nek},
title = {Hexagonal Unit Network a Tool for Proving the NP-Completeness Results
of Geometric Problems},
journal = {Inf. Process. Lett.},
volume = {22},
number = {1},
pages = {37--41},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90040-2},
doi = {10.1016/0020-0190(86)90040-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Krivanek86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KumarM86,
author = {P. Srinivas Kumar and
M. Manohar},
title = {On Probability of Forest of Quadtrees Reducing to Quadtrees},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {109--111},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90053-0},
doi = {10.1016/0020-0190(86)90053-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KumarM86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeissJ86,
author = {Ernst L. Leiss and
C. Jitmedha},
title = {Horizontally and Vertically Bounded Propagation of Privileges},
journal = {Inf. Process. Lett.},
volume = {22},
number = {6},
pages = {319--327},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90074-8},
doi = {10.1016/0020-0190(86)90074-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeissJ86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiY86,
author = {Ming Li and
Yaacov Yesha},
title = {String-Matching Cannot be Done by a Two-Head One-Way Deterministic
Finite Automation},
journal = {Inf. Process. Lett.},
volume = {22},
number = {5},
pages = {231--235},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90099-2},
doi = {10.1016/0020-0190(86)90099-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiY86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lickteig86,
author = {Thomas Lickteig},
title = {Gaussian Elimination is Optimal for Solving Linear Equations in Dimension
Two},
journal = {Inf. Process. Lett.},
volume = {22},
number = {6},
pages = {277--279},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90065-7},
doi = {10.1016/0020-0190(86)90065-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lickteig86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lingus86,
author = {A. Lingus},
title = {The Greedy and Delaunay Triangulations are Not Bad in the Average
Case},
journal = {Inf. Process. Lett.},
volume = {22},
number = {1},
pages = {25--31},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90038-4},
doi = {10.1016/0020-0190(86)90038-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lingus86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LouiMW86,
author = {Michael C. Loui and
Teresa A. Matsushita and
Douglas B. West},
title = {Election in a Complete Network with a Sense of Direction},
journal = {Inf. Process. Lett.},
volume = {22},
number = {4},
pages = {185--187},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90025-6},
doi = {10.1016/0020-0190(86)90025-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LouiMW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Manolopoulos86,
author = {Yannis Manolopoulos},
title = {Batched Search of Index Sequential Files},
journal = {Inf. Process. Lett.},
volume = {22},
number = {5},
pages = {267--272},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90105-5},
doi = {10.1016/0020-0190(86)90105-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Manolopoulos86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Martel86,
author = {Charles U. Martel},
title = {Lower Bounds on Parallel Algorithms for Finding the First Maximal
Independent Set},
journal = {Inf. Process. Lett.},
volume = {22},
number = {2},
pages = {81--85},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90145-6},
doi = {10.1016/0020-0190(86)90145-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Martel86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pan86,
author = {Victor Y. Pan},
title = {The Trade-Off Between the Additive Complexity and the Asynchronicity
of Linear and Bilinear Algorithms},
journal = {Inf. Process. Lett.},
volume = {22},
number = {1},
pages = {11--14},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90035-9},
doi = {10.1016/0020-0190(86)90035-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Pan86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Panny86,
author = {Wolfgang Panny},
title = {A Note on the Higher Moments of the Expected Behavior of Straight
Insertion Sort},
journal = {Inf. Process. Lett.},
volume = {22},
number = {4},
pages = {175--177},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90023-2},
doi = {10.1016/0020-0190(86)90023-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Panny86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Parberry86,
author = {Ian Parberry},
title = {On Recurrent and Recursive Interconnection Patterns},
journal = {Inf. Process. Lett.},
volume = {22},
number = {6},
pages = {285--289},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90067-0},
doi = {10.1016/0020-0190(86)90067-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Parberry86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PawagiR86,
author = {Shaunak Pawagi and
I. V. Ramakrishnan},
title = {An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees},
journal = {Inf. Process. Lett.},
volume = {22},
number = {5},
pages = {223--229},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90098-0},
doi = {10.1016/0020-0190(86)90098-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PawagiR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Richards86,
author = {Dana S. Richards},
title = {Data Compression and Gray-Code Sorting},
journal = {Inf. Process. Lett.},
volume = {22},
number = {4},
pages = {201--205},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90029-3},
doi = {10.1016/0020-0190(86)90029-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Richards86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rosier86,
author = {Louis E. Rosier},
title = {A Note on Presburger Arithmetic with Array Segments, Permutation and
Equality},
journal = {Inf. Process. Lett.},
volume = {22},
number = {1},
pages = {33--35},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90039-6},
doi = {10.1016/0020-0190(86)90039-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rosier86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sattolo86,
author = {S. Sattolo},
title = {An Algorithm to Generate a Random Cyclic Permutation},
journal = {Inf. Process. Lett.},
volume = {22},
number = {6},
pages = {315--317},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90073-6},
doi = {10.1016/0020-0190(86)90073-6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Sattolo86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schwer86,
author = {Sylviane R. Schwer},
title = {On the Rationality of Petri Net Languages},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {145--146},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90060-8},
doi = {10.1016/0020-0190(86)90060-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Schwer86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shock86,
author = {Robert C. Shock},
title = {Computing the Minimum Cover of Functional Dependencies},
journal = {Inf. Process. Lett.},
volume = {22},
number = {3},
pages = {157--159},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90063-3},
doi = {10.1016/0020-0190(86)90063-3},
timestamp = {Fri, 15 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shock86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Snir86,
author = {Marc Snir},
title = {Exact Balancing is Not Always Good},
journal = {Inf. Process. Lett.},
volume = {22},
number = {2},
pages = {97--102},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90148-1},
doi = {10.1016/0020-0190(86)90148-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Snir86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/StojmenovicS86,
author = {Ivan Stojmenovic and
Eljas Soisalon{-}Soininen},
title = {A Note on Approximate Convex Hulls},
journal = {Inf. Process. Lett.},
volume = {22},
number = {2},
pages = {55--56},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90140-7},
doi = {10.1016/0020-0190(86)90140-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/StojmenovicS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Takaoka86,
author = {Tadao Takaoka},
title = {An On-Line Pattern Matching Algorithm},
journal = {Inf. Process. Lett.},
volume = {22},
number = {6},
pages = {329--330},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90075-X},
doi = {10.1016/0020-0190(86)90075-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Takaoka86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WebsterB86,
author = {Max B. Webster and
Paul W. Baker},
title = {A Class of Differential Equations for Testing Variable Step-Size Integration},
journal = {Inf. Process. Lett.},
volume = {22},
number = {2},
pages = {103--107},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90149-3},
doi = {10.1016/0020-0190(86)90149-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WebsterB86.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-23 13:43 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:
