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/ipl41.bht:"
download as .bib file
@article{DBLP:journals/ipl/Adams92,
author = {Carlisle M. Adams},
title = {On Immunity Against Biham and Shamir's "Differential Cryptanalysis"},
journal = {Inf. Process. Lett.},
volume = {41},
number = {2},
pages = {77--80},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90258-W},
doi = {10.1016/0020-0190(92)90258-W},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Adams92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Aggarwal92,
author = {Alok Aggarwal},
title = {Parallel Complexity of Computing a Maximal Set of Disjoint Paths},
journal = {Inf. Process. Lett.},
volume = {41},
number = {3},
pages = {149--151},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90044-V},
doi = {10.1016/0020-0190(92)90044-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Aggarwal92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AnconaFG92,
author = {Massimo Ancona and
Claudia Fassino and
Vittoria Gianuzzi},
title = {Optimization of LR(k) "Reduced Parsers"},
journal = {Inf. Process. Lett.},
volume = {41},
number = {1},
pages = {13--20},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90074-6},
doi = {10.1016/0020-0190(92)90074-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AnconaFG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArvindR92,
author = {K. Arvind and
C. Pandu Regan},
title = {Connected Domination and Steiner Set on Weighted Permutation Graphs},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {215--220},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90183-V},
doi = {10.1016/0020-0190(92)90183-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArvindR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtkinsonS92,
author = {M. D. Atkinson and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Generating Binary Trees at Random},
journal = {Inf. Process. Lett.},
volume = {41},
number = {1},
pages = {21--23},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90075-7},
doi = {10.1016/0020-0190(92)90075-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtkinsonS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AurenhammerS92,
author = {Franz Aurenhammer and
Gerd St{\"{o}}ckl},
title = {Searching for Segments with Largest Relative Overlap},
journal = {Inf. Process. Lett.},
volume = {41},
number = {2},
pages = {103--108},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90263-U},
doi = {10.1016/0020-0190(92)90263-U},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AurenhammerS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BattistaTT92,
author = {Giuseppe Di Battista and
Roberto Tamassia and
Ioannis G. Tollis},
title = {Constrained Visibility Representations of Graphs},
journal = {Inf. Process. Lett.},
volume = {41},
number = {1},
pages = {1--7},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90072-4},
doi = {10.1016/0020-0190(92)90072-4},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BattistaTT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlazewiczDDS92,
author = {Jacek Blazewicz and
Paolo Dell'Olmo and
Maciej Drozdowski and
Maria Grazia Speranza},
title = {Scheduling Multiprocessor Tasks on Three Dedicated Processors},
journal = {Inf. Process. Lett.},
volume = {41},
number = {5},
pages = {275--280},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90172-R},
doi = {10.1016/0020-0190(92)90172-R},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BlazewiczDDS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandtCM92,
author = {Jonathan Brandt and
Carlos Cabrelli and
Ursula Molter},
title = {Corrigendum: An Algorithm for the Computation of the Hutchinson Distance},
journal = {Inf. Process. Lett.},
volume = {41},
number = {6},
pages = {347},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90163-P},
doi = {10.1016/0020-0190(92)90163-P},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandtCM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bshouty92,
author = {Nader H. Bshouty},
title = {A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial},
journal = {Inf. Process. Lett.},
volume = {41},
number = {6},
pages = {321--326},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90159-S},
doi = {10.1016/0020-0190(92)90159-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bshouty92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Buss92,
author = {Samuel R. Buss},
title = {The Graph of Multiplication is Equivalent to Counting},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {199--201},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90180-4},
doi = {10.1016/0020-0190(92)90180-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Buss92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CarsonNV92,
author = {Scott D. Carson and
Vivek Nirkhe and
Paul Vongsathorn},
title = {A Discrete-State Model of the Two-Headed Disk},
journal = {Inf. Process. Lett.},
volume = {41},
number = {6},
pages = {341--345},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90162-O},
doi = {10.1016/0020-0190(92)90162-O},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CarsonNV92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangL92,
author = {Ruei Chuan Chang and
Hsuan{-}Shih Lee},
title = {Finding a Maximum Set of Independent Chords in a Circle},
journal = {Inf. Process. Lett.},
volume = {41},
number = {2},
pages = {99--102},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90262-T},
doi = {10.1016/0020-0190(92)90262-T},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChangL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenD92,
author = {Calvin Ching{-}Yuen Chen and
Sajal K. Das},
title = {Breadth-First Traversal of Trees and Integer Sorting in Parallel},
journal = {Inf. Process. Lett.},
volume = {41},
number = {1},
pages = {39--49},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90078-A},
doi = {10.1016/0020-0190(92)90078-A},
timestamp = {Tue, 10 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenD92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Clausen92,
author = {Michael Clausen},
title = {Almost all Boolean Functions Have no Linear Symmetries},
journal = {Inf. Process. Lett.},
volume = {41},
number = {6},
pages = {291--292},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90154-N},
doi = {10.1016/0020-0190(92)90154-N},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Clausen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dam92,
author = {Mads Dam},
title = {R-Generability, and Definability in Branching Time Logics},
journal = {Inf. Process. Lett.},
volume = {41},
number = {5},
pages = {281--287},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90173-S},
doi = {10.1016/0020-0190(92)90173-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Dam92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ErbasTA92,
author = {Cengiz Erbas and
Murat M. Tanik and
Zekeriya Aliyazicioglu},
title = {Linear Congruence Equations for the Solutions of the N-Queens Problem},
journal = {Inf. Process. Lett.},
volume = {41},
number = {6},
pages = {301--306},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90156-P},
doi = {10.1016/0020-0190(92)90156-P},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ErbasTA92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Esparza92,
author = {Javier Esparza},
title = {A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri
Nets Using Linear Programming},
journal = {Inf. Process. Lett.},
volume = {41},
number = {6},
pages = {313--319},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90158-R},
doi = {10.1016/0020-0190(92)90158-R},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Esparza92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Esseling92,
author = {Klaas Esseling},
title = {The Order of Appel's Algorithm},
journal = {Inf. Process. Lett.},
volume = {41},
number = {3},
pages = {141--147},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90043-U},
doi = {10.1016/0020-0190(92)90043-U},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Esseling92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gathen92,
author = {Joachim von zur Gathen},
title = {Processor-Efficient Exponentiation in Finite Fields},
journal = {Inf. Process. Lett.},
volume = {41},
number = {2},
pages = {81--86},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90259-X},
doi = {10.1016/0020-0190(92)90259-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gathen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gemignani92,
author = {Luca Gemignani},
title = {Fast Inversion of Hankel and Toeplitz Matrices},
journal = {Inf. Process. Lett.},
volume = {41},
number = {3},
pages = {119--123},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90039-X},
doi = {10.1016/0020-0190(92)90039-X},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gemignani92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoldmannH92,
author = {Mikael Goldmann and
Johan H{\aa}stad},
title = {A Simple Lower Bound for Monotone Clique Using a Communication Game},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {221--226},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90184-W},
doi = {10.1016/0020-0190(92)90184-W},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GoldmannH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GusfieldLS92,
author = {Dan Gusfield and
Gad M. Landau and
Baruch Schieber},
title = {An Efficient Algorithm for the All Pairs Suffix-Prefix Problem},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {181--185},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90176-V},
doi = {10.1016/0020-0190(92)90176-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GusfieldLS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HooverP92,
author = {Debra Hoover and
Joseph Poole},
title = {A Distributet Self-Stabilizing Solution to the Dining Philosophers
Problem},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {209--213},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90182-U},
doi = {10.1016/0020-0190(92)90182-U},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HooverP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangC92,
author = {Shing{-}Tsaan Huang and
Nian{-}Shing Chen},
title = {A Self-Stabilizing Algorithm for Constructing Breadth-First Trees},
journal = {Inf. Process. Lett.},
volume = {41},
number = {2},
pages = {109--117},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90264-V},
doi = {10.1016/0020-0190(92)90264-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HuangC92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jacob92,
author = {Jeremy Jacob},
title = {A Model of Reconfiguration in Communicating Sequential Processes with
a Notion of Transactions},
journal = {Inf. Process. Lett.},
volume = {41},
number = {1},
pages = {9--12},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90073-5},
doi = {10.1016/0020-0190(92)90073-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jacob92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jansen92,
author = {Klaus Jansen},
title = {An Approximation Algorithm for the General Routing Problem},
journal = {Inf. Process. Lett.},
volume = {41},
number = {6},
pages = {333--339},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90161-N},
doi = {10.1016/0020-0190(92)90161-N},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jansen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kamin92,
author = {Samuel N. Kamin},
title = {Head-Strictness is Not a Monotonic Abstract Property},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {195--198},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90179-Y},
doi = {10.1016/0020-0190(92)90179-Y},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kamin92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kirchherr92,
author = {Walter W. Kirchherr},
title = {Kolmogorov Complexity and Random Graphs},
journal = {Inf. Process. Lett.},
volume = {41},
number = {3},
pages = {125--130},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90040-3},
doi = {10.1016/0020-0190(92)90040-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kirchherr92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KoR92,
author = {Chun Wa Ko and
Frank Ruskey},
title = {Generating Permutations of a Bag by Interchanges},
journal = {Inf. Process. Lett.},
volume = {41},
number = {5},
pages = {263--269},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90170-Z},
doi = {10.1016/0020-0190(92)90170-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KoR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kobuchi92,
author = {Youichi Kobuchi},
title = {Order of State Functions and Logic Functions},
journal = {Inf. Process. Lett.},
volume = {41},
number = {2},
pages = {61--66},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90256-U},
doi = {10.1016/0020-0190(92)90256-U},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kobuchi92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LarsenSS92,
author = {Kim S. Larsen and
Michael I. Schwartzbach and
Erik Meineche Schmidt},
title = {A New Formalism for Relational Algebra},
journal = {Inf. Process. Lett.},
volume = {41},
number = {3},
pages = {163--168},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90047-Y},
doi = {10.1016/0020-0190(92)90047-Y},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LarsenSS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Leermakers92,
author = {Ren{\'{e}} Leermakers},
title = {A Recursive Ascent Earley Parser},
journal = {Inf. Process. Lett.},
volume = {41},
number = {2},
pages = {87--91},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90260-3},
doi = {10.1016/0020-0190(92)90260-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Leermakers92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lozinskii92,
author = {Eliezer L. Lozinskii},
title = {Counting Propositional Models},
journal = {Inf. Process. Lett.},
volume = {41},
number = {6},
pages = {327--332},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90160-W},
doi = {10.1016/0020-0190(92)90160-W},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lozinskii92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaNT92,
author = {Eva Ma and
Bhagirath Narahari and
Lixin Tao},
title = {Optimal Embedding of 2-D Torus Into Ring},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {227--231},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90185-X},
doi = {10.1016/0020-0190(92)90185-X},
timestamp = {Tue, 07 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MaNT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Miller92,
author = {L. L. Miller},
title = {Generating Hinges from Arbitrary Subhypergraphs},
journal = {Inf. Process. Lett.},
volume = {41},
number = {6},
pages = {307--312},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90157-Q},
doi = {10.1016/0020-0190(92)90157-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Miller92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Misra92,
author = {Jayadev Misra},
title = {Corrigenda: Phase Synchronization},
journal = {Inf. Process. Lett.},
volume = {41},
number = {1},
pages = {59},
year = {1992},
timestamp = {Mon, 29 Oct 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Misra92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MisraG92,
author = {Jayadev Misra and
David Gries},
title = {A Constructive Proof of Vizing's Theorem},
journal = {Inf. Process. Lett.},
volume = {41},
number = {3},
pages = {131--133},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90041-S},
doi = {10.1016/0020-0190(92)90041-S},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MisraG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Muller92,
author = {Fritz M{\"{u}}ller},
title = {Confluence of the Lambda Calculus with Left-Linear Algebraic Rewriting},
journal = {Inf. Process. Lett.},
volume = {41},
number = {6},
pages = {293--299},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90155-O},
doi = {10.1016/0020-0190(92)90155-O},
timestamp = {Fri, 23 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Muller92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Myoupo92,
author = {Jean Fr{\'{e}}d{\'{e}}ric Myoupo},
title = {Corrigenda: Dynamic Programming on Linear Pipelines},
journal = {Inf. Process. Lett.},
volume = {41},
number = {5},
pages = {289},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90174-T},
doi = {10.1016/0020-0190(92)90174-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Myoupo92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NarayanaswamiF92,
author = {Chandrasekhar Narayanaswami and
Wm. Randolph Franklin},
title = {Edge Intersection on the Hypercube Computer},
journal = {Inf. Process. Lett.},
volume = {41},
number = {5},
pages = {257--262},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90169-V},
doi = {10.1016/0020-0190(92)90169-V},
timestamp = {Fri, 29 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NarayanaswamiF92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pachl92,
author = {Jan K. Pachl},
title = {A Simple Proof of a Completeness Result for leads-to in the {UNITY}
Logic},
journal = {Inf. Process. Lett.},
volume = {41},
number = {1},
pages = {35--38},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90077-9},
doi = {10.1016/0020-0190(92)90077-9},
timestamp = {Sat, 24 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Pachl92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pavlu92,
author = {Petr Pavlu},
title = {On Efficient Implementation of LR-Attributed Grammars},
journal = {Inf. Process. Lett.},
volume = {41},
number = {2},
pages = {67--75},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90257-V},
doi = {10.1016/0020-0190(92)90257-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pavlu92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Radhakrishnan92,
author = {Jaikumar Radhakrishnan},
title = {Improved Bounds for Covering Complete Uniform Hypergraphs},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {203--207},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90181-T},
doi = {10.1016/0020-0190(92)90181-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Radhakrishnan92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rajcani92,
author = {Peter Rajc{\'{a}}ni},
title = {Optimal Parallel 3-Coloring Algorithm for Rooted Trees and its Applications},
journal = {Inf. Process. Lett.},
volume = {41},
number = {3},
pages = {153--156},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90045-W},
doi = {10.1016/0020-0190(92)90045-W},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rajcani92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RivinZ92,
author = {Igor Rivin and
Ramin Zabih},
title = {A Dynamic Programming Solution to the n-Queens Problem},
journal = {Inf. Process. Lett.},
volume = {41},
number = {5},
pages = {253--256},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90168-U},
doi = {10.1016/0020-0190(92)90168-U},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RivinZ92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RoteW92,
author = {G{\"{u}}nter Rote and
Gerhard J. Woeginger},
title = {Counting Convex k-Gons in Planar Point Sets},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {191--194},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90178-X},
doi = {10.1016/0020-0190(92)90178-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RoteW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shermer92,
author = {Thomas C. Shermer},
title = {A Linear Algorithm for Bisecting a Polygon},
journal = {Inf. Process. Lett.},
volume = {41},
number = {3},
pages = {135--140},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90042-T},
doi = {10.1016/0020-0190(92)90042-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shermer92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shoudai92,
author = {Takayoshi Shoudai},
title = {A P-Complete Language Describable with Iterated Shuffle},
journal = {Inf. Process. Lett.},
volume = {41},
number = {5},
pages = {233--238},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90165-R},
doi = {10.1016/0020-0190(92)90165-R},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shoudai92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SrimaniR92,
author = {Pradip K. Srimani and
Rachamallu L. N. Reddy},
title = {Another Distributed Algorithm for Multiple Entries to a Critical Section},
journal = {Inf. Process. Lett.},
volume = {41},
number = {1},
pages = {51--57},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90079-B},
doi = {10.1016/0020-0190(92)90079-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SrimaniR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/StottsG92,
author = {P. David Stotts and
Parke Godfrey},
title = {Place/Transition Nets with Debit Arcs},
journal = {Inf. Process. Lett.},
volume = {41},
number = {1},
pages = {25--33},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90076-8},
doi = {10.1016/0020-0190(92)90076-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/StottsG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Szalas92,
author = {Andrzej Szalas},
title = {Axiomatizing Fixpoint Logics},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {175--180},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90175-U},
doi = {10.1016/0020-0190(92)90175-U},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Szalas92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/UrrutiaG92,
author = {Jorge Urrutia and
Fanica Gavril},
title = {An Algorithm for Fraternal Orientation of Graphs},
journal = {Inf. Process. Lett.},
volume = {41},
number = {5},
pages = {271--274},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90171-Q},
doi = {10.1016/0020-0190(92)90171-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/UrrutiaG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Verma92,
author = {Rakesh M. Verma},
title = {Strings, Trees, and Patterns},
journal = {Inf. Process. Lett.},
volume = {41},
number = {3},
pages = {157--161},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90046-X},
doi = {10.1016/0020-0190(92)90046-X},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Verma92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WadaLK92,
author = {Koichi Wada and
Yupin Luo and
Kimio Kawaguchi},
title = {Optimal Fault-Tolerant Routings for Connected Graphs},
journal = {Inf. Process. Lett.},
volume = {41},
number = {3},
pages = {169--174},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90048-Z},
doi = {10.1016/0020-0190(92)90048-Z},
timestamp = {Mon, 22 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WadaLK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wang92,
author = {Guorong Wang},
title = {An Improved Parallel Algorithm for Computing the Generalized Inverse
{A+}},
journal = {Inf. Process. Lett.},
volume = {41},
number = {5},
pages = {243--251},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90167-T},
doi = {10.1016/0020-0190(92)90167-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wang92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Whaley92,
author = {Tom Whaley},
title = {Alternative Developments of Cyclic-Permutation Algorithms},
journal = {Inf. Process. Lett.},
volume = {41},
number = {5},
pages = {239--241},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90166-S},
doi = {10.1016/0020-0190(92)90166-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Whaley92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuT92,
author = {L. C. Wu and
C. Y. Tang},
title = {Solving the Satisfiability Problem by Using Randomized Approach},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {187--190},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90177-W},
doi = {10.1016/0020-0190(92)90177-W},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yao92,
author = {Xin Yao},
title = {Finding Approximate Solutions to NP-Hard Problems by Neural Networks
is Hard},
journal = {Inf. Process. Lett.},
volume = {41},
number = {2},
pages = {93--98},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90261-S},
doi = {10.1016/0020-0190(92)90261-S},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yao92.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-04-19 12:20 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:
