default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/ipl/ipl99.bht:"
download as .bib file
@article{DBLP:journals/ipl/AvidorR06,
author = {Adi Avidor and
Ricky Rosen},
title = {A note on Unique Games},
journal = {Inf. Process. Lett.},
volume = {99},
number = {3},
pages = {87--91},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.03.004},
doi = {10.1016/J.IPL.2006.03.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AvidorR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BagchiBS06,
author = {Amitabha Bagchi and
Ankur Bhargava and
Torsten Suel},
title = {Approximate maximum weight branchings},
journal = {Inf. Process. Lett.},
volume = {99},
number = {2},
pages = {54--58},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.02.011},
doi = {10.1016/J.IPL.2006.02.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BagchiBS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BletsasA06,
author = {Konstantinos Bletsas and
Neil C. Audsley},
title = {Optimal priority assignment in the presence of blocking},
journal = {Inf. Process. Lett.},
volume = {99},
number = {3},
pages = {83--86},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.03.002},
doi = {10.1016/J.IPL.2006.03.002},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BletsasA06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CameronH06,
author = {Kathie Cameron and
Ch{\'{\i}}nh T. Ho{\`{a}}ng},
title = {On the structure of certain intersection graphs},
journal = {Inf. Process. Lett.},
volume = {99},
number = {2},
pages = {59--63},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.01.013},
doi = {10.1016/J.IPL.2006.01.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CameronH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen06a,
author = {Yangjun Chen},
title = {On the cost of searching signature trees},
journal = {Inf. Process. Lett.},
volume = {99},
number = {1},
pages = {19--26},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.10.015},
doi = {10.1016/J.IPL.2005.10.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenW06,
author = {Min Chen and
Weifan Wang},
title = {The 2-dipath chromatic number of Halin graphs},
journal = {Inf. Process. Lett.},
volume = {99},
number = {2},
pages = {47--53},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.02.009},
doi = {10.1016/J.IPL.2006.02.009},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChengNK06,
author = {T. C. Edwin Cheng and
C. T. Ng and
Vladimir Kotov},
title = {A new algorithm for online uniform-machine scheduling to minimize
the makespan},
journal = {Inf. Process. Lett.},
volume = {99},
number = {3},
pages = {102--105},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.02.012},
doi = {10.1016/J.IPL.2006.02.012},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChengNK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChoffrutG06,
author = {Christian Choffrut and
Serge Grigorieff},
title = {Separability of rational relations in A* {\texttimes} N\({}^{\mbox{\emph{m}}}\)
by recognizable relations is decidable},
journal = {Inf. Process. Lett.},
volume = {99},
number = {1},
pages = {27--32},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.09.018},
doi = {10.1016/J.IPL.2005.09.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChoffrutG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChouC06,
author = {Shih{-}Chien Chou and
Yuan{-}Chien Chen},
title = {Retrieving reusable components with variation points from software
product lines},
journal = {Inf. Process. Lett.},
volume = {99},
number = {3},
pages = {106--110},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.02.015},
doi = {10.1016/J.IPL.2006.02.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChouC06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Coja-OghlanK06,
author = {Amin Coja{-}Oghlan and
Lars Kuhtz},
title = {An improved algorithm for approximating the chromatic number of G\({}_{\mbox{n,
p}}\)},
journal = {Inf. Process. Lett.},
volume = {99},
number = {6},
pages = {234--238},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.05.004},
doi = {10.1016/J.IPL.2006.05.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Coja-OghlanK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DanvyR06,
author = {Olivier Danvy and
Henning Korsholm Rohde},
title = {On obtaining the Boyer-Moore string-matching algorithm by partial
evaluation},
journal = {Inf. Process. Lett.},
volume = {99},
number = {4},
pages = {158--162},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.001},
doi = {10.1016/J.IPL.2006.04.001},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DanvyR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DevillersB06,
author = {Raymond R. Devillers and
Laurent Van Begin},
title = {Boundedness undecidability for synchronized nets},
journal = {Inf. Process. Lett.},
volume = {99},
number = {5},
pages = {208--214},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.009},
doi = {10.1016/J.IPL.2006.04.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DevillersB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DijkKST06,
author = {Marten van Dijk and
Tom A. M. Kevenaar and
Geert Jan Schrijen and
Pim Tuyls},
title = {Improved constructions of secret sharing schemes by applying (lambda,
omega)-decompositions},
journal = {Inf. Process. Lett.},
volume = {99},
number = {4},
pages = {154--157},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.01.016},
doi = {10.1016/J.IPL.2006.01.016},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DijkKST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DouradoPS06,
author = {Mitre Costa Dourado and
F{\'{a}}bio Protti and
Jayme Luiz Szwarcfiter},
title = {Complexity aspects of generalized Helly hypergraphs},
journal = {Inf. Process. Lett.},
volume = {99},
number = {1},
pages = {13--18},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.02.007},
doi = {10.1016/J.IPL.2006.02.007},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DouradoPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FischerHK06,
author = {Felix A. Fischer and
Markus Holzer and
Stefan Katzenbeisser},
title = {The influence of neighbourhood and choice on the complexity of finding
pure Nash equilibria},
journal = {Inf. Process. Lett.},
volume = {99},
number = {6},
pages = {239--245},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.03.010},
doi = {10.1016/J.IPL.2006.03.010},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FischerHK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gagie06a,
author = {Travis Gagie},
title = {Large alphabets and incompressibility},
journal = {Inf. Process. Lett.},
volume = {99},
number = {6},
pages = {246--251},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.008},
doi = {10.1016/J.IPL.2006.04.008},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gagie06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrosseRW06,
author = {Andr{\'{e}} Gro{\ss}e and
J{\"{o}}rg Rothe and
Gerd Wechsung},
title = {On computing the smallest four-coloring of planar graphs and non-self-reducible
sets in {P}},
journal = {Inf. Process. Lett.},
volume = {99},
number = {6},
pages = {215--221},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.007},
doi = {10.1016/J.IPL.2006.04.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrosseRW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HellwigV06,
author = {Angelika Hellwig and
Lutz Volkmann},
title = {Lower bounds on the vertex-connectivity of digraphs and graphs},
journal = {Inf. Process. Lett.},
volume = {99},
number = {2},
pages = {41--46},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.03.001},
doi = {10.1016/J.IPL.2006.03.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HellwigV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HougardyV06,
author = {Stefan Hougardy and
Doratha E. Drake Vinkemeier},
title = {Approximating weighted matchings in parallel},
journal = {Inf. Process. Lett.},
volume = {99},
number = {3},
pages = {119--123},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.03.005},
doi = {10.1016/J.IPL.2006.03.005},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HougardyV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangSZZ06,
author = {Wei Huang and
Yaoyun Shi and
Shengyu Zhang and
Yufan Zhu},
title = {The communication complexity of the Hamming distance problem},
journal = {Inf. Process. Lett.},
volume = {99},
number = {4},
pages = {149--153},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.01.014},
doi = {10.1016/J.IPL.2006.01.014},
timestamp = {Wed, 19 Feb 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HuangSZZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IkedaN06,
author = {Satoshi Ikeda and
Koji Nakazawa},
title = {Strong normalization proofs by CPS-translations},
journal = {Inf. Process. Lett.},
volume = {99},
number = {4},
pages = {163--170},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.03.009},
doi = {10.1016/J.IPL.2006.03.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IkedaN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JamisonMV06,
author = {Robert E. Jamison and
Gretchen L. Matthews and
John Villalpando},
title = {Acyclic colorings of products of trees},
journal = {Inf. Process. Lett.},
volume = {99},
number = {1},
pages = {7--12},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.11.023},
doi = {10.1016/J.IPL.2005.11.023},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JamisonMV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JanssenN06,
author = {Philippe Janssen and
Lhouari Nourine},
title = {Minimum implicational basis for meet-semidistributive lattices},
journal = {Inf. Process. Lett.},
volume = {99},
number = {5},
pages = {199--202},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.004},
doi = {10.1016/J.IPL.2006.04.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JanssenN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jiang06a,
author = {Minghui Jiang},
title = {A new approximation algorithm for labeling points with circle pairs},
journal = {Inf. Process. Lett.},
volume = {99},
number = {4},
pages = {125--129},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.006},
doi = {10.1016/J.IPL.2006.04.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jiang06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KosowskiMZ06,
author = {Adrian Kosowski and
Michal Malafiejski and
Pawel Zylinski},
title = {An approximation algorithm for maximum P\({}_{\mbox{3}}\)-packing
in subcubic graphs},
journal = {Inf. Process. Lett.},
volume = {99},
number = {6},
pages = {230--233},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.05.003},
doi = {10.1016/J.IPL.2006.05.003},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KosowskiMZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kuba06,
author = {Markus Kuba},
title = {On Quickselect, partial sorting and Multiple Quickselect},
journal = {Inf. Process. Lett.},
volume = {99},
number = {5},
pages = {181--186},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.003},
doi = {10.1016/J.IPL.2006.04.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kuba06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Levin06,
author = {Asaf Levin},
title = {Real time scheduling with a budget: Parametric-search is better than
binary search},
journal = {Inf. Process. Lett.},
volume = {99},
number = {5},
pages = {187--191},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.011},
doi = {10.1016/J.IPL.2006.04.011},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Levin06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiSC06,
author = {Shisheng Li and
Guangzhong Sun and
Guoliang Chen},
title = {Improved algorithm for finding next-to-shortest paths},
journal = {Inf. Process. Lett.},
volume = {99},
number = {5},
pages = {192--194},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.013},
doi = {10.1016/J.IPL.2006.04.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiSC06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinTT06,
author = {Chung{-}Ming Lin and
Yin{-}Te Tsai and
Chuan Yi Tang},
title = {Balancing minimum spanning trees and multiple-source minimum routing
cost spanning trees on metric graphs},
journal = {Inf. Process. Lett.},
volume = {99},
number = {2},
pages = {64--67},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.11.021},
doi = {10.1016/J.IPL.2005.11.021},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinTT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mestre06,
author = {Juli{\'{a}}n Mestre},
title = {On the multi-radius cover problem},
journal = {Inf. Process. Lett.},
volume = {99},
number = {5},
pages = {195--198},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.012},
doi = {10.1016/J.IPL.2006.04.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mestre06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MoffatA06,
author = {Alistair Moffat and
Vo Ngoc Anh},
title = {Binary codes for locally homogeneous sequences},
journal = {Inf. Process. Lett.},
volume = {99},
number = {5},
pages = {175--180},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.014},
doi = {10.1016/J.IPL.2006.04.014},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MoffatA06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Montassier06,
author = {Micka{\"{e}}l Montassier},
title = {A note on the not 3-choosability of some families of planar graphs},
journal = {Inf. Process. Lett.},
volume = {99},
number = {2},
pages = {68--71},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.10.014},
doi = {10.1016/J.IPL.2005.10.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Montassier06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MuschollSS06,
author = {Anca Muscholl and
Mathias Samuelides and
Luc Segoufin},
title = {Complementing deterministic tree-walking automata},
journal = {Inf. Process. Lett.},
volume = {99},
number = {1},
pages = {33--39},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.09.017},
doi = {10.1016/J.IPL.2005.09.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MuschollSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Peczarski06,
author = {Marcin Peczarski},
title = {An improvement of the tree code construction},
journal = {Inf. Process. Lett.},
volume = {99},
number = {3},
pages = {92--95},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.03.007},
doi = {10.1016/J.IPL.2006.03.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Peczarski06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sakai06,
author = {Yoshifumi Sakai},
title = {A linear space algorithm for computing a longest common increasing
subsequence},
journal = {Inf. Process. Lett.},
volume = {99},
number = {5},
pages = {203--207},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.05.005},
doi = {10.1016/J.IPL.2006.05.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sakai06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Subramanian06,
author = {C. R. Subramanian},
title = {Analysis of a heuristic for acyclic edge colouring},
journal = {Inf. Process. Lett.},
volume = {99},
number = {6},
pages = {227--229},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.05.001},
doi = {10.1016/J.IPL.2006.05.001},
timestamp = {Tue, 14 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Subramanian06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TakenagaW06,
author = {Yasuhiko Takenaga and
Toby Walsh},
title = {Tetravex is NP-complete},
journal = {Inf. Process. Lett.},
volume = {99},
number = {5},
pages = {171--174},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.010},
doi = {10.1016/J.IPL.2006.04.010},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TakenagaW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tan06,
author = {Chik How Tan},
title = {Analysis of improved signcryption scheme with key privacy},
journal = {Inf. Process. Lett.},
volume = {99},
number = {4},
pages = {135--138},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.01.015},
doi = {10.1016/J.IPL.2006.01.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tan06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tripakis06,
author = {Stavros Tripakis},
title = {Folk theorems on the determinization and minimization of timed automata},
journal = {Inf. Process. Lett.},
volume = {99},
number = {6},
pages = {222--226},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.015},
doi = {10.1016/J.IPL.2006.04.015},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Tripakis06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsaban06,
author = {Boaz Tsaban},
title = {Fast generators for the Diffie-Hellman key agreement protocol and
malicious standards},
journal = {Inf. Process. Lett.},
volume = {99},
number = {4},
pages = {145--148},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.11.025},
doi = {10.1016/J.IPL.2005.11.025},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsaban06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vagvolgyi06,
author = {S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi},
title = {Descendants of a recognizable tree language for sets of linear monadic
term rewrite rules},
journal = {Inf. Process. Lett.},
volume = {99},
number = {3},
pages = {111--118},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.03.008},
doi = {10.1016/J.IPL.2006.03.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vagvolgyi06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VoorhiesLK06,
author = {Seth Voorhies and
Hyunyoung Lee and
Andreas Klappenecker},
title = {Fair service for mice in the presence of elephants},
journal = {Inf. Process. Lett.},
volume = {99},
number = {3},
pages = {96--101},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.03.006},
doi = {10.1016/J.IPL.2006.03.006},
timestamp = {Wed, 02 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VoorhiesLK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Xirotiri06,
author = {Olga Xirotiri},
title = {Simulation of simultaneous safe recursion over an arbitrary structure},
journal = {Inf. Process. Lett.},
volume = {99},
number = {2},
pages = {72--81},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.03.003},
doi = {10.1016/J.IPL.2006.03.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Xirotiri06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuKS06,
author = {Guangjun Xu and
Liying Kang and
Erfang Shan},
title = {Acyclic domination on bipartite permutation graphs},
journal = {Inf. Process. Lett.},
volume = {99},
number = {4},
pages = {139--144},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.002},
doi = {10.1016/J.IPL.2006.04.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XuKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yuster06,
author = {Raphael Yuster},
title = {Finding and counting cliques and independent sets in r-uniform hypergraphs},
journal = {Inf. Process. Lett.},
volume = {99},
number = {4},
pages = {130--134},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.005},
doi = {10.1016/J.IPL.2006.04.005},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Yuster06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangH06,
author = {Huaming Zhang and
Xin He},
title = {On simultaneous straight-line grid embedding of a planar graph and
its dual},
journal = {Inf. Process. Lett.},
volume = {99},
number = {1},
pages = {1--6},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.02.010},
doi = {10.1016/J.IPL.2006.02.010},
timestamp = {Tue, 11 Feb 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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 2025-03-12 22:39 CET 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:
