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/ipl92.bht:"
download as .bib file
@article{DBLP:journals/ipl/AggarwalW04,
author = {Alok Aggarwal and
Youngcheul Wee},
title = {On the symmetric angle-restricted nearest neighbor problem},
journal = {Inf. Process. Lett.},
volume = {92},
number = {3},
pages = {121--126},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.07.003},
doi = {10.1016/J.IPL.2004.07.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AggarwalW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AusielloDLP04,
author = {Giorgio Ausiello and
Marc Demange and
Luigi Laura and
Vangelis Th. Paschos},
title = {Algorithms for the On-Line Quota Traveling Salesman Problem},
journal = {Inf. Process. Lett.},
volume = {92},
number = {2},
pages = {89--94},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.013},
doi = {10.1016/J.IPL.2004.06.013},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AusielloDLP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BertschN04,
author = {Eberhard Bertsch and
Mark{-}Jan Nederhof},
title = {Fast parallel recognition of {LR} language suffixes},
journal = {Inf. Process. Lett.},
volume = {92},
number = {5},
pages = {225--229},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.08.010},
doi = {10.1016/J.IPL.2004.08.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BertschN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BezerraC04,
author = {Byron L. D. Bezerra and
Francisco de A. T. de Carvalho},
title = {A symbolic approach for content-based information filtering},
journal = {Inf. Process. Lett.},
volume = {92},
number = {1},
pages = {45--52},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.003},
doi = {10.1016/J.IPL.2004.06.003},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BezerraC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ButmanEL04,
author = {Ayelet Butman and
Revital Eres and
Gad M. Landau},
title = {Scaled and permuted string matching},
journal = {Inf. Process. Lett.},
volume = {92},
number = {6},
pages = {293--297},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.09.002},
doi = {10.1016/J.IPL.2004.09.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ButmanEL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CaiT04,
author = {Jin{-}yi Cai and
Robert A. Threlfall},
title = {A note on quadratic residuosity and {UP}},
journal = {Inf. Process. Lett.},
volume = {92},
number = {3},
pages = {127--131},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.015},
doi = {10.1016/J.IPL.2004.06.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CaiT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CampeanuY04,
author = {Cezar C{\^{a}}mpeanu and
Sheng Yu},
title = {Pattern expressions and pattern automata},
journal = {Inf. Process. Lett.},
volume = {92},
number = {6},
pages = {267--274},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.09.007},
doi = {10.1016/J.IPL.2004.09.007},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CampeanuY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangKKC04,
author = {Ku{-}Young Chang and
Howon Kim and
Ju{-}Sung Kang and
Hyun Sook Cho},
title = {An extension of {TYT} algorithm for GF((2\emph{n})\emph{m}) using
precomputation},
journal = {Inf. Process. Lett.},
volume = {92},
number = {5},
pages = {231--234},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.08.009},
doi = {10.1016/J.IPL.2004.08.009},
timestamp = {Thu, 02 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChangKKC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangLHH04,
author = {Chung{-}Haw Chang and
Cheng{-}Kuan Lin and
Hua{-}Min Huang and
Lih{-}Hsing Hsu},
title = {The super laceability of the hypercubes},
journal = {Inf. Process. Lett.},
volume = {92},
number = {1},
pages = {15--21},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.006},
doi = {10.1016/J.IPL.2004.06.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangLHH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen04,
author = {Yu{-}Wei Chen},
title = {An enhanced recursive frequency splitting broadcasting algorithm for
near video-on-demand services},
journal = {Inf. Process. Lett.},
volume = {92},
number = {6},
pages = {299--302},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.09.010},
doi = {10.1016/J.IPL.2004.09.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cheung04,
author = {King Sing Cheung},
title = {New characterization for live and reversible augmented marked graphs},
journal = {Inf. Process. Lett.},
volume = {92},
number = {5},
pages = {239--243},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.05.018},
doi = {10.1016/J.IPL.2004.05.018},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cheung04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Curtis04,
author = {Sharon A. Curtis},
title = {Darts and hoopla board design},
journal = {Inf. Process. Lett.},
volume = {92},
number = {1},
pages = {53--56},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.005},
doi = {10.1016/J.IPL.2004.06.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Curtis04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Davie04,
author = {George Davie},
title = {Characterising the Martin-L{\"{o}}f random sequences using computably
enumerable sets of measure one},
journal = {Inf. Process. Lett.},
volume = {92},
number = {3},
pages = {157--160},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.016},
doi = {10.1016/J.IPL.2004.06.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Davie04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Doerr04,
author = {Benjamin Doerr},
title = {Global roundings of sequences},
journal = {Inf. Process. Lett.},
volume = {92},
number = {3},
pages = {113--116},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.07.002},
doi = {10.1016/J.IPL.2004.07.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Doerr04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DoughertyS04,
author = {Daniel J. Dougherty and
Stanley M. Selkow},
title = {The complexity of the certification of properties of Stable Marriage},
journal = {Inf. Process. Lett.},
volume = {92},
number = {6},
pages = {275--277},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.09.006},
doi = {10.1016/J.IPL.2004.09.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DoughertyS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Du04,
author = {Donglei Du},
title = {Optimal preemptive semi-online scheduling on two uniform processors},
journal = {Inf. Process. Lett.},
volume = {92},
number = {5},
pages = {219--223},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.09.003},
doi = {10.1016/J.IPL.2004.09.003},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Du04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/El-Qawasmeh04,
author = {Eyas El{-}Qawasmeh},
title = {Word prediction using a clustered optimal binary search tree},
journal = {Inf. Process. Lett.},
volume = {92},
number = {5},
pages = {257--265},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.08.006},
doi = {10.1016/J.IPL.2004.08.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/El-Qawasmeh04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Engebretsen04,
author = {Lars Engebretsen},
title = {Simplified tight analysis of Johnson's algorithm},
journal = {Inf. Process. Lett.},
volume = {92},
number = {4},
pages = {207--210},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.08.001},
doi = {10.1016/J.IPL.2004.08.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Engebretsen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FosseR04,
author = {S. Foss{\'{e}} and
Gw{\'{e}}na{\"{e}}l Richomme},
title = {Some characterizations of Parikh matrix equivalent binary words},
journal = {Inf. Process. Lett.},
volume = {92},
number = {2},
pages = {77--82},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.011},
doi = {10.1016/J.IPL.2004.06.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FosseR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hershberger04,
author = {John Hershberger},
title = {Kinetic collision detection with fast flight plan changes},
journal = {Inf. Process. Lett.},
volume = {92},
number = {6},
pages = {287--291},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.09.005},
doi = {10.1016/J.IPL.2004.09.005},
timestamp = {Wed, 03 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Hershberger04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IsaakN04,
author = {Garth Isaak and
Darren A. Narayan},
title = {A classification of tournaments having an acyclic tournament as a
minimum feedback arc set},
journal = {Inf. Process. Lett.},
volume = {92},
number = {3},
pages = {107--111},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.07.001},
doi = {10.1016/J.IPL.2004.07.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IsaakN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JeaCL04,
author = {Kuen{-}Fang Jea and
Ming{-}Yuan Chang and
Ke{-}Chung Lin},
title = {An efficient and flexible algorithm for online mining of large itemsets},
journal = {Inf. Process. Lett.},
volume = {92},
number = {6},
pages = {311--316},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.09.008},
doi = {10.1016/J.IPL.2004.09.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JeaCL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KangMCC04,
author = {Heum{-}Geun Kang and
Jun{-}Ki Min and
Seok{-}Ju Chun and
Chin{-}Wan Chung},
title = {A compression method for prefix-sum cubes},
journal = {Inf. Process. Lett.},
volume = {92},
number = {2},
pages = {99--105},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.05.008},
doi = {10.1016/J.IPL.2004.05.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KangMCC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kaser04,
author = {Owen Kaser},
title = {Compressing arrays by ordering attribute values},
journal = {Inf. Process. Lett.},
volume = {92},
number = {5},
pages = {253--256},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.08.003},
doi = {10.1016/J.IPL.2004.08.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kaser04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KashemR04,
author = {Mohammod Abul Kashem and
M. Ziaur Rahman},
title = {An optimal parallel algorithm for c-vertex-ranking of trees},
journal = {Inf. Process. Lett.},
volume = {92},
number = {4},
pages = {179--184},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.07.007},
doi = {10.1016/J.IPL.2004.07.007},
timestamp = {Tue, 07 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KashemR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Katriel04,
author = {Irit Katriel},
title = {On the algebraic complexity of set equality and inclusion},
journal = {Inf. Process. Lett.},
volume = {92},
number = {4},
pages = {175--178},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.07.006},
doi = {10.1016/J.IPL.2004.07.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Katriel04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KrasikovN04,
author = {Ilia Krasikov and
Steven D. Noble},
title = {Finding next-to-shortest paths in a graph},
journal = {Inf. Process. Lett.},
volume = {92},
number = {3},
pages = {117--119},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.020},
doi = {10.1016/J.IPL.2004.06.020},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KrasikovN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kurowski04,
author = {Maciej Kurowski},
title = {A 1.235 lower bound on the number of points needed to draw all \emph{n}-vertex
planar graphs},
journal = {Inf. Process. Lett.},
volume = {92},
number = {2},
pages = {95--98},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.009},
doi = {10.1016/J.IPL.2004.06.009},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kurowski04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lechtenborger04,
author = {Jens Lechtenb{\"{o}}rger},
title = {Computing unique canonical covers for simple FDs via transitive reduction},
journal = {Inf. Process. Lett.},
volume = {92},
number = {4},
pages = {169--174},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.07.005},
doi = {10.1016/J.IPL.2004.07.005},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lechtenborger04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LitowD04,
author = {Bruce E. Litow and
Narsingh Deo},
title = {Graph compression and the zeros of polynomials},
journal = {Inf. Process. Lett.},
volume = {92},
number = {1},
pages = {39--44},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.004},
doi = {10.1016/J.IPL.2004.06.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LitowD04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Liu04a,
author = {Ding Liu},
title = {A strong lower bound for approximate nearest neighbor searching},
journal = {Inf. Process. Lett.},
volume = {92},
number = {1},
pages = {23--29},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.001},
doi = {10.1016/J.IPL.2004.06.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Liu04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lutz04,
author = {Jack H. Lutz},
title = {Computability versus exact computability of martingales},
journal = {Inf. Process. Lett.},
volume = {92},
number = {5},
pages = {235--237},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.08.008},
doi = {10.1016/J.IPL.2004.08.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lutz04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaityNR04,
author = {Soumen Maity and
Amiya Nayak and
Bimal K. Roy},
title = {Characterization of catastrophic faults in two-dimensional reconfigurable
systolic arrays with unidirectional links},
journal = {Inf. Process. Lett.},
volume = {92},
number = {4},
pages = {189--197},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.08.005},
doi = {10.1016/J.IPL.2004.08.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MaityNR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nunes04,
author = {Isabel Nunes},
title = {Method redefinition--ensuring alternative behaviors},
journal = {Inf. Process. Lett.},
volume = {92},
number = {6},
pages = {279--285},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.09.004},
doi = {10.1016/J.IPL.2004.09.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Nunes04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ochem04,
author = {Pascal Ochem},
title = {Oriented colorings of triangle-free planar graphs},
journal = {Inf. Process. Lett.},
volume = {92},
number = {2},
pages = {71--76},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.012},
doi = {10.1016/J.IPL.2004.06.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ochem04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PetkovicCB04,
author = {Tatjana Petkovic and
Miroslav Ciric and
Stojan Bogdanovic},
title = {Minimal forbidden subwords},
journal = {Inf. Process. Lett.},
volume = {92},
number = {5},
pages = {211--218},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.09.001},
doi = {10.1016/J.IPL.2004.09.001},
timestamp = {Mon, 21 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PetkovicCB04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SantisFM04,
author = {Alfredo De Santis and
Anna Lisa Ferrara and
Barbara Masucci},
title = {Cryptographic key assignment schemes for any access control policy},
journal = {Inf. Process. Lett.},
volume = {92},
number = {4},
pages = {199--205},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.03.019},
doi = {10.1016/J.IPL.2004.03.019},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SantisFM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShimSYM04,
author = {Jeong Min Shim and
Seok Il Song and
Jae Soo Yoo and
Young Soo Min},
title = {An efficient cache conscious multi-dimensional index structure},
journal = {Inf. Process. Lett.},
volume = {92},
number = {3},
pages = {133--142},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.017},
doi = {10.1016/J.IPL.2004.06.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShimSYM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shparlinski04,
author = {Igor E. Shparlinski},
title = {On the uniformity of distribution of the decryption exponent in fixed
encryption exponent {RSA}},
journal = {Inf. Process. Lett.},
volume = {92},
number = {3},
pages = {143--147},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.07.004},
doi = {10.1016/J.IPL.2004.07.004},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Shparlinski04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Skulrattanakulchai04,
author = {San Skulrattanakulchai},
title = {Acyclic colorings of subcubic graphs},
journal = {Inf. Process. Lett.},
volume = {92},
number = {4},
pages = {161--167},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.08.002},
doi = {10.1016/J.IPL.2004.08.002},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Skulrattanakulchai04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SzepietowskiT04,
author = {Andrzej Szepietowski and
Monika Targan},
title = {A note on the oriented chromatic number of grids},
journal = {Inf. Process. Lett.},
volume = {92},
number = {2},
pages = {65--70},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.014},
doi = {10.1016/J.IPL.2004.06.014},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SzepietowskiT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TorosluC04,
author = {Ismail Hakki Toroslu and
Ahmet Cosar},
title = {Dynamic programming solution for multiple query optimization problem},
journal = {Inf. Process. Lett.},
volume = {92},
number = {3},
pages = {149--155},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.018},
doi = {10.1016/J.IPL.2004.06.018},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TorosluC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Valiente04,
author = {Gabriel Valiente},
title = {Trading uninitialized space for time},
journal = {Inf. Process. Lett.},
volume = {92},
number = {1},
pages = {9--13},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.002},
doi = {10.1016/J.IPL.2004.06.002},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Valiente04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Volzer04,
author = {Hagen V{\"{o}}lzer},
title = {A constructive proof for {FLP}},
journal = {Inf. Process. Lett.},
volume = {92},
number = {2},
pages = {83--87},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.008},
doi = {10.1016/J.IPL.2004.06.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Volzer04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WeismanCK04,
author = {Amit Weisman and
L. Paul Chew and
Klara Kedem},
title = {Voronoi diagrams of moving points in the plane and of lines in space:
tight bounds for simple configurations},
journal = {Inf. Process. Lett.},
volume = {92},
number = {5},
pages = {245--251},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.08.004},
doi = {10.1016/J.IPL.2004.08.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WeismanCK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Windsor04,
author = {Aaron Windsor},
title = {A simple proof that finding a maximal independent set in a graph is
in {NC}},
journal = {Inf. Process. Lett.},
volume = {92},
number = {4},
pages = {185--187},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.08.007},
doi = {10.1016/J.IPL.2004.08.007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Windsor04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuHZ04,
author = {Bang Ye Wu and
Zheng{-}Nan Huang and
Fu{-}Jie Zhan},
title = {Exact algorithms for the minimum latency problem},
journal = {Inf. Process. Lett.},
volume = {92},
number = {6},
pages = {303--309},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.09.009},
doi = {10.1016/J.IPL.2004.09.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuHZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YamaguchiAM04,
author = {Atsuko Yamaguchi and
Kiyoko F. Aoki and
Hiroshi Mamitsuka},
title = {Finding the maximum common subgraph of a partial \emph{k}-tree and
a graph with a polynomially bounded number of spanning trees},
journal = {Inf. Process. Lett.},
volume = {92},
number = {2},
pages = {57--63},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.019},
doi = {10.1016/J.IPL.2004.06.019},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YamaguchiAM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YamashitaSK04,
author = {Masafumi Yamashita and
Ichiro Suzuki and
Tiko Kameda},
title = {Searching a polygonal region by a group of stationary \emph{k}-searchers},
journal = {Inf. Process. Lett.},
volume = {92},
number = {1},
pages = {1--8},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.010},
doi = {10.1016/J.IPL.2004.06.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YamashitaSK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangELM04,
author = {Xiaofan Yang and
David J. Evans and
Hong{-}Jian Lai and
Graham M. Megson},
title = {Generalized honeycomb torus is Hamiltonian},
journal = {Inf. Process. Lett.},
volume = {92},
number = {1},
pages = {31--37},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.05.017},
doi = {10.1016/J.IPL.2004.05.017},
timestamp = {Tue, 13 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YangELM04.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-27 04:39 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:
