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/ipl48.bht:"
download as .bib file
@article{DBLP:journals/ipl/Ahuja93,
author = {Mohan Ahuja},
title = {Assertions About Past and Future in Highways: Global Flush Broadcast
and Flush-Vector-Time},
journal = {Inf. Process. Lett.},
volume = {48},
number = {1},
pages = {21--28},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90263-9},
doi = {10.1016/0020-0190(93)90263-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ahuja93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtkinsonW93,
author = {M. D. Atkinson and
Louise Walker},
title = {Enumerating k-Way Trees},
journal = {Inf. Process. Lett.},
volume = {48},
number = {2},
pages = {73--75},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90180-H},
doi = {10.1016/0020-0190(93)90180-H},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtkinsonW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BennaceurP93,
author = {Hachemi Bennaceur and
G{\'{e}}rard Plateau},
title = {An Exact Algorithm for the Constraint Satisfaction Problem: Application
to Logical Inference},
journal = {Inf. Process. Lett.},
volume = {48},
number = {3},
pages = {151--158},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90258-B},
doi = {10.1016/0020-0190(93)90258-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BennaceurP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Billionnet93,
author = {Alain Billionnet},
title = {Partitioning Multiple-Chain-Like Task Across a Host-Satellite System},
journal = {Inf. Process. Lett.},
volume = {48},
number = {5},
pages = {261--266},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90089-R},
doi = {10.1016/0020-0190(93)90089-R},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Billionnet93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BuchsbaumC93,
author = {Adam L. Buchsbaum and
Martin C. Carlisle},
title = {Determining Uni-Connectivity in Directed Graphs},
journal = {Inf. Process. Lett.},
volume = {48},
number = {1},
pages = {9--12},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90261-7},
doi = {10.1016/0020-0190(93)90261-7},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BuchsbaumC93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BuhrmanTB93,
author = {Harry Buhrman and
Leen Torenvliet and
Peter van Emde Boas},
title = {Twenty Questions to a P-Selector},
journal = {Inf. Process. Lett.},
volume = {48},
number = {4},
pages = {201--204},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90146-Z},
doi = {10.1016/0020-0190(93)90146-Z},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BuhrmanTB93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangL93,
author = {Maw{-}Shang Chang and
Yi{-}Chang Liu},
title = {Polynomial Algorithms for the Weighted Perfect Domination Problems
on Chordal Graphs and Split Graphs},
journal = {Inf. Process. Lett.},
volume = {48},
number = {4},
pages = {205--210},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90147-2},
doi = {10.1016/0020-0190(93)90147-2},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangWK93,
author = {Ee{-}Chien Chang and
Weiguo Wang and
Mohan S. Kankanhalli},
title = {Multidimensional On-Line Bin-Packing: An Algorithm and its Average-Case
Analysis},
journal = {Inf. Process. Lett.},
volume = {48},
number = {3},
pages = {121--125},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90253-6},
doi = {10.1016/0020-0190(93)90253-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChangWK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChinnS93,
author = {Donald D. Chinn and
Rakesh K. Sinha},
title = {Bounds on Sample Space Size for Matrix Product Verification},
journal = {Inf. Process. Lett.},
volume = {48},
number = {2},
pages = {87--91},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90183-A},
doi = {10.1016/0020-0190(93)90183-A},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChinnS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CulikK93,
author = {Karel Cul{\'{\i}}k II and
Jarkko Kari},
title = {Parametrized Recurrent Systems for Image Generation},
journal = {Inf. Process. Lett.},
volume = {48},
number = {6},
pages = {267--274},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90167-8},
doi = {10.1016/0020-0190(93)90167-8},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CulikK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dankelmann93,
author = {Peter Dankelmann},
title = {Computing the Average Distance of an Interval Graph},
journal = {Inf. Process. Lett.},
volume = {48},
number = {6},
pages = {311--314},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90174-8},
doi = {10.1016/0020-0190(93)90174-8},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Dankelmann93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FraigniaudKP93,
author = {Pierre Fraigniaud and
Claire Kenyon and
Andrzej Pelc},
title = {Finding a Target Subnetwork in Sparse Networks with Random Faults},
journal = {Inf. Process. Lett.},
volume = {48},
number = {6},
pages = {297--303},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90172-6},
doi = {10.1016/0020-0190(93)90172-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FraigniaudKP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FujitaY93,
author = {Satoshi Fujita and
Masafumi Yamashita},
title = {Fast Gossiping on Square Mesh Computers},
journal = {Inf. Process. Lett.},
volume = {48},
number = {3},
pages = {127--130},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90254-7},
doi = {10.1016/0020-0190(93)90254-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FujitaY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FulopG93,
author = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
P{\'{a}}l Gyenizse},
title = {On Injectivity of Deterministic Top-Down Tree Transducers},
journal = {Inf. Process. Lett.},
volume = {48},
number = {4},
pages = {183--188},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90143-W},
doi = {10.1016/0020-0190(93)90143-W},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FulopG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gartner93,
author = {Stefan G{\"{a}}rtner},
title = {A Remark on the Regulation of k1ET0L Systems},
journal = {Inf. Process. Lett.},
volume = {48},
number = {2},
pages = {83--85},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90182-9},
doi = {10.1016/0020-0190(93)90182-9},
timestamp = {Tue, 26 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Gartner93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoldschmidtHY93,
author = {Olivier Goldschmidt and
Dorit S. Hochbaum and
Gang Yu},
title = {A Modified Greedy Heuristic for the Set Covering Problem with Improved
Worst Case Bound},
journal = {Inf. Process. Lett.},
volume = {48},
number = {6},
pages = {305--310},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90173-7},
doi = {10.1016/0020-0190(93)90173-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoldschmidtHY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GolinD93,
author = {Mordecai J. Golin and
Robert Sedgewick},
title = {Queue-Mergesort},
journal = {Inf. Process. Lett.},
volume = {48},
number = {5},
pages = {253--259},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90088-Q},
doi = {10.1016/0020-0190(93)90088-Q},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GolinD93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrinsteadSSH93,
author = {Dana L. Grinstead and
Peter J. Slater and
Naveed A. Sherwani and
Nancy D. Holmes},
title = {Efficient Edge Domination Problems in Graphs},
journal = {Inf. Process. Lett.},
volume = {48},
number = {5},
pages = {221--228},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90084-M},
doi = {10.1016/0020-0190(93)90084-M},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrinsteadSSH93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gupta93,
author = {Sanjay Gupta},
title = {On Bounded-Probability Operators and C=P},
journal = {Inf. Process. Lett.},
volume = {48},
number = {2},
pages = {93--98},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90184-B},
doi = {10.1016/0020-0190(93)90184-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gupta93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hachem93,
author = {Nabil I. Hachem},
title = {An Approximate Analysis of the Performance of Extendible Hashing with
Elastic Buckets},
journal = {Inf. Process. Lett.},
volume = {48},
number = {1},
pages = {13--20},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90262-8},
doi = {10.1016/0020-0190(93)90262-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hachem93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hall93,
author = {Cordelia V. Hall},
title = {Using Overloading to Express Distinctions Between Evaluators},
journal = {Inf. Process. Lett.},
volume = {48},
number = {1},
pages = {1--8},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90260-G},
doi = {10.1016/0020-0190(93)90260-G},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hall93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HensgenSC93,
author = {Debra A. Hensgen and
David L. Sims and
David Charley},
title = {A Fair Banker's Algorithm for Read and Write Locks},
journal = {Inf. Process. Lett.},
volume = {48},
number = {3},
pages = {131--137},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90255-8},
doi = {10.1016/0020-0190(93)90255-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HensgenSC93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoLW93,
author = {Kevin I.{-}J. Ho and
Joseph Y.{-}T. Leung and
W.{-}D. Wei},
title = {Complexity of Scheduling Tasks with Time-Dependent Execution Times},
journal = {Inf. Process. Lett.},
volume = {48},
number = {6},
pages = {315--320},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90175-9},
doi = {10.1016/0020-0190(93)90175-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HoLW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hwang93,
author = {Tzonelih Hwang},
title = {Scheme for Secure Digital Mobile Communications Based on Symmetric
Key Cryptography},
journal = {Inf. Process. Lett.},
volume = {48},
number = {1},
pages = {35--37},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90265-B},
doi = {10.1016/0020-0190(93)90265-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hwang93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/InoueITY93,
author = {Katsushi Inoue and
Akira Ito and
Itsuo Takanami and
Tsunehiro Yoshinaga},
title = {A Note on Multi-Inkdot Nondeterministic Turing Machines with Small
Space},
journal = {Inf. Process. Lett.},
volume = {48},
number = {6},
pages = {285--288},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90170-E},
doi = {10.1016/0020-0190(93)90170-E},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/InoueITY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IwanoK93,
author = {Kazuo Iwano and
Naoki Katoh},
title = {Efficient Algorithms for Finding the Most Vital Edge of a Minimum
Spanning Tree},
journal = {Inf. Process. Lett.},
volume = {48},
number = {5},
pages = {211--213},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90082-K},
doi = {10.1016/0020-0190(93)90082-K},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IwanoK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JohnsonH93,
author = {Theodore Johnson and
Krishna Harathi},
title = {A Simple Correctness Proof of the {MCS} Contention-Free Lock},
journal = {Inf. Process. Lett.},
volume = {48},
number = {5},
pages = {215--220},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90083-L},
doi = {10.1016/0020-0190(93)90083-L},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JohnsonH93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Karloff93,
author = {Howard J. Karloff},
title = {Fast Algorithms for Approximately Counting Mismatches},
journal = {Inf. Process. Lett.},
volume = {48},
number = {2},
pages = {53--60},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90177-B},
doi = {10.1016/0020-0190(93)90177-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Karloff93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KavrakiLW93,
author = {Lydia E. Kavraki and
Jean{-}Claude Latombe and
Randall H. Wilson},
title = {On the Complexity of Assembly Partitioning},
journal = {Inf. Process. Lett.},
volume = {48},
number = {5},
pages = {229--235},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90085-N},
doi = {10.1016/0020-0190(93)90085-N},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KavrakiLW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Khoong93,
author = {C. M. Khoong},
title = {Optimal Parallel Construction of Heaps},
journal = {Inf. Process. Lett.},
volume = {48},
number = {4},
pages = {159--161},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90139-Z},
doi = {10.1016/0020-0190(93)90139-Z},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Khoong93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeCH93,
author = {DongGill Lee and
Kwang{-}Moo Choe and
Taisook Han},
title = {A Description of Dynamic Behavior for Compilers Based on Object Oriented
Modeling},
journal = {Inf. Process. Lett.},
volume = {48},
number = {4},
pages = {163--170},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90140-5},
doi = {10.1016/0020-0190(93)90140-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeCH93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PatersonSSV93,
author = {Mike Paterson and
Heiko Schr{\"{o}}der and
Ondrej S{\'{y}}kora and
Imrich Vrto},
title = {A Short Proof of the Dilation of a Toroidal Mesh in a Path},
journal = {Inf. Process. Lett.},
volume = {48},
number = {4},
pages = {197--199},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90145-Y},
doi = {10.1016/0020-0190(93)90145-Y},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PatersonSSV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PillaipakkamnattR93,
author = {Krishnan Pillaipakkamnatt and
Vijay Raghavan},
title = {A Linear Time Equivalene Test for Read-Twice {DNF} Formulas},
journal = {Inf. Process. Lett.},
volume = {48},
number = {6},
pages = {289--295},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90171-5},
doi = {10.1016/0020-0190(93)90171-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PillaipakkamnattR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pretolani93,
author = {Daniele Pretolani},
title = {A Linear Time Algorithm for Unique Horn Satisfiability},
journal = {Inf. Process. Lett.},
volume = {48},
number = {2},
pages = {61--66},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90178-C},
doi = {10.1016/0020-0190(93)90178-C},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pretolani93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamaraoV93,
author = {K. V. S. Ramarao and
S. Venkatesan},
title = {The Lower Bounds on Distributed Shortest Paths},
journal = {Inf. Process. Lett.},
volume = {48},
number = {3},
pages = {145--149},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90257-A},
doi = {10.1016/0020-0190(93)90257-A},
timestamp = {Sun, 05 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RamaraoV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ReichweinF93,
author = {Georg Reichwein and
Jos{\'{e}} Luiz Fiadeiro},
title = {Models for the Substitution Axiom of {UNITY} Logic},
journal = {Inf. Process. Lett.},
volume = {48},
number = {4},
pages = {171--176},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90141-U},
doi = {10.1016/0020-0190(93)90141-U},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ReichweinF93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RodriguesU93,
author = {Marion Rodrigues and
Hasan Ural},
title = {Exact Solutions for the Construction of Optimal Length Test Sequences},
journal = {Inf. Process. Lett.},
volume = {48},
number = {6},
pages = {275--280},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90168-9},
doi = {10.1016/0020-0190(93)90168-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RodriguesU93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RouskovS93,
author = {Yordan Rouskov and
Pradip K. Srimani},
title = {Fault Diameter of Star Graphs},
journal = {Inf. Process. Lett.},
volume = {48},
number = {5},
pages = {243--251},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90087-P},
doi = {10.1016/0020-0190(93)90087-P},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RouskovS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SantosO93,
author = {Jorge Santos and
Javier Orozco},
title = {Rate Monotonic Scheduling in Hard Real-Time Systems},
journal = {Inf. Process. Lett.},
volume = {48},
number = {1},
pages = {39--45},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90266-C},
doi = {10.1016/0020-0190(93)90266-C},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SantosO93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shah93,
author = {Nimish R. Shah},
title = {A Parallel Algorithm for Constructing Projection Polyhedra},
journal = {Inf. Process. Lett.},
volume = {48},
number = {3},
pages = {113--119},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90252-5},
doi = {10.1016/0020-0190(93)90252-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shah93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SheuLC93,
author = {Jang{-}Ping Sheu and
Wen{-}Hwa Liaw and
Tzung{-}Shi Chen},
title = {A Broadcasting Algorithm in Star Graph Interconnection Networks},
journal = {Inf. Process. Lett.},
volume = {48},
number = {5},
pages = {237--241},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90086-O},
doi = {10.1016/0020-0190(93)90086-O},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SheuLC93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SielingW93,
author = {Detlef Sieling and
Ingo Wegener},
title = {Reduction of OBDDs in Linear Time},
journal = {Inf. Process. Lett.},
volume = {48},
number = {3},
pages = {139--144},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90256-9},
doi = {10.1016/0020-0190(93)90256-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SielingW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SteelW93,
author = {Mike A. Steel and
Tandy J. Warnow},
title = {Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree},
journal = {Inf. Process. Lett.},
volume = {48},
number = {2},
pages = {77--82},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90181-8},
doi = {10.1016/0020-0190(93)90181-8},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SteelW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TanL93,
author = {Kian{-}Lee Tan and
Hongjun Lu},
title = {On Resource Scheduling of Multi-Join Queries in Parallel Database
Systems},
journal = {Inf. Process. Lett.},
volume = {48},
number = {4},
pages = {189--195},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90144-X},
doi = {10.1016/0020-0190(93)90144-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TanL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TsaiT93,
author = {Ying Teh Tsai and
Chuan Yi Tang},
title = {The Competitiveness of Randomized Algorithms for On-Line Steiner Tree
and On-Line Spanning Tree Problems},
journal = {Inf. Process. Lett.},
volume = {48},
number = {4},
pages = {177--182},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90142-V},
doi = {10.1016/0020-0190(93)90142-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TsaiT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TschaCL93,
author = {Yeonghwan Tscha and
Yanghee Choi and
Kyoon Ha Lee},
title = {Rearrangeable Nonblocking Condition for Multi-log{\_}2 {N} Multiconnection
Networks},
journal = {Inf. Process. Lett.},
volume = {48},
number = {3},
pages = {107--112},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90251-4},
doi = {10.1016/0020-0190(93)90251-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TschaCL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VincentS93,
author = {Millist W. Vincent and
Bala Srinivasan},
title = {A Note on Relation Schemes which are in 3NF but not in {BCNF}},
journal = {Inf. Process. Lett.},
volume = {48},
number = {6},
pages = {281--283},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90169-A},
doi = {10.1016/0020-0190(93)90169-A},
timestamp = {Sun, 05 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/VincentS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Voss93,
author = {Stefan Vo{\ss}},
title = {Worst-Case Performance of Some Heuristics for Steiner's Problem in
Directed Graphs},
journal = {Inf. Process. Lett.},
volume = {48},
number = {2},
pages = {99--105},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90185-C},
doi = {10.1016/0020-0190(93)90185-C},
timestamp = {Wed, 14 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Voss93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yang93a,
author = {Wuu Yang},
title = {An Incremental {LL(1)} Parsing Algorithm},
journal = {Inf. Process. Lett.},
volume = {48},
number = {2},
pages = {67--72},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90179-D},
doi = {10.1016/0020-0190(93)90179-D},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yang93a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YellingJ93,
author = {Daniel M. Yellin and
Charanjit S. Jutla},
title = {Finding Extremal Sets in Less than Quadratic Time},
journal = {Inf. Process. Lett.},
volume = {48},
number = {1},
pages = {29--34},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90264-A},
doi = {10.1016/0020-0190(93)90264-A},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YellingJ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuY93a,
author = {Ming{-}Shing Yu and
Cheng{-}Hsing Yang},
title = {A Simple Optimal Parallel Algorithm for the Minimum Coloring Problem
on Interval Graphs},
journal = {Inf. Process. Lett.},
volume = {48},
number = {1},
pages = {47--51},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90267-D},
doi = {10.1016/0020-0190(93)90267-D},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YuY93a.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-31 18:40 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:
