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/ipl85.bht:"
download as .bib file
@article{DBLP:journals/ipl/AlbertHV03,
author = {Elvira Albert and
Michael Hanus and
Germ{\'{a}}n Vidal},
title = {A residualizing semantics for the partial evaluation of functional
logic programs},
journal = {Inf. Process. Lett.},
volume = {85},
number = {1},
pages = {19--25},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00336-8},
doi = {10.1016/S0020-0190(02)00336-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlbertHV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Alon03,
author = {Noga Alon},
title = {A simple algorithm for edge-coloring bipartite multigraphs},
journal = {Inf. Process. Lett.},
volume = {85},
number = {6},
pages = {301--302},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00446-5},
doi = {10.1016/S0020-0190(02)00446-5},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Alon03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AnejaCN03,
author = {Yash P. Aneja and
R. Chandrasekaran and
Kunhiraman Nair},
title = {Parametric analysis of overall min-cuts and applications in undirected
networks},
journal = {Inf. Process. Lett.},
volume = {85},
number = {2},
pages = {105--109},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00364-2},
doi = {10.1016/S0020-0190(02)00364-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AnejaCN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArmonAER03,
author = {Amitai Armon and
Yossi Azar and
Leah Epstein and
Oded Regev},
title = {On-line restricted assignment of temporary tasks with unknown durations},
journal = {Inf. Process. Lett.},
volume = {85},
number = {2},
pages = {67--72},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00350-2},
doi = {10.1016/S0020-0190(02)00350-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArmonAER03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BiedlCL03,
author = {Therese C. Biedl and
Timothy M. Chan and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {Drawing K\({}_{\mbox{2, n}}\): {A} lower bound},
journal = {Inf. Process. Lett.},
volume = {85},
number = {6},
pages = {303--305},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00433-7},
doi = {10.1016/S0020-0190(02)00433-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BiedlCL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Blaser03,
author = {Markus Bl{\"{a}}ser},
title = {Computing small partial coverings},
journal = {Inf. Process. Lett.},
volume = {85},
number = {6},
pages = {327--331},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00434-9},
doi = {10.1016/S0020-0190(02)00434-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Blaser03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangC03,
author = {Chin{-}Chen Chang and
Chi{-}Yien Chung},
title = {An efficient protocol for anonymous multicast and reception},
journal = {Inf. Process. Lett.},
volume = {85},
number = {2},
pages = {99--103},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00352-6},
doi = {10.1016/S0020-0190(02)00352-6},
timestamp = {Tue, 23 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChangC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChavezN03,
author = {Edgar Ch{\'{a}}vez and
Gonzalo Navarro},
title = {Probabilistic proximity search: Fighting the curse of dimensionality
in metric spaces},
journal = {Inf. Process. Lett.},
volume = {85},
number = {1},
pages = {39--46},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00344-7},
doi = {10.1016/S0020-0190(02)00344-7},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChavezN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChinSW03,
author = {Francis Y. L. Chin and
Hong Shen and
Fu Lee Wang},
title = {Transversal of disjoint convex polygons},
journal = {Inf. Process. Lett.},
volume = {85},
number = {1},
pages = {55--60},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00414-3},
doi = {10.1016/S0020-0190(02)00414-3},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChinSW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChinW03,
author = {Francis Y. L. Chin and
Fu Lee Wang},
title = {Erratum to: "Efficient algorithm for transversal of disjoint convex
polygons"},
journal = {Inf. Process. Lett.},
volume = {85},
number = {1},
pages = {53},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00415-5},
doi = {10.1016/S0020-0190(02)00415-5},
timestamp = {Thu, 04 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChinW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CicaleseV03,
author = {Ferdinando Cicalese and
Ugo Vaccaro},
title = {Binary search with delayed and missing answers},
journal = {Inf. Process. Lett.},
volume = {85},
number = {5},
pages = {239--247},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00426-X},
doi = {10.1016/S0020-0190(02)00426-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CicaleseV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ColeILPR03,
author = {Richard Cole and
Costas S. Iliopoulos and
Thierry Lecroq and
Wojciech Plandowski and
Wojciech Rytter},
title = {On special families of morphisms related to [delta]-matching and don't
care symbols},
journal = {Inf. Process. Lett.},
volume = {85},
number = {5},
pages = {227--233},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00430-1},
doi = {10.1016/S0020-0190(02)00430-1},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ColeILPR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DatarFGMP03,
author = {Mayur Datar and
Tom{\'{a}}s Feder and
Aristides Gionis and
Rajeev Motwani and
Rina Panigrahy},
title = {A combinatorial algorithm for {MAX} {CSP}},
journal = {Inf. Process. Lett.},
volume = {85},
number = {6},
pages = {307--315},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00435-0},
doi = {10.1016/S0020-0190(02)00435-0},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DatarFGMP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DhamdhereGG03,
author = {Dhananjay M. Dhamdhere and
K. Gururaja and
Prajakta G. Ganu},
title = {A compact execution history for dynamic slicing},
journal = {Inf. Process. Lett.},
volume = {85},
number = {3},
pages = {145--152},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00322-8},
doi = {10.1016/S0020-0190(02)00322-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DhamdhereGG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DrakeH03,
author = {Doratha E. Drake and
Stefan Hougardy},
title = {A simple approximation algorithm for the weighted matching problem},
journal = {Inf. Process. Lett.},
volume = {85},
number = {4},
pages = {211--213},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00393-9},
doi = {10.1016/S0020-0190(02)00393-9},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DrakeH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Durand03,
author = {Marianne Durand},
title = {Asymptotic analysis of an optimized quicksort algorithm},
journal = {Inf. Process. Lett.},
volume = {85},
number = {2},
pages = {73--77},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00351-4},
doi = {10.1016/S0020-0190(02)00351-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Durand03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FertinRR03,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud and
Arup Roychowdhury},
title = {On the oriented chromatic number of grids},
journal = {Inf. Process. Lett.},
volume = {85},
number = {5},
pages = {261--266},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00405-2},
doi = {10.1016/S0020-0190(02)00405-2},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FertinRR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FonsecaF03,
author = {Guilherme Dias da Fonseca and
Celina M. H. de Figueiredo},
title = {Kinetic heap-ordered trees: Tight analysis and improved algorithms},
journal = {Inf. Process. Lett.},
volume = {85},
number = {3},
pages = {165--169},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00366-6},
doi = {10.1016/S0020-0190(02)00366-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FonsecaF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fujita03,
author = {Satoshi Fujita},
title = {On-line grid-packing with a single active grid},
journal = {Inf. Process. Lett.},
volume = {85},
number = {4},
pages = {199--204},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00373-3},
doi = {10.1016/S0020-0190(02)00373-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fujita03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fuster-SabaterG03,
author = {Amparo F{\'{u}}ster{-}Sabater and
Pedro Garc{\'{\i}}a{-}Mochales},
title = {On the balancedness of nonlinear generators of binary sequences},
journal = {Inf. Process. Lett.},
volume = {85},
number = {2},
pages = {111--116},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00349-6},
doi = {10.1016/S0020-0190(02)00349-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fuster-SabaterG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GiannellaR03,
author = {Chris Giannella and
Edward L. Robertson},
title = {A note on approximation measures for multi-valued dependencies in
relational databases},
journal = {Inf. Process. Lett.},
volume = {85},
number = {3},
pages = {153--158},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00365-4},
doi = {10.1016/S0020-0190(02)00365-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GiannellaR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hage03,
author = {Jurriaan Hage},
title = {Enumerating submultisets of multisets},
journal = {Inf. Process. Lett.},
volume = {85},
number = {4},
pages = {221--226},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00394-0},
doi = {10.1016/S0020-0190(02)00394-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hage03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoriyamaI03,
author = {Takashi Horiyama and
Toshihide Ibaraki},
title = {Translation among CNFs, characteristic models and ordered binary decision
diagrams},
journal = {Inf. Process. Lett.},
volume = {85},
number = {4},
pages = {191--198},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00374-5},
doi = {10.1016/S0020-0190(02)00374-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HoriyamaI03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangC03,
author = {Tsung{-}Chuan Huang and
Slo{-}Li Chu},
title = {A statement based parallelizing framework for processor-in-memory
architectures},
journal = {Inf. Process. Lett.},
volume = {85},
number = {3},
pages = {159--163},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00353-8},
doi = {10.1016/S0020-0190(02)00353-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HuangC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangTT03,
author = {Po{-}Hsueh Huang and
Yin{-}Te Tsai and
Chuan Yi Tang},
title = {A fast algorithm for the alpha-connected two-center decision problem},
journal = {Inf. Process. Lett.},
volume = {85},
number = {4},
pages = {205--210},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00402-7},
doi = {10.1016/S0020-0190(02)00402-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HuangTT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KavvadiasS03,
author = {Dimitris J. Kavvadias and
Elias C. Stavropoulos},
title = {Monotone Boolean dualization is in co-NP[log\({}^{\mbox{2}}\)n]},
journal = {Inf. Process. Lett.},
volume = {85},
number = {1},
pages = {1--6},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00346-0},
doi = {10.1016/S0020-0190(02)00346-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KavvadiasS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KawanoY03,
author = {Sinichiro Kawano and
Koichi Yamazaki},
title = {Worst case analysis of a greedy algorithm for graph thickness},
journal = {Inf. Process. Lett.},
volume = {85},
number = {6},
pages = {333--337},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00432-5},
doi = {10.1016/S0020-0190(02)00432-5},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KawanoY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KeidarR03,
author = {Idit Keidar and
Sergio Rajsbaum},
title = {A simple proof of the uniform consensus synchronous lower bound},
journal = {Inf. Process. Lett.},
volume = {85},
number = {1},
pages = {47--52},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00333-2},
doi = {10.1016/S0020-0190(02)00333-2},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KeidarR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KimC03,
author = {Jae{-}Hoon Kim and
Kyung{-}Yong Chwa},
title = {Online deadline scheduling on faster machines},
journal = {Inf. Process. Lett.},
volume = {85},
number = {1},
pages = {31--37},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00332-0},
doi = {10.1016/S0020-0190(02)00332-0},
timestamp = {Tue, 26 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KimC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KimLNMCK03,
author = {Jong Min Kim and
Donghee Lee and
Sam H. Noh and
Sang Lyul Min and
Yookun Cho and
Chong{-}Sang Kim},
title = {An accurate and practical buffer allocation model for the buffer cache
based on marginal gains},
journal = {Inf. Process. Lett.},
volume = {85},
number = {2},
pages = {93--97},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00348-4},
doi = {10.1016/S0020-0190(02)00348-4},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KimLNMCK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KoKL03,
author = {Jong Ha Ko and
Sang{-}Hee Kim and
Jong{-}Kyu Lee},
title = {An {ENA} algorithm to enhance the performance of {TCP} over satellite
links},
journal = {Inf. Process. Lett.},
volume = {85},
number = {4},
pages = {215--219},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00372-1},
doi = {10.1016/S0020-0190(02)00372-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KoKL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KuCH03,
author = {Cheng{-}Yuan Ku and
Din{-}Yuen Chan and
Lain{-}Chyr Hwang},
title = {Optimal reservation policy for two queues in tandem},
journal = {Inf. Process. Lett.},
volume = {85},
number = {1},
pages = {27--30},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00334-4},
doi = {10.1016/S0020-0190(02)00334-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KuCH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LaihC03,
author = {Chi{-}Sung Laih and
Shin Yan Chiou},
title = {Cryptanalysis of an optimized protocol for mobile network authentication
and security},
journal = {Inf. Process. Lett.},
volume = {85},
number = {6},
pages = {339--341},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00431-3},
doi = {10.1016/S0020-0190(02)00431-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LaihC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiTV03,
author = {Ming Li and
John Tromp and
Paul M. B. Vit{\'{a}}nyi},
title = {Sharpening Occam's razor},
journal = {Inf. Process. Lett.},
volume = {85},
number = {5},
pages = {267--274},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00427-1},
doi = {10.1016/S0020-0190(02)00427-1},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiTV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lifshits03,
author = {Yury Lifshits},
title = {A lower bound on the size of {\(\epsilon\)}-free {NFA} corresponding
to a regular expression},
journal = {Inf. Process. Lett.},
volume = {85},
number = {6},
pages = {293--299},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00436-2},
doi = {10.1016/S0020-0190(02)00436-2},
timestamp = {Mon, 19 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lifshits03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuT03,
author = {Chang{-}Chun Lu and
Shi{-}Chun Tsai},
title = {A note on unscrambling address lines},
journal = {Inf. Process. Lett.},
volume = {85},
number = {4},
pages = {185--189},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00392-7},
doi = {10.1016/S0020-0190(02)00392-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MeidlW03,
author = {Wilfried Meidl and
Arne Winterhof},
title = {On the linear complexity profile of explicit nonlinear pseudorandom
numbers},
journal = {Inf. Process. Lett.},
volume = {85},
number = {1},
pages = {13--18},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00335-6},
doi = {10.1016/S0020-0190(02)00335-6},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MeidlW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Miao03,
author = {Ying Miao},
title = {A combinatorial characterization of regular anonymous perfect threshold
schemes},
journal = {Inf. Process. Lett.},
volume = {85},
number = {3},
pages = {131--135},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00368-X},
doi = {10.1016/S0020-0190(02)00368-X},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Miao03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MinAC03,
author = {Jun{-}Ki Min and
Jae{-}Yong Ahn and
Chin{-}Wan Chung},
title = {Efficient extraction of schemas for {XML} documents},
journal = {Inf. Process. Lett.},
volume = {85},
number = {1},
pages = {7--12},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00345-9},
doi = {10.1016/S0020-0190(02)00345-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MinAC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Misra03,
author = {Jayadev Misra},
title = {Derivation of a parallel string matching algorithm},
journal = {Inf. Process. Lett.},
volume = {85},
number = {5},
pages = {255--260},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00416-7},
doi = {10.1016/S0020-0190(02)00416-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Misra03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OgryczakT03,
author = {Wlodzimierz Ogryczak and
Arie Tamir},
title = {Minimizing the sum of the k largest functions in linear time},
journal = {Inf. Process. Lett.},
volume = {85},
number = {3},
pages = {117--122},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00370-8},
doi = {10.1016/S0020-0190(02)00370-8},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OgryczakT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pallo03,
author = {Jean Marcel Pallo},
title = {Generating binary trees by Glivenko classes on Tamari lattices},
journal = {Inf. Process. Lett.},
volume = {85},
number = {5},
pages = {235--238},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00417-9},
doi = {10.1016/S0020-0190(02)00417-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pallo03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Poland03,
author = {Jan Poland},
title = {Finding smooth maps is NP-complete},
journal = {Inf. Process. Lett.},
volume = {85},
number = {5},
pages = {249--253},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00429-5},
doi = {10.1016/S0020-0190(02)00429-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Poland03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PustylnikS03,
author = {Gennady Pustylnik and
Micha Sharir},
title = {The Minkowski sum of a simple polygon and a segment},
journal = {Inf. Process. Lett.},
volume = {85},
number = {4},
pages = {179--184},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00403-9},
doi = {10.1016/S0020-0190(02)00403-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PustylnikS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RanjanP03,
author = {Desh Ranjan and
Enrico Pontelli},
title = {The Level-Ancestor problem on Pure Pointer Machines},
journal = {Inf. Process. Lett.},
volume = {85},
number = {5},
pages = {275--283},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00428-3},
doi = {10.1016/S0020-0190(02)00428-3},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RanjanP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Richomme03,
author = {Gw{\'{e}}na{\"{e}}l Richomme},
title = {Some non finitely generated monoids of repetition-free endomorphisms},
journal = {Inf. Process. Lett.},
volume = {85},
number = {2},
pages = {61--66},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00354-X},
doi = {10.1016/S0020-0190(02)00354-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Richomme03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Serre03,
author = {Olivier Serre},
title = {Note on winning positions on pushdown games with [omega]-regular conditions},
journal = {Inf. Process. Lett.},
volume = {85},
number = {6},
pages = {285--291},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00445-3},
doi = {10.1016/S0020-0190(02)00445-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Serre03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shao03,
author = {Zuhua Shao},
title = {Proxy signature schemes based on factoring},
journal = {Inf. Process. Lett.},
volume = {85},
number = {3},
pages = {137--143},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00367-8},
doi = {10.1016/S0020-0190(02)00367-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shao03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Touzet03,
author = {H{\'{e}}l{\`{e}}ne Touzet},
title = {Tree edit distance with gaps},
journal = {Inf. Process. Lett.},
volume = {85},
number = {3},
pages = {123--129},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00369-1},
doi = {10.1016/S0020-0190(02)00369-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Touzet03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Trelea03,
author = {Ioan Cristian Trelea},
title = {The particle swarm optimization algorithm: convergence analysis and
parameter selection},
journal = {Inf. Process. Lett.},
volume = {85},
number = {6},
pages = {317--325},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00447-7},
doi = {10.1016/S0020-0190(02)00447-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Trelea03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vidyasankar03,
author = {K. Vidyasankar},
title = {A simple group mutual l-exclusion algorithm},
journal = {Inf. Process. Lett.},
volume = {85},
number = {2},
pages = {79--85},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00355-1},
doi = {10.1016/S0020-0190(02)00355-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vidyasankar03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vigneron03,
author = {Antoine Vigneron},
title = {Reporting intersections among thick objects},
journal = {Inf. Process. Lett.},
volume = {85},
number = {2},
pages = {87--92},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00347-2},
doi = {10.1016/S0020-0190(02)00347-2},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vigneron03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YeZ03,
author = {Deshi Ye and
Guochuan Zhang},
title = {On-line scheduling with extendable working time on a small number
of machines},
journal = {Inf. Process. Lett.},
volume = {85},
number = {4},
pages = {171--177},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00404-0},
doi = {10.1016/S0020-0190(02)00404-0},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YeZ03.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-06-17 01:50 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:
