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/ipl57.bht:"
download as .bib file
@article{DBLP:journals/ipl/AbellanasGHHSU96,
author = {Manuel Abellanas and
Jesus Garcia{-}Lopez and
Gregorio Hern{\'{a}}ndez{-}Pe{\~{n}}alver and
Ferran Hurtado and
Oriol Serra and
Jorge Urrutia},
title = {Onion Polygonizations},
journal = {Inf. Process. Lett.},
volume = {57},
number = {3},
pages = {165--173},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00193-X},
doi = {10.1016/0020-0190(95)00193-X},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AbellanasGHHSU96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Alimonti96,
author = {Paola Alimonti},
title = {New Local Search Approximation Techniques for Maximum Generalized
Satisfiability Problems},
journal = {Inf. Process. Lett.},
volume = {57},
number = {3},
pages = {151--158},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00196-4},
doi = {10.1016/0020-0190(95)00196-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Alimonti96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AslamD96,
author = {Javed A. Aslam and
Scott E. Decatur},
title = {On the Sample Complexity of Noise-Tolerant Learning},
journal = {Inf. Process. Lett.},
volume = {57},
number = {4},
pages = {189--195},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00006-3},
doi = {10.1016/0020-0190(96)00006-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AslamD96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AspvallLLS96,
author = {Bengt Aspvall and
Christos Levcopoulos and
Andrzej Lingas and
Robert Storlind},
title = {On 2-QBF Truth Testing in Parallel},
journal = {Inf. Process. Lett.},
volume = {57},
number = {2},
pages = {89--93},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00180-8},
doi = {10.1016/0020-0190(95)00180-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AspvallLLS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AttiyaF96,
author = {Hagit Attiya and
Roy Friedman},
title = {Limitations of Fast Consistency Conditions for Distributed Shared
Memories},
journal = {Inf. Process. Lett.},
volume = {57},
number = {5},
pages = {243--248},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00007-5},
doi = {10.1016/0020-0190(96)00007-5},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AttiyaF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaclawskiS96,
author = {Kenneth Baclawski and
Dan A. Simovici},
title = {A Characterization of the Information Content of a Classification},
journal = {Inf. Process. Lett.},
volume = {57},
number = {4},
pages = {211--214},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00003-8},
doi = {10.1016/0020-0190(96)00003-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaclawskiS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ben-OrR96,
author = {Michael Ben{-}Or and
Dana Ron},
title = {Agreement in the Presence of Faults, on Networks of Bounded Degree},
journal = {Inf. Process. Lett.},
volume = {57},
number = {6},
pages = {329--334},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00015-4},
doi = {10.1016/0020-0190(96)00015-4},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Ben-OrR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Blum96,
author = {Norbert Blum},
title = {An O(n log n) Implementation of the Standard Method for Minimizing
n-State Finite Automata},
journal = {Inf. Process. Lett.},
volume = {57},
number = {2},
pages = {65--59},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00199-9},
doi = {10.1016/0020-0190(95)00199-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Blum96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Canetti96,
author = {Ran Canetti},
title = {More on {BPP} and the Polynomial-Time Hierarchy},
journal = {Inf. Process. Lett.},
volume = {57},
number = {5},
pages = {237--241},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00016-6},
doi = {10.1016/0020-0190(96)00016-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Canetti96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CattellDF96,
author = {Kevin Cattell and
Michael J. Dinneen and
Michael R. Fellows},
title = {A Simple Linear-Time Algorithm for Finding Path-Decompositions of
Small Width},
journal = {Inf. Process. Lett.},
volume = {57},
number = {4},
pages = {197--203},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00190-5},
doi = {10.1016/0020-0190(95)00190-5},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CattellDF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenK96,
author = {Danny Z. Chen and
Kevin S. Klenk},
title = {Rectilinear Short Path Queries Among Rectangular Obstacles},
journal = {Inf. Process. Lett.},
volume = {57},
number = {6},
pages = {313--319},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00020-8},
doi = {10.1016/0020-0190(96)00020-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenK96a,
author = {Danny Z. Chen and
Kevin S. Klenk},
title = {Erratum: Rectilinear Short Path Queries Among Rectangular Obstacles},
journal = {Inf. Process. Lett.},
volume = {60},
number = {2},
pages = {105},
year = {1996},
url = {https://doi.org/10.1016/S0020-0190(96)00173-1},
doi = {10.1016/S0020-0190(96)00173-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenK96a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenY96,
author = {Tsong Yueh Chen and
Yuen{-}Tak Yu},
title = {A More General Sufficient Condition for Partition Testing to be Better
than Random Testing},
journal = {Inf. Process. Lett.},
volume = {57},
number = {3},
pages = {145--149},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00203-0},
doi = {10.1016/0020-0190(95)00203-0},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Clote96,
author = {Peter Clote},
title = {A Note on the Monotone Complexity of 2-REF},
journal = {Inf. Process. Lett.},
volume = {57},
number = {3},
pages = {117--123},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00002-6},
doi = {10.1016/0020-0190(96)00002-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Clote96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cusick96,
author = {Thomas W. Cusick},
title = {Bounds on the Number of Functions Satisfying the Strict Avalanche
Criterion},
journal = {Inf. Process. Lett.},
volume = {57},
number = {5},
pages = {261--263},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00211-1},
doi = {10.1016/0020-0190(95)00211-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cusick96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dancik96,
author = {Vlado Danc{\'{\i}}k},
title = {Complexity of Boolean Functions Over Bases with Unbounded Fan-In Gates},
journal = {Inf. Process. Lett.},
volume = {57},
number = {1},
pages = {31--34},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00182-4},
doi = {10.1016/0020-0190(95)00182-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Dancik96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DanyiF96,
author = {G. D{\'{a}}nyi and
Zolt{\'{a}}n F{\"{u}}l{\"{o}}p},
title = {A Note on the Equivalence Problem of E-Patterns},
journal = {Inf. Process. Lett.},
volume = {57},
number = {3},
pages = {125--128},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00212-X},
doi = {10.1016/0020-0190(95)00212-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DanyiF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Das96,
author = {Subrata Kumar Das},
title = {Modal Logics in the Theory of Relational Databases},
journal = {Inf. Process. Lett.},
volume = {57},
number = {1},
pages = {1--7},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00186-7},
doi = {10.1016/0020-0190(95)00186-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Das96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Deng96,
author = {Xiaotie Deng},
title = {A Lower Bound for Communication in the Crossbar},
journal = {Inf. Process. Lett.},
volume = {57},
number = {2},
pages = {103--108},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00195-6},
doi = {10.1016/0020-0190(95)00195-6},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Deng96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DongS96,
author = {Guozhu Dong and
Jianwen Su},
title = {Conjunctive Query Containment with Respect to Views and Constraints},
journal = {Inf. Process. Lett.},
volume = {57},
number = {2},
pages = {95--102},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00192-1},
doi = {10.1016/0020-0190(95)00192-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DongS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Drozdowski96,
author = {Maciej Drozdowski},
title = {Real-Time Scheduling of Linear Speedup Parallel Tasks},
journal = {Inf. Process. Lett.},
volume = {57},
number = {1},
pages = {35--40},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00174-3},
doi = {10.1016/0020-0190(95)00174-3},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Drozdowski96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuhCH96,
author = {Dyi{-}Rong Duh and
Gen{-}Huey Chen and
D. Frank Hsu},
title = {Combinatorial Properties of Generalized Hypercube Graphs},
journal = {Inf. Process. Lett.},
volume = {57},
number = {1},
pages = {41--45},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00173-5},
doi = {10.1016/0020-0190(95)00173-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DuhCH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fagerberg96,
author = {Rolf Fagerberg},
title = {A Generalization of Binomial Queues},
journal = {Inf. Process. Lett.},
volume = {57},
number = {2},
pages = {109--114},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00194-8},
doi = {10.1016/0020-0190(95)00194-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fagerberg96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FudosPS96,
author = {Ioannis Fudos and
Evaggelia Pitoura and
Wojciech Szpankowski},
title = {On Pattern Occurrences in a Random Text},
journal = {Inf. Process. Lett.},
volume = {57},
number = {6},
pages = {307--312},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00022-1},
doi = {10.1016/0020-0190(96)00022-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FudosPS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GarridoJLR96,
author = {Oscar Garrido and
Stefan Jarominek and
Andrzej Lingas and
Wojciech Rytter},
title = {A Simple Randomized Parallel Algorithm for Maximal f-Matchings},
journal = {Inf. Process. Lett.},
volume = {57},
number = {2},
pages = {83--87},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00179-4},
doi = {10.1016/0020-0190(95)00179-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GarridoJLR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gawiejnowicz96,
author = {Stanislaw Gawiejnowicz},
title = {A Note on Scheduling on a Single Processor with Speed Dependent on
a Number of Executed Jobs},
journal = {Inf. Process. Lett.},
volume = {57},
number = {6},
pages = {297--300},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00021-X},
doi = {10.1016/0020-0190(96)00021-X},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Gawiejnowicz96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GhandeharizadehIZ96,
author = {Shahram Ghandeharizadeh and
Doug Ierardi and
Roger Zimmermann},
title = {An On-Line Algorithm to Optimize File Layout in a Dynamic Environment},
journal = {Inf. Process. Lett.},
volume = {57},
number = {2},
pages = {75--81},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00202-2},
doi = {10.1016/0020-0190(95)00202-2},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GhandeharizadehIZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoldsmithH96,
author = {Judy Goldsmith and
Steven Homer},
title = {Scalability and the Isomorphism Problem},
journal = {Inf. Process. Lett.},
volume = {57},
number = {3},
pages = {137--143},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00204-9},
doi = {10.1016/0020-0190(95)00204-9},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoldsmithH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Harper96,
author = {Robert Harper},
title = {A Note on "A Simplified Account of Polymorphic References"},
journal = {Inf. Process. Lett.},
volume = {57},
number = {1},
pages = {15--16},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00178-6},
doi = {10.1016/0020-0190(95)00178-6},
timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Harper96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HermanK96,
author = {Michael W. Herman and
Waldemar W. Koczkodaj},
title = {A Monte Carlo Study of Parwise Comparison},
journal = {Inf. Process. Lett.},
volume = {57},
number = {1},
pages = {25--29},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00185-9},
doi = {10.1016/0020-0190(95)00185-9},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HermanK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kim96,
author = {Sum{-}Kwon Kim},
title = {An Note on Finding Compact Sets in Graphs Represented by an Adjacency
List},
journal = {Inf. Process. Lett.},
volume = {57},
number = {6},
pages = {335--338},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00017-8},
doi = {10.1016/0020-0190(96)00017-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kim96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KoutsoupiasP96,
author = {Elias Koutsoupias and
Christos H. Papadimitriou},
title = {The 2-Evader Problem},
journal = {Inf. Process. Lett.},
volume = {57},
number = {5},
pages = {249--252},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00010-5},
doi = {10.1016/0020-0190(96)00010-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KoutsoupiasP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeC96,
author = {Wei{-}Bin Lee and
Chin{-}Chen Chang},
title = {Integrating Authentication in Public Key Distribution System},
journal = {Inf. Process. Lett.},
volume = {57},
number = {1},
pages = {49--52},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00177-8},
doi = {10.1016/0020-0190(95)00177-8},
timestamp = {Tue, 23 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LeeC96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LenhartL96,
author = {William J. Lenhart and
Giuseppe Liotta},
title = {Drawing Outerplanar Minimum Weight Triangulations},
journal = {Inf. Process. Lett.},
volume = {57},
number = {5},
pages = {253--260},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00012-9},
doi = {10.1016/0020-0190(96)00012-9},
timestamp = {Tue, 20 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LenhartL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LevcopoulosK96,
author = {Christos Levcopoulos and
Drago Krznaric},
title = {Tight Lower Bounds for Minimum Weight-Triangulation Heuristics},
journal = {Inf. Process. Lett.},
volume = {57},
number = {3},
pages = {129--135},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00200-6},
doi = {10.1016/0020-0190(95)00200-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LevcopoulosK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MerliniSV96,
author = {Donatella Merlini and
Renzo Sprugnoli and
M. Cecilia Verri},
title = {A Uniform Model for the Storage Utilization of B-Tree-Like Structures},
journal = {Inf. Process. Lett.},
volume = {57},
number = {1},
pages = {53--58},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00189-1},
doi = {10.1016/0020-0190(95)00189-1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MerliniSV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MetivierS96,
author = {Yves M{\'{e}}tivier and
Nasser Saheb},
title = {Medians and Centres of Polyominoes},
journal = {Inf. Process. Lett.},
volume = {57},
number = {4},
pages = {175--181},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00005-1},
doi = {10.1016/0020-0190(96)00005-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MetivierS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Monti96,
author = {Angelo Monti},
title = {On the Computational Complexity of Graph Closures},
journal = {Inf. Process. Lett.},
volume = {57},
number = {6},
pages = {291--295},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00027-0},
doi = {10.1016/0020-0190(96)00027-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Monti96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MontiR96,
author = {Angelo Monti and
Alessandro Roncato},
title = {A Gap Theorem for the Anonymous Torus},
journal = {Inf. Process. Lett.},
volume = {57},
number = {5},
pages = {279--285},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00197-2},
doi = {10.1016/0020-0190(95)00197-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MontiR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MullerRR96,
author = {Michael M{\"{u}}ller and
Christine R{\"{u}}b and
Wolfgang R{\"{u}}lling},
title = {A Circuit for Exact Summation of Floating-Points Numbers},
journal = {Inf. Process. Lett.},
volume = {57},
number = {3},
pages = {159--163},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00205-7},
doi = {10.1016/0020-0190(95)00205-7},
timestamp = {Thu, 20 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MullerRR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MurshedK96,
author = {M. Manzur Murshed and
M. Kaykobad},
title = {Seek Distances in Two-Headed Disk Systems},
journal = {Inf. Process. Lett.},
volume = {57},
number = {4},
pages = {205--209},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00191-3},
doi = {10.1016/0020-0190(95)00191-3},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MurshedK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MuschollP96,
author = {Anca Muscholl and
Holger Petersen},
title = {A Note on the Commutative Closure of Star-Free Languages},
journal = {Inf. Process. Lett.},
volume = {57},
number = {2},
pages = {71--74},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00187-5},
doi = {10.1016/0020-0190(95)00187-5},
timestamp = {Fri, 15 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MuschollP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NayakAG96,
author = {Amiya Nayak and
Vincenzo Acciaro and
Paolo Gissi},
title = {A Note on Isomorphic Chordal Rings (Erratum)},
journal = {Inf. Process. Lett.},
volume = {57},
number = {2},
pages = {115},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00207-3},
doi = {10.1016/0020-0190(95)00207-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NayakAG96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamnathS96,
author = {Sarnath Ramnath and
Sivaprakasam Sunder},
title = {On Two-Processor Scheduling and Maximum Matching in Permutation Graphs},
journal = {Inf. Process. Lett.},
volume = {57},
number = {6},
pages = {321--327},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00018-X},
doi = {10.1016/0020-0190(96)00018-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RamnathS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RheeL96,
author = {Chongkye Rhee and
Y. Daniel Liang},
title = {An {NC} Algorithm for the Clique Cover Problem in Cocomparability
Graphs and its Application},
journal = {Inf. Process. Lett.},
volume = {57},
number = {5},
pages = {287--290},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00206-5},
doi = {10.1016/0020-0190(95)00206-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RheeL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SeshadriR96,
author = {Sridhar Seshadri and
Doron Rotem},
title = {The Two Headed Disk: Stochastic Dominance of the Greedy Policy},
journal = {Inf. Process. Lett.},
volume = {57},
number = {5},
pages = {273--277},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00210-3},
doi = {10.1016/0020-0190(95)00210-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SeshadriR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Symvonis96,
author = {Antonios Symvonis},
title = {Routing on Trees},
journal = {Inf. Process. Lett.},
volume = {57},
number = {4},
pages = {215--223},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00208-1},
doi = {10.1016/0020-0190(95)00208-1},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Symvonis96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Trevisan96,
author = {Luca Trevisan},
title = {A Note on Minimum-Area Upward Drawing of Complete and Fibonacci Trees},
journal = {Inf. Process. Lett.},
volume = {57},
number = {5},
pages = {231--236},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)81422-0},
doi = {10.1016/0020-0190(96)81422-0},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Trevisan96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VadapalliS96,
author = {Premkumar Vadapalli and
Pradip K. Srimani},
title = {Shortest Routing in Trivalent Cayley Graph Network},
journal = {Inf. Process. Lett.},
volume = {57},
number = {4},
pages = {183--188},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00004-X},
doi = {10.1016/0020-0190(96)00004-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VadapalliS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VeanesB96,
author = {Margus Veanes and
Jonas Barklund},
title = {On the Number of Edges in Cycletrees},
journal = {Inf. Process. Lett.},
volume = {57},
number = {4},
pages = {225--229},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00183-2},
doi = {10.1016/0020-0190(95)00183-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VeanesB96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ViswanathanCS96,
author = {Suresh Viswanathan and
{\'{E}}va Czabarka and
Abhijit Sengupta},
title = {On Fault-Tolerant Embedding of Hamiltonian Circuits in Line Digraph
Interconnection Networks},
journal = {Inf. Process. Lett.},
volume = {57},
number = {5},
pages = {265--271},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00011-7},
doi = {10.1016/0020-0190(96)00011-7},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ViswanathanCS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Volpano96,
author = {Dennis M. Volpano},
title = {Lower Bounds on Type Checking Overloading},
journal = {Inf. Process. Lett.},
volume = {57},
number = {1},
pages = {9--13},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00184-0},
doi = {10.1016/0020-0190(95)00184-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Volpano96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Xue96,
author = {Quingbo Xue},
title = {On a Class of Square-Free Graphs},
journal = {Inf. Process. Lett.},
volume = {57},
number = {1},
pages = {47--48},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00175-1},
doi = {10.1016/0020-0190(95)00175-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Xue96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YanbeS96,
author = {Akio Yanbe and
Kouichi Sakurai},
title = {A Short Certificate of the Number of Universal Optimal Strategies
for Stopping Simple Stochastic Games},
journal = {Inf. Process. Lett.},
volume = {57},
number = {1},
pages = {17--24},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00181-6},
doi = {10.1016/0020-0190(95)00181-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YanbeS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yen96,
author = {I{-}Ling Yen},
title = {A Highly Safe Self-Stabilizing Mutual Exclusion Algorithm},
journal = {Inf. Process. Lett.},
volume = {57},
number = {6},
pages = {301--305},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00026-9},
doi = {10.1016/0020-0190(96)00026-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yen96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zimand96,
author = {Marius Zimand},
title = {A High-Low Kolmogorov Complexity Law Equivalent to the 0-1 Law},
journal = {Inf. Process. Lett.},
volume = {57},
number = {2},
pages = {59--64},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(95)00201-4},
doi = {10.1016/0020-0190(95)00201-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zimand96.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-18 11:26 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:
