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/ipl51.bht:"
download as .bib file
@article{DBLP:journals/ipl/Acciaro94,
author = {Vincenzo Acciaro},
title = {On the Complexity of Computing Gr{\"{o}}bner Bases in Characteristic
2},
journal = {Inf. Process. Lett.},
volume = {51},
number = {6},
pages = {321--323},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00106-5},
doi = {10.1016/0020-0190(94)00106-5},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Acciaro94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Albacea94,
author = {Eliezer A. Albacea},
title = {Parallel Algorithm for Finding a Core of a Tree Network},
journal = {Inf. Process. Lett.},
volume = {51},
number = {5},
pages = {223--226},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00102-2},
doi = {10.1016/0020-0190(94)00102-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Albacea94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Allison94,
author = {Lloyd Allison},
title = {Using Hirschberg's Algorithm to Generate Random Alignments of Strings},
journal = {Inf. Process. Lett.},
volume = {51},
number = {5},
pages = {251--255},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90004-3},
doi = {10.1016/0020-0190(94)90004-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Allison94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BapirajuR94,
author = {Bapiraju Vinnakota and
V. V. Bapeswara Rao},
title = {Enumeration of Binary Trees},
journal = {Inf. Process. Lett.},
volume = {51},
number = {3},
pages = {125--127},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00083-2},
doi = {10.1016/0020-0190(94)00083-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BapirajuR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarthR94,
author = {Dominique Barth and
Andr{\'{e}} Raspaud},
title = {Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph},
journal = {Inf. Process. Lett.},
volume = {51},
number = {4},
pages = {175--179},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00087-5},
doi = {10.1016/0020-0190(94)00087-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BarthR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Basin94,
author = {David A. Basin},
title = {A Term Equality Problem Equivalent to Graph Isomorphism},
journal = {Inf. Process. Lett.},
volume = {51},
number = {2},
pages = {61--66},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00084-0},
doi = {10.1016/0020-0190(94)00084-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Basin94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BilardiCDM94,
author = {Gianfranco Bilardi and
Shiva Chaudhuri and
Devdatt P. Dubhashi and
Kurt Mehlhorn},
title = {A Lower Bound for Area-Universal Graphs},
journal = {Inf. Process. Lett.},
volume = {51},
number = {2},
pages = {101--105},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00070-0},
doi = {10.1016/0020-0190(94)00070-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BilardiCDM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Blackburn94,
author = {Simon R. Blackburn},
title = {Increasing the Rate of Output of m-Sequences},
journal = {Inf. Process. Lett.},
volume = {51},
number = {2},
pages = {73--77},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00067-0},
doi = {10.1016/0020-0190(94)00067-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Blackburn94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlumR94,
author = {Norbert Blum and
Henning Rochow},
title = {A Lower Bound on the Single-Operation Worst-Case Time Complexity of
the Union-Find Problem on Intervals},
journal = {Inf. Process. Lett.},
volume = {51},
number = {2},
pages = {57--60},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00082-4},
doi = {10.1016/0020-0190(94)00082-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BlumR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chandra94,
author = {Barun Chandra},
title = {Constructing Sparse Spanners for Most Graphs in Higher Dimensions},
journal = {Inf. Process. Lett.},
volume = {51},
number = {6},
pages = {289--294},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00104-9},
doi = {10.1016/0020-0190(94)00104-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chandra94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenC94,
author = {Ling Chen and
Henry Y. H. Chuang},
title = {A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image},
journal = {Inf. Process. Lett.},
volume = {51},
number = {1},
pages = {25--29},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00062-X},
doi = {10.1016/0020-0190(94)00062-X},
timestamp = {Tue, 14 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChenC94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenM94,
author = {Peng Chen and
Shigeru Masuyama},
title = {On the Equivalence in Complexity Among Three Computation Problems
on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph},
journal = {Inf. Process. Lett.},
volume = {51},
number = {4},
pages = {195--199},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00076-X},
doi = {10.1016/0020-0190(94)00076-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenN94,
author = {Wen{-}Chin Chen and
Wen{-}Chun Ni},
title = {Internal Path Length of the Binary Representation of Heap-Ordered
Trees},
journal = {Inf. Process. Lett.},
volume = {51},
number = {3},
pages = {129--132},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00081-6},
doi = {10.1016/0020-0190(94)00081-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenN94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenVW94,
author = {Bo Chen and
Andr{\'{e}} van Vliet and
Gerhard J. Woeginger},
title = {A Lower Bound for Randomized On-Line Scheduling Algorithms},
journal = {Inf. Process. Lett.},
volume = {51},
number = {5},
pages = {219--222},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00110-3},
doi = {10.1016/0020-0190(94)00110-3},
timestamp = {Wed, 21 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChenVW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DeinekoDR94,
author = {Vladimir G. Deineko and
Ren{\'{e}} van Dal and
G{\"{u}}nter Rote},
title = {The Convex-Hull-and-Line Traveling Salesman Problem: {A} Solvable
Case},
journal = {Inf. Process. Lett.},
volume = {51},
number = {3},
pages = {141--148},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00071-9},
doi = {10.1016/0020-0190(94)00071-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DeinekoDR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DeyS94,
author = {Tamal K. Dey and
Nimish R. Shah},
title = {Many-Face Complexity in Incremental Convex Arrangements},
journal = {Inf. Process. Lett.},
volume = {51},
number = {5},
pages = {227--231},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00098-0},
doi = {10.1016/0020-0190(94)00098-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DeyS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DiksKKMP94,
author = {Krzysztof Diks and
Evangelos Kranakis and
Danny Krizanc and
Bernard Mans and
Andrzej Pelc},
title = {Optimal Coteries and Voting Schemes},
journal = {Inf. Process. Lett.},
volume = {51},
number = {1},
pages = {1--6},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00064-6},
doi = {10.1016/0020-0190(94)00064-6},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DiksKKMP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EaswarakumarRC94,
author = {K. S. Easwarakumar and
C. Pandu Rangan and
Grant A. Cheston},
title = {A Linear Algorithm for Centering a Spanning Tree of a Biconnected
Graph},
journal = {Inf. Process. Lett.},
volume = {51},
number = {3},
pages = {121--124},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00066-2},
doi = {10.1016/0020-0190(94)00066-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EaswarakumarRC94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Eppstein94,
author = {David Eppstein},
title = {Arboricity and Bipartite Subgraph Listing Algorithms},
journal = {Inf. Process. Lett.},
volume = {51},
number = {4},
pages = {207--211},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90121-X},
doi = {10.1016/0020-0190(94)90121-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Eppstein94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FischerH94,
author = {Paul Fischer and
Klaus{-}Uwe H{\"{o}}ffgen},
title = {Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon},
journal = {Inf. Process. Lett.},
volume = {51},
number = {4},
pages = {189--193},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00079-4},
doi = {10.1016/0020-0190(94)00079-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FischerH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FrazierP94,
author = {Michael Frazier and
C. David Page Jr.},
title = {Prefix Grammars: An Alternative Characterization of the Regular Languages},
journal = {Inf. Process. Lett.},
volume = {51},
number = {2},
pages = {67--71},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00074-3},
doi = {10.1016/0020-0190(94)00074-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FrazierP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gergov94,
author = {Jordan Gergov},
title = {Time-Space Tradeoffs for Integer Multiplication on Various Types of
Input Oblivious Sequential Machines},
journal = {Inf. Process. Lett.},
volume = {51},
number = {5},
pages = {265--269},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00094-8},
doi = {10.1016/0020-0190(94)00094-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gergov94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GilM94,
author = {Joseph Gil and
Yossi Matias},
title = {Designing Algorithms by Expectations},
journal = {Inf. Process. Lett.},
volume = {51},
number = {1},
pages = {31--34},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00052-2},
doi = {10.1016/0020-0190(94)00052-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GilM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gusfield94,
author = {Dan Gusfield},
title = {Faster Implementation of a Shortest Superstring Approximation},
journal = {Inf. Process. Lett.},
volume = {51},
number = {5},
pages = {271--274},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00097-2},
doi = {10.1016/0020-0190(94)00097-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gusfield94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HalperinS94,
author = {Dan Halperin and
Micha Sharir},
title = {On Disjoint Concave Chains in Arrangements of (Pseudo) Lines},
journal = {Inf. Process. Lett.},
volume = {51},
number = {1},
pages = {53--56},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00057-3},
doi = {10.1016/0020-0190(94)00057-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HalperinS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Harper94,
author = {Robert Harper},
title = {A Simplified Account of Polymorphic References},
journal = {Inf. Process. Lett.},
volume = {51},
number = {4},
pages = {201--206},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90120-1},
doi = {10.1016/0020-0190(94)90120-1},
timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Harper94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HassinR94,
author = {Refael Hassin and
Shlomi Rubinstein},
title = {Approximations for the Maximum Acyclic Subgraph Problem},
journal = {Inf. Process. Lett.},
volume = {51},
number = {3},
pages = {133--140},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00086-7},
doi = {10.1016/0020-0190(94)00086-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HassinR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hemaspaandra94,
author = {Edith Hemaspaandra},
title = {Census Techniques Collapse Space Classes},
journal = {Inf. Process. Lett.},
volume = {51},
number = {2},
pages = {79--84},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00059-X},
doi = {10.1016/0020-0190(94)00059-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hemaspaandra94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hofri94,
author = {Micha Hofri},
title = {On Timeout for Global Deadlock Detection in Decentralized Database
Systems},
journal = {Inf. Process. Lett.},
volume = {51},
number = {6},
pages = {295--302},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(90)00107-K},
doi = {10.1016/0020-0190(90)00107-K},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hofri94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuCH94,
author = {Xiao{-}Dong Hu and
P. D. Chen and
Frank K. Hwang},
title = {A New Competitive Algorithm for the Counterfeit Coin Problem},
journal = {Inf. Process. Lett.},
volume = {51},
number = {4},
pages = {213--218},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90122-8},
doi = {10.1016/0020-0190(94)90122-8},
timestamp = {Tue, 10 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HuCH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HungP94,
author = {Ching Yu Hung and
Behrooz Parhami},
title = {Fast {RNS} Division Algorithms for Fixed Divisors with Application
to {RSA} Encrytion},
journal = {Inf. Process. Lett.},
volume = {51},
number = {4},
pages = {163--169},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00099-9},
doi = {10.1016/0020-0190(94)00099-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HungP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IgarashiOU94,
author = {Yoshihide Igarashi and
Shingo Osawa and
Walter Unger},
title = {Automorphisms of Broadcasting Schemes with Respect to Start Rounds},
journal = {Inf. Process. Lett.},
volume = {51},
number = {1},
pages = {35--41},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00063-8},
doi = {10.1016/0020-0190(94)00063-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IgarashiOU94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jerrum94,
author = {Mark Jerrum},
title = {Counting Trees in a Graph is {\#}P-Complete},
journal = {Inf. Process. Lett.},
volume = {51},
number = {3},
pages = {111--116},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00085-9},
doi = {10.1016/0020-0190(94)00085-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Jerrum94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JimboM94a,
author = {Shuji Jimbo and
Akira Maruoka},
title = {On the Relationship Between varepsilon-Biased Random Variables and
varepsilon-Dependent Random Variables},
journal = {Inf. Process. Lett.},
volume = {51},
number = {1},
pages = {17--23},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00061-1},
doi = {10.1016/0020-0190(94)00061-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JimboM94a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JwoT94,
author = {Jung{-}Sing Jwo and
Tai{-}Ching Tuan},
title = {On Transmitting Delay in a Distance-Transitive Strongly Antipodal
Graph},
journal = {Inf. Process. Lett.},
volume = {51},
number = {5},
pages = {233--235},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00105-7},
doi = {10.1016/0020-0190(94)00105-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JwoT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kirrinnis94,
author = {Peter Kirrinnis},
title = {An Optimal Bound for Path Weights in Huffman Trees},
journal = {Inf. Process. Lett.},
volume = {51},
number = {2},
pages = {107--110},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00069-7},
doi = {10.1016/0020-0190(94)00069-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kirrinnis94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kuzjurin94,
author = {Nikolai N. Kuzjurin},
title = {Multi-Processor Scheduling and Expanders},
journal = {Inf. Process. Lett.},
volume = {51},
number = {6},
pages = {315--319},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00101-4},
doi = {10.1016/0020-0190(94)00101-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kuzjurin94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeC94,
author = {Eun{-}Jung Lee and
Kwang{-}Moo Choe},
title = {Grammar Coverings of a Deterministic Parser with Action Conflicts},
journal = {Inf. Process. Lett.},
volume = {51},
number = {2},
pages = {85--92},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00078-6},
doi = {10.1016/0020-0190(94)00078-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeC94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Long94,
author = {Philip M. Long},
title = {Halfspace Learning, Linear Programming, and Nonmalicious Distributions},
journal = {Inf. Process. Lett.},
volume = {51},
number = {5},
pages = {245--250},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90003-5},
doi = {10.1016/0020-0190(94)90003-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Long94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lopez-Ortiz94,
author = {Alejandro L{\'{o}}pez{-}Ortiz},
title = {New Lower Bounds for Element Distinctness on a On-Tape Turing Machine},
journal = {Inf. Process. Lett.},
volume = {51},
number = {6},
pages = {311--314},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00111-1},
doi = {10.1016/0020-0190(94)00111-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lopez-Ortiz94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuCW94,
author = {Erl{-}Huei Lu and
Yi{-}Chang Chen and
Hsiao{-}Peng Wuu},
title = {A Complete Decoding Algorithm for Double-Error-Correcting Primitive
Binary {BCH} Codes of Odd m},
journal = {Inf. Process. Lett.},
volume = {51},
number = {3},
pages = {117--120},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00077-8},
doi = {10.1016/0020-0190(94)00077-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuCW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lysne94,
author = {Olav Lysne},
title = {Extending Bachmair's Method for Proof by Consistency to the Final
Algebra},
journal = {Inf. Process. Lett.},
volume = {51},
number = {6},
pages = {303--310},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00109-X},
doi = {10.1016/0020-0190(94)00109-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lysne94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MahajanTV94,
author = {Meena Mahajan and
Thomas Thierauf and
N. V. Vinodchandran},
title = {A Note on SpanP Functions},
journal = {Inf. Process. Lett.},
volume = {51},
number = {1},
pages = {7--10},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00068-9},
doi = {10.1016/0020-0190(94)00068-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MahajanTV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamalingamR94,
author = {G. Ramalingam and
Thomas W. Reps},
title = {On Competitive On-Line Algorithms for the Dynamic Priority-Ordering
Problem},
journal = {Inf. Process. Lett.},
volume = {51},
number = {3},
pages = {155--161},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00080-8},
doi = {10.1016/0020-0190(94)00080-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RamalingamR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RaspaudS94,
author = {Andr{\'{e}} Raspaud and
{\'{E}}ric Sopena},
title = {Good and Semi-Strong Colorings of Oriented Planar Graphs},
journal = {Inf. Process. Lett.},
volume = {51},
number = {4},
pages = {171--174},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00088-3},
doi = {10.1016/0020-0190(94)00088-3},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RaspaudS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Raz94,
author = {Yoav Raz},
title = {Serializability by Commitment Ordering},
journal = {Inf. Process. Lett.},
volume = {51},
number = {5},
pages = {257--264},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90005-1},
doi = {10.1016/0020-0190(94)90005-1},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Raz94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SeidenH94,
author = {Steven S. Seiden and
Daniel S. Hirschberg},
title = {Finding Succinct Ordered Minimal Perfect Hash Functions},
journal = {Inf. Process. Lett.},
volume = {51},
number = {6},
pages = {283--288},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00108-1},
doi = {10.1016/0020-0190(94)00108-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SeidenH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SenguptaV94,
author = {Abhijit Sengupta and
Suresh Viswanathan},
title = {On Fault-Tolerant Fixed Routing in Hypercubes},
journal = {Inf. Process. Lett.},
volume = {51},
number = {2},
pages = {93--99},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00075-1},
doi = {10.1016/0020-0190(94)00075-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SenguptaV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShenHL94,
author = {Xiaojun Shen and
Qing Hu and
Weifa Liang},
title = {Realization of an Arbitrary Permutation on a Hypercube},
journal = {Inf. Process. Lett.},
volume = {51},
number = {5},
pages = {237--243},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90002-7},
doi = {10.1016/0020-0190(94)90002-7},
timestamp = {Thu, 22 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ShenHL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sinachopoulos94,
author = {Antonia Sinachopoulos},
title = {Logics and Decidability for Labelled Pre- and Partially Ordered Kripke
Structures},
journal = {Inf. Process. Lett.},
volume = {51},
number = {1},
pages = {43--52},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00065-4},
doi = {10.1016/0020-0190(94)00065-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sinachopoulos94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SridharanSCK94,
author = {K. Sridharan and
Harry E. Stephanou and
K. C. Craig and
S. Sathiya Keerthi},
title = {Distance Measures on Intersecting Objects and Their Applications},
journal = {Inf. Process. Lett.},
volume = {51},
number = {4},
pages = {181--188},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00092-1},
doi = {10.1016/0020-0190(94)00092-1},
timestamp = {Wed, 07 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SridharanSCK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SzwarcfiterC94,
author = {Jayme Luiz Szwarcfiter and
Guy Chaty},
title = {Enumerating the Kernels of a Directed Graph with no Odd Circuits},
journal = {Inf. Process. Lett.},
volume = {51},
number = {3},
pages = {149--153},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00072-7},
doi = {10.1016/0020-0190(94)00072-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SzwarcfiterC94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TsaiTC94,
author = {Ying The Tsai and
Chuan Yi Tang and
Yunn Yen Chen},
title = {Average Performance of a Greedy Algorithm for the On-Line Minimum
Matching Problem on Euclidean Space},
journal = {Inf. Process. Lett.},
volume = {51},
number = {6},
pages = {275--282},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00116-2},
doi = {10.1016/0020-0190(94)00116-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TsaiTC94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wen94,
author = {Zhaofang Wen},
title = {New Algorithms for the {LCA} Problem and the Binary Tree Reconstruction
Problem},
journal = {Inf. Process. Lett.},
volume = {51},
number = {1},
pages = {11--16},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00058-1},
doi = {10.1016/0020-0190(94)00058-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wen94.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-27 01:03 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:
