A Complete Bibliography of Publications in Information Processing Letters : 2000–2009 Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected](Internet) WWW URL: http://www.math.utah.edu/~beebe/ 16 March 2017 Version 2.15 Title word cross-reference #3 [Kut07]. #3-SAT [Kut07]. #P [Liv09]. #P-completeness [Liv09]. (0,j ) [CF09]. (1,r) [LL02a]. (1,X p ) [SW09]. (2, 1) [WC09]. (a, b) [JLN02]. (D - J ) [ZB07]. (Δ + 4) [TJH07]. (f,n) [ZS09]. (γ,κ) [Efr08]. (λ, ω) [vDKST06]. (s, t) [Nag05a]. (SIR ∞ ) [CM07]. (t, n) [LHC + 01]. 0 [Bar01a]. 0, 1 [ELS06]. 1 [Bar01a, CHC02, DMN09, DBLS06, Hal03, HC01, KH03, Riz03]. 1, 2 [SK08a]. 1.235 [Kur04]. 1.5 [HL08]. 12 [HM09]. 13 [HSL + 02]. 1 p [KH03]. 2 [ABM09, BG08, Che00a, CKL + 03, CY02, Dal09, DLS08, EO07, HP00b, LCL08, LMMM04, MB08, OP08, Rom09, Tan06b, TZ08, ˇ S ˇ Z04]. 2/3 - [PS04b]. 28 [Sch06]. 2 28 [Bih02]. 2 n [Pre00]. 2 O(k) poly(n) [Raz07]. 3 [BCP09, Cai09, DLP04, HM09, KKS ˇ S08, LR08, LCW07, MRWW08, NY09, Sea04, SW07a, She07, Sku02a, WLC08, WWW08, Wol06, ZS08]. 3/2 [CL03, Riz03]. 4 [EG03, HM09, HKKL09, Sku02a, WWW08, Xia07, Yun08]. 47 [Pec07]. 5 [WWW08]. 5/3 [GGK03, ZNI03]. 5/4[ ˇ S ˇ Z04]. 78 [HR02]. 8/(7 + 1k - 1) [FK00b]. + [Lan08]. ◦ [KV08a]. NP [GP01]. 5 [CZ02, Fou02, LM09]. A * × N m [CG06]. aa → bc [HW06]. α [BLL02]. AM exp 6⊆ (NP ∩ coN P )/poly [Vin04]. b [PT00]. bb → ac [HW06]. c [KR04]. C 7 [V ˇ Z02]. C E [Fer05a]. C k [KOH09]. cc → ab [HW06]. co - NP [log 2 n] [KS03a]. D [NB05, ABPR06, CGK08, Jun05]. Δ 1
315
Embed
A Complete Bibliography of Publications in Information Processing Letters…ftp.math.utah.edu/pub/tex/bib/infoproc2000.pdf · 2019-03-30 · A Complete Bibliography of Publications
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
A Complete Bibliography of Publications in Information
Processing Letters : 2000–2009
Nelson H. F. BeebeUniversity of Utah
Department of Mathematics, 110 LCB155 S 1400 E RM 233
[AA05] Meziane Aıder and MustaphaAouchiche. Distance monotonic-ity and a new characterizationof Hamming graphs. Informa-tion Processing Letters, 96(6):207–213, December 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Alvarez:2008:IMP
[AAC+08] A. Alvarez, S. Arevalo, V. Cholvi,
REFERENCES 47
A. Fernandez, and E. Jimenez.On the interconnection of mes-sage passing systems. Informa-tion Processing Letters, 105(6):249–254, March 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Armon:2003:LRA
[AAER03] Amitai Armon, Yossi Azar, LeahEpstein, and Oded Regev. On-line restricted assignment oftemporary tasks with unknowndurations. Information Process-ing Letters, 85(2):67–72, Jan-uary 31, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Aichholzer:2006:TST
[AAHK06] Oswin Aichholzer, Franz Au-renhammer, Clemens Huemer,and Hannes Krasser. Transform-ing spanning trees and pseudo-triangulations. InformationProcessing Letters, 97(1):19–22,January 16, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Abu-Affash:2009:IBA
[AAK09] A. Karim Abu-Affash andMatthew J. Katz. Improvedbounds on the average distanceto the Fermat–Weber center of aconvex object. Information Pro-cessing Letters, 109(6):329–333,February 28, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Albert:2007:LIS
[AAN+07] M. H. Albert, M. D. Atkin-son, Doron Nussbaum, Jorg-Rudiger Sack, and Nicola San-toro. On the longest increas-ing subsequence of a circular list.Information Processing Letters,101(2):55–59, January 31, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Abravaya:2009:MDD
[AB09] S. Abravaya and D. Berend.Multi-dimensional dynamic fa-cility location and fast compu-tation at query points. Informa-tion Processing Letters, 109(8):386–390, March 31, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Angel:2006:FCS
[ABBG06] Eric Angel, Evripidis Bampis,Lelia Blin, and Laurent Gourves.Fair cost-sharing methods forthe minimum spanning treegame. Information ProcessingLetters, 100(1):29–35, October16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Alvarez:2004:CDS
[ABD+04] C. Alvarez, M. Blesa, J. Dıaz,A. Fernandez, and M. Serna.The complexity of deciding sta-bility under FFS in the Adver-sarial Queueing model. Informa-tion Processing Letters, 90(5):261–266, June 15, 2004. CO-
REFERENCES 48
DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Abdo:2009:EGI
[Abd09] Mohamed Abdo. Efficient gen-eration of the ideals of a posetin Gray code order. InformationProcessing Letters, 109(13):687–689, June 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Arkin:2009:GSR
[ABE+09] Esther M. Arkin, Sang Won Bae,Alon Efrat, Kazuya Okamoto,Joseph S. B. Mitchell, andValentin Polishchuk. Geomet-ric stable roommates. Informa-tion Processing Letters, 109(4):219–224, January 31, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Araujo:2008:NHS
[ABF+08] G. Araujo, J. Balogh, R. Fabila,G. Salazar, and J. Urrutia. Anote on harmonic subgraphs inlabelled geometric graphs. Infor-mation Processing Letters, 105(3):98–102, January 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Angel:2005:ARB
[ABG05] Eric Angel, Evripidis Bampis,and Laurent Gourves. Approx-imation results for a bicrite-ria job scheduling problem ona single machine without pre-emption. Information Process-ing Letters, 94(1):19–27, April15, 2005. CODEN IFPLAT.
ISSN 0020-0190 (print), 1872-6119 (electronic).
Ausiello:2008:OPC
[ABL08] Giorgio Ausiello, VincenzoBonifaci, and Luigi Laura. Theonline Prize-Collecting Travel-ing Salesman Problem. Informa-tion Processing Letters, 107(6):199–204, August 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Abellanas:2009:CPS
[ABM09] M. Abellanas, A. L. Bajuelos,and I. Matos. 2-covered pathsby a set of antennas with mini-mum power transmission range.Information Processing Letters,109(14):768–773, June 30, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[ABPR06] Eyal Ackerman, Gill Barequet,Ron Y. Pinter, and Dan Romik.The number of guillotine parti-tions in d dimensions. Informa-tion Processing Letters, 98(4):162–167, May 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 49
Arbib:2002:SNE
[AC02] Claudio Arbib and AlbertoCaprara. On the stability num-ber of the edge intersection oftwo graphs. Information Pro-cessing Letters, 83(3):173–174,August 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Abellanas:2009:AGT
[ACHP09] M. Abellanas, S. Canales, andG. Hernandez-Penalver. An“Art Gallery Theorem” for pyra-mids. Information ProcessingLetters, 109(13):719–721, June15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Adcock:2006:QLB
[ACI+06] Mark Adcock, Richard Cleve,Kazuo Iwama, Raymond Pu-tra, and Shigeru Yamashita.Quantum lower bounds for theGoldreich–Levin problem. In-formation Processing Letters, 97(5):208–211, March 16, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Aceto:2008:ETP
[ACIL08] Luca Aceto, Silvio Capobianco,Anna Ingolfsdottir, and BasLuttik. The equational theory ofprebisimilarity over basic CCSwith divergence. InformationProcessing Letters, 108(5):284–289, November 15, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Abraham:2007:WFR
[ACKM07] Ittai Abraham, Gregory Chock-ler, Idit Keidar, and DahliaMalkhi. Wait-free regular stor-age from Byzantine components.Information Processing Letters,101(2):60–65, January 31, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Aneja:2003:PAO
[ACN03] Y. P. Aneja, R. Chandrasekaran,and K. P. K. Nair. Paramet-ric analysis of overall min-cutsand applications in undirectednetworks. Information Process-ing Letters, 85(2):105–109, Jan-uary 31, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Alonso:2004:WCC
[ACRS04] Laurent Alonso, Philippe Chas-saing, Edward M. Reingold, andRene Schott. The worst-casechip problem. Information Pro-cessing Letters, 89(6):303–308,March 31, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Avis:2000:ENV
[AD00] David Avis and Luc De-vroye. Estimating the num-ber of vertices of a polyhe-dron. Information Process-ing Letters, 73(3–4):137–143,February 29, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
REFERENCES 50
nl/gej-ng/10/23/20/62/27/
34/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/62/27/34/article.
pdf.
Alba:2006:CNN
[AD06] Enrique Alba and Bernabe Dor-ronsoro. Computing nine newbest-so-far solutions for Capac-itated VRP with a cellular Ge-netic Algorithm. InformationProcessing Letters, 98(6):225–230, June 30, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Aiguier:2007:SIE
[AD07] Marc Aiguier and Razvan Di-aconescu. Stratified institu-tions and elementary homomor-phisms. Information Process-ing Letters, 103(1):5–13, June30, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Alspach:2009:HTG
[AD09] Brian Alspach and MatthewDean. Honeycomb toroidalgraphs are Cayley graphs. Infor-mation Processing Letters, 109(13):705–708, June 15, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Aurenhammer:2006:FLS
[ADK06] F. Aurenhammer, R. L. S. Drys-dale, and H. Krasser. Far-thest line segment Voronoi di-agrams. Information Process-ing Letters, 100(6):220–225, De-
[ADLP04] G. Ausiello, M. Demange,L. Laura, and V. Paschos. Al-gorithms for the On-Line QuotaTraveling Salesman Problem.Information Processing Letters,92(2):89–94, October 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Ager:2004:FCB
[ADM04] Mads Sig Ager, Olivier Danvy,and Jan Midtgaard. A func-tional correspondence betweencall-by-need evaluators and lazyabstract machines. Informa-tion Processing Letters, 90(5):223–232, June 15, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Agnetis:2001:LAH
[ADMP01] A. Agnetis, P. Detti, C. Meloni,and D. Pacciarelli. A linear algo-rithm for the Hamiltonian com-pletion number of the line graphof a tree. Information Process-ing Letters, 79(1):17–24, May31, 2001. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic). URL http:/
/www.elsevier.nl/gej%2Dng/
10/23/20/80/25/28/abstract.
html; http://www.elsevier.
nl/gej%2Dng/10/23/20/80/25/
28/article.pdf.
REFERENCES 51
Aceto:2001:P
[AF01] Luca Aceto and Wan Fokkink.Preface. Information Process-ing Letters, 80(1):1, October 15,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/27/27/abstract.html.
Attiratanasunthron:2008:RTA
[AF08] Nattapat Attiratanasunthronand Jittat Fakcharoenphol. Arunning time analysis of an AntColony Optimization algorithmfor shortest paths in directedacyclic graphs. Information Pro-cessing Letters, 105(3):88–92,January 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Anceaume:2007:MAG
[AFG07] Emmanuelle Anceaume, RoyFriedman, and Maria Gradi-nariu. Managed Agreement:Generalizing two fundamentaldistributed agreement problems.Information Processing Letters,101(5):190–198, March 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[AFK08] Mikhail J. Atallah, Greg N.Frederickson, and Ashish Kundu.A tree-covering problem arisingin integrity of tree-structureddata. Information ProcessingLetters, 109(1):79–82, Decem-ber 16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Akutsu:2008:IAL
[AFT08] Tatsuya Akutsu, Daiji Fuka-gawa, and Atsuhiro Takasu. Im-proved approximation of thelargest common subtree of twounordered trees of boundedheight. Information ProcessingLetters, 109(2):165–170, Decem-ber 31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Almstrum:2001:ESI
[AG01] Vicki L. Almstrum and DavidGries. From the Editors ofthis special issue. InformationProcessing Letters, 77(2–4):49–51, February 28, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
24/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/24/article.
pdf.
Abdel-Ghaffar:2003:MNE
[AG03] Khaled A. S. Abdel-Ghaffar.Maximum number of edges join-ing vertices on a cube. In-formation Processing Letters, 87
REFERENCES 52
(2):95–99, July 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[AGM03] Noga Alon, Oded Goldreich, andYishay Mansour. Almost k-wiseindependence versus k-wise in-dependence. Information Pro-cessing Letters, 88(3):107–110,November 15, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Agrawal:2002:CSS
[Agr02] Manindra Agrawal. For com-pleteness, sublogarithmic spaceis no space. Information Pro-cessing Letters, 82(6):321–325,June 30, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic). See note[Sze08].
Amir:2007:IAC
[AGS07] Amihood Amir, Leszek Gasie-niec, and Riva Shalom. Im-proved approximate common in-terval. Information ProcessingLetters, 103(4):142–149, August16, 2007. CODEN IFPLAT.
ISSN 0020-0190 (print), 1872-6119 (electronic).
Afshani:2008:AIR
[AH08] Peyman Afshani and HamedHatami. Approximation and in-approximability results for max-imum clique of disc graphs inhigh dimensions. InformationProcessing Letters, 105(3):83–87, January 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Andren:2008:FMM
[AHM08] Daniel Andren, Lars Hellstrom,and Klas Markstrom. Fastmultiplication of matrices overa finitely generated semiring.Information Processing Let-ters, 107(6):230–234, August31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Arkin:2001:AMQ
[AHS01] Esther M. Arkin, Refael Hassin,and Maxim Sviridenko. Approx-imating the maximum quadraticassignment problem. Informa-tion Processing Letters, 77(1):13–16, January 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/24/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/24/26/article.
pdf.
REFERENCES 53
Abellanas:2003:VDS
[AHS+03] M. Abellanas, F. Hurtado,V. Sacristan, C. Icking, L. Ma,R. Klein, E. Langetepe, andB. Palop. Voronoi Diagram forservices neighboring a highway.Information Processing Letters,86(5):283–288, June 15, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Albert:2003:RSP
[AHV03] Elvira Albert, Michael Hanus,and German Vidal. A resid-ualizing semantics for the par-tial evaluation of functional logicprograms. Information Process-ing Letters, 85(1):19–25, Jan-uary 16, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Aceto:2008:EP
[AI08] Luca Aceto and Anna Ingolfs-dottir. On the expressibility ofpriority. Information Process-ing Letters, 109(1):83–85, De-cember 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Amano:2003:IEC
[AIM+03] Kazuyuki Amano, Kazuo Iwama,Akira Maruoka, Kenshi Mat-suo, and Akihiro Matsuura.Inclusion–exclusion for k-CNFformulas. Information Process-ing Letters, 87(2):111–117, July31, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Akl:2007:PPT
[AIM07] Selim G. Akl, Md. Kamrul Is-lam, and Henk Meijer. On pla-nar path transformation. Infor-mation Processing Letters, 104(2):59–64, October 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Akl:2008:PTT
[AIM08] Selim G. Akl, Kamrul Islam,and Henk Meijer. Planar treetransformation: Results andcounterexample. InformationProcessing Letters, 109(1):61–67, December 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Albers:2002:RST
[AK02] Susanne Albers and MarekKarpinski. Randomized splaytrees: Theoretical and exper-imental results. InformationProcessing Letters, 81(4):213–221, February 28, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/35/
34/abstract.html.
Aiger:2008:AGH
[AK08] Dror Aiger and Klara Kedem.Applying graphics hardware toachieve extremely fast geomet-ric pattern matching in two andthree dimensional transforma-tion space. Information Pro-cessing Letters, 105(6):224–230,March 16, 2008. CODEN IF-
[AK09a] Dror Aiger and Klara Kedem.Geometric pattern matching forpoint sets in the plane un-der similarity transformations.Information Processing Letters,109(16):935–940, July 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Almeida:2009:CCC
[AK09b] Jorge Almeida and OndrejKlıma. A counterexample to aconjecture concerning concate-nation hierarchies. InformationProcessing Letters, 110(1):4–7,December 1, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
AlWehaibi:2004:PLP
[AKAE04] Abdullah AlWehaibi, MichaelKadoch, Anjali Agarwal, andAhmed ElHakeem. Packet lossprobability for DiffServ over IPand MPLS reliable homogeneousmulticast networks. InformationProcessing Letters, 90(2):73–80,April 30, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Aerts:2000:RDS
[AKE00] Joep Aerts, Jan Korst, and Se-bastian Egner. Random du-plicate storage strategies forload balancing in multime-dia servers. Information Pro-cessing Letters, 76(1–2):51–59,
November 20, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/24/
32/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/24/32/article.
pdf.
Abu-Khzam:2007:LTA
[AKL07] Faisal N. Abu-Khzam andMichael A. Langston. Linear-time algorithms for problems onplanar graphs with fixed disk di-mension. Information Process-ing Letters, 101(1):36–40, Jan-uary 16, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Akutsu:2006:RBE
[Aku06] Tatsuya Akutsu. A relation be-tween edit distance for orderedtrees and edit distance for Eulerstrings. Information ProcessingLetters, 100(3):105–109, Novem-ber 15, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Apostolico:2002:SCB
[AL02] Alberto Apostolico and StefanoLonardi. A speed-up for thecommute between subword treesand DAWGs. Information Pro-cessing Letters, 83(3):159–161,August 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 55
Alagarsamy:2005:MEA
[Ala05] K. Alagarsamy. A mutual ex-clusion algorithm with optimallybounded bypasses. InformationProcessing Letters, 96(1):36–40,October 16, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Alba:2006:NLT
[ALA06] Enrique Alba, Gabriel Luque,and Lourdes Araujo. Naturallanguage tagging with geneticalgorithms. Information Pro-cessing Letters, 100(5):173–182,December 16, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[ALU02] Amihood Amir, Gad M. Lan-dau, and Esko Ukkonen. Onlinetimestamped text indexing. In-formation Processing Letters, 82(5):253–259, June 15, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Aloupis:2005:LBC
[AM05] Greg Aloupis and Erin McLeish.A lower bound for computingOja depth. Information Pro-cessing Letters, 96(4):151–153,November 30, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ambainis:2000:HRS
[Amb00] Andris Ambainis. How rich isthe structure of the intrinsiccomplexity of learning. Informa-tion Processing Letters, 75(3):109–112, August 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/28/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/28/27/article.
pdf.
Ambainis:2001:LFL
[Amb01] Andris Ambainis. On learn-ing formulas in the limit andwith assurance. InformationProcessing Letters, 77(1):9–11,
January 31, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/24/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/24/25/article.
pdf.
Appa:2005:STA
[AMM05] G. Appa, D. Magos, andI. Mourtos. On the system oftwo all different predicates. In-formation Processing Letters, 94(3):99–105, May 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Arkin:2003:MLW
[AMP03] Esther M. Arkin, Joseph S. B.Mitchell, and Christine D. Pi-atko. Minimum-link watchmantours. Information Process-ing Letters, 86(4):203–207, May31, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Anderson:2001:SPT
[AMR01] James H. Anderson, MarkMoir, and Srikanth Rama-murthy. A simple proof tech-nique for priority-scheduledsystems. Information Pro-cessing Letters, 77(2–4):63–70,February 28, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
REFERENCES 57
10/23/20/68/29/26/article.
pdf.
Arkin:2008:CCC
[AMS08] Esther M. Arkin, Joseph S. B.Mitchell, and Jack Snoeyink.Capturing crossings: Convexhulls of segment and plane in-tersections. Information Pro-cessing Letters, 107(5):194–197,August 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Amtoft:2008:SMP
[Amt08] Torben Amtoft. Slicing formodern program structures: atheory for eliminating irrelevantloops. Information Process-ing Letters, 106(2):45–51, April15, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Antonellis:2009:ACC
[AMT09] Panagiotis Antonellis, ChristosMakris, and Nikos Tsirakis. Al-gorithms for clustering click-stream data. Information Pro-cessing Letters, 109(8):381–385,March 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Amir:2009:PMN
[AN09] Amihood Amir and GonzaloNavarro. Parameterized match-ing on non-linear structures.Information Processing Letters,109(15):864–867, July 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Andersson:2009:HNC
[And09] Daniel Andersson. Hashi-wokakero is NP-complete. In-formation Processing Letters,109(19):1145–1146, September15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
[ANR05] Siva Anantharaman, PaliathNarendran, and Michael Rusi-nowitch. Closure properties anddecision problems of dag au-tomata. Information Process-ing Letters, 94(5):231–240, June15, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Adamus:2009:NCP
[AOS+09] Lech Adamus, Beata Orchel, Ar-tur Szymanski, A. Pawe l Wo-jda, and Ma lgorzata Zwonek. Anote on t-complementing permu-tations for graphs. Informa-tion Processing Letters, 110(2):44–45, December 16, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Avidor:2006:NUG
[AR06] Adi Avidor and Ricky Rosen.A note on Unique Games. In-formation Processing Letters, 99(3):87–91, August 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
(6):287–292, December 31, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Araki:2007:TDB
[Ara07] Toru Araki. On the k-tupledomination of de Bruijn andKautz digraphs. InformationProcessing Letters, 104(3):86–90, October 31, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Ayala-Rincon:2007:VFJ
[ARdAdS07] Mauricio Ayala-Rincon, Bruno T.de Abreu, and Jose de Siqueira.A variant of the Ford–Johnsonalgorithm that is more space ef-ficient. Information ProcessingLetters, 102(5):201–207, May31, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Ayala-Rincon:2002:FVE
[ARdFPS02] Mauricio Ayala-Rincon, Alexsan-dro F. da Fonseca, Haydee Wer-neck Poubel, and Jose Siqueira.A framework to visualize equiv-alences between computationalmodels of regular languages. In-formation Processing Letters, 84(1):5–16, October 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Aronov:2002:LBV
[Aro02] Boris Aronov. A lower boundon Voronoi diagram complexity.Information Processing Letters,83(4):183–185, August 31, 2002.
[Ars08] Abdullah N. Arslan. An al-gorithm with linear expectedrunning time for string edit-ing with substitutions and sub-string reversals. InformationProcessing Letters, 106(5):213–218, May 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Arya:2002:BSP
[Ary02] Sunil Arya. Binary space par-titions for axis-parallel line seg-ments: Size-height tradeoffs. In-formation Processing Letters, 84(4):201–206, November 30, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Araki:2002:EPR
[AS02a] Tom Araki and Yukio Shibata.Erratum to: “Pancyclicity of re-cursive circulant graphs”: [In-form. Process. Lett. 81 (2002)187–190]. Information Process-ing Letters, 84(3):173, Novem-ber 15, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic). See [AS02b].
Araki:2002:PRC
[AS02b] Toru Araki and Yukio Shi-bata. Pancyclicity of recursivecirculant graphs. InformationProcessing Letters, 81(4):187–190, February 28, 2002. CO-DEN IFPLAT. ISSN 0020-0190
[AS07a] Hasan Akın and Irfan Siap.On cellular automata over Ga-lois rings. Information Process-ing Letters, 103(1):24–27, June30, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Alborzi:2007:ETA
[AS07b] Houman Alborzi and HananSamet. Execution time analy-sis of a top-down R-tree con-struction algorithm. Informa-tion Processing Letters, 101(1):6–12, January 16, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Asano:2007:ARV
[Asa07] Tetsuo Asano. Aspect-ratioVoronoi diagram and its com-plexity bounds. InformationProcessing Letters, 105(1):26–31, December 31, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Asano:2008:OUI
[Asa08] Tetsuo Asano. Online unifor-mity of integer points on aline. Information ProcessingLetters, 109(1):57–60, December16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 81
Abrahamson:2005:ETB
[ASW05] Jeff Abrahamson, Ali Shoko-ufandeh, and Pawel Winter. Eu-clidean TSP between two nestedconvex obstacles. InformationProcessing Letters, 95(2):370–375, July 31, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Attie:2002:WFB
[Att02] Paul Attie. Wait-free Byzantineconsensus. Information Process-ing Letters, 83(4):221–227, Au-gust 31, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Audsley:2001:PAF
[Aud01] N. C. Audsley. On prior-ity assignment in fixed pri-ority scheduling. Informa-tion Processing Letters, 79(1):39–44, May 31, 2001.CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http:/
/www.elsevier.nl/gej%2Dng/
10/23/20/80/25/31/abstract.
html; http://www.elsevier.
nl/gej%2Dng/10/23/20/80/25/
31/article.pdf.
Avoine:2007:HSC
[AV07] Gildas Avoine and Serge Vau-denay. How to safely close adiscussion. Information Pro-cessing Letters, 102(4):138–142,May 16, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Aggarwal:2004:SAR
[AW04] Alok Aggarwal and YoungcheulWee. On the symmetricangle-restricted nearest neigh-bor problem. Information Pro-cessing Letters, 92(3):121–126,November 15, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ann:2008:FSA
[AYTH08] Hsing-Yen Ann, Chang-BiauYang, Chiou-Ting Tseng, andChiou-Yi Hor. A fast andsimple algorithm for comput-ing the longest common subse-quence of run-length encodedstrings. Information ProcessingLetters, 108(6):360–364, Novem-ber 30, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Almeida:2008:DAB
[AZ08] Jorge Almeida and Marc Zeitoun.Description and analysis of abottom-up DFA minimizationalgorithm. Information Process-ing Letters, 107(2):52–59, July16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Ben-Amram:2003:TCF
[BA03a] Amir M. Ben-Amram. Tighterconstant-factor time hierarchies.Information Processing Letters,87(1):39–44, July 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 82
Bruda:2003:LCP
[BA03b] Stefan D. Bruda and Se-lim G. Akl. On limits on thecomputational power of data-accumulating algorithms. In-formation Processing Letters, 86(4):221–227, May 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Bletsas:2006:OPA
[BA06] Konstantinos Bletsas and NeilAudsley. Optimal priority as-signment in the presence ofblocking. Information Process-ing Letters, 99(3):83–86, August16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Bach:2007:BED
[Bac07] Eric Bach. Bounds for the ex-pected duration of the monopo-list game. Information Process-ing Letters, 101(2):86–92, Jan-uary 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Bars:2001:LFM
[Bar01a] Jean-Marie Le Bars. The 0-1 law fails for monadic exis-tential second-order logic onundirected graphs. Informa-tion Processing Letters, 77(1):43–48, January 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[BB05] J. A. Bergstra and I. Bethke.An upper bound for the equa-tional specification of finite stateservices. Information Process-ing Letters, 94(6):267–269, June30, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Bubeck:2009:NCT
[BB09] Uwe Bubeck and Hans KleineBuning. A new 3-CNF transfor-mation by parallel-serial graphs.Information Processing Letters,109(7):376–379, March 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Barbuti:2002:AIO
[BBD02] R. Barbuti, C. Bernardeschi,and N. De Francesco. Ab-stract interpretation of opera-tional semantics for secure infor-mation flow. Information Pro-cessing Letters, 83(2):101–108,July 31, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Barbosa:2001:PDG
[BBF01] Valmir C. Barbosa, MarioR. F. Benevides, and AyruL. Oliveira Filho. A prioritydynamics for generalized drink-ing philosophers. Information
[BBM06] Patricia Bouyer, Thomas Bri-haye, and Nicolas Markey. Im-proved undecidability results onweighted timed automata. In-formation Processing Letters, 98(5):188–194, June 15, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Baldoni:2008:AGE
[BBMR08] Roberto Baldoni, Francois Bon-net, Alessia Milani, and MichelRaynal. Anonymous graph ex-ploration without collision bymobile robots. Information Pro-cessing Letters, 109(2):98–103,December 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Bagchi:2006:AMW
[BBS06a] Amitabha Bagchi, Ankur Bhar-gava, and Torsten Suel. Approx-imate maximum weight branch-ings. Information Process-ing Letters, 99(2):54–58, July31, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 84
Baier:2006:NAP
[BBS06b] Christel Baier, Nathalie Bertrand,and Philippe Schnoebelen. Anote on the attractor-propertyof infinite-state Markov chains.Information Processing Letters,97(2):58–63, January 31, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Bender:2000:PGT
[BC00] Michael A. Bender and Chan-dra Chekuri. Performanceguarantees for the TSP witha parameterized triangle in-equality. Information Pro-cessing Letters, 73(1–2):17–21,January 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/25/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/25/28/article.
pdf.
Biro:2007:IKE
[BC07] Peter Biro and Katarına Cechlarova.Inapproximability of the kidneyexchange problem. Informa-tion Processing Letters, 101(5):199–202, March 16, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Balbuena:2005:SCO
[BCD+05] C. Balbuena, M. Cera, A. Dianez,P. Garcıa-Vazquez, and X. Mar-cote. Sufficient conditions for λ′-optimality of graphs with small
[BD04] Rainer E. Burkard and Vladimir G.Deineko. On the Euclidean TSPwith a permuted Van der Veenmatrix. Information ProcessingLetters, 91(6):259–262, Septem-ber 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Burmester:2005:SSG
[BD05] Mike Burmester and YvoDesmedt. A secure and scalableGroup Key Exchange system.Information Processing Letters,94(3):137–143, May 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Bhattacharyya:2008:USD
[BD08] Bishnu Bhattacharyya andFrank Dehne. Using spine de-compositions to efficiently solvethe length-constrained heaviestpath problem for trees. Infor-mation Processing Letters, 108(5):293–297, November 15, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 86
Bitner:2009:FSE
[BD09] Steven Bitner and OvidiuDaescu. Farthest segments andextremal triangles spanned bypoints in R3. Information Pro-cessing Letters, 109(20):1167–1171, September 30, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Bezerra:2004:SAC
[BdATdC04] Byron L. D. Bezerra and Fran-cisco de A. T. de Carvalho. Asymbolic approach for content-based information filtering. In-formation Processing Letters, 92(1):45–52, October 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Biernacki:2005:DED
[BDcS05] Dariusz Biernacki, Olivier Danvy,and Chung chieh Shan. On thedynamic extent of delimited con-tinuations. Information Process-ing Letters, 96(1):7–17, Octo-ber 16, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Bornstein:2006:PCA
[BdFdS06] Claudson Bornstein, CelinaM. H. de Figueiredo, andVinıcius G. P. de Sa. ThePair Completion algorithm forthe Homogeneous Set SandwichProblem. Information Process-ing Letters, 98(3):87–91, May16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Brosenne:2007:AO
[BDHW07] Henrik Brosenne, Carsten Damm,Matthias Homeister, and StephanWaack. On approximation by ⊕-OBDDs. Information Process-ing Letters, 102(1):17–21, April15, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Berman:2007:COC
[BDKW07] Piotr Berman, Bhaskar Das-Gupta, Ming-Yang Kao, and JieWang. On constructing an op-timal consensus clustering frommultiple clusterings. Informa-tion Processing Letters, 104(4):137–145, November 15, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Birmele:2009:MAO
[BDL09] Etienne Birmele, Francois Del-bot, and Christian Laforest.Mean analysis of an online algo-rithm for the vertex cover prob-lem. Information ProcessingLetters, 109(9):436–439, April15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Boulinier:2008:SET
[BDLP08] Christian Boulinier, Ajoy K.Datta, Lawrence L. Larmore,and Franck Petit. Space efficientand time optimal distributedBFS tree construction. Infor-mation Processing Letters, 108(5):273–278, November 15, 2008.CODEN IFPLAT. ISSN 0020-
REFERENCES 87
0190 (print), 1872-6119 (elec-tronic).
Blundo:2000:VCG
[BDN00] Carlo Blundo, Alfredo De San-tis, and Moni Naor. Vi-sual cryptography for grey levelimages. Information Pro-cessing Letters, 75(6):255–259,November 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/31/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/31/27/article.
pdf.
Bu:2008:FLN
[BDQ08] Tian-Ming Bu, Xiaotie Deng,and Qi Qi. Forward lookingNash equilibrium for keywordauction. Information Process-ing Letters, 105(2):41–46, Jan-uary 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Buhrman:2003:QZE
[BdW03] Harry Buhrman and Ronaldde Wolf. Quantum zero-error al-gorithms cannot be composed.Information Processing Letters,87(2):79–84, July 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Barequet:2005:OBC
[BE05] Gill Barequet and Gershon El-ber. Optimal bounding conesof vectors in three dimensions.Information Processing Letters,
93(2):83–89, January 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Bouajjani:2000:EAA
[BEF+00] Ahmed Bouajjani, Javier Es-parza, Alain Finkel, OdedMaler, Peter Rossmanith, BernardWillems, and Pierre Wolper.An efficient automata approachto some problems on context-free grammars. InformationProcessing Letters, 74(5–6):221–227, June 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[BEL08] Joachim Biskup, David W. Em-bley, and Jan-Hendrik Lochner.Reducing inference control toaccess control for normalizeddatabase schemas. InformationProcessing Letters, 106(1):8–12,March 31, 2008. CODEN IF-
[BEP09] Nicolas Bourgeois, Bruno Es-coffier, and Vangelis Th. Paschos.Approximation of min coloringby moderately exponential algo-rithms. Information ProcessingLetters, 109(16):950–954, July31, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Bertault:2000:FDA
[Ber00] Francois Bertault. A force-directed algorithm that pre-serves edge-crossing properties.Information Processing Letters,74(1–2):7–13, April 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[BF03] Thorsten Bernholt and RolandFried. Computing the updateof the repeated median regres-sion line in linear time. In-formation Processing Letters, 88(3):111–117, November 15, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Bona:2009:ANB
[BF09] Miklos Bona and Ryan Flynn.The average number of block in-terchanges needed to sort a per-mutation and a recent result ofStanley. Information ProcessingLetters, 109(16):927–931, July31, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Bansal:2009:CDB
[BFB09] Mukul S. Bansal and DavidFernandez-Baca. Computingdistances between partial rank-ings. Information ProcessingLetters, 109(4):238–241, Jan-uary 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 89
Berczi:2009:LTA
[BFK09] Kristof Berczi, Satoru Fujishige,and Naoyuki Kamiyama. Alinear-time algorithm to finda pair of arc-disjoint span-ning in-arborescence and out-arborescence in a directedacyclic graph. InformationProcessing Letters, 109(23–24):1227–1231, November 15, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Bein:2000:LBR
[BFL00] Wolfgang W. Bein, Rudolf Fleis-cher, and Lawrence L. Larmore.Limited bookmark randomizedonline algorithms for the pag-ing problem. Information Pro-cessing Letters, 76(4–6):155–162, December 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/28/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/28/25/article.
pdf.
Bonizzoni:2001:SSSa
[BFMZ01a] P. Bonizzoni, C. Ferretti,G. Mauri, and R. Zizza. Sep-arating some splicing models.Information Processing Letters,79(6):255–259, September 30,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/80/37/27/abstract.html.
Bonizzoni:2001:SSSb
[BFMZ01b] P. Bonizzoni, C. Ferretti,G. Mauri, and R. Zizza. Sep-arating some splicing models.Information Processing Letters,79(6):255–259, September 30,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
[BGHP09] Bernd Bank, Marc Giusti, JoosHeintz, and Luis Miguel Pardo.On the intrinsic complexity ofpoint finding in real singular hy-persurfaces. Information Pro-cessing Letters, 109(19):1141–1144, September 15, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Bose:2008:FPR
[BGK+08] Prosenjit Bose, Hua Guo, Evan-gelos Kranakis, Anil Mahesh-wari, Pat Morin, Jason Morri-son, Michiel Smid, and YihuiTang. On the false-positive rateof Bloom filters. InformationProcessing Letters, 108(4):210–213, October 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Boichut:2008:TLS
[BH08a] Y. Boichut and P.-C. Heam. Atheoretical limit for safety veri-fication techniques with regularfix-point computations. Infor-mation Processing Letters, 108(1):1–2, September 15, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Bordihn:2008:NCD
[BH08b] Henning Bordihn and MarkusHolzer. A note on cooperatingdistributed grammar systems
working in combined modes.Information Processing Letters,108(1):10–14, September 15,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Bockenhauer:2000:AAT
[BHK+00] Hans-Joachim Bockenhauer, Ju-raj Hromkovic, Ralf Klas-ing, Sebastian Seibert, andWalter Unger. Approxima-tion algorithms for the TSPwith sharpened triangle in-equality. Information Pro-cessing Letters, 75(3):133–138,August 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/28/
31/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/28/31/article.
pdf.
Baier:2004:PWS
[BHK04] Christel Baier, Holger Her-manns, and Joost-Pieter Ka-toen. Probabilistic weak simula-tion is decidable in polynomialtime. Information ProcessingLetters, 89(3):123–130, Febru-ary 14, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Blaser:2009:DTS
[BHLV09] Markus Blaser, Moritz Hardt,Richard J. Lipton, and Nisheeth K.Vishnoi. Deterministically test-ing sparse polynomial identitiesof unbounded degree. Informa-
[BHM06] S. Brlek, S. Hamadou, andJ. Mullins. A flaw in theelectronic commerce protocolSET. Information ProcessingLetters, 97(3):104–108, Febru-ary 14, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Blaser:2008:ACC
[BHM08] Markus Blaser, Thomas Hey-nen, and Bodo Manthey. Addingcardinality constraints to inte-ger programs with applicationsto maximum satisfiability. Infor-mation Processing Letters, 105(5):194–198, February 29, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Baldoni:2001:ISC
[BHMR01] Roberto Baldoni, Jean-MichelHelary, Achour Mostefaoui,and Michel Raynal. Impos-sibility of scalar clock-basedcommunication-induced check-pointing protocols ensuring theRDT property. InformationProcessing Letters, 80(2):105–111, October 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/80/37/
32/abstract.html.
Born:2003:HDC
[BHW03] Axel Born, Cor A. J. Hurkens,and Gerhard J. Woeginger. Howto detect a counterfeit coin:Adaptive versus non-adaptivesolutions. Information Process-ing Letters, 86(3):137–141, May16, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Brosenne:2006:NOB
[BHW06] Henrik Brosenne, MatthiasHomeister, and Stephan Waack.Nondeterministic ordered bi-nary decision diagrams with re-peated tests and various modesof acceptance. InformationProcessing Letters, 98(1):6–10,April 15, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Bauer:2009:NRT
[BHY09] Joanna Bauer, Dag Haugland,and Di Yuan. New results onthe time complexity and ap-proximation ratio of the Broad-cast Incremental Power algo-rithm. Information ProcessingLetters, 109(12):615–619, May31, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Biham:2002:HDE
[Bih02] Eli Biham. How to decrypt oreven substitute DES-encryptedmessages in 228 steps. Infor-mation Processing Letters, 84(3):117–124, November 15, 2002.CODEN IFPLAT. ISSN 0020-
[BJ08] Attila Bernath and GwenaelJoret. Well-balanced orienta-tions of mixed graphs. Informa-tion Processing Letters, 106(4):149–151, May 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Bachman:2002:MTW
[BJK02] Aleksander Bachman, AdamJaniak, and Mikhail Y. Ko-valyov. Minimizing the to-tal weighted completion timeof deteriorating jobs. Informa-tion Processing Letters, 81(2):81–84, January 31, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/33/
31/abstract.html.
Beimel:2000:LUH
[BK00] Amos Beimel and Eyal Kushile-vitz. Learning unions of high-
dimensional boxes over thereals. Information Process-ing Letters, 73(5–6):213–220,March 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/28/
35/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/28/35/article.
pdf.
Bartha:2004:TTT
[BK04] Miklos Bartha and MiklosKresz. Tutte type theorems forgraphs having a perfect inter-nal matching. Information Pro-cessing Letters, 91(6):277–284,September 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Bohte:2005:ASN
[BK05] Sander M. Bohte and Joost N.Kok. Applications of spikingneural networks. InformationProcessing Letters, 95(6):519–520, September 30, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Burghardt:2001:AGE
[BKS01] J. Burghardt, F. Kammuller,and J. W. Sanders. On the anti-symmetry of Galois embeddings.Information Processing Letters,79(2):57–63, June 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/31/
26/abstract.html; http:
REFERENCES 93
//www.elsevier.nl/gej-ng/
10/23/20/80/31/26/article.
pdf.
Bein:2000:TOA
[BL00] Wolfgang W. Bein and Lawrence L.Larmore. Trackless online algo-rithms for the server problem.Information Processing Letters,74(1–2):73–79, April 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/25/
35/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/25/35/article.
pdf.
Brandstadt:2006:SLT
[BL06] Andreas Brandstadt and Van BangLe. Structure and linear timerecognition of 3-leaf powers. In-formation Processing Letters, 98(4):133–138, May 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Blaser:2003:CSP
[Bla03] Markus Blaser. Computingsmall partial coverings. Informa-tion Processing Letters, 85(6):327–331, March 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Blanchet:2005:SPL
[Bla05] Bruno Blanchet. Security pro-tocols: from linear to classi-cal logic by abstract interpre-tation. Information ProcessingLetters, 95(5):473–479, Septem-ber 15, 2005. CODEN IFPLAT.
ISSN 0020-0190 (print), 1872-6119 (electronic).
Brandstadt:2004:ERA
[BLdR04] Andreas Brandstadt, Van BangLe, and H. N. de Ridder.Efficient robust algorithms forthe Maximum Weight StableSet Problem in chair-free graphclasses. Information ProcessingLetters, 89(4):165–173, Febru-ary 28, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Brandstadt:2002:RVF
[BLL02] Andreas Brandstadt, Hoang-Oanh Le, and Van Bang Le. Onα-redundant vertices in P5-freegraphs. Information ProcessingLetters, 82(3):119–122, May 16,2002. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/86/34/27/abstract.html.
Branke:2002:WRL
[BLME02] Jurgen Branke, Stefan Leppert,Martin Middendorf, and PeterEades. Width-restricted lay-ering of acyclic digraphs withconsideration of dummy nodes.Information Processing Letters,81(2):59–63, January 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/3327/abstract.html.
Bernardeschi:2006:UPR
[BLMM06] C. Bernardeschi, G. Lettieri,L. Martini, and P. Masci. Using
REFERENCES 94
postdomination to reduce spacerequirements of data flow analy-sis. Information Processing Let-ters, 98(1):11–18, April 15, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Bein:2007:UMT
[BLN07] Wolfgang Bein, Lawrence L.Larmore, and John Noga. Uni-form metrical task systems witha limited number of states. In-formation Processing Letters,104(4):123–128, November 15,2007. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Brandstadt:2003:SSN
[BLV03] Andreas Brandstadt, Hoang-Oanh Le, and Jean-Marie Van-herpe. Structure and stabil-ity number of chair-, co-P- andgem-free graphs revisited. In-formation Processing Letters, 86(3):161–167, May 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Boxer:2001:PAA
[BM01] Laurence Boxer and Russ Miller.A parallel algorithm for approx-imate regularity. InformationProcessing Letters, 80(6):311–316, December 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/84/37/
33/abstract.html.
Baldoni:2002:MIE
[BM02a] Roberto Baldoni and GiovannaMelideo. On the minimal in-formation to encode timestampsin distributed computations. In-formation Processing Letters, 84(3):159–166, November 15, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Brandstadt:2002:MWS
[BM02b] Andreas Brandstadt and SuhailMahfud. Maximum Weight Sta-ble Set on graphs without clawand co-claw (and similar graphclasses) can be solved in lin-ear time. Information Process-ing Letters, 84(5):251–259, De-cember 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ben-Moshe:2004:CAL
[BMCK04] Boaz Ben-Moshe, Paz Carmi,and Matthew J. Katz. Com-puting all large sums-of-pairsin Rn and the discrete planartwo-watchtower problem. In-formation Processing Letters, 89(3):137–139, February 14, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Baev:2002:LBP
[BME02] Ivan D. Baev, Waleed M. Meleis,and Alexandre Eichenberger.Lower bounds on precedence-constrained scheduling for par-allel processors. InformationProcessing Letters, 83(1):27–32,
REFERENCES 95
July 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[BMP+00] P. Oscar Boykin, Tal Mor,Matthew Pulver, Vwani Roy-chowdhury, and Farrokh Vatan.A new universal and fault-tolerant quantum basis. Infor-mation Processing Letters, 75(3):101–107, August 31, 2000.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.nl/gej-ng/10/23/
20/64/28/26/abstract.html;
http://www.elsevier.nl/gej-
ng/10/23/20/64/28/26/article.
pdf.
Beyersdorff:2009:CPI
[BMTV09] Olaf Beyersdorff, Arne Meier,Michael Thomas, and Herib-ert Vollmer. The complex-ity of propositional implica-tion. Information ProcessingLetters, 109(18):1071–1077, Au-gust 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Blake:2005:NWN
[BMX05] Ian F. Blake, V. Kumar Murty,and Guangwu Xu. A note onwindow τ -NAF algorithm. In-formation Processing Letters,95(5):496–502, September 15,2005. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Bertsch:2001:SLT
[BN01] E. Bertsch and M.-J. Neder-hof. Size/lookahead tradeoff forLL(k)-grammars. InformationProcessing Letters, 80(3):125–129, November 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/84/35/
28/abstract.html.
Bertsch:2004:FPR
[BN04] E. Bertsch and M.-J. Neder-hof. Fast parallel recognitionof LR language suffixes. In-formation Processing Letters, 92(5):225–229, December 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Bertsch:2007:SOL
[BN07] E. Bertsch and M.-J. Neder-hof. Some observations on LR-like parsing with delayed reduc-tion. Information ProcessingLetters, 104(6):195–199, Decem-ber 16, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 96
Bodirsky:2009:IPV
[BNvO09] Manuel Bodirsky, Gustav Nordh,and Timo von Oertzen. Integerprogramming with 2-variableequations and 1-variable in-equalities. Information Process-ing Letters, 109(11):572–575,May 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Bojanczyk:2007:NAT
[Boj07] Miko laj Bojanczyk. A new al-gorithm for testing if a regu-lar language is locally thresholdtestable. Information Process-ing Letters, 104(3):91–94, Octo-ber 31, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Bollig:2003:VSF
[Bol03] Beate Bollig. A very simplefunction that requires exponen-tial size nondeterministic graph-driven read-once branching pro-grams. Information Process-ing Letters, 86(3):143–148, May16, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Bollig:2005:LLB
[Bol05] Beate Bollig. A large lowerbound on the query complex-ity of a simple boolean function.Information Processing Letters,95(4):423–428, August 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Bollig:2008:NSO
[Bol08a] Beate Bollig. A note on the sizeof OBDDs for the graph of in-teger multiplication. Informa-tion Processing Letters, 109(1):41–43, December 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Bollig:2008:ORO
[Bol08b] Beate Bollig. The optimal read-once branching program com-plexity for the direct storage ac-cess function. Information Pro-cessing Letters, 106(4):171–174,May 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Bollig:2009:SGO
[Bol09a] Beate Bollig. On the size of(generalized) OBDDs for thresh-old functions. InformationProcessing Letters, 109(10):499–503, April 30, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Bolognesi:2009:PRN
[Bol09b] Tommaso Bolognesi. A pseudo-random network mobile automa-ton with linear growth. Informa-tion Processing Letters, 109(13):668–674, June 15, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Borzyszkowski:2000:GIC
[Bor00] Tomasz Borzyszkowski. Gen-eralized interpolation in CASL. Information Processing
[Bou02] Patricia Bouyer. A logical char-acterization of data languages.Information Processing Letters,84(2):75–85, October 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Bergstra:2001:PAC
[BP01] Jan A. Bergstra and AlbanPonse. Process algebra and con-ditional composition. Informa-tion Processing Letters, 80(1):41–49, October 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/84/27/
32/abstract.html.
Baril:2006:ELU
[BP06] Jean-Luc Baril and Jean-MarcelPallo. Efficient lower and up-per bounds of the diagonal-flip distance between triangula-tions. Information ProcessingLetters, 100(4):131–136, Novem-ber 30, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Brewster:2003:CDP
[BR03] Richard C. Brewster and RomeoRizzi. On the complexity ofdigraph packings. InformationProcessing Letters, 86(2):101–106, April 30, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Braben:2001:BT
[Bra01] D. W. Braben. Buckingthe trends. Information Pro-cessing Letters, 77(2–4):85–87,February 28, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
29/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/29/article.
pdf.
Brass:2007:MHC
[Bra07] Peter Brass. Multidimensionalheaps and complementary rangesearching. Information Pro-cessing Letters, 102(4):152–155,May 16, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Brass:2009:UHF
[Bra09] Peter Brass. Universal hashfunctions for an infinite universeand hash trees. InformationProcessing Letters, 109(10):461–462, April 30, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[Bre04] J. Breit. An improved ap-proximation algorithm for two-machine flow shop schedulingwith an availability constraint.Information Processing Letters,90(6):273–278, June 30, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Brodsky:2005:IGB
[Bro05] Alex Brodsky. An impossibil-ity gap between width-4 andwidth-5 permutation branchingprograms. Information Process-ing Letters, 94(4):159–164, May31, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Bohler:2005:BBC
[BRSV05] Elmar Bohler, Steffen Reith,Henning Schnoor, and Herib-ert Vollmer. Bases for Booleanco-clones. Information Process-ing Letters, 96(2):59–66, Octo-ber 31, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Baveja:2000:ALC
[BS00a] Alok Baveja and Aravind Srini-vasan. Approximating low-congestion routing and column-restricted packing problems. In-formation Processing Letters, 74(1–2):19–25, April 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/25/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/25/28/article.
pdf.
Bespamyatnikh:2000:CSP
[BS00b] Sergei Bespamyatnikh andMichael Segal. Covering aset of points by two axis-parallel boxes. InformationProcessing Letters, 75(3):95–100, August 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[BS02] Judit Buki and Csaba Szabo.Complexity of homomorphismsto direct products of graphs. In-formation Processing Letters, 81(4):175–178, February 28, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/35/27/abstract.html.
Berend:2006:DHG
[BS06] Daniel Berend and Amir Sapir.The diameter of Hanoi graphs.Information Processing Letters,98(2):79–85, April 30, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Bird:2007:MLL
[BS07] Richard S. Bird and Stefan Sad-nicki. Minimal on-line labelling.Information Processing Letters,101(1):41–45, January 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Bleischwitz:2008:NER
[BS08a] Yvonne Bleischwitz and Flo-rian Schoppmann. New effi-ciency results for makespan costsharing. Information Process-ing Letters, 107(2):64–70, July16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Bordawekar:2008:APT
[BS08b] Rajesh Bordawekar and OdedShmueli. An algorithm for par-titioning trees augmented withsibling edges. Information Pro-cessing Letters, 108(3):136–142,October 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Bostan:2009:SFA
[BS09] Alin Bostan and Eric Schost.A simple and fast algorithmfor computing exponentials ofpower series. Information Pro-cessing Letters, 109(13):754–756, June 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Booij:2005:GDR
[BtN05] Olaf Booij and Hieu tat Nguyen.A gradient descent rule for spik-ing neurons emitting multiplespikes. Information ProcessingLetters, 95(6):552–558, Septem-ber 30, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Bunde:2004:SOC
[Bun04] David P. Bunde. SPT is opti-mally competitive for uniproces-sor flow. Information Process-ing Letters, 90(5):233–238, June15, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Burkhard:2005:DHP
[Bur05] Walter A. Burkhard. Doublehashing with passbits. Infor-
[BUZ02] Alain Bretto, Stephane Ubeda,and Janez Zerovnik. A poly-nomial algorithm for the strongHelly property. InformationProcessing Letters, 81(1):55–57, January 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/27/
35/abstract.html.
Boldi:2000:CPS
[BV00a] Paolo Boldi and Sebastiano Vi-gna. Coverings that preservesense of direction. InformationProcessing Letters, 75(4):175–180, September 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[BV08] Julia Bottcher and Dan Vi-lenchik. On the tractabilityof coloring semirandom graphs.Information Processing Letters,108(3):143–149, October 16,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Bretto:2009:CCS
[BV09] Alain Bretto and Thierry Vallee.A clique-covering sufficient con-dition for Hamiltonicity ofgraphs. Information Process-ing Letters, 109(20):1156–1160,September 30, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Bansal:2002:NOC
[BVG02] S. S. Bansal, B. Vishal, andP. Gupta. Near optimalCholesky factorization on or-thogonal multiprocessors. In-formation Processing Letters, 84(1):23–30, October 16, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Biaz:2001:CFB
[BW01] Saad Biaz and Jennifer L.Welch. Closed form boundsfor clock synchronization undersimple uncertainty assumptions.
REFERENCES 101
Information Processing Letters,80(3):151–157, November 15,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/35/32/abstract.html.
Bollig:2003:FRO
[BW03] Beate Bollig and Ingo Wegener.Functions that have read-oncebranching programs of quadraticsize are not necessarily testable.Information Processing Letters,87(1):25–29, July 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[BZ02] Hans Kleine Buning and XishunZhao. Polynomial time algo-rithms for computing a repre-sentation for minimal unsatis-fiable formulas with fixed defi-
[BZ06] Iztok Banic and Janez Zerovnik.Fault-diameter of Cartesiangraph bundles. Information Pro-cessing Letters, 100(2):47–51,October 31, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ben-Zwi:2007:LBT
[BZLN07] Oren Ben-Zwi, Oded Lachish,and Ilan Newman. Lowerbounds for testing EuclideanMinimum Spanning Trees. In-formation Processing Letters,102(6):219–225, June 15, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chicano:2008:ACO
[CA08] Francisco Chicano and EnriqueAlba. Ant colony optimizationwith partial order reduction fordiscovering safety property vi-olations in concurrent models.Information Processing Letters,106(6):221–231, June 15, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Cai:2009:LKR
[Cai09] Xuan Cai. Linear kernelizationsfor restricted 3-Hitting Set prob-lems. Information ProcessingLetters, 109(13):730–738, June
[Cap06] Salvatore Caporaso. A decidablecharacterization of the classesbetween lintime and exptime.Information Processing Letters,97(1):36–40, January 16, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Carpentieri:2002:SCM
[Car02] Bruno Carpentieri. Send-ing compressed messages to alearned receiver on a bidirec-tional line. Information Process-ing Letters, 83(2):63–70, July31, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Cholvi:2001:MPC
[CB01] Vicent Cholvi and Pablo Boronat.A minimal property for char-acterizing deadlock-free pro-grams. Information Process-ing Letters, 77(5–6):283–290,March 31, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/32/
33/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/32/33/article.
pdf.
Cholvi:2004:RBM
[CB04] Vicent Cholvi and Josep Bernabeu.Relationships between memory
[CB07] Edward Chlebus and Jordy Bra-zier. Nonstationary Poissonmodeling of Web browsing ses-sion arrivals. Information Pro-cessing Letters, 102(5):187–190,May 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chang:2001:GGQ
[CC01a] Ye-In Chang and Bor-Hsu Chen.A generalized grid quorum strat-egy for k-mutual exclusion indistributed systems. Informa-tion Processing Letters, 80(4):205–212, November 30, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/34/31/abstract.html.
Chen:2001:FTA
[CC01b] Yu-Wei Chen and Kuo-LiangChung. Fault-tolerant algo-rithm for Fast Fourier Trans-form on hypercubes. In-formation Processing Letters,79(1):11–16, May 31, 2001.CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http:/
/www.elsevier.nl/gej%2Dng/
10/23/20/80/25/27/abstract.
html; http://www.elsevier.
REFERENCES 103
nl/gej%2Dng/10/23/20/80/25/
27/article.pdf.
Cheng:2002:SAQ
[CC02] Sheng-Tzong Cheng and Ing-Ray Chen. A self-adjusting qual-ity of service control scheme.Information Processing Letters,83(6):337–344, September 30,2002. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Chang:2003:EPA
[CC03] Chin-Chen Chang and Chi-YienChung. An efficient protocolfor anonymous multicast and re-ception. Information Process-ing Letters, 85(2):99–103, Jan-uary 31, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chen:2005:OAL
[CC05a] Kuan-Yu Chen and Kun-MaoChao. Optimal algorithms forlocating the longest and short-est segments satisfying a sumor an average constraint. In-formation Processing Letters, 96(6):197–201, December 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Cheung:2005:CIP
[CC05b] K. S. Cheung and K. O. Chow.Cycle inclusion property of aug-mented marked graphs. Infor-mation Processing Letters, 94(6):271–276, June 30, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chen:2006:NTI
[CC06a] Yangjun Chen and Yibin Chen.A new tree inclusion algorithm.Information Processing Letters,98(6):253–262, June 30, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chou:2006:RRC
[CC06b] Shih-Chien Chou and Yuan-Chien Chen. Retrievingreusable components with varia-tion points from software prod-uct lines. Information Process-ing Letters, 99(3):106–110, Au-gust 16, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Clifford:2007:SDW
[CC07] Peter Clifford and Raphael Clif-ford. Simple deterministic wild-card matching. InformationProcessing Letters, 101(2):53–54, January 31, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chen:2009:SJB
[CC09] Hue-Ling Chen and Ye-InChang. Spatial joins based onNA-trees. Information Process-ing Letters, 109(13):713–718,June 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Campelo:2004:CHV
[CCF04] Manoel Campelo, RicardoCorrea, and Yuri Frota. Cliques,holes and the vertex coloring
[CCG08] Sebastien Collette, LilianaCucu, and Joel Goossens. In-tegrating job parallelism in real-time scheduling theory. Infor-mation Processing Letters, 106(5):180–187, May 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Carrabs:2005:LTA
[CCGP05] F. Carrabs, R. Cerulli, M. Gen-tili, and G. Parlato. A lin-ear time algorithm for the mini-mum Weighted Feedback VertexSet on diamonds. InformationProcessing Letters, 94(1):29–35,April 15, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chung:2002:DCK
[CCKL02] Ilyong Chung, Wankyu Choi,Youngchel Kim, and Mike Lee.The design of conference keydistribution system employinga symmetric balanced incom-plete block design. Informa-tion Processing Letters, 81(6):313–318, March 31, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/37/
31/abstract.html. See erra-tum [Chu04].
Cazorla:2001:PAP
[CCVP01] D. Cazorla, F. Cuartero,V. Valero, and F. L. Pelayo. Aprocess algebra for probabilisticand nondeterministic processes.Information Processing Letters,80(1):15–23, October 15, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/27/29/abstract.html.
Chan:2007:GOF
[CCY+07] Joseph Wun-Tat Chan, FrancisY. L. Chin, Deshi Ye, YongZhang, and Hong Zhu. Greedyonline frequency allocation incellular networks. InformationProcessing Letters, 102(2–3):55–61, April 30, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[CD09] Arturo Carpi and ValerioD’Alonzo. On a word avoid-ing near repeats. InformationProcessing Letters, 109(13):679–682, June 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 105
Chatterjee:2004:PFO
[CDC04] Krishnendu Chatterjee, Pal-lab Dasgupta, and P. P.Chakrabarti. The power offirst-order quantification overstates in branching and lineartime temporal logics. Informa-tion Processing Letters, 91(5):201–210, September 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chin:2004:SAC
[CDF+04] Francis Y. L. Chin, Alfredo DeSantis, Anna Lisa Ferrara, N. L.Ho, and S. K. Kim. A sim-ple algorithm for the constrainedsequence problems. Informa-tion Processing Letters, 90(4):175–179, May 31, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Costagliola:2001:DCP
[CDFG01] G. Costagliola, V. Deufemia,F. Ferrucci, and C. Gravino.Decidability of the consistencyproblem for regular symbolicpicture description languages.Information Processing Letters,80(3):119–124, November 15,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/35/27/abstract.html.
Cimato:2005:ICV
[CDFM05] Stelvio Cimato, Alfredo De San-tis, Anna Lisa Ferrara, and Bar-bara Masucci. Ideal contrast vi-sual cryptography schemes with
[CDKK02] L. Paul Chew, Haggai David,Matthew J. Katz, and Klara Ke-dem. Walking around fat ob-stacles. Information ProcessingLetters, 83(3):135–140, August16, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Carpi:2002:CPF
[CdL02] Arturo Carpi and Aldo de Luca.A combinatorial property of thefactor poset of a word. Informa-tion Processing Letters, 81(1):35–39, January 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/27/
32/abstract.html.
Codenotti:2004:AAH
[CDL+04] Bruno Codenotti, GianlucaDe Marcoo, Mauro Leoncini,Manuela Montangero, and Mas-simo Santini. Approximationalgorithms for a hierarchicallystructured bin packing problem.Information Processing Letters,89(5):215–221, March 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 106
Costantini:2002:ERA
[CDP02] Stefania Costantini, OttavioD’Antona, and AlessandroProvetti. On the equivalenceand range of applicability ofgraph-based representations oflogic programs. InformationProcessing Letters, 84(5):241–249, December 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chandran:2009:CBG
[CDS09] L. Sunil Chandran, Anita Das,and Naveen Sivadasan. Onthe cubicity of bipartite graphs.Information Processing Letters,109(9):432–435, April 15, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Cesati:2002:PCC
[Ces02] Marco Cesati. Perfect Codeis W [1]-complete. InformationProcessing Letters, 81(3):163–168, February 14, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/34/
34/abstract.html.
Cheng:2002:KRG
[CF02] Qi Cheng and Fang Fang. Kol-mogorov random graphs onlyhave trivial stable colorings. In-formation Processing Letters, 81(3):133–136, February 14, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/34/29/abstract.html.
Cichacz:2009:FP
[CF09] Sylwia Cichacz and DaliborFroncek. Factorization of Kn,n
into (0, j)-prisms. InformationProcessing Letters, 109(16):932–934, July 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[CFS09] S. Cabello, M. Fort, and J. A.Sellares. Higher-order Voronoidiagrams on triangulated sur-faces. Information ProcessingLetters, 109(9):440–445, April15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Chen:2008:RPC
[CFvG08] Taolue Chen, Wan Fokkink, andRob van Glabbeek. Ready topreorder: The case of weakprocess semantics. InformationProcessing Letters, 109(2):104–111, December 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 107
Chen:2001:CHN
[CFW01] Lusheng Chen, Fang-Wei Fu,and Victor K.-W. Wei. On theconstructions of highly nonlin-ear zigzag functions and un-biased functions. Informa-tion Processing Letters, 79(3):135–140, July 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/32/
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/32/30/article.
pdf.
Castro:2000:PSP
[CG00] Jorge Castro and David Gui-jarro. PACS, simple-PAC andquery learning. InformationProcessing Letters, 73(1–2):11–16, January 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/25/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/25/27/article.
pdf.
Chockler:2004:LBT
[CG04a] Hana Chockler and Dan Gutfre-und. A lower bound for test-ing juntas. Information Process-ing Letters, 90(6):301–305, June30, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Crescenzi:2004:MLC
[CG04b] Pilu Crescenzi and FedericoGreco. The minimum likelycolumn cover problem. Infor-mation Processing Letters, 89(4):175–179, February 28, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chandran:2005:RMV
[CG05] L. Sunil Chandran and FabrizioGrandoni. Refined memoriza-tion for vertex cover. Infor-mation Processing Letters, 93(3):125–131, February 14, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Choffrut:2006:SRR
[CG06] Christian Choffrut and SergeGrigorieff. Separability of ratio-nal relations in A∗×Nm by rec-ognizable relations is decidable.Information Processing Letters,99(1):27–32, July 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Czerwinski:2008:IRF
[CG08] Sebastian Czerwinski and Jaros lawGrytczuk. Invisible runnersin finite fields. InformationProcessing Letters, 108(2):64–67, September 30, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chen:2009:AVD
[CG09] Meirun Chen and Xiaofeng Guo.Adjacent vertex-distinguishing
REFERENCES 108
edge and total chromatic num-bers of hypercubes. InformationProcessing Letters, 109(12):599–602, May 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Cabello:2008:PCD
[CGK08] Sergio Cabello, Panos Gi-annopoulos, and ChristianKnauer. On the parameter-ized complexity of d-dimensionalpoint set pattern matching. In-formation Processing Letters,105(2):73–77, January 16, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Cegielski:2006:MSE
[CGM06] Patrick Cegielski, Irene Gues-sarian, and Yuri Matiyasevich.Multiple serial episodes match-ing. Information Processing Let-ters, 98(6):211–218, June 30,2006. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Czerwinski:2009:LLG
[CGZ09] Sebastian Czerwinski, Jaros lawGrytczuk, and Wiktor Zelazny.Lucky labelings of graphs. In-formation Processing Letters,109(18):1078–1081, August 31,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Cho:2002:REF
[CH02] Hsun-Jung Cho and Li-Yen Hsu.Ring embedding in faulty hon-eycomb rectangular torus. In-
[CH03a] Hsun-Jung Cho and Li-Yen Hsu.Generalized honeycomb torus.Information Processing Letters,86(4):185–190, May 31, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Choi:2003:TSP
[CH03b] Kwanghoon Choi and TaisookHan. A type system for thepush-enter model. InformationProcessing Letters, 87(4):205–211, August 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Cameron:2006:SCI
[CH06] Kathie Cameron and Chınh T.Hoang. On the structure ofcertain intersection graphs. In-formation Processing Letters, 99(2):59–63, July 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chatterjee:2008:RSP
[CH08] Krishnendu Chatterjee andThomas A. Henzinger. Re-duction of stochastic parity tostochastic mean-payoff games.Information Processing Letters,106(1):1–7, March 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 109
Chang:2002:MGC
[Cha02a] Byeong-Mo Chang. Managingthe granularity of constraint-based analyses by rule transfor-mation. Information Process-ing Letters, 83(2):79–88, July31, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Chang:2002:CPP
[Cha02b] Gerard J. Chang. Corrigendumto “The path-partition problemin block graphs”: [InformationProcessing Letters 52 (1994)317–322]. Information Process-ing Letters, 83(5):293, Septem-ber 15, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic). See [YC94].
Chauve:2002:TPM
[Cha02c] Cedric Chauve. Tree patternmatching with a more gen-eral notion of occurrence of thepattern. Information Process-ing Letters, 82(4):197–201, May31, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Chandran:2003:LBH
[Cha03] L. Sunil Chandran. A lowerbound for the hitting set sizefor combinatorial rectangles andan application. InformationProcessing Letters, 86(2):75–78,April 30, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chan:2004:NMI
[Cha04a] Timothy M. Chan. A noteon maximum independent setsin rectangle intersection graphs.Information Processing Letters,89(1):19–23, January 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chandran:2004:MCG
[Cha04b] L. Sunil Chandran. Minimumcuts, girth and a spectral thresh-old. Information Processing Let-ters, 89(3):105–110, February14, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Chataigner:2005:AMA
[Cha05] Frederic Chataigner. Approx-imating the Maximum Agree-ment Forest on k trees. Informa-tion Processing Letters, 93(5):239–244, March 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[Che03] L.-B. Chen. An efficient mini-mum and maximum global snap-shot algorithm. InformationProcessing Letters, 86(3):155–159, May 16, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chen:2004:ERF
[Che04a] Yu-Wei Chen. An enhancedrecursive frequency splittingbroadcasting algorithm for nearvideo-on-demand services. In-formation Processing Letters, 92(6):299–302, December 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Cheung:2004:NCL
[Che04b] K. S. Cheung. New character-ization for live and reversibleaugmented marked graphs. In-formation Processing Letters, 92(5):239–243, December 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chen:2006:SAP
[Che06a] Jing-Chao Chen. A simple algo-rithm for in-place merging. In-formation Processing Letters, 98(1):34–40, April 15, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chen:2006:CSS
[Che06b] Yangjun Chen. On the cost ofsearching signature trees. In-formation Processing Letters, 99
REFERENCES 111
(1):19–26, July 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chen:2007:CPT
[Che07] Xie-Bin Chen. Cycles pass-ing through prescribed edges ina hypercube with some faultyedges. Information ProcessingLetters, 104(6):211–215, Decem-ber 16, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Chen:2009:HPC
[Che09a] Xie-Bin Chen. Hamilto-nian paths and cycles passingthrough a prescribed path in hy-percubes. Information Process-ing Letters, 110(2):77–82, De-cember 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chen:2009:PBH
[Che09b] Xie-Bin Chen. On path bipan-cyclicity of hypercubes. Infor-mation Processing Letters, 109(12):594–598, May 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chen:2009:SRT
[Che09c] Xie-Bin Chen. Some results ontopological properties of foldedhypercubes. Information Pro-cessing Letters, 109(8):395–399,March 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Choi:2009:KDK
[CHH+09] Seung Geol Choi, Javier Her-ranz, Dennis Hofheinz, Jung YeonHwang, Eike Kiltz, Dong HoonLee, and Moti Yung. TheKurosawa–Desmedt key encap-sulation is not chosen-ciphertextsecure. Information ProcessingLetters, 109(16):897–901, July31, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Chung:2009:IBE
[CHK+09] Byungchun Chung, JunbeomHur, Heeyoul Kim, Seong-MinHong, and Hyunsoo Yoon. Im-proved batch exponentiation.Information Processing Letters,109(15):832–837, July 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Charbit:2008:NCS
[CHL+08] Pierre Charbit, Michel Habib,Vincent Limouzy, Fabien de Mont-golfier, Mathieu Raffinot, andMichael Rao. A note on comput-ing set overlap classes. Informa-tion Processing Letters, 108(4):186–191, October 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Czumaj:2005:AAO
[CHLN05] Artur Czumaj, Magnus M.Halldorsson, Andrzej Lingas,and Johan Nilsson. Approxi-mation algorithms for optimiza-tion problems in graphs with su-perlogarithmic treewidth. In-
[CHLN07] Vaston Costa, Edward Haeusler,Eduardo S. Laber, and LoanaNogueira. A note on the sizeof minimal covers. Informa-tion Processing Letters, 102(2–3):124–126, April 30, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Cho:2002:DRU
[Cho02] Haengrae Cho. Database recov-ery using incomplete page ver-sions in a multisystem data shar-ing environment. InformationProcessing Letters, 83(1):49–55,July 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Cholvi:2008:SBN
[Cho08] V. Cholvi. Stability bounds innetworks with dynamic link ca-pacities. Information Process-ing Letters, 109(2):151–154, De-cember 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chung:2000:FMW
[Chu00] Kuo-Liang Chung. On find-ing medians of weighted dis-crete points. Information Pro-cessing Letters, 74(3–4):103–106, May 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
URL http://www.elsevier.
nl/gej-ng/29/28/24/63/27/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/63/27/27/article.
pdf.
Chung:2004:EDC
[Chu04] Ilyong Chung. Erratum to:“The design of conference keydistribution system employing asymmetric balanced incompleteblock design”: [Inform. Pro-cess. Lett. 81 (2002) 313–318].Information Processing Letters,91(6):299–300, September 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). See [CCKL02].
Chen:2006:OOP
[CHU06] J. Chen, R. M. Hierons, andH. Ural. Overcoming observabil-ity problems in distributed testarchitectures. Information Pro-cessing Letters, 98(5):177–182,June 15, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chu:2008:SLT
[Chu08] Frank Pok Man Chu. A sim-ple linear time certifying LBFS-based algorithm for recogniz-ing trivially perfect graphs andtheir complements. InformationProcessing Letters, 107(1):7–12,June 30, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 113
Cai:2009:ECP
[CHZL09] Jiansheng Cai, Jianfeng Hou,Xia Zhang, and Guizhen Liu.Edge-choosability of planargraphs without non-induced 5-cycles. Information ProcessingLetters, 109(7):343–346, March16, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Crochemore:2008:CLP
[CI08] Maxime Crochemore and LucianIlie. Computing Longest Previ-ous Factor in linear time and ap-plications. Information Process-ing Letters, 106(2):75–80, April15, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Cole:2003:SFM
[CIL+03] Richard Cole, Costas Iliopou-los, Thierry Lecroq, WojciechPlandowski, and Wojciech Ryt-ter. On special families of mor-phisms related to δ-matchingand don’t care symbols. In-formation Processing Letters, 85(5):227–233, March 16, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Crochemore:2001:FPB
[CIPR01] Maxime Crochemore, Costas S.Iliopoulos, Yoan J. Pinzon, andJames F. Reid. A fast andpractical bit-vector algorithmfor the Longest Common Sub-sequence problem. InformationProcessing Letters, 80(6):279–
[CIR08] Maxime Crochemore, Costas S.Iliopoulos, and M. Sohel Rah-man. Optimal prefix and suf-fix queries on texts. InformationProcessing Letters, 108(5):320–325, November 15, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chung:2002:EII
[CK02] Tae-Sun Chung and Hyoung-JooKim. Extracting indexing infor-mation from XML DTDs. In-formation Processing Letters, 81(2):97–103, January 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/33/34/abstract.html.
Chandra:2003:DAD
[CK03] Punit Chandra and Ajay D.Kshemkalyani. Distributed al-gorithm to detect strong con-junctive predicates. Informa-tion Processing Letters, 87(5):243–249, September 15, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chatain:2007:WFA
[CK07] Thomas Chatain and VictorKhomenko. On the well-foundedness of adequate orders
REFERENCES 114
used for construction of com-plete unfolding prefixes. Infor-mation Processing Letters, 104(4):129–136, November 15, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Cohen:2008:GMC
[CK08] Reuven Cohen and Liran Katzir.The Generalized Maximum Cov-erage Problem. InformationProcessing Letters, 108(1):15–22, September 15, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Cho:2002:SSD
[CKCB02] Seung Mo Cho, Hyung Ho Kim,Sung Deok Cha, and Doo HwanBae. A semantics of sequence di-agrams. Information ProcessingLetters, 84(3):125–130, Novem-ber 15, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Caragiannis:2002:NBS
[CKK02a] Ioannis Caragiannis, ChristosKaklamanis, and PanagiotisKanellopoulos. New boundson the size of the minimumfeedback vertex set in meshesand butterflies. InformationProcessing Letters, 83(5):275–280, September 15, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chowdhury:2002:EDT
[CKK02b] Rezaul Alam Chowdhury, M. Kaykobad,and Irwin King. An effi-cient decoding technique for
[CKK03a] Ioannis Caragiannis, ChristosKaklamanis, and PanagiotisKanellopoulos. A logarithmicapproximation algorithm for theminimum energy consumptionbroadcast subgraph problem.Information Processing Letters,86(3):149–154, May 16, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chung:2003:EPX
[CKK03b] Yon Dohn Chung, Jong WookKim, and Myoung Ho Kim.Efficient preprocessing of XMLqueries using structured signa-tures. Information ProcessingLetters, 87(5):257–264, Septem-ber 15, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Chang:2004:ETA
[CKKC04] Ku-Young Chang, Howon Kim,Ju-Sung Kang, and Hyun-SookCho. An extension of TYT algo-rithm for GF((2n)m) using pre-computation. Information Pro-cessing Letters, 92(5):231–234,December 16, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 115
Cosmadakis:2001:ODD
[CKL01] Stavros Cosmadakis, GabrielKuper, and Leonid Libkin. Onthe orthographic dimension ofdefinable sets. InformationProcessing Letters, 79(3):141–145, July 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/32/
31/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/32/31/article.
pdf.
Chun:2003:DLC
[CKL+03] Kilsoo Chun, Seungjoo Kim,Sangjin Lee, Soo Hak Sung, andSeonhee Yoon. Differential andlinear cryptanalysis for 2-roundSPNs. Information ProcessingLetters, 87(5):277–282, Septem-ber 15, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Calvo:2001:CPS
[CKM+01] Jorge Alberto Calvo, DannyKrizanc, Pat Morin, MichaelSoss, and Godfried Toussaint.Convexifying polygons with sim-ple projections. InformationProcessing Letters, 80(2):81–86, October 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/80/37/
29/abstract.html.
Cheon:2006:KPC
[CKN06] Jung Hee Cheon, Woo-HwanKim, and Hyun Soo Nam.Known-plaintext cryptanalysisof the Domingo–Ferrer alge-braic privacy homomorphismscheme. Information ProcessingLetters, 97(3):118–123, Febru-ary 14, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Caprara:2000:PMS
[CKP00] Alberto Caprara, Hans Kellerer,and Ulrich Pferschy. A PTASfor the Multiple Subset SumProblem with different knap-sack capacities. InformationProcessing Letters, 73(3–4):111–118, February 29, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/62/27/
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/62/27/30/article.
pdf.
Cohen:2006:EAG
[CKR06] Reuven Cohen, Liran Katzir,and Danny Raz. An efficientapproximation for the General-ized Assignment Problem. Infor-mation Processing Letters, 100(4):162–166, November 30, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Cada:2009:DHC
[CKRR09] Roman Cada, Tomas Kaiser,Moshe Rosenfeld, and Zdenek
REFERENCES 116
Ryjacek. Disjoint Hamilton cy-cles in the star graph. Informa-tion Processing Letters, 110(1):30–35, December 1, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Cachin:2009:FSC
[CKS09] Christian Cachin, Idit Keidar,and Alexander Shraer. Fork se-quential consistency is blocking.Information Processing Letters,109(7):360–364, March 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Collins:2007:NIS
[CKSY07] Michael J. Collins, DavidKempe, Jared Saia, and MaxwellYoung. Nonnegative integralsubset representations of inte-ger sets. Information ProcessingLetters, 101(3):129–133, Febru-ary 14, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Cygan:2009:ETA
[CKW09] Marek Cygan, Lukasz Kowa-lik, and Mateusz Wykurz.Exponential-time approxima-tion of weighted set cover. Infor-mation Processing Letters, 109(16):957–961, July 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chrobak:2006:RGA
[CKY06] Marek Chrobak, Claire Kenyon,and Neal Young. The reversegreedy algorithm for the metric
[CL00a] Eddie Cheng and Marc J. Lip-man. On the Day-Tripathiorientation of the star graphs:Connectivity. Information Pro-cessing Letters, 73(1–2):5–10,January 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/25/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/25/26/article.
pdf.
Colbourn:2000:QDC
[CL00b] Charles J. Colbourn and AlanC. H. Ling. Quorums fromdifference covers. Informa-tion Processing Letters, 75(1–2):9–12, July 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/25/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/25/26/article.
pdf.
Cheng:2003:ATM
[CL03] T. C. Edwin Cheng and Zhao-hui Liu. 3/2-approximation fortwo-machine no-wait flowshopscheduling with availability con-straints. Information Processing
[CL06] Li Chunlin and Li Layuan. QoSbased resource scheduling bycomputational economy in com-putational grid. InformationProcessing Letters, 98(3):119–126, May 16, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Cheng:2009:OAA
[CLC09] Chih-Huai Cheng, Hsiao-FeiLiu, and Kun-Mao Chao. Opti-mal algorithms for the average-constrained maximum-sum seg-ment problem. Information Pro-cessing Letters, 109(3):171–174,January 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Cleary:2002:RRD
[Cle02] Sean Cleary. Restricted ro-tation distance between binarytrees. Information ProcessingLetters, 84(6):333–338, Decem-ber 31, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Chang:2004:SLH
[CLHH04] Chung-Haw Chang, Cheng-Kuan Lin, Hua-Min Huang, andLih-Hsing Hsu. The super lace-ability of the hypercubes. In-formation Processing Letters, 92(1):15–21, October 16, 2004.
[CLL04] Maw-Shang Chang, Chin-HuaLin, and Chuan-Min Lee. Newupper bounds on feedback ver-tex numbers in butterflies. In-formation Processing Letters, 90(6):279–285, June 30, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chao:2008:SIE
[CLL08] Yi-Hsiung Chao, Shun-Shii Lin,and Kwei-Jay Lin. Schedula-bility issues for EDZL schedul-ing on real-time multiprocessorsystems. Information ProcessingLetters, 107(5):158–164, August16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Chen:2009:RAC
[CLM09] Xing Chen, Juan Liu, and Jix-iang Meng. The restrictedarc connectivity of Cartesianproduct digraphs. InformationProcessing Letters, 109(21–22):1202–1205, October 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chung:2007:EAR
[CLT07] Yun-Sheng Chung, Chin LungLu, and Chuan Yi Tang. Ef-ficient algorithms for regularexpression constrained sequencealignment. Information Pro-cessing Letters, 103(6):240–246,
REFERENCES 118
September 15, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chang:2002:GLE
[CLW02] Ji-Woong Chang, Young-KooLee, and Kyu-Young Whang.Global lock escalation in databasemanagement systems. Informa-tion Processing Letters, 82(4):179–186, May 31, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chen:2009:LTA
[CLZ09] Lei Chen, Changhong Lu, andZhenbing Zeng. A linear-timealgorithm for paired-dominationproblem in strongly chordalgraphs. Information Process-ing Letters, 110(1):20–23, De-cember 1, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chen:2007:ILB
[CM07] Wenbin Chen and JiangtaoMeng. An improved lowerbound for approximating Short-est Integer Relation in `∞ norm(SIR∞). Information ProcessingLetters, 101(4):174–179, Febru-ary 28, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Chandran:2005:CCG
[CMO05] L. S. Chandran, C. Mannino,and G. Oriolo. On the cubic-ity of certain graphs. Informa-tion Processing Letters, 94(3):113–118, May 16, 2005. CO-
DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Calude:2003:TCR
[CMS03] Cristian S. Calude, SolomonMarcus, and Ludwig Staiger. Atopological characterization ofrandom sequences. InformationProcessing Letters, 88(5):245–250, December 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Cai:2000:NNN
[CN00] Jin-Yi Cai and Ajay Nerurkar.A note on the non-NP-hardnessof approximate lattice prob-lems under general Cook re-ductions. Information Pro-cessing Letters, 76(1–2):61–66,November 20, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/24/
33/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/24/33/article.
pdf.
Chavez:2003:PPS
[CN03] Edgar Chavez and GonzaloNavarro. Probabilistic proxim-ity search: Fighting the curse ofdimensionality in metric spaces.Information Processing Letters,85(1):39–46, January 16, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 119
Cheng:2006:NAO
[CNK06] T. C. E. Cheng, C. T. Ng,and Vladimir Kotov. A newalgorithm for online uniform-machine scheduling to minimizethe makespan. Information Pro-cessing Letters, 99(3):102–105,August 16, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Coja-Oghlan:2006:IAA
[COK06] Amin Coja-Oghlan and LarsKuhtz. An improved algorithmfor approximating the chromaticnumber of Gn,p. InformationProcessing Letters, 99(6):234–238, September 30, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Comellas:2000:DSW
[COP00] Francesc Comellas, Javier Ozon,and Joseph G. Peters. Deter-ministic small-world communi-cation networks. InformationProcessing Letters, 76(1–2):83–90, November 20, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/24/
36/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/24/36/article.
pdf.
Chen:2005:IDA
[COW05] Zhi-Zhong Chen, YuusukeOkamoto, and Lusheng Wang.Improved deterministic approxi-mation algorithms for Max TSP.
Information Processing Letters,95(2):333–342, July 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Cantu-Paz:2002:OSS
[CP02] Erick Cantu-Paz. Order statis-tics and selection methods ofevolutionary algorithms. Infor-mation Processing Letters, 82(1):15–22, April 15, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/86/27/
29/abstract.html.
Capponi:2005:BFL
[CP05a] Agostino Capponi and ConcettaPilotto. Bounded families for theon-line t-relaxed coloring. In-formation Processing Letters, 96(4):141–145, November 30, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Caprara:2005:MSS
[CP05b] Alberto Caprara and UlrichPferschy. Modified subset sumheuristics for bin packing. In-formation Processing Letters, 96(1):18–23, October 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Choi:2003:ERS
[CPC03] Yong-Jin Choi, Ho-Hyun Park,and Chin-Wan Chung. Estimat-ing the result size of a query
REFERENCES 120
to velocity skewed moving ob-jects. Information ProcessingLetters, 88(6):279–285, Decem-ber 31, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Chen:2006:RGV
[CPX06] Zhenming Chen, Evanthia Pa-padopoulou, and Jinhui Xu. Ro-bustness of k-gon Voronoi dia-gram construction. InformationProcessing Letters, 97(4):138–145, February 28, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chen:2009:FTA
[CQ09] Meirun Chen and JianguoQian. On f -fault tolerant arc-forwarding and optical indicesof all-optical folded hypercubes.Information Processing Letters,109(15):828–831, July 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Caprara:2002:PTB
[CR02] Alberto Caprara and RomeoRizzi. Packing triangles inbounded degree graphs. Infor-mation Processing Letters, 84(4):175–180, November 30, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chakaravarthy:2009:AMW
[CR09] Venkatesan T. Chakaravarthyand Sambuddha Roy. Approx-imating maximum weight K-colorable subgraphs in chordal
[CRW07] Min Chen, Andre Raspaud, andWeifan Wang. Three-coloringplanar graphs without short cy-cles. Information ProcessingLetters, 101(3):134–138, Febru-ary 14, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Chrobak:2000:SAH
[CS00] Marek Chrobak and Jirı Sgall. Asimple analysis of the harmonicalgorithm for two servers. In-formation Processing Letters, 75(1–2):75–77, July 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/25/
38/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/25/38/article.
pdf.
Chandran:2003:SLB
[CS03a] L. Sunil Chandran and C. R.Subramanian. A spectral lowerbound for the treewidth of agraph and its consequences. In-formation Processing Letters, 87(4):195–200, August 31, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 121
Crochemore:2003:WTC
[CS03b] M. Crochemore and V. T. Ste-fanov. Waiting time and com-plexity for matching patternswith automata. InformationProcessing Letters, 87(3):119–125, August 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Codenotti:2005:CCN
[CS05] Bruno Codenotti and DanielStefankovic. On the computa-tional complexity of Nash equi-libria for (0,1) bimatrix games.Information Processing Letters,94(3):145–150, May 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Cleary:2009:RDF
[CS09a] Sean Cleary and Katherine St.John. Rotation distance is fixed-parameter tractable. Informa-tion Processing Letters, 109(16):918–922, July 31, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Cojocaru:2009:EDR
[CS09b] Alina Carmen Cojocaru andIgor E. Shparlinski. On the em-bedding degree of reductions ofan elliptic curve. InformationProcessing Letters, 109(13):652–654, June 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chin:2003:TDC
[CSW03] Francis Y. L. Chin, Hong Shen,and Fu Lee Wang. Transver-sal of disjoint convex polygons.Information Processing Letters,85(1):55–60, January 16, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chang:2000:ESM
[CT00a] Keh-Ning Chang and Shi-ChunTsai. Exact solution of aminimal recurrence. Informa-tion Processing Letters, 75(1–2):61–64, July 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/25/
35/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/25/35/article.
pdf.
Chen:2000:NCM
[CT00b] Liang Chen and NaoyukiTokuda. A note on “cate-gory and measure in complex-ity classes”. Information Pro-cessing Letters, 73(5–6):167–168, March 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/28/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/28/28/article.
pdf.
REFERENCES 122
Chemillier:2003:CWS
[CT03a] Marc Chemillier and CharlotteTruchet. Computation of wordssatisfying the “rhythmic oddityproperty” (after Simha Arom’sworks). Information Process-ing Letters, 86(5):255–261, June15, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Cleary:2003:BRR
[CT03b] Sean Cleary and JenniferTaback. Bounding restrictedrotation distance. InformationProcessing Letters, 88(5):251–256, December 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Cai:2004:NQR
[CT04] Jin-Yi Cai and Robert A.Threlfall. A note on quadraticresiduosity and UP. InformationProcessing Letters, 92(3):127–131, November 15, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Colannino:2005:ACR
[CT05] Justin Colannino and GodfriedToussaint. An algorithm forcomputing the restriction scaf-fold assignment problem in com-putational biology. Informa-tion Processing Letters, 95(4):466–471, August 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).See corrigendum [CT07].
Colannino:2007:CAC
[CT07] Justin Colannino and GodfriedToussaint. Corrigendum to “Analgorithm for computing therestriction Scaffold assignmentproblem in computational bi-ology” [Inform. Process. Lett.95 (4) (2005) 466–471]. Infor-mation Processing Letters, 103(1):44, June 30, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).See [CT05].
Connie:2005:PNA
[CTGN05] Tee Connie, Andrew Teoh,Michael Goh, and David Ngo.Palmhashing: a novel approachfor cancelable biometrics. In-formation Processing Letters, 93(1):1–5, January 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chen:2003:NDL
[CTN03] Liang Chen, Naoyuki Tokuda,and Akira Nagai. A new dif-ferential LSI space-based prob-abilistic document classifier. In-formation Processing Letters, 88(5):203–212, December 16, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Curtis:2004:DHB
[Cur04] S. A. Curtis. Darts and hooplaboard design. Information Pro-cessing Letters, 92(1):53–56, Oc-tober 16, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 123
Cicalese:2000:IHU
[CV00] Ferdinando Cicalese and UgoVaccaro. An improved heuris-tic for “Ulam–Renyi game”.Information Processing Let-ters, 73(3–4):119–124, Febru-ary 29, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/62/27/
31/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/62/27/31/article.
pdf.
Cicalese:2003:BSD
[CV03] Ferdinando Cicalese and UgoVaccaro. Binary search with de-layed and missing answers. In-formation Processing Letters, 85(5):239–247, March 16, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Canete-Valdeon:2008:CSV
[CVEOV08] Jose M. Canete-Valdeon, Fer-nando Enrıquez, Javier Ortega,and Ernesto Velaquez. Clarify-ing the semantics of value in usecases through Jackson’s Prob-lem Frames. Information Pro-cessing Letters, 107(6):221–229,August 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chin:2002:EAT
[CW02] Francis Y. L. Chin and Fu LeeWang. Efficient algorithm fortransversal of disjoint convex
polygons. Information Process-ing Letters, 83(3):141–144, Au-gust 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic). See erra-tum [CW03].
Chin:2003:EEA
[CW03] Francis Y. L. Chin and Fu LeeWang. Erratum to: “Efficientalgorithm for transversal of dis-joint convex polygons”. Infor-mation Processing Letters, 85(1):53, January 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).See [CW02].
Cai:2004:RCB
[CW04] Jin-Yi Cai and Osamu Watan-abe. Relativized collapsing be-tween BPP and PH under strin-gent oracle access. Informa-tion Processing Letters, 90(3):147–154, May 16, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Cheng:2007:CCN
[CW07] Hai-Lung Cheng and Biing-FengWang. On Chen and Chen’s newtree inclusion algorithm. Infor-mation Processing Letters, 103(1):14–18, June 30, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Chang:2009:DGP
[CW09] Jou-Ming Chang and Ro-YuWu. On the diameter of geomet-ric path graphs of points in con-vex position. Information Pro-cessing Letters, 109(8):409–413,
REFERENCES 124
March 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[CWT08] M. L. Chiang, S. C. Wang, andL. Y. Tseng. The incremen-tal agreement. Information Pro-cessing Letters, 107(5):165–170,August 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chrzastowski-Wachtel:2001:DCC
[CWTHR01] Piotr Chrzastowski-Wachtel,Jerzy Tyszkiewicz, Achim Hoff-mann, and Arthur Ramer.Definability of connectives inconditional event algebras ofSchay-Adams-Calabrese andGoodman-Nguyen-Walker. In-formation Processing Letters, 79(4):155–160, August 15, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.nl/gej-ng/10/23/
20/80/33/25/abstract.html;
http://www.elsevier.nl/gej-
ng/10/23/20/80/33/25/article.
pdf.
Chung:2000:NST
[CY00] Kuo-Liang Chung and Wen-Ming Yan. On the numberof spanning trees of a multi-complete/star related graph.Information Processing Let-ters, 76(3):113–119, Decem-
REFERENCES 125
ber 15, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/27/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/27/27/article.
pdf.
Chin:2001:SNP
[CY01a] Kien-Weh Chin and Hsu-ChunYen. The symmetry numberproblem for trees. Informa-tion Processing Letters, 79(2):73–79, June 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/31/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/31/28/article.
pdf.
Chung:2001:EAF
[CY01b] Kuo-Liang Chung and Wen-Ming Yan. An efficient al-gorithm for the Fourier trans-form on a compressed image inrestricted quadtree and shad-ing format. Information Pro-cessing Letters, 79(1):1–5, May31, 2001. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic). URL http:/
/www.elsevier.nl/gej%2Dng/
10/23/20/80/25/25/abstract.
html; http://www.elsevier.
nl/gej%2Dng/10/23/20/80/25/
25/article.pdf.
Chung:2002:FDC
[CY02] Kuo-Liang Chung and Wen-Ming Yan. Fast 2D discrete co-sine transform on compressedimage in restricted quadtreeand shading format. Informa-tion Processing Letters, 81(1):13–21, January 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/27/
29/abstract.html.
Campeanu:2004:PEP
[CY04] Cezar Campeanu and Sheng Yu.Pattern expressions and patternautomata. Information Process-ing Letters, 92(6):267–274, De-cember 31, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Chen:2002:TUB
[CZ02] Zhi-Zhong Chen and ShiqingZhang. Tight upper bound onthe number of edges in a bipar-tite K3,3-free or K5-free graphwith an application. Informa-tion Processing Letters, 84(3):141–145, November 15, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Chen:2009:DCP
[CZ09] Wei Chen and Wenhui Zhang. Adirect construction of polynomial-size OBDD proof of pigeon holeproblem. Information Process-ing Letters, 109(10):472–477,April 30, 2009. CODEN IF-
[Dai09] Liuling Dai. An aggressive algo-rithm for multiple string match-ing. Information ProcessingLetters, 109(11):553–559, May16, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Dalmau:2009:TNP
[Dal09] Vıctor Dalmau. There are nopure relational width 2 con-straint satisfaction problems.Information Processing Letters,109(4):213–218, January 31,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Damaschke:2002:OMO
[Dam02] Peter Damaschke. Optimiz-ing a mail-order with discountand shipping costs. Informa-tion Processing Letters, 82(2):93–97, April 30, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/86/33/
30/abstract.html.
Damaschke:2006:RSP
[Dam06] Peter Damaschke. A remarkon the subsequence problem forarc-annotated sequences withpairwise nested arcs. Informa-tion Processing Letters, 100(2):64–68, October 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Darondeau:2005:ELC
[Dar05] Ph. Darondeau. Equality oflanguages coincides with iso-morphism of reachable stategraphs for bounded and per-sistent Petri nets. Informa-tion Processing Letters, 94(6):241–245, June 30, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Davie:2004:CML
[Dav04] George Davie. Characteris-ing the Martin-Lof random se-quences using computably enu-merable sets of measure one. In-formation Processing Letters, 92(3):157–160, November 15, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Dawande:2003:NCP
[Daw03] Milind Dawande. A notion ofcross-perfect bipartite graphs.Information Processing Letters,88(4):143–147, November 30,2003. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Dutra:2006:FRA
[DB06] Renato C. Dutra and Valmir C.Barbosa. Finding routes inanonymous sensor networks. In-formation Processing Letters, 98(4):139–144, May 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Diaz-Banez:2006:FWE
[DBLS06] J. M. Dıaz-Banez, M. A. Lopez,and J. A. Sellares. On finding a
[dBT08] Mark de Berg and ShripadThite. Cache-oblivious selectionin sorted X + Y matrices. Infor-mation Processing Letters, 109(2):87–92, December 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
deBerg:2002:FMS
[dBvdS02] Mark de Berg and A. Frankvan der Stappen. On the fat-ness of Minkowski sums. In-formation Processing Letters, 81(5):259–264, March 16, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/36/31/abstract.html.
Deo:2007:PDD
[DC07] Narsingh Deo and Aurel Cami.Preferential deletion in dynamicmodels of web-like networks.Information Processing Letters,102(4):156–162, May 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Dermid:2007:HRM
[DCS07] Eric Mc Dermid, ChristineCheng, and Ichiro Suzuki.
Hardness results on the man-exchange stable marriage prob-lem with short preference lists.Information Processing Letters,101(1):13–19, January 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Dubrois:2006:EPT
[DD06] Jacques Dubrois and Jean-Guillaume Dumas. Efficientpolynomial time algorithmscomputing industrial-strengthprimitive roots. InformationProcessing Letters, 97(2):41–45,January 31, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Deng:2008:CAC
[DD08] Xiaotie Deng and Ye Du.The computation of approxi-mate competitive equilibrium isPPAD-hard. Information Pro-cessing Letters, 108(6):369–373,November 30, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
DeLoof:2008:RGM
[DDD08] K. De Loof, B. De Baets, andH. De Meyer. On the randomgeneration of monotone datasets. Information ProcessingLetters, 107(6):216–220, August31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Dahlhaus:2004:LTA
[DDR04] Elias Dahlhaus, Peter Dankel-mann, and R. Ravi. A linear-
REFERENCES 128
time algorithm to compute aMAD tree of an interval graph.Information Processing Letters,89(5):255–259, March 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[Deo05] Sebastian Deorowicz. Contextexhumation after the Burrows–Wheeler transform. Informa-tion Processing Letters, 95(1):313–320, July 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Deorowicz:2006:STI
[Deo06] Sebastian Deorowicz. Speedingup transposition-invariant stringmatching. Information Process-ing Letters, 100(1):14–20, Octo-ber 16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Deorowicz:2009:ASL
[Deo09] Sebastian Deorowicz. An al-gorithm for solving the longestincreasing circular subsequenceproblem. Information Process-ing Letters, 109(12):630–634,May 31, 2009. CODEN IF-
[Der09] Dariusz Dereniowski. Maximumvertex occupation time and in-ert fugitive: Recontaminationdoes help. Information Pro-cessing Letters, 109(9):422–426,April 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Detti:2009:PAM
[Det09] Paolo Detti. A polynomial al-gorithm for the multiple knap-sack problem with divisible itemsizes. Information ProcessingLetters, 109(11):582–584, May16, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Demetrescu:2003:CAF
[DF03] Camil Demetrescu and IreneFinocchi. Combinatorial algo-rithms for feedback problemsin directed graphs. Informa-tion Processing Letters, 86(3):129–136, May 16, 2003. CO-
REFERENCES 129
DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
daFonseca:2003:KHO
[dFdF03] Guilherme D. da Fonseca andCelina M. H. de Figueiredo. Ki-netic heap-ordered trees: Tightanalysis and improved algo-rithms. Information ProcessingLetters, 85(3):165–169, Febru-ary 14, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
deFigueiredo:2009:EWP
[dFdF09] Celina M. H. de Figueiredo andGuilherme D. da Fonseca. En-closing weighted points with analmost-unit ball. InformationProcessing Letters, 109(21–22):1216–1221, October 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
daFonseca:2004:KH
[dFdFC04] Guilherme D. da Fonseca,Celina M. H. de Figueiredo, andPaulo C. P. Carvalho. Kinetichanger. Information ProcessingLetters, 89(3):151–157, Febru-ary 14, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
deFigueiredo:2005:NHS
[dFdS05] Celina M. H. de Figueiredo andVinıcius G. P. de Sa. Note onthe Homogeneous Set SandwichProblem. Information Process-ing Letters, 93(2):75–81, Jan-uary 31, 2005. CODEN IF-
[DFG+03] Mayur Datar, Tomas Feder,Aristides Gionis, Rajeev Mot-wani, and Rina Panigrahy.A combinatorial algorithm forMAX CSP. Information Pro-cessing Letters, 85(6):307–315,March 31, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Santis:2004:CKA
[DFM04] Alfredo De Santis, Anna LisaFerrara, and Barbara Masucci.Cryptographic key assignmentschemes for any access controlpolicy. Information ProcessingLetters, 92(4):199–205, Novem-ber 30, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Downey:2008:PAD
[DFMR08] Rodney G. Downey, Michael R.Fellows, Catherine McCartin,and Frances Rosamond. Param-eterized approximation of dom-inating set problems. Informa-tion Processing Letters, 109(1):68–70, December 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Devillers:2000:LLS
[DG00] Raymond Devillers and JoelGoossens. Liu and Lay-land’s schedulability test re-visited. Information Process-ing Letters, 73(5–6):157–161,March 31, 2000. CODEN
[DGR05] Ajoy K. Datta, Maria Gradi-nariu, and Michel Raynal. Sta-bilizing mobile philosophers. In-formation Processing Letters, 95(1):299–306, July 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
deVGarcia:2001:CMP
[dH01] Alex de V. Garcia and Ed-ward Hermann Haeusler. Codemigration and program main-tainability — A categorical per-spective. Information Pro-cessing Letters, 79(5):249–254,
REFERENCES 131
September 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/80/34/
32/abstract.html.
Drake:2003:SAA
[DH03] Doratha E. Drake and StefanHougardy. A simple approxima-tion algorithm for the weightedmatching problem. InformationProcessing Letters, 85(4):211–213, February 28, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Drake:2004:AAT
[DH04] Doratha E. Drake and Ste-fan Hougardy. On approxima-tion algorithms for the terminalSteiner tree problem. Informa-tion Processing Letters, 89(1):15–18, January 16, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Deng:2006:CME
[DH06] Xiaotie Deng and Li-Sha Huang.On the complexity of marketequilibria with maximum socialwelfare. Information Process-ing Letters, 97(1):4–11, January16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Durand:2008:CCP
[DH08] Arnaud Durand and Miki Her-mann. On the counting com-plexity of propositional circum-scription. Information Pro-cessing Letters, 106(4):164–170,
May 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Derisavi:2003:OSS
[DHS03] Salem Derisavi, Holger Her-manns, and William H. Sanders.Optimal state-space lumping inMarkov chains. InformationProcessing Letters, 87(6):309–315, September 30, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Dietel:2008:NOF
[DHS08] Jana Dietel, Hans-DietrichHecker, and Andreas Spillner. Anote on optimal floodlight illu-mination of stages. InformationProcessing Letters, 105(4):121–123, February 15, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Daza:2009:FSS
[DHS09] Vanesa Daza, Javier Herranz,and German Saez. Flaws insome self-healing key distribu-tion schemes with revocation.Information Processing Letters,109(11):523–526, May 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Diaconescu:2004:HTA
[Dia04] Razvan Diaconescu. Herbrandtheorems in arbitrary institu-tions. Information Process-ing Letters, 90(1):29–37, April15, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 132
Diaconescu:2008:CSF
[Dia08] Razvan Diaconescu. A cate-gorical study on the finitenessof specifications. InformationProcessing Letters, 108(2):75–80, September 30, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Diaconescu:2009:EPA
[Dia09] Razvan Diaconescu. An encod-ing of partial algebras as total al-gebras. Information ProcessingLetters, 109(23–24):1245–1251,November 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Dijkstra:2001:USL
[Dij01] Edsger W. Dijkstra. Un-der the spell of Leibniz’sdream. Information Pro-cessing Letters, 77(2–4):53–61,February 28, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/25/article.
pdf.
Diller:2002:EMV
[Dil02] Antoni Diller. Efficient multi-variate abstraction using an ar-ray representation for combina-tors. Information ProcessingLetters, 84(6):311–317, Decem-ber 31, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Dimauro:2000:RAI
[DIPS00] G. Dimauro, S. Impedovo,G. Pirlo, and A. Salzo. RNSarchitectures for the implemen-tation of the ‘diagonal func-tion’. Information Process-ing Letters, 73(5–6):189–198,March 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/28/
32/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/28/32/article.
pdf.
Dawar:2007:MTF
[DJ07] Anuj Dawar and David Janin.The monadic theory of finiterepresentations of infinite words.Information Processing Letters,103(3):94–101, July 31, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Dunkelman:2008:TIV
[DK08] Orr Dunkelman and NathanKeller. Treatment of the ini-tial value in Time-Memory-DataTradeoff attacks on stream ci-phers. Information ProcessingLetters, 107(5):133–137, August16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Daylight:2009:TBI
[DKV09] Edgar G. Daylight, Wouter M.Koolen, and Paul M. B. Vitanyi.Time-bounded incompressibility
REFERENCES 133
of compressible strings and se-quences. Information Process-ing Letters, 109(18):1055–1059,August 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[DL04] Jerome Durand-Lose. A Kleenetheorem for splitable signals. In-formation Processing Letters, 89(5):237–245, March 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Dori:2006:CAC
[DL06] Shiri Dori and Gad M. Landau.Construction of Aho–Corasickautomaton in linear time for in-teger alphabets. InformationProcessing Letters, 98(2):66–72,April 30, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Delbot:2008:BLH
[DL08] Francois Delbot and ChristianLaforest. A better list heuris-tic for vertex cover. Informa-tion Processing Letters, 107(3–4):125–127, July 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
DiGiacomo:2004:NOD
[DLP04] Emilio Di Giacomo, GiuseppeLiotta, and Maurizio Patrignani.A note on 3D orthogonal draw-ings with direction constrainededges. Information Process-ing Letters, 90(2):97–101, April30, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Dourado:2008:IAR
[DLPS08] Mitre C. Dourado, Min ChihLin, Fabio Protti, and Jayme L.Szwarcfiter. Improved algo-rithms for recognizing p-Hellyand hereditary p-Helly hyper-graphs. Information Process-ing Letters, 108(4):247–250, Oc-tober 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Diaz:2008:DCN
[DLS08] Josep Dıaz, Zvi Lotker, andMaria Serna. The distant-2chromatic number of randomproximity and random geomet-ric graphs. Information Pro-cessing Letters, 106(4):144–148,May 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 134
delaVega:2009:GRG
[dlVT09] W. Fernandez de la Vega andZsolt Tuza. Groupies in ran-dom graphs. Information Pro-cessing Letters, 109(7):339–340,March 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Davida:2009:FAU
[DLX09] George Davida, Bruce Litow,and Guangwu Xu. Fast arith-metics using Chinese remain-dering. Information ProcessingLetters, 109(13):660–662, June15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
DeSantis:2000:SSS
[DM00a] Alfredo De Santis and Bar-bara Masucci. On secret setschemes. Information Pro-cessing Letters, 74(5–6):243–251, June 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/28/
34/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/28/34/article.
pdf.
Dimitrakos:2000:GMT
[DM00b] Theodosis Dimitrakos and TomMaibaum. On a generalizedmodularization theorem. Infor-mation Processing Letters, 74(1–2):65–71, April 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
URL http://www.elsevier.
nl/gej-ng/10/23/20/63/25/
34/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/25/34/article.
pdf.
Duarte:2000:RGD
[DM00c] Carlos H. C. Duarte and TomMaibaum. A rely-guaranteediscipline for open distributedsystems design. Informa-tion Processing Letters, 74(1–2):55–63, April 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/25/
33/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/25/33/article.
pdf.
Devroye:2003:CHF
[DM03] Luc Devroye and Pat Morin.Cuckoo hashing: Further anal-ysis. Information ProcessingLetters, 86(4):215–219, May 31,2003. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Diaz:2005:OSP
[DM05] R. Duran Dıaz and J. MunozMasque. Optimal strong primes.Information Processing Letters,93(1):47–52, January 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 135
Danvy:2008:EBS
[DM08a] Olivier Danvy and Kevin Mil-likin. On the equivalence be-tween small-step and big-stepabstract machines: a simple ap-plication of lightweight fusion.Information Processing Letters,106(3):100–109, April 30, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Drysdale:2008:AAF
[DM08b] R. L. Scot Drysdale and AsishMukhopadhyay. An O(n logn)algorithm for the all-farthest-segments problem for a pla-nar set of points. Informa-tion Processing Letters, 105(2):47–51, January 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Das:2009:SSP
[DM09] Ananya Das and Charles Mar-tel. Stochastic shortest pathwith unlimited hops. Infor-mation Processing Letters, 109(5):290–295, February 15, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Das:2009:IAW
[DMN09] Gautam K. Das, DebapriyayMukhopadhyay, and Subhas C.Nandy. Improved algorithm forthe widest empty 1-corner corri-dor. Information Processing Let-ters, 109(18):1060–1065, August31, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Danvy:2005:CTB
[DN05] Olivier Danvy and Lasse R.Nielsen. CPS transformation ofbeta-redexes. Information Pro-cessing Letters, 94(5):217–224,June 15, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Dereniowski:2006:VRC
[DN06] Dariusz Dereniowski and AdamNadolski. Vertex rankings ofchordal graphs and weightedtrees. Information Process-ing Letters, 98(3):96–100, May16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Das:2008:WBL
[DN08] Gautam K. Das and Subhas C.Nandy. Weighted broadcast inlinear radio networks. Informa-tion Processing Letters, 106(4):136–143, May 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[Doe04] Benjamin Doerr. Global round-ings of sequences. InformationProcessing Letters, 92(3):113–116, November 15, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 136
Duffy:2008:CAD
[DOS08] K. R. Duffy, N. O’Connell, andA. Sapozhnikov. Complexityanalysis of a decentralised graphcolouring algorithm. Informa-tion Processing Letters, 107(2):60–63, July 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Doyen:2007:RPR
[Doy07] Laurent Doyen. Robust para-metric reachability for timedautomata. Information Pro-cessing Letters, 102(5):208–213,May 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
DeMarco:2001:FBU
[DP01] Gianluca De Marco and AndrzejPelc. Faster broadcasting in un-known radio networks. Infor-mation Processing Letters, 79(2):53–56, June 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/31/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/31/25/article.
pdf.
Damian:2006:AHD
[DP06] Mirela Damian and Sriram V.Pemmaraju. APX-hardness ofdomination problems in circlegraphs. Information ProcessingLetters, 97(6):231–237, March31, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Dieudonne:2007:CFW
[DP07] Yoann Dieudonne and FranckPetit. Circle formation of weakrobots and Lyndon words. Infor-mation Processing Letters, 101(4):156–162, February 28, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Dimakopoulos:2005:HCP
[DPP05] Vassilios V. Dimakopoulos,Leonidas Palios, and Athana-sios S. Poulakidas. On theHamiltonicity of the Cartesianproduct. Information Process-ing Letters, 96(2):49–53, Octo-ber 31, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Dovier:2000:NCC
[DPR00] Agostino Dovier, Enrico Pon-telli, and Gianfranco Rossi. Anecessary condition for Con-structive Negation in ConstraintLogic Programming. Informa-tion Processing Letters, 74(3–4):147–156, May 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/63/27/
33/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/63/27/33/article.
pdf.
Domaratzki:2002:SFA
[DPS02] Michael Domaratzki, GiovanniPighizzini, and Jeffrey Shallit.Simulating finite automata with
[DS01] Adrian Dumitrescu and WilliamSteiger. Space-time trade-offsfor some ranking and search-ing queries. Information Pro-cessing Letters, 79(5):237–241,September 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/80/34/
30/abstract.html.
Dinur:2004:HAL
[DS04a] Irit Dinur and Shmuel Safra. Onthe hardness of approximatinglabel-cover. Information Pro-cessing Letters, 89(5):247–254,March 16, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Dougherty:2004:CCP
[DS04b] Daniel J. Dougherty and Stan-ley M. Selkow. The complex-ity of the certification of prop-erties of Stable Marriage. In-formation Processing Letters, 92(6):275–277, December 31, 2004.CODEN IFPLAT. ISSN 0020-
REFERENCES 138
0190 (print), 1872-6119 (elec-tronic).
Dolama:2006:OCN
[DS06] Mohammad Hosseini Dolamaand Eric Sopena. On theoriented chromatic number ofHalin graphs. Information Pro-cessing Letters, 98(6):247–252,June 30, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Carvalho:2008:EGB
[dSCLP08] Ricardo dos Santos Carvalho,Carlile Lavor, and Fabio Protti.Extending the geometric build-up algorithm for the molec-ular distance geometry prob-lem. Information ProcessingLetters, 108(4):234–237, Octo-ber 31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Dobrev:2000:EGC
[DSSV00] Stefan Dobrev, Heiko Schroder,Ondrej Sykora, and ImrichVrt’o. Evolutionary graphcolouring. Information Pro-cessing Letters, 76(1–2):91–94,November 20, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/24/
37/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/24/37/article.
pdf.
Droste:2008:WAD
[DSV08] Manfred Droste, Jacques Sakarovitch,and Heiko Vogler. Weighted au-tomata with discounting. Infor-mation Processing Letters, 108(1):23–28, September 15, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Dorn:2009:QQC
[DT09] Sebastian Dorn and ThomasThierauf. The quantum querycomplexity of the determinant.Information Processing Letters,109(6):325–328, February 28,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
[Dur04] Bruce K. Durgan. Compactsearchable static binary trees.Information Processing Letters,89(1):49–52, January 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Durand:2004:KLS
[DV04] Bruno Durand and NikolaiVereshchagin. Kolmogorov–loveland stochasticity for finitestrings. Information ProcessingLetters, 91(6):263–269, Septem-ber 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Devillers:2006:BUS
[DV06] Raymond Devillers and Lau-rent Van Begin. Boundednessundecidability for synchronizednets. Information ProcessingLetters, 99(5):208–214, Septem-ber 15, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Dankelmann:2009:MSG
[DV09] Peter Dankelmann and LutzVolkmann. Minimum size of agraph or digraph of given radius.Information Processing Letters,109(16):971–973, July 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Dietzfelbinger:2007:CAC
[DW07] Martin Dietzfelbinger and Hen-ning Wunderlich. A character-ization of average case commu-nication complexity. Informa-tion Processing Letters, 101(6):245–249, March 31, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
deWerra:2003:USS
[dWH03] D. de Werra and P. Hansen.Using stable sets to bound thechromatic number. Informa-tion Processing Letters, 87(3):127–131, August 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Dong:2008:EFD
[DYZ08] Qiang Dong, Xiaofan Yang, andJuan Zhao. Embedding a fam-ily of disjoint multi-dimensionalmeshes into a crossed cube. In-formation Processing Letters,108(6):394–397, November 30,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Eisenstat:2007:VDF
[EA07] David Eisenstat and Dana An-gluin. The VC dimension of k-fold union. Information Pro-cessing Letters, 101(5):181–184,March 16, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Fujita:2002:ICC
[eF02] Ken etsu Fujita. An inter-pretation of λµ-calculus in λ-
[Efr08] Pavlos S. Efraimidis. The com-plexity of linear programming in(γ, κ)-form. Information Pro-cessing Letters, 105(5):199–201,February 29, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Eisenbrand:2003:DDC
[EG03] Friedrich Eisenbrand and Fab-rizio Grandoni. Detecting di-rected 4-cycles still faster. In-formation Processing Letters, 87(1):13–15, July 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Engelfriet:2007:ESC
[EG07] Joost Engelfriet and TjallingGelsema. An exercise in struc-tural congruence. InformationProcessing Letters, 101(1):1–5,January 16, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ehrenfeucht:2000:PSC
[EHHR00] Andrzej Ehrenfeucht, JurriaanHage, Tero Harju, and Grze-gorz Rozenberg. Pancyclicityin switching classes. Informa-tion Processing Letters, 73(5–6):153–156, March 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
URL http://www.elsevier.
nl/gej-ng/29/28/24/62/28/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/28/25/article.
pdf.
Ettinger:2004:QQC
[EHK04] Mark Ettinger, Peter Høyer, andEmanuel Knill. The quantumquery complexity of the hid-den subgroup problem is poly-nomial. Information Process-ing Letters, 91(1):43–48, July16, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
[EHRS09] Gabor Erdelyi, Lane A. Hemas-paandra, Jorg Rothe, and Hol-ger Spakowski. Frequency of cor-rectness versus average polyno-mial time. Information Process-ing Letters, 109(16):946–949,July 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Eidenbenz:2002:AAT
[Eid02] Stephan Eidenbenz. Approx-imation algorithms for ter-rain guarding. Information
[EIM02] Thomas Eiter, Toshihide Ibaraki,and Kazuhisa Makino. Recogni-tion and dualization of disguisedbidual Horn functions. Informa-tion Processing Letters, 82(6):283–291, June 30, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Eisenbrand:2001:SVP
[Eis01] Friedrich Eisenbrand. Shortvectors of planar lattices viacontinued fractions. Informa-tion Processing Letters, 79(3):121–126, July 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/32/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/32/28/article.
pdf.
Eisenstat:2009:FUL
[Eis09] David Eisenstat. k-Fold unionsof low-dimensional conceptclasses. Information ProcessingLetters, 109(23–24):1232–1234,November 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Efrat:2000:CEB
[EK00] Alon Efrat and Matthew J.Katz. Computing Euclideanbottleneck matchings in higherdimensions. Information Pro-cessing Letters, 75(4):169–174,September 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/29/
29/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/29/29/article.
pdf.
Ellis:2000:CCP
[EKF00] John Ellis, Tobias Krahn, andHongbing Fan. Computingthe cycles in the perfect shuf-fle permutation. InformationProcessing Letters, 75(5):217–224, October 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/30/
29/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/30/29/article.
pdf.
Epstein:2008:AFP
[EL08] Leah Epstein and Asaf Levin.Asymptotic fully polynomial ap-proximation schemes for vari-ants of open-end bin pack-ing. Information ProcessingLetters, 109(1):32–37, December16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 142
Elmasry:2009:CSP
[Elm09] Amr Elmasry. Computing thesubset partial order for densefamilies of sets. Informa-tion Processing Letters, 109(18):1082–1086, August 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Esperet:2008:IUG
[ELO08] Louis Esperet, Arnaud Labourel,and Pascal Ochem. On induced-universal graphs for the class ofbounded-degree graphs. Infor-mation Processing Letters, 108(5):255–260, November 15, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Elkin:2007:NLB
[ELR07] Michael Elkin, Christian Liebchen,and Romeo Rizzi. New lengthbounds for cycle bases. Infor-mation Processing Letters, 104(5):186–193, November 30, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Elbassioni:2006:UBN
[ELS06] Khaled Elbassioni, Zvi Lotker,and Raimund Seidel. Upperbound on the number of verticesof polyhedra with 0, 1-constraintmatrices. Information Process-ing Letters, 100(2):69–71, Octo-ber 31, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Engelfriet:2006:EPD
[EM06] Joost Engelfriet and SebastianManeth. The equivalence prob-lem for deterministic MSO treetransducers is decidable. Infor-mation Processing Letters, 100(5):206–212, December 16, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Engelhardt:2008:SBM
[EM08] Kai Engelhardt and YoramMoses. Single-bit messages areinsufficient for data link overduplicating channels. Informa-tion Processing Letters, 107(6):235–239, August 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Escoffier:2006:WCF
[EMP06] Bruno Escoffier, Jerome Mon-not, and Vangelis Th. Paschos.Weighted Coloring: furthercomplexity and approximabilityresults. Information ProcessingLetters, 97(3):98–103, February14, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Erk:2007:DCS
[EN07] Katrin Erk and Joachim Niehren.Dominance constraints in strat-ified context unification. Infor-mation Processing Letters, 101(4):141–147, February 28, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 143
Engebretsen:2004:STA
[Eng04] Lars Engebretsen. Simplifiedtight analysis of Johnson’s algo-rithm. Information ProcessingLetters, 92(4):207–210, Novem-ber 30, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Engelfriet:2007:KCC
[Eng07] Joost Engelfriet. A Kleenecharacterization of computabil-ity. Information Processing Let-ters, 101(4):139–140, February28, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Esperet:2007:OCO
[EO07] Louis Esperet and PascalOchem. Oriented colorings of2-outerplanar graphs. Informa-tion Processing Letters, 101(5):215–219, March 16, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Epstein:2000:NLS
[Eps00] Leah Epstein. A note onon-line scheduling with prece-dence constraints on identicalmachines. Information Pro-cessing Letters, 76(4–6):149–153, December 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/28/
24/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/28/24/article.
pdf.
El-Qawasmeh:2004:WPU
[EQ04] Eyas El-Qawasmeh. Word pre-diction using a clustered opti-mal binary search tree. Infor-mation Processing Letters, 92(5):257–265, December 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Effler:2003:CAG
[ER03] Scott Effler and Frank Ruskey.A CAT algorithm for generat-ing permutations with a fixednumber of inversions. Informa-tion Processing Letters, 86(2):107–112, April 30, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Even:2005:HSW
[ERS05] Guy Even, Dror Rawitz, andShimon (Moni) Shahar. Hittingsets when the VC-dimension issmall. Information Process-ing Letters, 95(2):358–362, July31, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Eiben:2002:EC
[ES02] A. E. Eiben and M. Schoenauer.Evolutionary computing. Infor-mation Processing Letters, 82(1):1–6, April 15, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/86/27/
27/abstract.html.
REFERENCES 144
Efraimidis:2006:WRS
[ES06] Pavlos S. Efraimidis and Paul G.Spirakis. Weighted random sam-pling with a reservoir. Informa-tion Processing Letters, 97(5):181–185, March 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[ESZ02] Funda Ergun, Rakesh Sinha,and Lisa Zhang. An improvedFPTAS for Restricted ShortestPath. Information ProcessingLetters, 83(5):287–291, Septem-ber 15, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Esteban:2003:CCT
[ET03] Juan Luis Esteban and JacoboToran. A combinatorial charac-terization of treelike resolutionspace. Information ProcessingLetters, 87(6):295–300, Septem-ber 30, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Etessami:2000:NQP
[Ete00] Kousha Etessami. A note on aquestion of Peled and Wilke re-garding stutter-invariant LTL.
[FB04] Valerio Freschi and Alessan-dro Bogliolo. Longest com-mon subsequence between run-length-encoded strings: a newalgorithm with improved par-allelism. Information Process-ing Letters, 90(4):167–173, May31, 2004. CODEN IFPLAT.
REFERENCES 145
ISSN 0020-0190 (print), 1872-6119 (electronic).
Fujito:2004:ANA
[FD04] Toshihiro Fujito and TakashiDoi. A 2-approximation NCalgorithm for connected vertexcover and tree cover. Informa-tion Processing Letters, 90(2):59–63, April 30, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Fecher:2004:CHT
[Fec04] Harald Fecher. A completed hi-erarchy of true concurrent equiv-alences. Information ProcessingLetters, 89(5):261–265, March16, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Feijen:2001:JFM
[Fei01] W. H. J. Feijen. The joy of for-mula manipulation. Informa-tion Processing Letters, 77(2–4):89–96, February 28, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/30/article.
pdf.
Fertin:2000:HBG
[Fer00] Guillaume Fertin. Hierarchi-cal broadcast and gossip net-works. Information Process-ing Letters, 73(3–4):131–136,February 29, 2000. CODENIFPLAT. ISSN 0020-0190
[Fer05a] Mirtha-Lina Fernandez. Onproving CE -termination ofrewriting by size-change termi-nation. Information ProcessingLetters, 93(4):155–162, Febru-ary 28, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Fernandez:2005:RMI
[Fer05b] Mirtha-Lina Fernandez. Relax-ing monotonicity for innermosttermination. Information Pro-cessing Letters, 93(3):117–123,February 14, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Feofiloff:2007:PDA
[FFFdP07] Paulo Feofiloff, Cristina G. Fer-nandes, Carlos E. Ferreira, andJose Coelho de Pina. Primal-dual approximation algorithmsfor the Prize-Collecting SteinerTree Problem. Information Pro-cessing Letters, 103(5):195–202,August 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Fredriksson:2006:GCA
[FG06] Kimmo Fredriksson and SzymonGrabowski. A general com-pression algorithm that supports
REFERENCES 146
fast searching. Information Pro-cessing Letters, 100(6):226–232,December 31, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Fomin:2009:SSE
[FGK+09a] Fedor V. Fomin, Petr A. Golo-vach, Jan Kratochvıl, DieterKratsch, and Mathieu Liedloff.Sort and Search: Exact algo-rithms for generalized domina-tion. Information ProcessingLetters, 109(14):795–798, June30, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Frati:2009:PPT
[FGK09b] Fabrizio Frati, Markus Geyer,and Michael Kaufmann. Pla-nar packing of trees and spidertrees. Information ProcessingLetters, 109(6):301–307, Febru-ary 28, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Fleischer:2004:FOP
[FGLW04] Rudolf Fleischer, MordecaiGolin, Chin-Tau Lea, andSteven Wong. Finding opti-mal paths in MREP routing.Information Processing Letters,89(2):57–63, January 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Fertin:2002:MFV
[FGR02] Guillaume Fertin, EmmanuelGodard, and Andre Raspaud.Minimum feedback vertex set
and acyclic coloring. Informa-tion Processing Letters, 84(3):131–139, November 15, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Fertin:2003:ADC
[FGR03] Guillaume Fertin, EmmanuelGodard, and Andre Raspaud.Acyclic and k-distance coloringof the grid. Information Process-ing Letters, 87(1):51–58, July16, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Fomin:2006:PCG
[FH06] Fedor V. Fomin and KjartanHøie. Pathwidth of cubic graphsand exact algorithms. Informa-tion Processing Letters, 97(5):191–196, March 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Fischer:2006:INC
[FHK06] Felix Fischer, Markus Holzer,and Stefan Katzenbeisser. Theinfluence of neighbourhood andchoice on the complexity of find-ing pure Nash equilibria. In-formation Processing Letters,99(6):239–245, September 30,2006. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Fiedorowicz:2008:AAE
[FHN08] Anna Fiedorowicz, MariuszHa luszczak, and NarayananNarayanan. About acyclic edge
REFERENCES 147
colourings of planar graphs. In-formation Processing Letters,108(6):412–417, November 30,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Fishburn:2002:SSD
[Fis02] John P. Fishburn. Solving asystem of difference constraintswith variables restricted to a fi-nite set. Information ProcessingLetters, 82(3):143–144, May 16,2002. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
[FJ08b] John S. Fitzgerald and Cliff B.Jones. The connection betweentwo ways of reasoning about par-tial functions. Information Pro-cessing Letters, 107(3–4):128–132, July 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Flanagan:2001:AIM
[FJL01] Cormac Flanagan, Rajeev Joshi,and K. Rustan M. Leino. An-notation inference for modu-lar checkers. Information Pro-cessing Letters, 77(2–4):97–108,February 28, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
31/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/31/article.
pdf.
Feige:2000:FNB
[FK00a] Uriel Feige and Joe Kilian.Finding OR in a noisy broad-cast network. InformationProcessing Letters, 73(1–2):69–75, January 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/25/
36/abstract.html; http:
REFERENCES 148
//www.elsevier.nl/gej-ng/
29/28/24/62/25/36/article.
pdf.
Freund:2000:LBI
[FK00b] Ari Freund and Howard Karloff.A lower bound of 8/(7 + 1
k−1 )on the integrality ratio of theCalinescu-Karloff-Rabani relax-ation for multiway cut. Infor-mation Processing Letters, 75(1–2):43–50, July 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/25/
32/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/25/32/article.
pdf.
Feige:2001:NAM
[FKL01] Uriel Feige, Marek Karpinski,and Michael Langberg. Anote on approximating Max-Bisection on regular graphs.Information Processing Let-ters, 79(4):181–188, August15, 2001. CODEN IF-PLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/33/
29/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/33/29/article.
pdf.
Fayyazi:2006:ALT
[FKM06] Morteza Fayyazi, David Kaeli,and Waleed Meleis. An ad-justable linear time parallel al-gorithm for maximum weight
[FKV04] Zoltan Fulop, Armin Kuhnemann,and Heiko Vogler. A bottom-up characterization of determin-istic top-down tree transducerswith regular look-ahead. Infor-mation Processing Letters, 91(2):57–67, July 31, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Fink:2009:NLB
[FKW09] Irene Fink, Sven O. Krumke,and Stephan Westphal. Newlower bounds for online k-serverrouting problems. InformationProcessing Letters, 109(11):563–567, May 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Furmanczyk:2008:NMT
[FKZ08] Hanna Furmanczyk, AdrianKosowski, and Pawe l Zylinski.A note on mixed tree coloring.Information Processing Letters,106(4):133–135, May 16, 2008.
[FL02] Fedor V. Fomin and AndrzejLingas. Approximation algo-rithms for time-dependent ori-enteering. Information Process-ing Letters, 83(2):57–62, July31, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Fang:2005:EIH
[FL05a] Jywe-Fei Fang and Kuan-ChouLai. Embedding the incompletehypercube in books. Informa-tion Processing Letters, 96(1):1–6, October 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Finkel:2005:CHR
[FL05b] Alain Finkel and Jerome Ler-oux. The convex hull of a regularset of integer vectors is polyhe-dral and effectively computable.Information Processing Letters,96(1):30–35, October 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Feige:2007:IAR
[FL07] Uriel Feige and James R. Lee.An improved approximation ra-tio for the minimum linear ar-rangement problem. Informa-tion Processing Letters, 101(1):26–29, January 16, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[FLJ05] Jianxi Fan, Xiaola Lin, and Xi-aohua Jia. Node-pancyclicityand edge-pancyclicity of crossedcubes. Information ProcessingLetters, 93(3):133–138, Febru-ary 14, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Focardi:2000:FVS
[FLP00] Riccardo Focardi, Flaminia L.Luccio, and David Peleg.Feedback vertex set in hy-percubes. Information Pro-cessing Letters, 76(1–2):1–5,November 20, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/24/
24/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/24/24/article.
pdf.
Fulop:2000:DPA
[FM00] Zoltan Fulop and SebastianManeth. Domains of par-tial attributed tree transduc-ers. Information Process-ing Letters, 73(5–6):175–180,
REFERENCES 150
March 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/28/
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/28/30/article.
pdf.
Fernau:2003:SRS
[FM03] H. Fernau and A. Meduna. Asimultaneous reduction of sev-eral measures of descriptionalcomplexity in scattered contextgrammars. Information Process-ing Letters, 86(5):235–240, June15, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Frandsen:2005:RBC
[FM05] Gudmund Skovbjerg Frandsenand Peter Bro Miltersen. Re-viewing bounds on the circuitsize of the hardest functions. In-formation Processing Letters, 95(2):354–357, July 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Fredriksson:2006:EPS
[FM06] Kimmo Fredriksson and MaximMozgovoy. Efficient parameter-ized string matching. Informa-tion Processing Letters, 100(3):91–96, November 15, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Feder:2009:GTP
[FM09] Tomas Feder and Rajeev Mot-wani. On the graph turn-
[FMCW02] Harald Fecher, Mila Majster-Cederbaum, and Jinzhao Wu.Bundle event structures: A re-vised cpo approach. Informa-tion Processing Letters, 83(1):7–12, July 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Friedman:2004:WFD
[FMR04] Roy Friedman, Achour Moste-faoui, and Michel Raynal. Aweakest failure detector-basedasynchronous consensus proto-col for f < n. InformationProcessing Letters, 90(1):39–46,April 15, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Friedman:2005:ABL
[FMR05] Roy Friedman, Achour Moste-faoui, and Michel Raynal. Asyn-chronous bounded lifetime fail-ure detectors. InformationProcessing Letters, 94(2):85–91,April 30, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Fidytek:2001:ACM
[FMSS01] Robert Fidytek, Andrzej W.Mostowski, Rafa l Somla, andAndrzej Szepietowski. Al-gorithms counting monotone
[FMT03] Jose Luiz Fiadeiro, Jan Madey,and Andrzej Tarlecki. Foreword.Information Processing Letters,88(1–2):1–2, October 17, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Feder:2009:AMC
[FMT09] Tomas Feder, Heikki Mannila,and Evimaria Terzi. Approx-imating the Minimum ChainCompletion problem. Informa-tion Processing Letters, 109(17):980–985, August 16, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Fouquet:2002:NOP
[Fou02] Jean-Luc Fouquet. No oddpairs in minimal imperfect NP5
[FP04] Wojciech Fraczak and AnnaPodolak. A characterizationof s-languages. InformationProcessing Letters, 89(2):65–70,
January 31, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Fusco:2008:ABA
[FP08] Emanuele G. Fusco and An-drzej Pelc. Acknowledged broad-casting in ad hoc radio net-works. Information ProcessingLetters, 109(2):136–141, Decem-ber 31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Fosse:2004:SCP
[FR04] S. Fosse and G. Richomme.Some characterizations of Parikhmatrix equivalent binary words.Information Processing Letters,92(2):77–82, October 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Feige:2006:HAM
[FR06] Uriel Feige and Daniel Reich-man. On the hardness of approx-imating Max-Satisfy. Informa-tion Processing Letters, 97(1):31–35, January 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Fertin:2008:ACG
[FR08] Guillaume Fertin and AndreRaspaud. Acyclic coloring ofgraphs of maximum degree five:Nine colors are enough. Infor-mation Processing Letters, 105(2):65–72, January 16, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 152
Fredman:2003:NTR
[Fre03a] Michael L. Fredman. The num-ber of tests required to searchan unordered table. InformationProcessing Letters, 87(2):85–88,July 31, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Fredriksson:2003:SSM
[Fre03b] Kimmo Fredriksson. Shift-or string matching with super-alphabets. Information Process-ing Letters, 87(4):201–204, Au-gust 31, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Fredriksson:2005:EDC
[Fre05] Kimmo Fredriksson. Exploitingdistance coherence to speed uprange queries in metric indexes.Information Processing Letters,95(1):287–292, July 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Froschle:2005:DBH
[Fro05] S. B. Froschle. The decidabil-ity border of hereditary historypreserving bisimilarity. Informa-tion Processing Letters, 93(6):289–293, March 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Fertin:2003:OCN
[FRR03] Guillaume Fertin, Andre Ras-paud, and Arup Roychowdhury.On the oriented chromatic num-ber of grids. Information Pro-cessing Letters, 85(5):261–266,
March 16, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Farr:2008:NGP
[FS08] Graham Farr and JohannesSchmidt. On the number ofGo positions on lattice graphs.Information Processing Letters,105(4):124–130, February 15,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Feder:2009:NTB
[FS09] Tomas Feder and Carlos Subi.Nearly tight bounds on the num-ber of Hamiltonian circuits ofthe hypercube and generaliza-tions. Information ProcessingLetters, 109(5):267–272, Febru-ary 15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Fuster-Sabater:2003:BNG
[FSGM03] Amparo Fuster-Sabater and Pe-dro Garcıa-Mochales. On thebalancedness of nonlinear gener-ators of binary sequences. In-formation Processing Letters, 85(2):111–116, January 31, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Fekete:2003:CEE
[FSW03] Sandor P. Fekete, MartinSkutella, and Gerhard J. Woeg-inger. The complexity of eco-nomic equilibria for house al-location markets. Information
[Fuc03] Bernhard Fuchs. A note on theterminal Steiner tree problem.Information Processing Letters,87(4):219–220, August 31, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Fujito:2001:AICa
[Fuj01a] Toshihiro Fujito. On approx-imability of the independent/connected edge dominating setproblems. Information Pro-cessing Letters, 79(6):261–266,September 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/80/37/
28/abstract.html.
Fujito:2001:AICb
[Fuj01b] Toshihiro Fujito. On approx-imability of the independent/connected edge dominating setproblems. Information Pro-cessing Letters, 79(6):261–266,September 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/80/37/
28/abstract.html.
Fujita:2003:LGP
[Fuj03] Satoshi Fujita. On-line grid-packing with a single activegrid. Information ProcessingLetters, 85(4):199–204, Febru-ary 28, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Fujiyoshi:2005:LNM
[Fuj05] Akio Fujiyoshi. Linearity andnondeletion on monadic context-free tree grammars. InformationProcessing Letters, 93(3):103–107, February 14, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Fung:2008:LBO
[Fun08] Stanley P. Y. Fung. Lowerbounds on online deadlinescheduling with preemptionpenalties. Information Process-ing Letters, 108(4):214–218, Oc-tober 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 154
Friedman:2003:CCC
[FVC03] Roy Friedman, Roman Viten-berg, and Gregory Chockler. Onthe composability of consistencyconditions. Information Pro-cessing Letters, 86(4):169–176,May 31, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Feige:2003:CFB
[FY03] Uriel Feige and Orly Yahalom.On the complexity of findingbalanced oneway cuts. Informa-tion Processing Letters, 87(1):1–5, July 16, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Gabow:2000:PBD
[Gab00] Harold N. Gabow. Path-baseddepth-first search for strong andbiconnected components. Infor-mation Processing Letters, 74(3–4):107–114, May 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[Gal03] Giulia Galbiati. On finding cy-cle bases and fundamental cyclebases with a shortest maximalcycle. Information ProcessingLetters, 88(4):155–159, Novem-ber 30, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Gamess:2000:PTE
[Gam00] Eric Gamess. plapackJava: To-wards an efficient Java inter-face for high performance par-allel linear algebra. Informa-tion Processing Letters, 75(5):191–197, October 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/30/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/30/26/article.
pdf.
Gavril:2000:MWI
[Gav00] Fanica Gavril. Maximum weightindependent sets and cliquesin intersection graphs of fil-aments. Information Pro-cessing Letters, 73(5–6):181–188, March 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[GCC00] D. J. Guan, Chun-Yen Chou,and Chiou-Wei Chen. Com-putational complexity of sim-ilarity retrieval in a pictorialdatabase. Information Pro-cessing Letters, 75(3):113–117,August 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/28/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/28/28/article.
pdf.
Gunther:2000:CPL
[GD00] Wolfgang Gunther and RolfDrechsler. On the computa-tional power of linearly trans-formed BDDs. Information
[GD04] Ralf Hartmut Guting and Zhim-ing Ding. A simple but effec-tive improvement to the plumb-line algorithm. Information Pro-cessing Letters, 91(6):251–257,September 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Gennaro:2005:SMS
[GD05] Rosario Gennaro and Mario DiRaimondo. Secure multiplica-tion of shared secrets in the ex-ponent. Information Process-ing Letters, 96(2):71–79, Octo-ber 31, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Gregor:2008:PPH
[GD08] Petr Gregor and Tomas Dvorak.Path partitions of hypercubes.Information Processing Letters,108(6):402–406, November 30,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Goswami:2007:CDN
[GDN07] Partha P. Goswami, Sandip Das,and Subhas C. Nandy. Chro-
matic distribution of k-nearestneighbors of a line segment in aplanar colored point set. Infor-mation Processing Letters, 102(4):163–168, May 16, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Garcia:2008:ECQ
[GdPL08] Pedro Garcıa, Manuel Vazquezde Parga, and Damian Lopez.On the efficient construction ofquasi-reversible automata for re-versible languages. Informa-tion Processing Letters, 107(1):13–17, June 30, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Georgakopoulos:2008:CST
[Geo08] George F. Georgakopoulos.Chain-splay trees, or, how toachieve and prove log logN -competitiveness by splaying. In-formation Processing Letters,106(1):37–43, March 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Grabowski:2008:BPS
[GF08] Szymon Grabowski and KimmoFredriksson. Bit-parallel stringmatching under Hamming dis-tance in O(ndm/we) worst casetime. Information ProcessingLetters, 105(5):182–187, Febru-ary 29, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 157
Greenberg:2002:AHL
[GG02] Ronald I. Greenberg and LeeGuan. On the area of hyper-cube layouts. Information Pro-cessing Letters, 84(1):41–46, Oc-tober 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Gaur:2003:AAS
[GGK03] Daya Ram Gaur, Arvind Gupta,and Ramesh Krishnamurti. A5/3-approximation algorithmfor scheduling vehicles on a pathwith release and handling times.Information Processing Letters,86(2):87–91, April 30, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Ghosh:2000:FCS
[GH00a] Sukumar Ghosh and XinHe. Fault-containing self-stabilization using priorityscheduling. Information Pro-cessing Letters, 73(3–4):145–151, February 29, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/62/27/
35/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/62/27/35/article.
pdf.
Granvilliers:2000:CSP
[GH00b] Laurent Granvilliers and GaetanHains. A conservative schemefor parallel interval narrow-ing. Information Process-ing Letters, 74(3–4):141–146,
May 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/63/27/
32/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/63/27/32/article.
pdf.
Guo:2005:ALT
[GH05] J. Y. Guo and F. K. Hwang.An almost-linear time and linearspace algorithm for the longestcommon subsequence problem.Information Processing Letters,94(3):131–135, May 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Galindo:2008:SPK
[GH08] David Galindo and Javier Her-ranz. On the security of publickey cryptosystems with a doubledecryption mechanism. Infor-mation Processing Letters, 108(5):279–283, November 15, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Grauman:2008:HNG
[GHJ+08] Tracy Grauman, Stephen G.Hartke, Adam Jobson, Bill Kin-nersley, Douglas B. West, Les-ley Wiglesworth, Pratik Worah,and Hehui Wu. The hub num-ber of a graph. Information Pro-cessing Letters, 108(4):226–228,October 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 158
Gudmundsson:2002:LBA
[GHL02] Joachim Gudmundsson, ThoreHusfeldt, and Christos Lev-copoulos. Lower bounds for ap-proximate polygon decomposi-tion and minimum gap. Infor-mation Processing Letters, 81(3):137–141, February 14, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
[GHNP02] Clemens Gropl, Stefan Hougardy,Till Nierhoff, and Hans JurgenPromel. Steiner trees in uni-formly quasi-bipartite graphs.Information Processing Letters,83(4):195–200, August 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Ghodosi:2007:INP
[Gho07] Hossein Ghodosi. On insecu-rity of Naor–Pinkas’ distributedoblivious transfer. InformationProcessing Letters, 104(5):179–182, November 30, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Goh:2002:P
[GHS02] William M. Y. Goh, Pawe lHitczenko, and Ali Shokoufan-deh. s-partitions. Informa-tion Processing Letters, 82(6):327–329, June 30, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[GIS04] Alexander Gaysinsky, Alon Itai,and Hadas Shachnai. Stronglycompetitive algorithms forcaching with pipelined prefetch-ing. Information Processing Let-ters, 91(1):19–27, July 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Giurcaneanu:2004:SPN
[Giu04] Ciprian Doru Giurcaneanu. Onsome properties of the NML es-timator for Bernoulli strings. In-formation Processing Letters, 89(4):209–213, February 28, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Giaro:2000:ECS
[GK00] Krzysztof Giaro and MarekKubale. Edge-chromatic sumof trees and bounded cyclic-ity graphs. Information Pro-cessing Letters, 75(1–2):65–69, July 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/25/
36/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/25/36/article.
pdf.
Geerts:2004:TFT
[GK04] Floris Geerts and Bart Kuijpers.Topological formulation of ter-mination properties of iterates offunctions. Information Process-
[GKL09] Leszek Gasieniec, Miros lawKowaluk, and Andrzej Lin-gas. Faster multi-witnessesfor Boolean matrix multiplica-tion. Information ProcessingLetters, 109(4):242–247, Jan-uary 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Gasieniec:2002:ADG
[GL02] Leszek Gasieniec and AndrzejLingas. On adaptive determin-istic gossiping in ad hoc radionetworks. Information Process-ing Letters, 83(2):89–93, July31, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Grieser:2004:ILA
[GL04a] Gunter Grieser and SteffenLange. Incremental learningof approximations from positivedata. Information ProcessingLetters, 89(1):37–42, January16, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Guillaume:2004:BSA
[GL04b] Jean-Loup Guillaume and MatthieuLatapy. Bipartite structure ofall complex networks. Informa-tion Processing Letters, 90(5):215–221, June 15, 2004. CO-
REFERENCES 160
DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Goubault-Larrecq:2005:DR
[GL05] Jean Goubault-Larrecq. Decid-ing H∞ by resolution. Informa-tion Processing Letters, 95(3):401–408, August 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Gottlob:2007:LAM
[GL07] Georg Gottlob and Stephanie TienLee. A logical approach to multi-cut problems. Information Pro-cessing Letters, 103(4):136–141,August 16, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Gotthilf:2009:IAS
[GL09a] Zvi Gotthilf and Moshe Lewen-stein. Improved algorithms forthe k simple shortest paths andthe replacement paths problems.Information Processing Letters,109(7):352–355, March 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Gu:2009:PSO
[GL09b] Manzhan Gu and Xiwen Lu.Preemptive stochastic onlinescheduling on two uniform ma-chines. Information ProcessingLetters, 109(7):369–375, March16, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Glen:2008:NMC
[GLS08] Amy Glen, Aaron Lauve, andFranco V. Saliola. A note onthe Markoff condition and cen-tral words. Information Pro-cessing Letters, 105(6):241–244,March 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Goswami:2002:EMC
[GM02] D. Goswami and R. Mall. Anefficient method for computingdynamic program slices. Infor-mation Processing Letters, 81(2):111–117, January 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/33/36/abstract.html.
Gronau:2007:OIU
[GM07] Ilan Gronau and Shlomo Moran.Optimal implementations ofUPGMA and other commonclustering algorithms. Informa-tion Processing Letters, 104(6):205–210, December 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Ganguly:2008:DKS
[GM08a] Sumit Ganguly and AnirbanMajumder. Deterministic K-setstructure. Information Process-ing Letters, 109(1):27–31, De-cember 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 161
Goldwasser:2008:SCA
[GM08b] Michael H. Goldwasser andArundhati Bagchi Misra. Asimpler competitive analysis forscheduling equal-length jobs onone machine with restarts. In-formation Processing Letters,107(6):240–245, August 31,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Golic:2009:OCA
[GM09] Jovan Dj. Golic and GuglielmoMorgari. Optimal correlationattack on the multiplexer gen-erator. Information ProcessingLetters, 109(15):838–841, July16, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Galbraith:2002:PKS
[GMLS02] S. Galbraith, J. Malone-Lee, andN. P. Smart. Public key sig-natures in the multi-user set-ting. Information ProcessingLetters, 83(5):263–266, Septem-ber 15, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Ghodsi:2007:STM
[GMM+07] Mohammad Ghodsi, HamidMahini, Kian Mirjalali, Shayan OveisGharan, Amin S. Sayedi R.,and Morteza Zadimoghaddam.Spanning trees with minimumweighted degrees. InformationProcessing Letters, 104(3):113–116, October 31, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Gaspers:2009:CGB
[GMNP09] Serge Gaspers, Margaret-EllenMessinger, Richard J. Nowakowski,and Pawe l Pra lat. Clean thegraph before you draw it! Infor-mation Processing Letters, 109(10):463–467, April 30, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Gambosi:2000:LSS
[GN00] Giorgio Gambosi and GaiaNicosia. On-line schedulingwith setup costs. InformationProcessing Letters, 73(1–2):61–68, January 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/25/
35/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/25/35/article.
pdf.
Guo:2006:FPT
[GN06] Jiong Guo and Rolf Nieder-meier. A fixed-parametertractability result for multicom-modity demand flow in trees. In-formation Processing Letters, 97(3):109–114, February 14, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Garcia-Nieto:2009:SSB
[GNAJT09] J. Garcıa-Nieto, E. Alba,L. Jourdan, and E. Talbi. Sen-sitivity and specificity basedmultiobjective approach for fea-ture selection: Application to
REFERENCES 162
cancer diagnosis. InformationProcessing Letters, 109(16):887–896, July 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[GNU08] Jiong Guo, Rolf Niedermeier,and Johannes Uhlmann. Twofixed-parameter algorithms forVertex Covering by Paths onTrees. Information Process-ing Letters, 106(2):81–86, April15, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Griffiths:2005:OBD
[GO05] Evan J. Griffiths and Pekka Or-ponen. Optimization, block de-signs and No Free Lunch the-orems. Information Process-ing Letters, 94(2):55–61, April30, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Gobel:2000:RPI
[Gob00] Manfred Gobel. Rings of poly-nomial invariants of the alter-nating group have no finiteSAGBI bases with respect toany admissible order. Infor-mation Processing Letters, 74
(1–2):15–18, April 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/25/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/25/27/article.
pdf.
Godard:2002:SSE
[God02] Emmanuel Godard. A self-stabilizing enumeration algo-rithm. Information Process-ing Letters, 82(6):299–305, June30, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
[Gol01] Jovan Dj. Golic. A probabilisticcryptanalytic method for a time-variant permutation generator.Information Processing Letters,80(2):67–73, October 31, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
REFERENCES 163
elsevier.com/gej-ng/10/23/
20/80/37/27/abstract.html.
Goldstein:2003:DTD
[Gol03] Darin Goldstein. Determinationof the topology of a directed net-work. Information ProcessingLetters, 88(3):121–131, Novem-ber 15, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Goldberg:2004:COP
[Gol04] Mayer Goldberg. A construc-tion of one-point bases in ex-tended lambda calculi. Informa-tion Processing Letters, 89(6):281–286, March 31, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Goller:2008:RPR
[Gol08] Stefan Goller. Reachability onprefix-recognizable graphs. In-formation Processing Letters,108(2):71–74, September 30,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Goodrich:2009:ACM
[Goo09] Michael T. Goodrich. On thealgorithmic complexity of theMastermind game with black-peg results. Information Pro-cessing Letters, 109(13):675–678, June 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Gortz:2008:ACM
[Gør08] Inge Li Gørtz. Asymmetrick-center with minimum cover-
[Gou01] Mohamed G. Gouda. El-ements of security: Clo-sure, convergence, and pro-tection. Information Process-ing Letters, 77(2–4):109–114,February 28, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
32/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/32/article.
pdf.
Green:2001:RSE
[GP01] Frederic Green and RandallPruim. Relativized separation
of EQP from PNP. Informa-tion Processing Letters, 80(5):257–260, December 15, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/36/33/abstract.html.
Gal:2003:ENM
[GP03a] Anna Gal and Pavel Pudlak. Er-ratum to: “A note on monotonecomplexity and the rank of ma-trices”: [Information Process-ing Letters 87 (2003) 321–326].Information Processing Letters,88(5):257, December 16, 2003.CODEN IFPLAT. ISSN 0020-
REFERENCES 164
0190 (print), 1872-6119 (elec-tronic). See [GP03b].
Gal:2003:NMC
[GP03b] Anna Gal and Pavel Pudlak.A note on monotone complex-ity and the rank of matri-ces. Information Processing Let-ters, 87(6):321–326, September30, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic). See erratum[GP03a].
Gropl:2001:EWC
[GPS01] Clemens Gropl, Hans JurgenPromel, and Anand Srivastav.On the evolution of the worst-case OBDD size. Informa-tion Processing Letters, 77(1):1–7, January 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/24/
24/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/24/24/article.
pdf.
Giannella:2003:NAM
[GR03] Chris Giannella and EdwardRobertson. A note on ap-proximation measures for multi-valued dependencies in rela-tional databases. InformationProcessing Letters, 85(3):153–158, February 14, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Gaber:2009:ASC
[GRH09] Mohamed Medhat Gaber, UweRoehm, and Karel Herink. Ananalytical study of central andin-network data processing forwireless sensor networks. Infor-mation Processing Letters, 110(2):62–70, December 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[GRW06] Andre Große, Jorg Rothe, andGerd Wechsung. On comput-ing the smallest four-coloringof planar graphs and non-self-reducible sets in P. Informa-tion Processing Letters, 99(6):215–221, September 30, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Goldwurm:2000:CPU
[GS00] Massimiliano Goldwurm andMassimo Santini. Clique poly-nomials have a unique root ofsmallest modulus. InformationProcessing Letters, 75(3):127–132, August 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/28/
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/28/30/article.
pdf.
Gerbessiotis:2003:RSC
[GS03] Alexandros V. Gerbessiotis andConstantinos J. Siniolakis. Ran-
domized selection in n+C+o(n)comparisons. Information Pro-cessing Letters, 88(3):95–100,November 15, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Geiselmann:2004:PAS
[GS04a] Willi Geiselmann and RainerSteinwandt. Power attacks ona side-channel resistant ellipticcurve implementation. Infor-mation Processing Letters, 91(1):29–32, July 16, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Gerbessiotis:2004:PIS
[GS04b] Alexandros V. Gerbessiotisand Constantinos J. Siniolakis.Probabilistic integer sorting. In-formation Processing Letters, 90(4):187–193, May 31, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Garcia:2005:CGM
[GS05a] Thierry Garcia and David Seme.A Coarse-Grained Multicom-puter algorithm for the detec-tion of repetitions. Informa-tion Processing Letters, 93(6):307–313, March 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Gupta:2005:CHD
[GS05b] Kishan Chand Gupta andPalash Sarkar. Constructionof high degree resilient S-boxeswith improved nonlinearity. In-formation Processing Letters, 95(3):413–417, August 16, 2005.
[GS09a] Mira Gonen and Yuval Shavitt.A Θ(logn)-approximation forthe set cover problem with setownership. Information Pro-cessing Letters, 109(3):183–186,January 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Grassl:2009:CAS
[GS09b] Markus Grassl and Rainer Stein-wandt. Cryptanalysis of an au-thentication scheme using trun-cated polynomials. InformationProcessing Letters, 109(15):861–863, July 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Grahne:2009:BRP
[GT09] Gosta Grahne and Alex Thomo.Bounded regular path queriesin view-based data integration.Information Processing Letters,109(13):739–744, June 15, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Gallier:2003:DFA
[GTM03] Jean H. Gallier, Salvatore LaTorre, and Supratik Mukhopad-hyay. Deterministic finite au-tomata with recursive calls andDPDAs. Information Process-ing Letters, 87(4):187–193, Au-gust 31, 2003. CODEN IF-
[Gue01] Rachid Guerraoui. On the hard-ness of failure-sensitive agree-ment problems. InformationProcessing Letters, 79(2):99–104, June 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/31/
32/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/31/32/article.
pdf.
Gupta:2008:FAS
[Gup08] Sushmita Gupta. Feedback arcset problem in bipartite tourna-ments. Information ProcessingLetters, 105(4):150–154, Febru-ary 15, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Gurski:2008:PAP
[Gur08] Frank Gurski. Polynomial al-gorithms for protein similar-ity search for restricted mRNAstructures. Information Pro-cessing Letters, 105(5):170–176,February 29, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Gusfield:2002:PDP
[Gus02] Dan Gusfield. Partition-distance: A problem and classof perfect graphs arising in clus-tering. Information ProcessingLetters, 82(3):159–164, May 16,
[Gut02] Walter J. Gutjahr. ACO algo-rithms with guaranteed conver-gence to the optimal solution.Information Processing Letters,82(3):145–153, May 16, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/86/34/32/abstract.html.
Gutner:2008:EAA
[Gut08] Shai Gutner. Elementary ap-proximation algorithms for prizecollecting Steiner tree problems.Information Processing Letters,107(1):39–44, June 30, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Garcia-Villalba:2000:LCS
[GVFS00] L. J. Garcıa-Villalba andA. Fuster-Sabater. On thelinear complexity of the se-quences generated by nonlin-ear filterings. Information Pro-cessing Letters, 76(1–2):67–73,November 20, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/24/
34/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/24/34/article.
pdf.
Gradwohl:2008:WIL
[GY08] Ronen Gradwohl and AmirYehudayoff. t-Wise indepen-dence with local dependencies.Information Processing Letters,106(5):208–212, May 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[GZN06] Hossein Ghodosi and RahimZaare-Nahandi. Comments onthe ‘m out of n oblivious trans-fer’. Information ProcessingLetters, 97(4):153–155, Febru-ary 28, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Hage:2003:ESM
[Hag03] Jurriaan Hage. Enumeratingsubmultisets of multisets. In-formation Processing Letters, 85(4):221–226, February 28, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 168
Hagen:2007:FPT
[Hag07] Matthias Hagen. On the fixed-parameter tractability of theequivalence test of monotonenormal forms. Information Pro-cessing Letters, 103(4):163–167,August 16, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Halman:2003:LTA
[Hal03] Nir Halman. A linear time al-gorithm for the weighted lex-icographic rectilinear 1-centerproblem in the plane. Informa-tion Processing Letters, 86(3):121–128, May 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Hammack:2007:MCB
[Ham07] Richard Hammack. Minimumcycle bases of direct products ofcomplete graphs. InformationProcessing Letters, 102(5):214–218, May 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Han:2006:IAS
[Han06] Yijie Han. Improved algorithmfor the symmetry number prob-lem on trees. Information Pro-cessing Letters, 98(4):130–132,May 31, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Han:2008:NTA
[Han08] Yijie Han. A note of anO(n3/ logn) time algorithm for
all pairs shortest paths. Infor-mation Processing Letters, 105(3):114–116, January 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Haastad:2000:BOC
[Has00a] Johan Hastad. On bounded oc-currence constraint satisfaction.Information Processing Letters,74(1–2):1–6, April 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/25/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/25/25/article.
pdf.
Hasunuma:2000:EDS
[Has00b] Toru Hasunuma. On edge-disjoint spanning trees withsmall depths. InformationProcessing Letters, 75(1–2):71–74, July 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/25/
37/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/25/37/article.
pdf.
Huang:2001:OFA
[HC01] Shing-Tsaan Huang and Bau-Wen Chen. Optimal 1-fair al-ternators. Information Pro-cessing Letters, 80(3):159–163,November 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190
[HC02] John D. Holt and Soon M.Chung. Mining associationrules using inverted hashing andpruning. Information Process-ing Letters, 83(4):211–220, Au-gust 31, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ho:2003:SSS
[HC03a] Ting-Yem Ho and Jou-MingChang. Sorting a sequenceof strong kings in a tourna-ment. Information ProcessingLetters, 87(6):317–320, Septem-ber 30, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Huang:2003:SBP
[HC03b] Tsung-Chuan Huang and Slo-LiChu. A statement based paral-lelizing framework for processor-in-memory architectures. In-formation Processing Letters, 85(3):159–163, February 14, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
He:2008:PBH
[HC08a] Weiping He and Ing-Ray Chen.Proxy-based hybrid cache man-agement in Mobile IP systems.Information Processing Letters,106(1):26–32, March 31, 2008.
[HC08b] Sun-Yuan Hsieh and Chih-Sheng Cheng. Finding amaximum-density path in a treeunder the weight and length con-straints. Information ProcessingLetters, 105(5):202–205, Febru-ary 29, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
He:2002:WSM
[He02] Wei-Hua He. Weaknesses insome multisignature schemes forspecified group of verifiers. In-formation Processing Letters, 83(2):95–99, July 31, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Heam:2008:NPO
[Hea08] P.-C. Heam. A note on partiallyordered tree automata. Informa-tion Processing Letters, 108(4):242–246, October 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Hehner:2001:VSC
[Heh01] Eric C. R. Hehner. Vari-ables and scopes considered for-mally. Information Process-ing Letters, 79(1):33–38, May31, 2001. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic). URL http:/
/www.elsevier.nl/gej%2Dng/
10/23/20/80/25/30/abstract.
html; http://www.elsevier.
REFERENCES 170
nl/gej%2Dng/10/23/20/80/25/
30/article.pdf.
Hershberger:2004:KCD
[Her04] John Hershberger. Kinetic col-lision detection with fast flightplan changes. Information Pro-cessing Letters, 92(6):287–291,December 31, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Hesselink:2003:SMT
[Hes03] Wim H. Hesselink. Salembier’sMin-tree algorithm turned intobreadth first search. Informa-tion Processing Letters, 88(5):225–229, December 16, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Hess:2004:SVE
[Hes04] F. Hess. On the security ofthe verifiably-encrypted signa-ture scheme of Boneh, Gentry,Lynn and Shacham. InformationProcessing Letters, 89(3):111–114, February 14, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Hesselink:2007:LTA
[Hes07] Wim H. Hesselink. A linear-time algorithm for Euclideanfeature transform sets. Informa-tion Processing Letters, 102(5):181–186, May 31, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Heun:2008:AMG
[Heu08] Volker Heun. Analysis of amodification of Gusfield’s recur-sive algorithm for reconstruct-ing ultrametric trees. Informa-tion Processing Letters, 108(4):222–225, October 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Hutton:2001:GAL
[HG01] Graham Hutton and JeremyGibbons. The generic approx-imation lemma. InformationProcessing Letters, 79(4):197–201, August 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/33/
31/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/33/31/article.
pdf.
Hajiaghayi:2002:NCO
[HG02] Mohammad Taghi Hajiaghayiand Yashar Ganjali. A note onthe Consecutive Ones Subma-trix problem. Information Pro-cessing Letters, 83(3):163–166,August 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Hack:2006:ORA
[HG06] Sebastian Hack and GerhardGoos. Optimal register allo-cation for SSA-form programsin polynomial time. Informa-tion Processing Letters, 98(4):150–155, May 31, 2006. CO-
REFERENCES 171
DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Han:2009:NLB
[HGYZ09] Xin Han, He Guo, Dawei Yin,and Yong Zhang. A note on on-line broadcast scheduling withdeadlines. Information Pro-cessing Letters, 109(3):204–207,January 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Hasunuma:2007:IUB
[HH07] Toru Hasunuma and Misa Hi-rota. An improved upper boundon the queuenumber of the hy-percube. Information Process-ing Letters, 104(2):41–44, Oc-tober 16, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic). See note[PCW08].
Hua:2009:GTL
[HH09] Hongbo Hua and Yaoping Hou.On graphs with the third largestnumber of maximal indepen-dent sets. Information Pro-cessing Letters, 109(4):248–253,January 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Halava:2008:PCP
[HHHK08] Vesa Halava, Tero Harju,Mika Hirvensalo, and JuhaniKarhumaki. Post Correspon-dence Problem for short words.Information Processing Letters,108(3):115–118, October 16,2008. CODEN IFPLAT. ISSN
[Hie04] R. M. Hierons. Using a minimalnumber of resets when testingfrom a finite state machine. In-formation Processing Letters, 90(6):287–292, June 30, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Hierons:2006:AAT
[Hie06] R. M. Hierons. Applying adap-tive test cases to nondetermin-
[HIM09] Koki Hamada, Kazuo Iwama,and Shuichi Miyazaki. Animproved approximation lowerbound for finding almost stablemaximum matchings. Informa-tion Processing Letters, 109(18):1036–1040, August 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Hitchcock:2003:GSC
[Hit03] John M. Hitchcock. Gales suf-fice for constructive dimension.Information Processing Letters,86(1):9–12, April 15, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Herman:2005:SPP
[HJ05] Ted Herman and ColetteJohnen. Strategies for peer-to-peer downloading. InformationProcessing Letters, 94(5):203–209, June 15, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Hoffman:2002:GDG
[HJR02] Alan J. Hoffman, Kate Jenkins,and Tim Roughgarden. On agame in directed graphs. In-formation Processing Letters, 83(1):13–16, July 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 173
Hedetniemi:2001:MMS
[HJS01] Stephen T. Hedetniemi, David P.Jacobs, and Pradip K. Sri-mani. Maximal matching sta-bilizes in time O(m). Informa-tion Processing Letters, 80(5):221–223, December 15, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/36/27/abstract.html.
Hedetniemi:2003:LTS
[HJS03] Stephen T. Hedetniemi, David P.Jacobs, and Pradip K. Srimani.Linear time self-stabilizing col-orings. Information ProcessingLetters, 87(5):251–255, Septem-ber 15, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Howe:2000:ANC
[HK00] Jacob M. Howe and Andy King.Abstracting numeric constraintswith Boolean functions. Infor-mation Processing Letters, 75(1–2):17–23, July 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/25/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/25/28/article.
pdf.
Hoogeboom:2004:TD
[HK04] Hendrik Jan Hoogeboom andWalter A. Kosters. Tetris anddecidability. Information Pro-cessing Letters, 89(6):267–272,
March 31, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Haddad:2009:SSC
[HK09] Mohammed Haddad and Hama-mache Kheddouci. A strictstrong coloring of trees. In-formation Processing Letters,109(18):1047–1054, August 31,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Hsieh:2009:FRF
[HKC09] Sun-Yuan Hsieh, Che-Nan Kuo,and Hsin-Hung Chou. A fur-ther result on fault-free cycles infaulty folded hypercubes. Infor-mation Processing Letters, 110(2):41–43, December 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Horev:2009:PCG
[HKKL09] Elad Horev, Matthew J. Katz,Roi Krakovski, and MaartenLoffler. Polychromatic 4-coloring of guillotine subdivi-sions. Information ProcessingLetters, 109(13):690–694, June15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Harary:2001:NGC
[HKL01] Frank Harary, Vladik Kreinovich,and Luc Longpre. A newgraph characteristic and its ap-plication to numerical com-putability. Information Pro-cessing Letters, 77(5–6):277–
[HL03] Susanne E. Hambrusch andChuan-Ming Liu. Data replica-tion in static tree structures. In-formation Processing Letters, 86(4):197–202, May 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Honkala:2004:ICH
[HL04] Iiro Honkala and Tero Laiho-nen. On identifying codes inthe hexagonal mesh. Informa-tion Processing Letters, 89(1):9–14, January 16, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Han:2005:AAI
[HL05] Daewan Han and Moonsik Lee.An algebraic attack on theimproved summation generator
[HL07] Iiro Honkala and Tero Laihonen.On a new class of identifyingcodes in graphs. InformationProcessing Letters, 102(2–3):92–98, April 30, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Haddadi:2008:CBM
[HL08] Salim Haddadi and Zoubir Lay-ouni. Consecutive block min-imization is 1.5-approximable.Information Processing Letters,108(3):132–135, October 16,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Habib:2003:NFA
[HLP03] Michel Habib, Emmanuelle Leb-har, and Christophe Paul. Anote on finding all homogeneousset sandwiches. InformationProcessing Letters, 87(3):147–151, August 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Hertz:2003:FAC
[HLS03] A. Hertz, V. Lozin, andD. Schindl. Finding augment-ing chains in extensions of claw-free graphs. Information Pro-cessing Letters, 86(6):311–316,June 30, 2003. CODEN IF-
[HLSW02] John H. Holmes, Pier LucaLanzi, Wolfgang Stolzmann, andStewart W. Wilson. Learningclassifier systems: New models,successful applications. Infor-mation Processing Letters, 82(1):23–30, April 15, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/86/27/
30/abstract.html.
Hsu:2007:GPB
[HLT07] Hong-Chun Hsu, Pao-LienLai, and Chang-Hsiung Tsai.Geodesic pancyclicity and bal-anced pancyclicity of Aug-mented cubes. Information Pro-cessing Letters, 101(6):227–232,March 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
He:2009:DAM
[HLY09] Cheng He, Yixun Lin, and Jin-jiang Yuan. A DP algorithm forminimizing makespan and to-tal completion time on a series-batching machine. InformationProcessing Letters, 109(12):603–607, May 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Herman:2001:ASH
[HM01] Ted Herman and ToshimitsuMasuzawa. Available stabiliz-ing heaps. Information Pro-
[HM02] Andrew G. Hart and ServetMartınez. Sequential itera-tion of the Erlang fixed-pointequations. Information Pro-cessing Letters, 81(6):319–325,March 31, 2002. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/37/
32/abstract.html.
Horowitz:2003:ENS
[HM03] Keren Horowitz and DahliaMalkhi. Estimating network sizefrom local information. Infor-mation Processing Letters, 88(5):237–243, December 16, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Harvey:2004:DS
[HM04] Nicholas J. A. Harvey and J. IanMunro. Deterministic SkipNet.Information Processing Letters,90(4):205–208, May 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 176
Held:2008:TIC
[HM08] Martin Held and Joseph S. B.Mitchell. Triangulating input-constrained planar point sets.Information Processing Letters,109(1):54–56, December 16,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Hocquard:2009:EPG
[HM09] Herve Hocquard and MickaelMontassier. Every planar graphwithout cycles of lengths 4 to12 is acyclically 3-choosable.Information Processing Letters,109(21–22):1193–1196, October31, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Hurink:2008:AMI
[HN08] Johann L. Hurink and TimNieberg. Approximating min-imum independent dominatingsets in wireless networks. Infor-mation Processing Letters, 109(2):155–160, December 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Hoare:2001:L
[Hoa01] Tony Hoare. Legacy. Informa-tion Processing Letters, 77(2–4):123–129, February 28, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.nl/gej-ng/10/23/
20/68/29/34/abstract.html;
http://www.elsevier.nl/gej-
ng/10/23/20/68/29/34/article.
pdf.
Hoepman:2001:COB
[Hoe01] Jaap-Henk Hoepman. Canan operation both update thestate and return a meaning-ful value in the asynchronousPRAM model? InformationProcessing Letters, 79(4):161–166, August 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/33/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/33/26/article.
pdf.
Honkala:2002:EPP
[Hon02] Juha Honkala. The equalityproblem for Parikh simple alge-braic power series. InformationProcessing Letters, 84(2):57–60,October 31, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Honkala:2005:CHS
[Hon05] Juha Honkala. The class ofHDT0L sequences is closed withrespect to rational functions. In-formation Processing Letters, 94(4):155–158, May 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Hong:2007:ANI
[Hon07] Dawei Hong. Analysis of noise-induced phase synchronizationin nervous systems: from algo-rithmic perspective. Informa-
[Hoo01] Rob R. Hoogerwoord. Formal-ity works. Information Pro-cessing Letters, 77(2–4):137–142, February 28, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
36/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/36/article.
pdf.
Horn:2007:DS
[Hor07] Florian Horn. Dicing on theStreett. Information Process-ing Letters, 104(1):1–9, Septem-ber 30, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Hoyer:2000:SPF
[Høy00] Peter Høyer. Simplified proofof the Fourier Sampling The-orem. Information Process-ing Letters, 75(4):139–143,September 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[HP00b] F. K. Hwang and C. K.Pai. Sequential constructionof a circular consecutive-2 sys-tem. Information Process-ing Letters, 75(5):231–235, Oc-tober 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/30/
31/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/30/31/article.
pdf.
Hitchcock:2005:RBS
[HP05] John M. Hitchcock and A. Pa-van. Resource-bounded strongdimension versus resource-bounded category. InformationProcessing Letters, 95(3):377–381, August 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 178
Hurkens:2008:MDG
[HPW08] Cor A. J. Hurkens, Rudi A. Pen-davingh, and Gerhard J. Woeg-inger. The Magnus–Derek gamerevisited. Information Process-ing Letters, 109(1):38–40, De-cember 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Hassin:2000:BAM
[HR00] Refael Hassin and Shlomi Ru-binstein. Better approxima-tions for max TSP. InformationProcessing Letters, 75(4):181–186, September 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/29/
31/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/29/31/article.
pdf.
Hassin:2001:AAM
[HR01] Refael Hassin and Shlomi Ru-binstein. Approximation algo-rithms for maximum linear ar-rangement. Information Pro-cessing Letters, 80(4):171–177,November 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/84/34/
27/abstract.html.
Hassin:2002:AAM
[HR02] Refael Hassin and Shlomi Ru-binstein. A 7
8 -approximation al-gorithm for metric Max TSP.Information Processing Letters,
[HR03] Manuel Hernandez and David A.Rosenblueth. Disjunctive par-tial deduction of a right-to-leftstring-matching algorithm. In-formation Processing Letters,87(5):235–241, September 15,2003. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Her:2005:EMD
[HR05] Jun-Ho Her and R. S. Ramakr-ishna. External-memory depth-first search algorithm for solidgrid graphs. Information Pro-cessing Letters, 93(4):177–183,February 28, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Hajiaghayi:2006:IAA
[HR06a] Mohammad Taghi Hajiaghayiand Harald Racke. An O(
√n)-
approximation algorithm for di-rected sparsest cut. InformationProcessing Letters, 97(4):156–160, February 28, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Hassin:2006:IAA
[HR06b] Refael Hassin and Shlomi Ru-binstein. An improved approx-imation algorithm for the met-ric maximum clustering problem
REFERENCES 179
with given cluster sizes. In-formation Processing Letters, 98(3):92–95, May 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Hamilton:2008:CHI
[HRC08] Chris H. Hamilton and An-drew Rau-Chaplin. CompactHilbert indices: Space-fillingcurves for domains with unequalside lengths. Information Pro-cessing Letters, 105(5):155–163,February 29, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Hertrampf:2000:NCP
[HRV00] Ulrich Hertrampf, Steffen Re-ith, and Heribert Vollmer. Anote on closure properties oflogspace MOD classes. Informa-tion Processing Letters, 75(3):91–93, August 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/28/
24/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/28/24/article.
pdf.
Hellwig:2004:NCL
[HRV04] Angelika Hellwig, Dieter Raut-enbach, and Lutz Volkmann.Note on the connectivity of linegraphs. Information Process-ing Letters, 91(1):7–10, July16, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Hvam:2007:BCS
[HRWZ07] K. Hvam, L. Reinhardt, P. Win-ter, and M. Zachariasen. Bound-ing component sizes of two-connected Steiner networks. In-formation Processing Letters,104(5):159–163, November 30,2007. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Hartuv:2000:CAB
[HS00] Erez Hartuv and Ron Shamir.A clustering algorithm based ongraph connectivity. InformationProcessing Letters, 76(4–6):175–181, December 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/28/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/28/28/article.
pdf.
Hofstee:2001:DRC
[HS01] H. Peter Hofstee and JunSawada. Derivation of a rota-tor circuit with homogeneous in-terconnect. Information Pro-cessing Letters, 77(2–4):131–135, February 28, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
35/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/35/article.
pdf.
REFERENCES 180
Hochberg:2003:OOP
[HS03] Robert A. Hochberg and Matthias F.Stallmann. Optimal one-pagetree embeddings in linear time.Information Processing Letters,87(2):59–66, July 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Heber:2005:CIT
[HS05] Steffen Heber and Carla D. Sav-age. Common intervals of trees.Information Processing Letters,93(2):69–74, January 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Hsieh:2008:NCE
[Hsi08] Sun-Yuan Hsieh. A note on cycleembedding in folded hypercubeswith faulty elements. Informa-tion Processing Letters, 108(2):81, September 30, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[HSTH09] Tung-Yang Ho, Yuan-KangShih, Jimmy J. M. Tan, and Lih-Hsing Hsu. Conditional fault
Hamiltonian connectivity of thecomplete graph. InformationProcessing Letters, 109(12):585–588, May 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Huang:2009:TLT
[HSWC09] Jing Huang, Haina Sun, WeifanWang, and Dong Chen. (2,1)-total labelling of trees withsparse vertices of maximum de-gree. Information ProcessingLetters, 109(3):199–203, Jan-uary 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Huang:2006:CCH
[HSZZ06] Wei Huang, Yaoyun Shi,Shengyu Zhang, and Yufan Zhu.The communication complexityof the Hamming distance prob-lem. Information ProcessingLetters, 99(4):149–153, August31, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Higuchi:2000:FAA
[HT00] Akira Higuchi and Naofumi Tak-agi. A fast addition algo-rithm for elliptic curve arith-metic in GF(2n) using projec-tive coordinates. InformationProcessing Letters, 76(3):101–103, December 15, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/27/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
REFERENCES 181
10/23/20/67/27/25/article.
pdf.
Hoffmann:2003:APT
[HT03] Michael Hoffmann and Csaba D.Toth. Alternating pathsthrough disjoint line segments.Information Processing Letters,87(6):287–294, September 30,2003. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Huang:2003:FAA
[HTT03] Po-Hsueh Huang, Yin Te Tsai,and Chuan Yi Tang. A fast al-gorithm for the alpha-connectedtwo-center decision problem. In-formation Processing Letters, 85(4):205–210, February 28, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Hu:2007:LTA
[Hu07] Shiyan Hu. A linear time al-gorithm for max-min length tri-angulation of a convex polygon.Information Processing Letters,101(5):203–208, March 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Hellwig:2006:LBV
[HV06a] Angelika Hellwig and Lutz Volk-mann. Lower bounds on thevertex-connectivity of digraphsand graphs. Information Pro-cessing Letters, 99(2):41–46,July 31, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Hougardy:2006:AWM
[HV06b] Stefan Hougardy and Do-ratha E. Vinkemeier. Approx-imating weighted matchings inparallel. Information ProcessingLetters, 99(3):119–123, August16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Hofbauer:2006:T
[HW06] Dieter Hofbauer and JohannesWaldmann. Termination ofaa → bc, bb → ac, cc → ab. In-formation Processing Letters, 98(4):156–158, May 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Hwang:2000:CYK
[Hwa00] Min-Shiang Hwang. Cryptanal-ysis of YCN key assignmentscheme in a hierarchy. Informa-tion Processing Letters, 73(3–4):97–101, February 29, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/62/27/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/62/27/28/article.
pdf.
Hsu:2002:IGT
[HWW02] Chien-Lung Hsu, Tzong-SunWu, and Tzong-Chen Wu. Im-provements of generalization ofthreshold signature and authen-ticated encryption for groupcommunications. InformationProcessing Letters, 81(1):41–
[hYScH05] Jyh haw Yeh, Marion Scheep-ers, and Wen chen Hu. Modify-ing YCN key assignment schemeto resist the attack from Hwang.Information Processing Letters,95(4):435–440, August 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Huang:2007:DPA
[HYT+07] Kuo-Si Huang, Chang-BiauYang, Kuo-Tsung Tseng, Yung-Hsing Peng, and Hsing-YenAnn. Dynamic programming al-gorithms for the mosaic longestcommon subsequence problem.Information Processing Letters,102(2–3):99–103, April 30, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Huang:2008:EAF
[HYT+08] Kuo-Si Huang, Chang-BiauYang, Kuo-Tsung Tseng, Hsing-Yen Ann, and Yung-Hsing Peng.Efficient algorithms for find-ing interleaving relationship be-tween sequences. InformationProcessing Letters, 105(5):188–193, February 29, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 183
Hyyro:2008:IBP
[Hyy08] Heikki Hyyro. Improving thebit-parallel NFA of Baeza-Yatesand Navarro for approximatestring matching. InformationProcessing Letters, 108(5):313–319, November 15, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Hebrard:2003:EAH
[HZ03] Jean-Jacques Hebrard andBruno Zanuttini. An efficientalgorithm for Horn description.Information Processing Letters,88(4):177–182, November 30,2003. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Hong:2009:VFT
[HZ09] Yanmei Hong and Zhao Zhang.Vertex fault tolerance of optimal-κ graphs and super-κ graphs.Information Processing Letters,109(20):1151–1155, September30, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Hericko:2008:AOS
[HZR08] Marjan Hericko, Ales Zivkovic,and Ivan Rozman. An approachto optimizing software develop-ment team size. InformationProcessing Letters, 108(3):101–106, October 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Islam:2003:NES
[IAIH03] Rafiqul Islam, Nasim Ad-nan, Nur Islam, and ShohorabHossen. A new external sort-ing algorithm with no additionaldisk space. Information Process-ing Letters, 86(5):229–233, June15, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Ibarra:2009:SAF
[Iba09] Louis Ibarra. A simple algo-rithm to find Hamiltonian cy-cles in proper interval graphs.Information Processing Letters,109(18):1105–1108, August 31,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Isaak:2009:GRA
[IJN09] Garth Isaak, Robert Jamison,and Darren Narayan. Greedyrankings and arank numbers.Information Processing Letters,109(15):825–827, July 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Iannella:2005:FIR
[IK05] Nicolangelo Iannella and LarsKindermann. Finding iterativeroots with a spiking neural net-work. Information ProcessingLetters, 95(6):545–551, Septem-ber 30, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 184
Itai:2007:CDC
[IK07] Alon Itai and Irit Katriel.Canonical density control. Infor-mation Processing Letters, 104(6):200–204, December 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Im:2000:DSF
[IKKY00] Byoung-Mo Im, Myoung HoKim, Hyung-Il Kang, andJae Soo Yoo. Declustering sig-nature files based on a dy-namic measure. InformationProcessing Letters, 74(5–6):235–241, June 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/28/
33/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/28/33/article.
pdf.
Izumi:2006:WAC
[IM06] Taisuke Izumi and ToshimitsuMasuzawa. A weakly-adaptivecondition-based consensus al-gorithm in asynchronous dis-tributed systems. InformationProcessing Letters, 100(5):199–205, December 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[IN03] B. Intrigila and M. Nesi. Onstructural properties of eta-expansions of identity. Informa-tion Processing Letters, 87(6):327–333, September 30, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Isaak:2004:CTH
[IN04] Garth Isaak and Darren A.Narayan. A classification oftournaments having an acyclic
REFERENCES 185
tournament as a minimum feed-back arc set. Information Pro-cessing Letters, 92(3):107–111,November 15, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ikeda:2006:SNP
[IN06] Satoshi Ikeda and Koji Nakazawa.Strong normalization proofs byCPS-translations. InformationProcessing Letters, 99(4):163–170, August 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Nakayama:2007:PTA
[iNM07] Shin ichi Nakayama and ShigeruMasuyama. A polynomial timealgorithm for obtaining min-imum edge ranking on two-connected outerplanar graphs.Information Processing Letters,103(6):216–221, September 15,2007. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Oum:2009:CRW
[iO09] Sang il Oum. Computing rank-width exactly. InformationProcessing Letters, 109(13):745–748, June 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Iyer:2009:LTA
[IP09] K. Viswanathan Iyer andS. Prasanna. A linear time al-gorithm for finding an optimaldegree-bounded subtree of anedge-weighted tree. Information
[IR08a] Costas S. Iliopoulos and M. So-hel Rahman. Faster index forproperty matching. Informa-tion Processing Letters, 105(6):218–223, March 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).See errata [JLW09].
Iliopoulos:2008:NEA
[IR08b] Costas S. Iliopoulos and M. So-hel Rahman. New efficient al-gorithms for the LCS and con-strained LCS problems. Infor-mation Processing Letters, 106(1):13–18, March 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Imbs:2009:NAB
[IR09] Damien Imbs and Michel Ray-nal. A note on atomicity: Boost-ing Test&Set to solve consensus.Information Processing Letters,109(12):589–591, May 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Irving:2007:CRP
[Irv07] Robert W. Irving. The cycleroommates problem: a hard caseof kidney exchange. Informa-tion Processing Letters, 103(1):1–4, June 30, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 186
Israeli:2008:AAS
[IS08] Amos Israeli and Oran Sharon.An approximation algorithm forsequential rectangle placement.Information Processing Letters,108(6):407–411, November 30,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Iwen:2009:NCS
[IS09] M. A. Iwen and C. V. Spencer.A note on compressed sens-ing and the complexity of ma-trix multiplication. InformationProcessing Letters, 109(10):468–471, April 30, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Igel:2003:CFW
[IT03] Christian Igel and Marc Tous-saint. On classes of functionsfor which No Free Lunch re-sults hold. Information Process-ing Letters, 86(6):317–321, June30, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Iwama:2004:OCP
[IY04] Kazuo Iwama and KoukiYonezawa. The orthogonal CNNproblem. Information Process-ing Letters, 90(3):115–120, May16, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Iwamoto:2006:SSR
[IY06] Mitsugu Iwamoto and HirosukeYamamoto. Strongly secure
[Jac03a] Michael Jackson. Why softwarewriting is difficult and will re-main so. Information Process-ing Letters, 88(1–2):13–25, Oc-tober 17, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Jacquemard:2003:RCU
[Jac03b] Florent Jacquemard. Reacha-bility and confluence are unde-cidable for flat term rewritingsystems. Information ProcessingLetters, 87(5):265–270, Septem-ber 15, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Jimenez:2006:IUF
[JAF06] Ernesto Jimenez, Sergio Arevalo,and Antonio Fernandez. Imple-menting unreliable failure detec-tors with unknown membership.Information Processing Letters,100(2):60–63, October 31, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Jain:2009:SOPb
[Jai09a] Sanjay Jain. On some openproblems in monotonic and con-servative learning. Information
[JC07] Min Ji and T. C. E. Cheng.An FPTAS for scheduling jobswith piecewise linear decreas-ing processing times to minimizemakespan. Information Pro-cessing Letters, 102(2–3):41–47,April 30, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ji:2008:FPM
[JC08] Min Ji and T. C. E. Cheng.An FPTAS for parallel-machinescheduling under a grade ofservice provision to minimizemakespan. Information Process-ing Letters, 108(4):171–174, Oc-tober 31, 2008. CODEN IF-
[JCL04] Kuen-Fang Jea, Ming-YuanChang, and Ke-Chung Lin. Anefficient and flexible algorithmfor online mining of large item-sets. Information ProcessingLetters, 92(6):311–316, Decem-ber 31, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Jarray:2008:CRH
[JCP08] Fethi Jarray, Marie-ChristineCosta, and Christophe Pi-couleau. Complexity results forthe horizontal bar packing prob-lem. Information ProcessingLetters, 108(6):356–359, Novem-ber 30, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Ji:2009:MBN
[JCSX09] Zexuan Ji, Qiang Chen, Quan-Sen Sun, and De-Shen Xia. Amoment-based nonlocal-meansalgorithm for image denoising.Information Processing Letters,109(23–24):1238–1244, Novem-ber 15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Jha:2003:PDK
[Jha03] Pranava K. Jha. Perfect r-domination in the Kroneckerproduct of two cycles, with anapplication to diagonal/toroidalmesh. Information ProcessingLetters, 87(3):163–168, August
[JHfS08] Justie Su-Tzu Juan, Chun-MingHuang, and I fan Sun. Thestrong distance problem on theCartesian product of graphs.Information Processing Letters,107(2):45–51, July 16, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Jiang:2005:USP
[Jia05] Minghui Jiang. UPS-k : a setpartitioning problem with appli-cations in UPS pickup-deliverysystem. Information ProcessingLetters, 93(4):173–175, Febru-ary 28, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Jiang:2006:AMC
[Jia06a] Minghui Jiang. Approximat-ing minimum coloring and max-imum independent set in dot-ted interval graphs. InformationProcessing Letters, 98(1):29–33,April 15, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Jiang:2006:NAA
[Jia06b] Minghui Jiang. A new approx-imation algorithm for labelingpoints with circle pairs. In-formation Processing Letters, 99(4):125–129, August 31, 2006.CODEN IFPLAT. ISSN 0020-
0190 (print), 1872-6119 (elec-tronic).
Jiao:2008:NRP
[Jia08] Li Jiao. A note on regularPetri nets. Information Process-ing Letters, 108(3):110–114, Oc-tober 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Jonsson:2002:FCA
[JJ02] Fredrik Jonsson and Thomas Jo-hansson. A fast correlation at-tack on LILI-128. InformationProcessing Letters, 81(3):127–132, February 14, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/34/
28/abstract.html.
Jerebic:2005:CPC
[JKS05] Janja Jerebic, Sandi Klavzar,and Simon Spacapan. Charac-terizing r-perfect codes in directproducts of two and three cycles.Information Processing Letters,94(1):1–6, April 15, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Jez:2009:TDC
[J L09] Artur Jez and Jakub Lopuszanski.On the two-dimensional cowsearch problem. InformationProcessing Letters, 109(11):543–547, May 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 189
Jacobsen:2002:ECN
[JLN02] Lars Jacobsen, Kim S. Larsen,and Morten N. Nielsen. Onthe existence and constructionof non-extreme (a, b)-trees. In-formation Processing Letters, 84(2):69–73, October 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Jeong:2001:PAM
[JLO01] Kil-Hyun Jeong, Jong-Kyu Lee,and Hee-Kuck Oh. Perfor-mance analysis of a multicas-ting protocol with contention-less minislots. InformationProcessing Letters, 79(3):127–133, July 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/32/
29/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/32/29/article.
pdf.
Juan:2009:EFI
[JLW09] M. T. Juan, J. J. Liu, andY. L. Wang. Errata for “Fasterindex for property matching”.Information Processing Letters,109(18):1027–1029, August 31,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). See [IR08a].
Jiang:2007:SCA
[JLY07] M. Jiang, Y. P. Luo, and S. Y.Yang. Stochastic convergenceanalysis and parameter selection
of the standard particle swarmoptimization algorithm. Infor-mation Processing Letters, 102(1):8–16, April 15, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[JMV06] Robert E. Jamison, Gretchen L.Matthews, and John Villal-pando. Acyclic colorings ofproducts of trees. InformationProcessing Letters, 99(1):7–12,July 16, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Janssen:2006:MIB
[JN06] Philippe Janssen and LhouariNourine. Minimum implica-tional basis for Λ-semidistributivelattices. Information ProcessingLetters, 99(5):199–202, Septem-ber 15, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Jean:2007:GRC
[JN07] Geraldine Jean and MachaNikolski. Genome rearrange-ments: a correct algorithm foroptimal capping. Information
[JNK+02] Prasanta K. Jana, B. DamodaraNaidu, Shailendra Kumar, Mon-ish Arora, and Bhabani P.Sinha. Parallel prefix compu-tation on extended multi-meshnetwork. Information Process-ing Letters, 84(6):295–303, De-cember 31, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Johnson:2004:TFS
[Joh04] L. F. Johnson. Tumble, a fastsimple iteration algorithm forFibonacci. Information Pro-cessing Letters, 89(4):187–189,February 28, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Jonsson:2002:TSP
[Jon02] Hakan Jonsson. The Trav-eling Salesman Problem forlines in the plane. Informa-tion Processing Letters, 82(3):137–142, May 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/86/34/
30/abstract.html.
Jones:2003:OSC
[Jon03a] Cliff B. Jones. Operational se-mantics: Concepts and their ex-pression. Information Process-ing Letters, 88(1–2):27–32, Oc-
[Jon03b] Hakan Jonsson. An approxima-tive solution to the Zookeeper’sProblem. Information Pro-cessing Letters, 87(6):301–307,September 30, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Joye:2003:CPY
[Joy03] Marc Joye. Cryptanalysis of apay-as-you-watch system. In-formation Processing Letters, 88(3):119–120, November 15, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Jager:2009:NPG
[JP09] Gerold Jager and MarcinPeczarski. The number of pes-simistic guesses in GeneralizedMastermind. Information Pro-cessing Letters, 109(12):635–641, May 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Jiang:2003:SFA
[JQQ+03] Minghui Jiang, Jianbo Qian,Zhongping Qin, Binhai Zhu, andRobert Cimikowski. A simplefactor-3 approximation for label-ing points with circles. Informa-tion Processing Letters, 87(2):101–105, July 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 191
Jothi:2004:SND
[JR04] Raja Jothi and Balaji Raghavachari.Survivable network design: thecapacitated minimum spanningnetwork problem. InformationProcessing Letters, 91(4):183–190, August 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Janiak:2007:LEG
[JR07] Adam Janiak and Rados lawRudek. The learning effect: Get-ting to the core of the prob-lem. Information ProcessingLetters, 103(5):183–187, August31, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
James:2001:RDO
[JS01] Jerry James and Ambuj K.Singh. Recovering distributedobjects. Information Process-ing Letters, 77(2–4):143–150,February 28, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
37/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/37/article.
pdf.
Jancar:2007:NEA
[JS07] Petr Jancar and Zdenek Sawa.A note on emptiness for alter-nating finite automata with aone-letter alphabet. InformationProcessing Letters, 104(5):164–167, November 30, 2007. CO-
DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Ji:2004:SPM
[JTG04] Mingjun Ji, Huanwen Tang, andJuan Guo. A single-point muta-tion evolutionary programming.Information Processing Letters,90(6):293–299, June 30, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Jukna:2004:MNN
[Juk04] Stasys Jukna. On the mini-mum number of negations lead-ing to super-polynomial savings.Information Processing Letters,89(2):71–74, January 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Jukna:2005:PVN
[Juk05] Stasys Jukna. On the P ver-sus NP intersected with co-NPquestion in communication com-plexity. Information ProcessingLetters, 96(6):202–206, Decem-ber 31, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Jukna:2009:NST
[Juk09] S. Jukna. A nondeterminis-tic space-time tradeoff for linearcodes. Information ProcessingLetters, 109(5):286–289, Febru-ary 15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 192
Jung:2005:DFS
[Jun05] Haejae Jung. The d-deap*: afast and simple cache-aligned d-ary deap. Information Process-ing Letters, 93(2):63–67, Jan-uary 31, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Jourdan:2005:MNI
[JUZ05] Guy-Vincent Jourdan, HasanUral, and Nejib Zaguia. Min-imizing the number of inputswhile applying adaptive testcases. Information Process-ing Letters, 94(4):165–169, May31, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Javanian:2006:DNR
[JVA06] Mehri Javanian and Moham-mad Q. Vahidi-Asl. Depth ofnodes in random recursive k-ary trees. Information Process-ing Letters, 98(3):115–118, May16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Jiang:2009:PCC
[JX09] Jiuchuan Jiang and XiaojunXia. Prominence convergencein the collective synchronizationof situated multi-agents. Infor-mation Processing Letters, 109(5):278–285, February 15, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Jun:2004:EGA
[JXL04] Ye Jun, Liu Xiande, and HanLu. Evolutionary game algo-rithm for continuous parameteroptimization. Information Pro-cessing Letters, 91(5):211–219,September 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Xue:2009:ORF
[jXyL09] Zhan jun Xue and San yangLiu. An optimal result on fault-tolerant cycle-embedding in al-ternating group graphs. In-formation Processing Letters,109(21–22):1197–1201, October31, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
etal:2002:OAR
[K+02] N. Kitsios et al. An optimalalgorithm for reporting visiblerectangles. Information Pro-cessing Letters, 81(5):283–288,March 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kim:2002:STE
[KA02a] Yong-Jik Kim and James H. An-derson. A space- and time-efficient local-spin spin lock. In-formation Processing Letters, 84(1):47–55, October 16, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Kosch:2002:PMJ
[KA02b] Harald Kosch and Solomon At-nafu. Processing a multimedia
REFERENCES 193
join through the method of near-est neighbor search. Informa-tion Processing Letters, 82(5):269–276, June 15, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kikuchi:2006:EBE
[KA06] Yosuke Kikuchi and Toru Araki.Edge-bipancyclicity and edge-fault-tolerant bipancyclicity ofbubble-sort graphs. Informa-tion Processing Letters, 100(2):52–59, October 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[Kas04b] Petteri Kaski. Packing Steinertrees with identical terminalsets. Information ProcessingLetters, 91(1):1–5, July 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Ko:2008:PRF
[KAS08] Youngjoong Ko, Hongkuk An,and Jungyun Seo. Pseudo-relevance feedback and statis-tical query expansion for Websnippet generation. Informa-tion Processing Letters, 109(1):
18–22, December 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Katriel:2004:ACS
[Kat04] Irit Katriel. On the algebraiccomplexity of set equality andinclusion. Information Pro-cessing Letters, 92(4):175–178,November 30, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Khachiyan:2007:GPA
[KBEG07] Leonid Khachiyan, Endre Boros,Khaled Elbassioni, and VladimirGurvich. A global parallelalgorithm for the hypergraphtransversal problem. Informa-tion Processing Letters, 101(4):148–155, February 28, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Kulkarni:2005:ARW
[KBOR05] Sandeep S. Kulkarni, ChaseBolen, John Oleszkiewicz, andAndrew Robinson. Alternatorsin read/write atomicity. Infor-mation Processing Letters, 93(5):207–215, March 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Kwon:2002:AAG
[KC02] Oh-Heum Kwon and Kyung-Yong Chwa. Approximationalgorithms for general paralleltask scheduling. InformationProcessing Letters, 81(3):143–150, February 14, 2002. CO-
REFERENCES 194
DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/34/
31/abstract.html.
Kim:2003:NCS
[KC03a] Jae-Hoon Kim and Kyung-YongChwa. Non-clairvoyant schedul-ing for weighted flow time. In-formation Processing Letters, 87(1):31–37, July 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kim:2003:ODS
[KC03b] Jae-Hoon Kim and Kyung-YongChwa. Online deadline schedul-ing on faster machines. Informa-tion Processing Letters, 85(1):31–37, January 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Ku:2003:ORP
[KCH03] Cheng-Yuan Ku, Din-YuenChan, and Lain-Chyr Hwang.Optimal reservation policy fortwo queues in tandem. Informa-tion Processing Letters, 85(1):27–30, January 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kong:2006:IGA
[KCYL06] Fanyu Kong, Zhun Cai, JiaYu, and Daxing Li. Improvedgeneralized Atkin algorithm forcomputing square roots in fi-nite fields. Information Pro-cessing Letters, 98(1):1–5, April15, 2006. CODEN IFPLAT.
ISSN 0020-0190 (print), 1872-6119 (electronic).
Kadrie:2001:APS
[KDTS01] Ahmad Kadrie, V. R. Dare,D. G. Thomas, and K. G. Sub-ramanian. Algebraic propertiesof the shuffle over ω-trajectories.Information Processing Letters,80(3):139–144, November 15,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/35/30/abstract.html.
Kaldewaij:2001:ORT
[KdV01] Anne Kaldewaij and Laurensde Vries. Optimal real-timegarbage collection for acyclicpointer structures. InformationProcessing Letters, 77(2–4):151–157, February 28, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
38/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/38/article.
pdf.
Kerenidis:2004:QSP
[KdW04] Iordanis Kerenidis and Ronaldde Wolf. Quantum symmetrically-private information retrieval. In-formation Processing Letters, 90(3):109–114, May 16, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[Kim03] Sung Kwon Kim. Linear-time al-gorithm for finding a maximum-density segment of a sequence.Information Processing Letters,86(6):339–342, June 30, 2003.
[Kir02] Daniel Kirsten. The finite powerproblem revisited. InformationProcessing Letters, 84(6):291–294, December 31, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kapoor:2004:MVD
[KJ04] Hemangee K. Kapoor andMark B. Josephs. Modelling andverification of delay-insensitivecircuits using CCS and the Con-currency Workbench. Informa-tion Processing Letters, 89(6):293–296, March 31, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Koubkova:2002:ATC
[KK02] A. Koubkova and V. Koubek.Algorithms for transitive clo-sure. Information Process-ing Letters, 81(6):289–296,March 31, 2002. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/37/
27/abstract.html.
REFERENCES 197
Kovacs:2004:PTM
[KK04] Andras Kovacs and Tamas Kis.Partitioning of trees for min-imizing height and cardinal-ity. Information Processing Let-ters, 89(4):181–185, February28, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Konig:2007:ICC
[KK07] Barbara Konig and VitaliKozioura. Incremental con-struction of coverability graphs.Information Processing Let-ters, 103(5):203–209, August31, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Ko:2003:EAE
[KKL03] Jong Ha Ko, Sang Hee Kim,and Jong Kyu Lee. An ENAalgorithm to enhance the per-formance of TCP over satellitelinks. Information ProcessingLetters, 85(4):215–219, Febru-ary 28, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kloks:2000:FCS
[KKM00] Ton Kloks, Dieter Kratsch, andHaiko Muller. Finding andcounting small induced sub-graphs efficiently. Informa-tion Processing Letters, 74(3–4):115–121, May 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[KKSS08] Martin Kochol, Nad’a Krivonakova,Silvia Smejova, and KatarınaSrankova. Complexity of ap-proximation of 3-edge-coloringof graphs. Information Process-ing Letters, 108(4):238–241, Oc-tober 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Knill:2001:QCQ
[KL01] E. Knill and R. Laflamme.Quantum computing and quadrat-ically signed weight enumer-ators. Information Process-ing Letters, 79(4):173–179, Au-gust 15, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/33/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/33/28/article.
pdf.
REFERENCES 198
Klasing:2004:HRA
[KL04a] Ralf Klasing and ChristianLaforest. Hardness results andapproximation algorithms of k-tuple domination in graphs. In-formation Processing Letters, 89(2):75–83, January 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Korsh:2004:CTG
[KL04b] James F. Korsh and Paul S.LaFollette. Constant time gen-eration of derangements. In-formation Processing Letters, 90(4):181–186, May 31, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Klein:2008:SOA
[Kle08] Shmuel T. Klein. Should one al-ways use repeated squaring formodular exponentiation? Infor-mation Processing Letters, 106(6):232–237, June 15, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kim:2004:ESJ
[KLK04] Jongik Kim, Sang Ho Lee, andHyoung-Joo Kim. Efficientstructural joins with clusteredextents. Information Process-ing Letters, 91(2):69–75, July31, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kim:2006:RFC
[KLK06] Sangwon Kim, Joonwon Lee,and Jinsoo Kim. Runtime feasi-bility check for non-preemptive
[KLN+03] Jong Min Kim, Donghee Lee,Sam H. Noh, Sang Lyul Min,Yookun Cho, and Chong SangKim. An accurate and practicalbuffer allocation model for thebuffer cache based on marginalgains. Information ProcessingLetters, 85(2):93–97, January31, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kim:2004:FAG
[KLP04] Sung-Ryul Kim, Inbok Lee, andKunsoo Park. A fast algorithmfor the generalized k-keywordproximity problem given key-word offsets. Information Pro-cessing Letters, 91(3):115–120,August 16, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kim:2000:PSA
[KLY00] Hyun-Sung Kim, Sung-Woo Lee,and Kee-Young Yoo. Par-titioned systolic architecturefor modular multiplication inGF (2 m ). InformationProcessing Letters, 76(3):135–139, December 15, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/27/
REFERENCES 199
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/27/30/article.
pdf.
Karagiorgos:2002:ADA
[KM02] Gregory Karagiorgos and Niko-laos M. Missirlis. Accelerateddiffusion algorithms for dynamicload balancing. InformationProcessing Letters, 84(2):61–67,October 31, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Koo:2003:EBE
[KM03a] Zakil Koo and Songchun Moon.Effects of broadcast errors onconcurrency control in wirelessbroadcasting environments. In-formation Processing Letters, 86(1):13–21, April 15, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kwek:2003:OSR
[KM03b] Stephen Kwek and Kurt Mehl-horn. Optimal search for ra-tionals. Information Process-ing Letters, 86(1):23–26, April15, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kontkanen:2007:LTA
[KM07] Petri Kontkanen and Petri Myl-lymaki. A linear-time algorithmfor computing the multinomialstochastic complexity. Informa-tion Processing Letters, 103(6):227–233, September 15, 2007.CODEN IFPLAT. ISSN 0020-
0190 (print), 1872-6119 (elec-tronic).
Kang:2004:CMP
[KMCC04] Heum-Geun Kang, Jun-Ki Min,Seok-Ju Chun, and Chin-WanChung. A compression methodfor prefix-sum cubes. Informa-tion Processing Letters, 92(2):99–105, October 31, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kumaraswamy:2004:FDV
[KMF04] Krishna Kumaraswamy, VasileiosMegalooikonomou, and Chris-tos Faloutsos. Fractal dimen-sion and vector quantization. In-formation Processing Letters, 91(3):107–113, August 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Kneis:2006:PPD
[KMRR06] Joachim Kneis, Daniel Molle,Stefan Richter, and Peter Ross-manith. Parameterized powerdomination complexity. Infor-mation Processing Letters, 98(4):145–149, May 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kitsios:2002:OAR
[KMS+02] N. Kitsios, C. Makris, S. Sioutas,A. Tsakalidis, J. Tsaknakis,and B. Vassiliadis. An opti-mal algorithm for reporting vis-ible rectangles. InformationProcessing Letters, 81(5):283–288, March 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190
[KMST07] Yoshinobu Kawabe, Ken Mano,Hideki Sakurada, and YasuyukiTsukada. Theorem-provinganonymity of infinite-state sys-tems. Information ProcessingLetters, 101(1):46–51, January16, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kouris:2004:EAD
[KMT04] Ioannis N. Kouris, Christos H.Makris, and Athanasios K.Tsakalidis. Efficient automaticdiscovery of ‘hot’ itemsets. In-formation Processing Letters, 90(2):65–72, April 30, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kano:2005:PST
[KMU05] M. Kano, C. Merino, and J. Ur-rutia. On plane spanning treesand cycles of multicolored pointsets with few intersections. In-formation Processing Letters, 93(6):301–306, March 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Kosowski:2006:AAM
[KMZ06] Adrian Kosowski, Micha l Ma lafiejski,and Pawe l Zylinski. An ap-proximation algorithm for max-imum P3-packing in subcubicgraphs. Information Processing
[KN04a] I. Kerenidis and A. Nayak. Weakcoin flipping with small bias. In-formation Processing Letters, 89(3):131–135, February 14, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Krasikov:2004:FNS
[KN04b] I. Krasikov and S. D. Noble.Finding next-to-shortest pathsin a graph. Information Pro-cessing Letters, 92(3):117–119,November 15, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Knoblauch:2005:NAM
[Kno05] Andreas Knoblauch. Neuralassociative memory for brainmodeling and information re-trieval. Information ProcessingLetters, 95(6):537–544, Septem-ber 30, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Koura:2009:NGA
[KOH09] Ippei Koura, Takao Ono, andTomio Hirata. A note onthe Greedy algorithm for find-ing independent sets of Ck-freegraphs. Information ProcessingLetters, 109(10):485–489, April30, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 201
Koiran:2002:TTS
[Koi02] Pascal Koiran. Transfer theo-rems via sign conditions. In-formation Processing Letters, 81(2):65–69, January 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/33/28/abstract.html.
Koivisto:2006:OCS
[Koi06] Mikko Koivisto. Optimal 2-constraint satisfaction via sum–product algorithms. Informa-tion Processing Letters, 98(1):24–28, April 15, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kolman:2003:NGA
[Kol03] Petr Kolman. A note on thegreedy algorithm for the unsplit-table flow problem. Informa-tion Processing Letters, 88(3):101–105, November 15, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Koltun:2004:RSG
[Kol04] Vladlen Koltun. Ready, set, go!The Voronoi diagram of mov-ing points that start from a line.Information Processing Letters,89(5):233–235, March 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Kolliopoulos:2005:MCS
[Kol05] Stavros G. Kolliopoulos. Minimum-cost single-source 2-splittable
flow. Information ProcessingLetters, 94(1):15–18, April 15,2005. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Koutis:2005:FPA
[Kou05] Ioannis Koutis. A faster param-eterized algorithm for set pack-ing. Information Processing Let-ters, 94(1):7–9, April 15, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Koutis:2006:PCI
[Kou06] Ioannis Koutis. Parameterizedcomplexity and improved in-approximability for computingthe largest j-simplex in a V -polytope. Information Process-ing Letters, 100(1):8–13, Octo-ber 16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kowalik:2007:AQD
[Kow07] Lukasz Kowalik. Adjacencyqueries in dynamic sparsegraphs. Information ProcessingLetters, 102(5):191–195, May31, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kang:2006:RBS
[KP06] Bo Gyeong Kang and Je HongPark. On the relationship be-tween squared pairings and plainpairings. Information ProcessingLetters, 97(6):219–224, March31, 2006. CODEN IFPLAT.
REFERENCES 202
ISSN 0020-0190 (print), 1872-6119 (electronic).
Kim:2009:IMQ
[KP09] Eunsang Kim and Kunsoo Park.Improving multikey Quicksortfor sorting strings with manyequal elements. InformationProcessing Letters, 109(9):454–459, April 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kim:2007:ASA
[KPC07] Seok Woo Kim, Seong-HunPaeng, and Hee Je Cho. Ap-proximately n-secting an angle.Information Processing Letters,103(1):19–23, June 30, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Kim:2004:EPS
[KPL04] Sang-Wook Kim, Dae-HyunPark, and Heon-Gil Lee. Effi-cient processing of subsequencematching with the Euclideanmetric in time-series databases.Information Processing Letters,90(5):253–260, June 15, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Kovalyov:2002:PAL
[KPS02] Mikhail Y. Kovalyov, MarcusPattloch, and Gunter Schmidt.A polynomial algorithm for lot-size scheduling of two type tasks.Information Processing Letters,83(4):229–235, August 31, 2002.
[KR03a] Idit Keidar and Sergio Rajs-baum. A simple proof of theuniform consensus synchronouslower bound. Information Pro-cessing Letters, 85(1):47–52,January 16, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kralovic:2003:MFV
[KR03b] Rastislav Kralovic and PeterRuzicka. Minimum feedbackvertex sets in shuffle-based inter-connection networks. Informa-tion Processing Letters, 86(4):191–196, May 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kashem:2004:OPA
[KR04] Md. Abul Kashem and M. ZiaurRahman. An optimal parallel al-gorithm for c-vertex-ranking oftrees. Information ProcessingLetters, 92(4):179–184, Novem-ber 30, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kopparty:2005:FPE
[KR05] Swastik Kopparty and Chinya V.Ravishankar. A framework forpursuit evasion games in Rn. In-formation Processing Letters, 96(3):114–122, November 15, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[KR08] A. Kooshesh and B. Ravikumar.Efficient implementation of al-gorithms for approximate expo-nentiation. Information Pro-cessing Letters, 105(4):131–137,February 15, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Krajicek:2007:SPT
[Kra07] Jan Krajıcek. Substitutions intopropositional tautologies. Infor-mation Processing Letters, 101(4):163–167, February 28, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Karmakar:2008:FCS
[KRD08] Arindam Karmakar, SasankaRoy, and Sandip Das. Fastcomputation of smallest enclos-ing circle with center on a queryline segment. Information Pro-cessing Letters, 108(6):343–346,November 30, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Krivelevich:2002:DCE
[Kri02] Michael Krivelevich. Decid-ing k-colorability in expected
[KRS01] Goran Konjevod, R. Ravi, andF. Sibel Salman. On ap-proximating planar metrics bytree metrics. Information Pro-cessing Letters, 80(4):213–219,November 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/84/34/
32/abstract.html.
Kishore:2000:OPA
[KS00] K. V. R. C. N. Kishore and San-jeev Saxena. An optimal paral-lel algorithm for general maxi-mal matchings is as easy as forbipartite graphs. InformationProcessing Letters, 75(4):145–151, September 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/29/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/29/25/article.
pdf.
Kanda:2002:CVT
[KS02a] Takeshi Kanda and Kokichi Sug-ihara. Comparison of varioustrees for nearest-point search
REFERENCES 204
with/without the Voronoi di-agram. Information Process-ing Letters, 84(1):17–22, Octo-ber 16, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kobayashi:2002:CSG
[KS02b] Zenji Kobayashi and TakeshiSekiguchi. On a characterizationof the standard Gray code by us-ing its edge type on a hypercube.Information Processing Letters,81(5):231–237, March 16, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/36/27/abstract.html.
Kavvadias:2003:MBD
[KS03a] Dimitris J. Kavvadias andElias C. Stavropoulos. Mono-tone Boolean dualization is inco−NP[log2 n]. InformationProcessing Letters, 85(1):1–6,January 16, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kikuchi:2003:DNG
[KS03b] Yosuke Kikuchi and Yukio Shi-bata. On the domination num-bers of generalized de Bruijn di-graphs and generalized Kautzdigraphs. Information Process-ing Letters, 86(2):79–85, April30, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kaplan:2005:GAS
[KS05] Haim Kaplan and Nira Shafrir.
The greedy algorithm for short-est superstrings. InformationProcessing Letters, 93(1):13–17,January 16, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kaplan:2006:GAE
[KS06] Haim Kaplan and Nira Shafrir.The greedy algorithm for editdistance with moves. Informa-tion Processing Letters, 97(1):23–27, January 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kowalski:2009:GPP
[KS09] Dariusz R. Kowalski and Micha lStrojnowski. Gossiping by pro-cessors prone to omission fail-ures. Information ProcessingLetters, 109(6):308–314, Febru-ary 28, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kannan:2003:MSI
[KSRI03] Rajgopal Kannan, S. Sarangi,Sibabrata Ray, and S. S. Iyen-gar. Minimal sensor integrity:Measuring the vulnerability ofsensor grids. Information Pro-cessing Letters, 86(1):49–55,April 15, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kavvadias:2000:GAM
[KSS00] Dimitris J. Kavvadias, MarthaSideri, and Elias C. Stavropou-los. Generating all maxi-mal models of a Boolean ex-pression. Information Pro-
[Kuj09] Jussi Kujala. Assemblingapproximately optimal binarysearch trees efficiently usingarithmetics. Information Pro-cessing Letters, 109(16):962–966, July 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kundu:2000:OAC
[Kun00] Sukhamay Kundu. An optimalO(N2) algorithm for comput-ing the min-transitive closureof a weighted graph. Informa-tion Processing Letters, 74(5–6):215–220, June 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/28/
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/28/30/article.
pdf.
REFERENCES 206
Kurowski:2003:SEF
[Kur03] Maciej Kurowski. Simple and ef-ficient floor-planning. Informa-tion Processing Letters, 86(3):113–119, May 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kurowski:2004:LBN
[Kur04] Maciej Kurowski. A 1.235 lowerbound on the number of pointsneeded to draw all n-vertex pla-nar graphs. Information Pro-cessing Letters, 92(2):95–98, Oc-tober 31, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kurosaki:2008:DDT
[Kur08] Tetsuo Kurosaki. Direct defini-tion of a ternary infinite square-free sequence. Information Pro-cessing Letters, 106(5):175–179,May 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kutzkov:2007:NUB
[Kut07] Konstantin Kutzkov. New upperbound for the #3-sat problem.Information Processing Letters,105(1):1–5, December 31, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Kristiansen:2003:CCF
[KV03] Lars Kristiansen and Paul J.Voda. Complexity classes andfragments of C. InformationProcessing Letters, 88(5):213–218, December 16, 2003. CO-
DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kallahalla:2004:ASR
[KV04] Mahesh Kallahalla and Peter J.Varman. Analysis of simplerandomized buffer managementfor parallel I/O. InformationProcessing Letters, 90(1):47–52,April 15, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Korze:2005:LSP
[KV05] Danilo Korze and AleksanderVesel. L(2, 1)-labeling of strongproducts of cycles. Informa-tion Processing Letters, 94(4):183–190, May 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Keil:2008:RNG
[KV08a] J. Mark Keil and Tzvetalin S.Vassilev. The relative neigh-bourhood graph is a part of ev-ery 30-triangulation. Informa-tion Processing Letters, 109(2):93–97, December 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kenkre:2008:CPP
[KV08b] Sreyash Kenkre and SundarVishwanathan. The commonprefix problem on trees. Infor-mation Processing Letters, 105(6):245–248, March 16, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 207
Kravchenko:2001:HAMa
[KW01a] Svetlana A. Kravchenko andFrank Werner. A heuristic algo-rithm for minimizing mean flowtime with unit setups. Informa-tion Processing Letters, 79(6):291–296, September 30, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/80/37/33/abstract.html.
Kravchenko:2001:HAMb
[KW01b] Svetlana A. Kravchenko andFrank Werner. A heuristic algo-rithm for minimizing mean flowtime with unit setups. Informa-tion Processing Letters, 79(6):291–296, September 30, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/80/37/33/abstract.html.
Kato:2005:SSR
[KW05] Ryoichi Kato and OsamuWatanabe. Substring search andrepeat search using factor or-acles. Information ProcessingLetters, 93(6):269–274, March31, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kwon:2002:STC
[Kwo02a] Oh-Heum Kwon. Schedulingtime-constrained multicast mes-sages in circuit-switched treenetworks. Information Process-ing Letters, 84(2):109–116, Oc-tober 31, 2002. CODEN IF-
[Kwo02b] Taekyoung Kwon. Digital signa-ture algorithm for securing dig-ital identities. Information Pro-cessing Letters, 82(5):247–252,June 15, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic). See erra-tum [Kwo03].
Kwon:2003:EDS
[Kwo03] Taekyoung Kwon. Erratumto: “Digital signature algo-rithm for securing digital iden-tities”: [Inform. Process. Lett.82 (2002) 247–252]. Informa-tion Processing Letters, 88(4):201–202, November 30, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). See [Kwo02b].
Kaneko:2000:STR
[KY00] Atsushi Kaneko and KiyoshiYoshimoto. On spanningtrees with restricted degrees.Information Processing Let-ters, 73(5–6):163–165, March31, 2000. CODEN IF-PLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/28/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/28/27/article.
pdf.
REFERENCES 208
Kawano:2003:WCA
[KY03a] Sinichiro Kawano and KoichiYamazaki. Worst case analysisof a greedy algorithm for graphthickness. Information Pro-cessing Letters, 85(6):333–337,March 31, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kim:2003:PCM
[KY03b] Ho-Sook Kim and Hwan-SeungYong. Personalized cache man-agement for mobile computingenvironments. Information Pro-cessing Letters, 87(4):221–228,August 31, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kuo:2006:MMS
[KY06] Wen-Hung Kuo and Dar-LiYang. Minimizing the makespanin a single machine schedul-ing problem with a time-basedlearning effect. InformationProcessing Letters, 97(2):64–67,January 31, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Kuo:2007:SMS
[KY07] Wen-Hung Kuo and Dar-LiYang. Single machine schedulingwith past-sequence-dependentsetup times and learning effects.Information Processing Letters,102(1):22–26, April 15, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Khuller:2002:GST
[KZ02] Samir Khuller and An Zhu. TheGeneral Steiner Tree-Star prob-lem. Information ProcessingLetters, 84(4):215–220, Novem-ber 30, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Kasperski:2006:AAI
[KZ06] Adam Kasperski and Pawe lZielinski. An approximation al-gorithm for interval data min-max regret combinatorial opti-mization problems. Informa-tion Processing Letters, 97(5):177–180, March 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Kasperski:2009:AMR
[KZ09] Adam Kasperski and Pawe lZielinski. On the approximabil-ity of minmax (regret) networkoptimization problems. Infor-mation Processing Letters, 109(5):262–266, February 15, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Leal:2001:SLV
[LA01] William Leal and Anish Arora.State-level and value-level sim-ulations in data refinement.Information Processing Let-ters, 77(2–4):159–167, Febru-ary 28, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
REFERENCES 209
39/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/39/article.
pdf.
Laing:2007:NIC
[Lai07] Kofi A. Laing. Name-independentcompact routing in trees. Infor-mation Processing Letters, 103(2):57–60, July 16, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Lai:2009:NPB
[Lai09] Chia-Jui Lai. A note onpath bipancyclicity of hyper-cubes. Information Process-ing Letters, 109(19):1129–1130,September 15, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Lange:2008:PMT
[Lan08] Martin Lange. A purely model-theoretic proof of the exponen-tial succinctness gap betweenCTL + and CTL. InformationProcessing Letters, 108(5):308–312, November 15, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Lasota:2009:ELB
[Las09] S lawomir Lasota. EXPSPACElower bounds for the sim-ulation preorder between acommunication-free Petri netand a finite-state system. Infor-mation Processing Letters, 109(15):850–855, July 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Latifi:2007:SFT
[Lat07] Shahram Latifi. A study of faulttolerance in star graph. Infor-mation Processing Letters, 102(5):196–200, May 31, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Lavallee:2008:RCC
[Lav08] Sylvain Lavallee. N-rationalityof a certain class of formal se-ries. Information ProcessingLetters, 108(3):124–126, Octo-ber 16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Lee:2001:ECM
[LC01] Seok-Lyong Lee and Chin-Wan Chung. On the effec-tive clustering of multidimen-sional data sequences. Informa-tion Processing Letters, 80(2):87–95, October 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/80/37/
30/abstract.html.
Liu:2002:SJR
[LC02] Zhaohui Liu and T. C. EdwinCheng. Scheduling with job re-lease dates, delivery times andpreemption penalties. Informa-tion Processing Letters, 82(2):107–111, April 30, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/86/33/
32/abstract.html.
REFERENCES 210
Laih:2003:COP
[LC03a] C. S. Laih and S. Y. Chiou.Cryptanalysis of an optimizedprotocol for mobile network au-thentication and security. In-formation Processing Letters, 85(6):339–341, March 31, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[LC03c] Brad Lushman and Gordon V.Cormack. Proof of correctnessof Ressel’s adOPTed algorithm.Information Processing Letters,86(6):303–310, June 30, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Lai:2004:PCT
[LC04] Yung-Ling Lai and Gerard J.Chang. On the profile of thecorona of two graphs. Informa-tion Processing Letters, 89(6):287–292, March 31, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Li:2006:LSS
[LC06] Yuan Li and T. W. Cusick.Linear structures of symmetric
functions over finite fields. In-formation Processing Letters, 97(3):124–127, February 14, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Lin:2008:LTA
[LC08] Min-Sheng Lin and Yung-JuiChen. Linear time algorithmsfor counting the number of min-imal vertex covers with mini-mum/maximum size in an in-terval graph. Information Pro-cessing Letters, 107(6):257–264,August 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Lee:2009:SMC
[LC09a] Chuan-Min Lee and Maw-ShangChang. Signed and minus clique-transversal functions on graphs.Information Processing Letters,109(8):414–417, March 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Lin:2009:CNV
[LC09b] Min-Sheng Lin and Yung-JuiChen. Counting the numberof vertex covers in a trapezoidgraph. Information ProcessingLetters, 109(21–22):1187–1192,October 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Lin:2006:NSC
[LCC06] Jyh-Shyan Lin, Jen-Chun Chang,and Rong-Jaye Chen. New sim-ple constructions of distance-
REFERENCES 211
increasing mappings from bi-nary vectors to permutations.Information Processing Letters,100(2):83–89, October 31, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Lee:2006:BAA
[LCKL06] Jeng Farn Lee, Meng ChangChen, Ming Tat Ko, and Wan-jiun Liao. Bandwidth allocationalgorithms for weighted maxi-mum rate constrained link shar-ing policy. Information Pro-cessing Letters, 97(6):238–243,March 31, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Lin:2006:VCP
[LCL06] Guohui Lin, Zhipeng Cai, andDekang Lin. Vertex covering bypaths on trees with its appli-cations in machine translation.Information Processing Letters,97(2):73–81, January 31, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Lai:2008:FOD
[LCL08] Hsin-Hao Lai, Gerard J. Chang,and Ko-Wei Lih. On fullyorientability of 2-degenerategraphs. Information ProcessingLetters, 105(5):177–181, Febru-ary 29, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Lee:2009:AAM
[LCLP09] Kangbok Lee, Byung-CheonChoi, Joseph Y.-T. Leung, andMichael L. Pinedo. Approx-imation algorithms for multi-agent scheduling to minimize to-tal weighted completion time.Information Processing Letters,109(16):913–917, July 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Liu:2009:SRE
[LCM09] Juan Liu, Xing Chen, and Jixi-ang Meng. Super restricted edgeconnected Cartesian productgraphs. Information ProcessingLetters, 109(13):655–659, June15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Luo:2007:CPG
[LCW07] Xiaofang Luo, Min Chen, andWeifan Wang. On 3-colorableplanar graphs without cycles offour lengths. Information Pro-cessing Letters, 103(4):150–156,August 16, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Litow:2004:GCZ
[LD04] B. Litow and N. Deo. Graphcompression and the zeros ofpolynomials. Information Pro-cessing Letters, 92(1):39–44, Oc-tober 16, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 212
Lai:2002:REN
[LE02] Wei Lai and Peter Eades. Re-moving edge-node intersectionsin drawings of graphs. Infor-mation Processing Letters, 81(2):105–110, January 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
[Lec07] Thierry Lecroq. Fast ex-act string matching algorithms.Information Processing Letters,102(6):229–235, June 15, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Lee:2009:CSM
[Lee09] Chuan-Min Lee. On the com-plexity of signed and minus totaldomination in graphs. Informa-tion Processing Letters, 109(20):1177–1181, September 30, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Leino:2001:REN
[Lei01] K. Rustan M. Leino. Real es-tate of names. InformationProcessing Letters, 77(2–4):169–171, February 28, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
40/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/40/article.
pdf.
Leino:2005:EWP
[Lei05] K. Rustan M. Leino. Efficientweakest preconditions. Informa-tion Processing Letters, 93(6):281–288, March 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Luccio:2007:RRD
[LEP07] Fabrizio Luccio, Antonio MesaEnriquez, and Linda Pagli. k-Restricted rotation distance be-tween binary trees. InformationProcessing Letters, 102(5):175–180, May 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Levin:2006:RTS
[Lev06] Asaf Levin. Real time schedul-ing with a budget: Parametric-search is better than binarysearch. Information ProcessingLetters, 99(5):187–191, Septem-ber 15, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 213
Levin:2007:FHI
[Lev07] Asaf Levin. The finite hori-zon investor problem with abudget constraint. Informa-tion Processing Letters, 104(1):21–28, September 30, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Laber:2002:IBA
[LH02] Eduardo Sany Laber andLeonardo Gomes Holanda. Im-proved bounds for asymmetriccommunication protocols. In-formation Processing Letters, 83(4):205–209, August 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Lee:2003:MMC
[LH03] SingLing Lee and Hann-JangHo. On minimizing the max-imum congestion for WeightedHypergraph Embedding in a Cy-cle. Information Processing Let-ters, 87(5):271–275, September15, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Li:2004:SAD
[LH04] Ying Li and Yibin Hou. Searchaudio data with the waveletpyramidal algorithm. Informa-tion Processing Letters, 91(1):49–55, July 16, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Lorencz:2005:SFA
[LH05] Robert Lorencz and JosefHlavac. Subtraction-free Almost
[LH08] Pao-Lien Lai and Hong-ChunHsu. The two-equal-disjointpath cover problem of MatchingComposition Network. Infor-mation Processing Letters, 107(1):18–23, June 30, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Li:2000:STJ
[LHC+00] Zichen Li, L. C. K. Hui, K. P.Chow, C. F. Chong, W. W.Tsang, and H. W. Chan. Se-curity of Tseng–Jan’s group sig-nature schemes. InformationProcessing Letters, 75(5):187–189, October 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/30/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/30/25/article.
pdf.
Li:2001:SWA
[LHC+01] Z. C. Li, L. C. K. Hui, K. P.Chow, C. F. Chong, W. W.Tsang, and H. W. Chan. Se-curity of Wang et al.’s group-oriented (t, n) threshold sig-nature schemes with traceablesigners. Information Process-ing Letters, 80(6):295–298, De-cember 31, 2001. CODEN
[LHC+05] Chuan-Min Lee, Ling-Ju Hung,Maw-Shang Chang, Chia-BenShen, and Chuan-Yi Tang. Animproved algorithm for the max-imum agreement subtree prob-lem. Information ProcessingLetters, 94(5):211–216, June 15,2005. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Lee:2002:EAH
[LHK02] Dong-Ho Lee, Shin Heu, andHyoung-Joo Kim. An effi-cient algorithm for hyperspher-ical range query processing inhigh-dimensional data space. In-formation Processing Letters, 83(2):115–123, July 31, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Liu:2008:LEL
[LHL08] Bin Liu, Jianfeng Hou, andGuizhen Liu. List edge and listtotal colorings of planar graphswithout short cycles. Informa-tion Processing Letters, 108(6):347–351, November 30, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
conflict analysis of concurrentworkflow definition. Informa-tion Processing Letters, 80(4):189–194, November 30, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/34/29/abstract.html.
Lu:2000:GSP
[LHT00] Bor-Kuan Lu, Fang-Rong Hsu,and Chuan Yi Tang. Guardingin a simple polygon. InformationProcessing Letters, 75(4):153–158, September 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/29/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/29/26/article.
pdf.
Liu:2007:EDRb
[LHWL07] J. J. Liu, G. S. Huang, Y. L.Wang, and R. C. T. Lee.Edit distance for a run-length-encoded string and an uncom-pressed string. InformationProcessing Letters, 105(1):12–16, December 31, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Li:2000:ERS
[Li00] Chu Min Li. Equivalency rea-soning to solve a class of hardSAT problems. InformationProcessing Letters, 76(1–2):75–81, November 20, 2000. CO-DEN IFPLAT. ISSN 0020-0190
[Li06] Rao Li. A new sufficient condi-tion for Hamiltonicity of graphs.Information Processing Letters,98(4):159–161, May 31, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Li:2009:UBP
[Li09] Jian Li. An O(log n/ log logn)upper bound on the price ofstability for undirected Shapleynetwork design games. Informa-tion Processing Letters, 109(15):876–878, July 16, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Libkin:2003:CRC
[Lib03] Leonid Libkin. A collapse re-sult for constraint queries overstructures of small degree. In-formation Processing Letters, 86(5):277–281, June 15, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Liberatore:2006:CEC
[Lib06] Paolo Liberatore. On the com-plexity of extension checkingin default logic. InformationProcessing Letters, 98(2):61–65,April 30, 2006. CODEN IF-
[Lie08] Mathieu Liedloff. Finding adominating set on bipartitegraphs. Information ProcessingLetters, 107(5):154–157, August16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Lifshits:2003:LBS
[Lif03] Yuri Lifshits. A lower boundon the size of ε-free NFA cor-responding to a regular expres-sion. Information ProcessingLetters, 85(6):293–299, March31, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Lins:2002:EAC
[Lin02] Rafael Dueire Lins. An effi-cient algorithm for cyclic refer-ence counting. Information Pro-cessing Letters, 83(3):145–150,August 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Lin:2007:FSA
[Lin07] Min-Sheng Lin. Fast and sim-ple algorithms to count the num-ber of vertex covers in an in-terval graph. Information Pro-cessing Letters, 102(4):143–146,May 16, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 216
Lin:2008:CMN
[Lin08a] Jyhjong Lin. A conceptualmodel for negotiating in service-oriented environments. Informa-tion Processing Letters, 108(4):192–203, October 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Lins:2008:CRC
[Lin08b] Rafael Dueire Lins. Cyclic ref-erence counting. InformationProcessing Letters, 109(1):71–78, December 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Litow:2003:IFB
[Lit03a] B. Litow. Inequality of finitebehaviors of rational weight fi-nite automata is in R. Informa-tion Processing Letters, 87(3):139–145, August 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Litow:2003:NCM
[Lit03b] B. Litow. A note on commu-tative multivariate rational se-ries. Information ProcessingLetters, 87(6):283–285, Septem-ber 30, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Liu:2004:NPL
[Liu04a] Ding Liu. A note on point lo-cation in arrangements of hy-perplanes. Information Process-ing Letters, 90(2):93–95, April30, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
[Liu05] Pangfeng Liu. Minimum degreetriangulation for rectangular do-mains. Information ProcessingLetters, 96(4):128–135, Novem-ber 30, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Livne:2009:NPC
[Liv09] Noam Livne. A note on #p-completeness of NP-witnessingrelations. Information Pro-cessing Letters, 109(5):259–261,February 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Lin:2003:CHS
[LJ03] Li Lin and Yunfei Jiang. Thecomputation of hitting sets: Re-view and new algorithms. In-formation Processing Letters, 86(4):177–184, May 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Liu:2009:CLW
[LJ09] GuanJun Liu and ChangJunJiang. On conditions for the live-ness of weakly persistent nets.Information Processing Letters,109(16):967–970, July 31, 2009.
[LJL07] Brendan Lucier, Tao Jiang, andMing Li. Average-case analy-sis of QuickSort and Binary In-sertion Tree height using incom-pressibility. Information Pro-cessing Letters, 103(2):45–51,July 16, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Lin:2000:REP
[LK00] Jenn-Wei Lin and Sy-Yen Kuo.Resolving error propagation indistributed systems. Informa-tion Processing Letters, 74(5–6):257–262, June 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/28/
36/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/28/36/article.
pdf.
Lee:2002:ENN
[LK02] Dong-Ho Lee and Hyoung-Joo Kim. An efficient near-est neighbor search in high-dimensional data spaces. In-formation Processing Letters, 81(5):239–246, March 16, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
[LKP01] Han Wook Lee, Dae WoongKim, and Chan-Ik Park. PhasedRGSS: An improved disk ar-ray scheduling for continuousmedia retrieval. InformationProcessing Letters, 80(5):225–231, December 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/84/36/
28/abstract.html.
Lee:2002:DSS
[LKY02] Keon-Jik Lee, Kee-Won Kim,and Kee-Young Yoo. Digit-serial-in-serial-out systolic mul-tiplier for Montgomery algo-rithm. Information ProcessingLetters, 82(2):65–71, April 30,2002. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
REFERENCES 218
elsevier.com/gej-ng/10/23/
20/86/33/27/abstract.html.
Li:2001:EVC
[LL01] Xuandong Li and Johan Lil-ius. Efficient verification of aclass of time Petri nets usinglinear programming. Informa-tion Processing Letters, 77(5–6):219–224, March 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/32/
24/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/32/24/article.
pdf.
Le:2002:NCS
[LL02a] Hoang-Oanh Le and Van BangLe. The NP-completenessof (1, r)-subcolorability of cu-bic graphs. Information Pro-cessing Letters, 81(3):157–162,February 14, 2002. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/34/
33/abstract.html.
Lefebvre:2002:CLL
[LL02b] Arnaud Lefebvre and ThierryLecroq. Compror: On-line loss-less data compression with a fac-tor oracle. Information Pro-cessing Letters, 83(1):1–6, July16, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Lingas:2009:EAA
[LL09] Andrzej Lingas and Eva-MartaLundell. Efficient approximationalgorithms for shortest cycles inundirected graphs. InformationProcessing Letters, 109(10):493–498, April 30, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Lan:2009:IUL
[LLC09] James K. Lan, Victor W. Liu,and Chiuyuan Chen. Improvedupper and lower bounds on theoptimization of mixed chordalring networks. InformationProcessing Letters, 109(13):757–762, June 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[LLK08] Sung-Hwa Lim, Byoung-HoonLee, and Jai-Hoon Kim. Di-versity and fault avoidance fordependable replication systems.Information Processing Letters,108(1):33–37, September 15,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
REFERENCES 219
Lee:2009:NAA
[LLP09a] Kangbok Lee, Joseph Y.-T. Leung, and Michael L.Pinedo. A note on “An ap-proximation algorithm for theload-balanced semi-matchingproblem in weighted bipartitegraphs”. Information ProcessingLetters, 109(12):608–610, May31, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic). See [Low06].
Lee:2009:NGB
[LLP09b] Kangbok Lee, Joseph Y.-T. Le-ung, and Michael L. Pinedo. Anote on graph balancing prob-lems with restrictions. Informa-tion Processing Letters, 110(1):24–29, December 1, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Leung:2007:MTW
[LLPZ07] Joseph Y.-T. Leung, HaibingLi, Michael Pinedo, and Ji-awei Zhang. Minimizing to-tal weighted completion timewhen scheduling orders in a flex-ible environment with uniformmachines. Information Pro-cessing Letters, 103(3):119–129,July 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Latapy:2002:CDL
[LM02] Matthieu Latapy and ClemenceMagnien. Coding distribu-tive lattices with Edge FiringGames. Information ProcessingLetters, 83(3):125–128, August
[LM04a] Giacomo Lenzi and Erich Mon-teleone. On Fixpoint Arithmeticand Infinite Time Turing Ma-chines. Information ProcessingLetters, 91(3):121–128, August16, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Liskiewicz:2004:NLU
[LM04b] Maciej Liskiewicz and BodoManthey. New lower and up-per bounds for the competitiveratio of transmission protocols.Information Processing Letters,89(6):297–301, March 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Lesh:2006:BSH
[LM06] N. Lesh and M. Mitzenmacher.Bubblesearch: A simple heuris-tic for improving priority-basedgreedy algorithms. InformationProcessing Letters, 97(4):161–169, February 28, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Laue:2008:AHM
[LM08a] Soren Laue and Domagoj Mati-jevic. Approximating k-hopminimum spanning trees in Eu-clidean metrics. InformationProcessing Letters, 107(3–4):96–101, July 31, 2008. CODEN IF-
[LM08b] Rui Li and Jixiang Meng. Rever-sals Cayley graphs of symmet-ric groups. Information Process-ing Letters, 109(2):130–132, De-cember 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Liu:2008:SCS
[LM08c] Juan Liu and Jixiang Meng.Super-connected and super-arc-connected Cartesian product ofdigraphs. Information Process-ing Letters, 108(3):90–93, Octo-ber 16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Lozin:2009:MIS
[LM09] Vadim Lozin and RaffaeleMosca. Maximum independentsets in subclasses of P 5-freegraphs. Information ProcessingLetters, 109(6):319–324, Febru-ary 28, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Liu:2009:CFS
[LMC+09] Hai Liu, Lizhuang Ma, XuanCai, Zhihua Chen, and YangShen. A closed-form solutionto video matting of naturalsnow. Information ProcessingLetters, 109(18):1097–1104, Au-gust 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Leenen:2007:RSC
[LMG07] Louise Leenen, Thomas Meyer,and Aditya Ghose. Relaxationsof semiring constraint satisfac-tion problems. Information Pro-cessing Letters, 103(5):177–182,August 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Lucas:2005:OTC
[LMM05] Salvador Lucas, Claude Marche,and Jose Meseguer. Operationaltermination of conditional termrewriting systems. Informa-tion Processing Letters, 95(4):446–453, August 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Lesh:2004:EAR
[LMMM04] N. Lesh, J. Marks, A. McMahon,and M. Mitzenmacher. Exhaus-tive approaches to 2D rectangu-lar perfect packings. Informa-tion Processing Letters, 90(1):7–14, April 15, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Lanotte:2004:TCT
[LMST04] Ruggero Lanotte, Andrea Maggiolo-Schettini, and Simone Tini. ε-transitions in Concurrent TimedAutomata. Information Process-ing Letters, 89(1):1–7, January16, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Leprevost:2005:GAE
[LMVV05] Franck Leprevost, Jean Mon-nerat, Sebastien Varrette, and
[Lon03] Philip M. Long. An upperbound on the sample complexityof PAC-learning halfspaces withrespect to the uniform distri-bution. Information ProcessingLetters, 87(5):229–234, Septem-ber 15, 2003. CODEN IFPLAT.
[Lop00] Lanfranco Lopriore. Protec-tion in a single-address-space en-vironment. Information Pro-cessing Letters, 76(1–2):25–32,November 20, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/24/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/24/28/article.
pdf.
Low:2002:ERS
[Low02] Chor Ping Low. An efficientretrieval selection algorithm forvideo servers with random dupli-cated assignment storage tech-nique. Information ProcessingLetters, 83(6):315–321, Septem-ber 30, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Low:2006:AAL
[Low06] Chor Ping Low. An ap-proximation algorithm for theload-balanced semi-matchingproblem in weighted bipartite
REFERENCES 222
graphs. Information ProcessingLetters, 100(4):154–161, Novem-ber 30, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic). See note[LLP09a].
Lozin:2002:MIM
[Loz02] V. V. Lozin. On maximuminduced matchings in bipartitegraphs. Information ProcessingLetters, 81(1):7–11, January 16,2002. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/27/28/abstract.html.
Lozin:2005:BC
[Loz05] Vadim V. Lozin. Between 2- and3-colorability. Information Pro-cessing Letters, 94(4):179–182,May 31, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Lipsky:2008:AMM
[LP08a] Ohad Lipsky and Ely Porat. Ap-proximate matching in the L∞metric. Information ProcessingLetters, 105(4):138–140, Febru-ary 15, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
[LP09] Fabrizio Luccio and Linda Pagli.The Fermat star of binary trees.Information Processing Letters,109(11):568–571, May 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Lee:2002:SAS
[LPC02] Jae-Ha Lee, Sang-Min Park, andKyung-Yong Chwa. Simple al-gorithms for searching a poly-gon with flashlights. Informa-tion Processing Letters, 81(5):265–270, March 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/36/
32/abstract.html.
Li:2005:MCK
[LPM05] Mingyan Li, Radha Poovendran,and David A. McGrew. Min-imizing center key storage inhybrid one-way function basedgroup key management withcommunication constraints. In-formation Processing Letters, 93(4):191–198, February 28, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Lotker:2008:SRT
[LPSR08] Zvi Lotker, Boaz Patt-Shamir,and Dror Rawitz. Ski rentalwith two general options. Infor-mation Processing Letters, 108(6):365–368, November 30, 2008.CODEN IFPLAT. ISSN 0020-
REFERENCES 223
0190 (print), 1872-6119 (elec-tronic).
Lamport:2000:WDC
[LPW00] Leslie Lamport, Sharon Perl,and William Weihl. Whendoes a correct mutual exclu-sion algorithm guarantee mu-tual exclusion? InformationProcessing Letters, 76(3):131–134, December 15, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/27/
29/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/27/29/article.
pdf.
Lingas:2014:CNC
[LPWZ14] Andrzej Lingas, Leonidas Palios,Agnieszka Wasylewicz, andPawel Zylinski. Corrigendumto “Note on covering mono-tone orthogonal polygons” [Inf.Process. Lett. 104(6) (2007)220–227]. Information Pro-cessing Letters, 114(11):646–654, November 2014. CO-DEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
sciencedirect.com/science/
article/pii/S0020019014000593.See [LWZ07].
Lehman:2003:SEB
[LR03a] Meir M. Lehman and Juan F.Ramil. Software evolution—-background, theory, practice.Information Processing Let-ters, 88(1–2):33–44, October 17,
[LR03b] Vadim Lozin and Dieter Raut-enbach. Some results on graphswithout long induced paths. In-formation Processing Letters, 88(4):167–171, November 30, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Liebchen:2005:GAC
[LR05] Christian Liebchen and RomeoRizzi. A greedy approach tocompute a minimum cycle basisof a directed graph. Informa-tion Processing Letters, 94(3):107–112, May 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Liu:2006:ICU
[LR06] Hong Liu and Kenneth W. Re-gan. Improved construction foruniversality of determinant andpermanent. Information Pro-cessing Letters, 100(6):233–237,December 31, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Lopez:2008:HAC
[LR08] Mario A. Lopez and ShlomoReisner. Hausdorff approxima-tion of 3D convex polytopes.Information Processing Letters,107(2):76–82, July 16, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 224
Li:2002:NBB
[LS02] Xiao Yu Li and Matthias F.Stallmann. New bounds on thebarycenter heuristic for bipar-tite graph drawing. Informa-tion Processing Letters, 82(6):293–298, June 30, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Lange:2006:PDL
[LS06] Martin Lange and Rafa l Somla.Propositional dynamic logic ofcontext-free programs and fix-point logic with chop. Informa-tion Processing Letters, 100(2):72–75, October 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Laroussinie:2007:SEA
[LS07a] Francois Laroussinie and JeremySproston. State explosion inalmost-sure probabilistic reach-ability. Information ProcessingLetters, 102(6):236–241, June15, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Lin:2007:FRC
[LS07b] Min Chih Lin and Jayme L.Szwarcfiter. Faster recognitionof clique-Helly and hereditaryclique-Helly graphs. Informa-tion Processing Letters, 103(1):40–43, June 30, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Li:2009:GCR
[LS09a] Yue Li and Joe Sawada. Graycodes for reflectable languages.
Information Processing Letters,109(5):296–300, February 15,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Linhart:2009:MDC
[LS09b] Chaim Linhart and Ron Shamir.Matching with don’t-cares anda small number of mismatches.Information Processing Letters,109(5):273–277, February 15,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
[LSL08] Banghe Li, Yuefeng Shen, andBo Li. A new algorithm forcomputing the minimum Haus-dorff distance between two pointsets on a line under translation.Information Processing Letters,106(2):52–58, April 15, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Long:2007:DLC
[LSS07] Philip M. Long, Rocco A. Serve-dio, and Hans Ulrich Simon.Discriminative learning can suc-ceed where generative learning
[LSY07] Shuang Luan, Jared Saia, andMaxwell Young. Approxima-tion algorithms for minimizingsegments in radiation therapy.Information Processing Letters,101(6):239–244, March 31, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Landau:2003:SLC
[LSZU03] Gad M. Landau, BaruchSchieber, and Michal Ziv-Ukelson. Sparse LCS CommonSubstring Alignment. Informa-tion Processing Letters, 88(6):259–270, December 31, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Lu:2003:NUA
[LT03] Chang-Chun Lu and Shi-ChunTsai. A note on unscramblingaddress lines. Information Pro-cessing Letters, 85(4):185–189,February 28, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Li:2006:VML
[LT06] (Ben) P. C. Li and M. Toulouse.Variations of the maximum leafspanning tree problem for bipar-tite graphs. Information Pro-cessing Letters, 97(4):129–132,
February 28, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Liu:2007:EDRa
[LT07] ChenGuang Liu and KazuyukiTanaka. Eigen-distribution onrandom assignments for gametrees. Information ProcessingLetters, 104(2):73–77, October16, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Lai:2008:EFM
[LT08a] Chia-Jui Lai and Chang-HsiungTsai. Embedding a family ofmeshes into twisted cubes. In-formation Processing Letters,108(5):326–330, November 15,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Lai:2008:ECF
[LT08b] Chia-Jui Lai and Chang-HsiungTsai. On embedding cycles intofaulty dual-cubes. InformationProcessing Letters, 109(2):147–150, December 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Lee:2005:SES
[LTH05] Kuo-Chu Lee, Chi-Hung Tzeng,and Shing-Tsaan Huang. Aspace-efficient self-stabilizing al-gorithm for measuring the size ofring networks. Information Pro-cessing Letters, 94(3):125–130,May 16, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 226
Lee:2008:EHP
[LTH08] Chung-Meng Lee, Jimmy J. M.Tan, and Lih-Hsing Hsu. Em-bedding Hamiltonian paths inhypercubes with a required ver-tex in a fixed position. Informa-tion Processing Letters, 107(5):171–176, August 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Li:2001:SCT
[LTHS01] Tseng-Kuei Li, Jimmy J. M.Tan, Lih-Hsing Hsu, and Ting-Yi Sung. The shuffle-cubes andtheir generalization. Informa-tion Processing Letters, 77(1):35–41, January 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[LTT06] Chung-Ming Lin, Yin Te Tsai,and Chuan Yi Tang. Balanc-ing minimum spanning trees andmultiple-source minimum rout-ing cost spanning trees on met-ric graphs. Information Process-ing Letters, 99(2):64–67, July31, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Li:2003:BEF
[LTTH03] Tseng-Kuei Li, Chang-HsiungTsai, Jimmy J. M. Tan, andLih-Hsing Hsu. Bipanconnec-tivity and edge-fault-tolerant bi-pancyclicity of hypercubes. In-formation Processing Letters, 87(2):107–110, July 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Li:2003:SOR
[LTV03] Ming Li, John Tromp, and PaulVitanyi. Sharpening Occam’srazor. Information ProcessingLetters, 85(5):267–274, March16, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Leinders:2004:EPS
[LTV04] Dirk Leinders, Jerzy Tyszkiewicz,and Jan Van den Bussche. Onthe expressive power of semijoinqueries. Information Process-ing Letters, 91(2):93–98, July31, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 227
Lucas:2004:DAR
[Luc04a] Joan M. Lucas. A direct al-gorithm for restricted rotationdistance. Information Process-ing Letters, 90(3):129–134, May16, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Lucas:2004:SNS
[Luc04b] Salvador Lucas. Strong and NV-sequentiality of constructor sys-tems. Information ProcessingLetters, 89(4):191–201, Febru-ary 28, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Lutz:2004:CVE
[Lut04] Jack H. Lutz. Computabilityversus exact computability ofmartingales. Information Pro-cessing Letters, 92(5):235–237,December 16, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[LW06] Kang Li and Lusheng Wang. Apolynomial time approximationscheme for embedding a directedhypergraph on a ring. Informa-tion Processing Letters, 97(5):203–207, March 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Lin:2008:EGM
[LW08] Hwei-Jen Lin and Hung-HsuanWu. Efficient geometric measureof music similarity. InformationProcessing Letters, 109(2):116–120, December 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Liu:2009:TAP
[LW09] Wanwei Liu and Ji Wang. Atighter analysis of Piterman’sBuchi determinization. Informa-tion Processing Letters, 109(16):941–945, July 31, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Lu:2001:DAT
[LWC01] Erl-Huei Lu, Shao-Wei Wu, andYi-Chang Cheng. A decod-ing algorithm for triple-error-correcting binary BCH codes.Information Processing Letters,80(6):299–303, December 31,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119
REFERENCES 228
(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/37/31/abstract.html.
Lingas:2007:NCM
[LWZ07] Andrzej Lingas, Agnieszka Wa-sylewicz, and Pawe l Zylinski.Note on covering monotone or-thogonal polygons with star-shaped polygons. InformationProcessing Letters, 104(6):220–227, December 16, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).See corrigendum [LPWZ14].
Lin:2002:TST
[LX02] Guohui Lin and Guoliang Xue.On the terminal Steiner treeproblem. Information Process-ing Letters, 84(2):103–107, Oc-tober 31, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Lee:2000:LSM
[LY00] Keon-Jik Lee and Kee-YoungYoo. Linear systolic multi-plier/squarer for fast exponen-tiation. Information Process-ing Letters, 76(3):105–111, De-cember 15, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/27/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/27/26/article.
pdf.
Lin:2007:BMC
[LY07] Cho-Chin Lin and Hao-Yun Yin.Bounds on the multi-clients in-cremental computing for homo-geneous decreasing computationsequences. Information Process-ing Letters, 102(1):35–40, April15, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
[LYP02] Oukseh Lee, Kwangkeun Yi,and Yunheung Paek. A proofmethod for the correctness ofmodularized 0CFA. InformationProcessing Letters, 81(4):179–185, February 28, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/35/
28/abstract.html.
Lange:2004:FLI
[LZ04] Steffen Lange and Sandra Zilles.Formal language identification:query learning vs. Gold-stylelearning. Information Pro-cessing Letters, 91(6):285–292,September 2004. CODEN IF-
[LZ09] Edo Liberty and Steven W.Zucker. The Mailman algorithm:A note on matrix–vector mul-tiplication. Information Pro-cessing Letters, 109(3):179–182,January 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Laoutaris:2004:JOP
[LZS04] Nikolaos Laoutaris, VassiliosZissimopoulos, and IoannisStavrakakis. Joint object place-ment and node dimensioningfor Internet content distribution.Information Processing Letters,89(6):273–279, March 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Moffat:2006:BCL
[MA06] Alistair Moffat and Vo NgocAnh. Binary codes for locallyhomogeneous sequences. In-formation Processing Letters,99(5):175–180, September 15,2006. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Maass:2007:CSL
[Maa07] Moritz G. Maaß. Computingsuffix links for suffix trees andarrays. Information ProcessingLetters, 101(6):250–254, March31, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Min:2003:EES
[MAC03] Jun-Ki Min, Jae-Yong Ahn, andChin-Wan Chung. Efficient ex-traction of schemas for XMLdocuments. Information Pro-cessing Letters, 85(1):7–12, Jan-uary 16, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Madey:2003:WPP
[Mad03] Jan Madey. WMT—-from a per-sonal perspective. InformationProcessing Letters, 88(1–2):3–6,October 17, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Madry:2005:DEC
[Mad05] Aleksander Madry. Data ex-change: On the complexityof answering queries with in-equalities. Information Process-ing Letters, 94(6):253–257, June30, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Madsen:2006:AES
[Mad06] Bolette Ammitzbøll Madsen. Analgorithm for Exact Satisfiabil-ity analysed with the number ofclauses as parameter. Informa-tion Processing Letters, 97(1):28–30, January 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[Mai02] Subhamoy Maitra. Highly non-linear balanced Boolean func-tions with good local and globalavalanche characteristics. In-formation Processing Letters,83(5):281–286, September 15,2002. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Maibaum:2003:WEG
[Mai03] Tom Maibaum. On what ex-actly goes on when software isdeveloped step-by-step, II: Thesequel. Information ProcessingLetters, 88(1–2):45–51, October17, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Makinen:2000:ILS
[Mak00] Erkki Makinen. On inferring lin-ear single-tree languages. Infor-mation Processing Letters, 73(1–2):1–3, January 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/25/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/25/25/article.
pdf.
Mitra:2004:ASS
[MAK04] Pradipta Prometheus Mitra,Muhammad Arshad Ul Abedin,
and Md. Abul Kashem. Algo-rithms for solving the symmetrynumber problem on trees. In-formation Processing Letters, 91(4):163–169, August 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Minetti:2008:SSR
[MAL08] Gabriela Minetti, Enrique Alba,and Gabriel Luque. Seed-ing strategies and recombina-tion operators for solving theDNA fragment assembly prob-lem. Information ProcessingLetters, 108(3):94–100, October16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Manthey:2005:NAW
[Man05] Bodo Manthey. Non-approximabilityof weighted multiple sequencealignment for arbitrary metrics.Information Processing Letters,95(3):389–395, August 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Martin:2001:TEC
[Mar01] Alain J. Martin. Towardsan energy complexity of com-putation. Information Pro-cessing Letters, 77(2–4):181–187, February 28, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
42/abstract.html; http:
//www.elsevier.nl/gej-ng/
REFERENCES 231
10/23/20/68/29/42/article.
pdf.
Martel:2002:ECP
[Mar02] Chip Martel. The expected com-plexity of Prim’s minimum span-ning tree algorithm. InformationProcessing Letters, 81(4):197–201, February 28, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/35/
31/abstract.html.
Marx:2004:LEM
[Mar04] Daniel Marx. List edge multicol-oring in graphs with few cycles.Information Processing Letters,89(2):85–90, January 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Martin:2008:PNR
[Mar08] Alvar Ibeas Martın. On the pe-riod of the Naor–Reingold se-quence. Information ProcessingLetters, 108(5):304–307, Novem-ber 15, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Masopust:2008:DCM
[Mas08] Tomas Masopust. Descrip-tional complexity of multi-parallel grammars. InformationProcessing Letters, 108(2):68–70, September 30, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Mayordomo:2002:KCC
[May02] Elvira Mayordomo. A Kol-mogorov complexity characteri-zation of constructive Hausdorffdimension. Information Process-ing Letters, 84(1):1–3, October16, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Majumder:2008:DDP
[MB08] Subhashis Majumder and Bhar-gab B. Bhattacharya. On thedensity and discrepancy of a2D point set with applicationsto thermal analysis of VLSIchips. Information ProcessingLetters, 107(5):177–182, August16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Malpani:2002:NPC
[MC02a] Navneet Malpani and JianerChen. A note on practicalconstruction of maximum band-width paths. Information Pro-cessing Letters, 83(3):175–180,August 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Mukherjee:2002:PTO
[MC02b] Maharaj Mukherjee and KanadChakraborty. A polynomial-time optimization algorithm fora rectilinear partitioning prob-lem with applications in VLSIdesign automation. InformationProcessing Letters, 83(1):41–48,July 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 232
Misiolek:2006:TFN
[MC06] Ewa Misio lek and Danny Z.Chen. Two flow network sim-plification algorithms. Informa-tion Processing Letters, 97(5):197–202, March 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
McCartin:2001:IAJ
[McC01] Catherine McCartin. An im-proved algorithm for the jumpnumber problem. Informa-tion Processing Letters, 79(2):87–92, June 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/31/
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/31/30/article.
pdf.
McIlroy:2001:MS
[McI01] M. Douglas McIlroy. The mu-sic of streams. InformationProcessing Letters, 77(2–4):189–195, February 28, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
43/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/43/article.
pdf.
Mukhopadhyay:2006:AFS
[MCL06] Asish Mukhopadhyay, SamidhChatterjee, and Benjamin Lafre-niere. On the All-Farthest-Segments problem for a planar
set of points. Information Pro-cessing Letters, 100(3):120–123,November 15, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Moreno:2009:TDU
[MCS+09] A. Moreno, E. Cesar, J. Sor-ribes, T. Margalef, and E. Luque.Task distribution using factor-ing load balancing in Master–Worker applications. Informa-tion Processing Letters, 109(16):902–906, July 31, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
McKellar:2000:RRM
[MD00] Steven McKellar and RobertDavis. Redundancy removal inmulticast protocols. Informa-tion Processing Letters, 73(5–6):169–173, March 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/28/
29/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/28/29/article.
pdf.
Montagne:2004:OSF
[ME04] Eurıpides Montagne and AnandEkambaram. An optimal storageformat for sparse matrices. In-formation Processing Letters, 90(2):87–92, April 30, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 233
Meer:2007:SAV
[Mee07] Klaus Meer. Simulated Anneal-ing versus Metropolis for a TSPinstance. Information Process-ing Letters, 104(6):216–219, De-cember 16, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[MG01] Clare Martin and Jeremy Gib-bons. On the semantics ofnested datatypes. InformationProcessing Letters, 80(5):233–238, December 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/84/36/
29/abstract.html.
Mosko:2006:FIW
[MGLA06] Marc Mosko and J. J. Garcia-Luna-Aceves. Fraction interpo-lation walking a Farey tree. In-formation Processing Letters, 98(1):19–23, April 15, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Ma:2009:SPH
[MH09] Daegun Ma and Jin Hong. Suc-cess probability of the Hell-man trade-off. Information Pro-cessing Letters, 109(7):347–351,March 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Mehedy:2007:IDB
[MHK07] Lenin Mehedy, M. Kam-rul Hasan, and MohammadKaykobad. An improved degreebased condition for Hamiltoniancycles. Information ProcessingLetters, 102(2–3):108–112, April30, 2007. CODEN IFPLAT.
REFERENCES 234
ISSN 0020-0190 (print), 1872-6119 (electronic).
Miao:2003:CCR
[Mia03] Ying Miao. A combinato-rial characterization of regu-lar anonymous perfect thresh-old schemes. Information Pro-cessing Letters, 85(3):131–135,February 14, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Miettinen:2008:PNP
[Mie08] Pauli Miettinen. On thePositive–Negative Partial SetCover problem. InformationProcessing Letters, 108(4):219–221, October 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Millen:2003:FD
[Mil03] Jonathan Millen. On the free-dom of decryption. Informa-tion Processing Letters, 86(6):329–333, June 30, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Minsker:2005:LTA
[Min05] Steven Minsker. The Little Tow-ers of Antwerpen problem. In-formation Processing Letters, 94(5):197–201, June 15, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Minkevicius:2007:IOC
[Min07a] Saulius Minkevicius. The impactof overload conditions on com-puter network reliability. Infor-mation Processing Letters, 104
(1):32–35, September 30, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Minnameier:2007:LGD
[Min07b] Christoph Minnameier. Localand global deadlock-detectionin component-based systems areNP-hard. Information Pro-cessing Letters, 103(3):105–111,July 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Misra:2001:WSP
[Mis01] Jayadev Misra. A walk overthe shortest path: Dijkstra’s Al-gorithm viewed as fixed-pointcomputation. Information Pro-cessing Letters, 77(2–4):197–200, February 28, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[MK02] A. Meduna and D. Kolar. Ho-mogeneous grammars with a re-duced number of non-context-free productions. InformationProcessing Letters, 81(5):253–257, March 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/36/
30/abstract.html.
Michiels:2003:CMM
[MK03] Wil Michiels and Jan Korst.Complexity of min–max sub-sequence problems. Informa-tion Processing Letters, 87(4):213–217, August 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Min:2005:PBN
[MK05] Kyung-Sub Min and Hyoung-Joo Kim. A path-based node fil-tering method for efficient struc-tural joins. Information Pro-cessing Letters, 95(5):480–486,September 15, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Mukhopadhyay:2008:ISP
[MKGB08] Asish Mukhopadhyay, ChanchalKumar, Eugene Greene, and Bi-nay Bhattacharya. On intersect-
ing a set of parallel line segmentswith a convex polygon of mini-mum area. Information Process-ing Letters, 105(2):58–64, Jan-uary 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ma:2009:CEE
[ML09] Meijie Ma and Baodong Liu. Cy-cles embedding in exchanged hy-percubes. Information Process-ing Letters, 110(2):71–76, De-cember 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ma:2008:SCA
[MLX08] Meijie Ma, Guizhen Liu, andJun-Ming Xu. The super con-nectivity of augmented cubes.Information Processing Letters,106(2):59–63, April 15, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). See note [MTXL09].
Manolios:2001:DMC
[MM01] Panagiotis Manolios and J. StrotherMoore. On the desirabilityof mechanizing calculationalproofs. Information Process-ing Letters, 77(2–4):173–179,February 28, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
41/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/41/article.
pdf.
REFERENCES 236
McIver:2005:EPH
[MM05] Annabelle McIver and CarrollMorgan. An elementary proofthat Herman’s Ring is Θ(N2).Information Processing Letters,94(2):79–84, April 30, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Manea:2007:ANP
[MM07a] Florin Manea and Victor Mi-trana. All NP-problems canbe solved in polynomial timeby accepting hybrid networks ofevolutionary processors of con-stant size. Information Pro-cessing Letters, 103(3):112–118,July 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Masopust:2007:DCS
[MM07b] Tomas Masopust and AlexanderMeduna. Descriptional complex-ity of semi-conditional gram-mars. Information ProcessingLetters, 104(1):29–31, Septem-ber 30, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Massart:2008:CPO
[MMV08] Thierry Massart, Cedric Meuter,and Laurent Van Begin. Onthe complexity of partial ordertrace model checking. Informa-tion Processing Letters, 106(3):120–126, April 30, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Maass:2005:NMA
[MN05] Moritz G. Maaß and JohannesNowak. A new method for ap-proximate indexing and dictio-nary lookup with one error. In-formation Processing Letters, 96(5):185–191, December 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Mahajan:2008:RSE
[MN08] Meena Mahajan and JayalalSarma M. N. Rigidity of asimple extended lower triangu-lar matrix. Information Pro-cessing Letters, 107(5):149–153,August 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Maity:2004:CCF
[MNR04] Soumen Maity, Amiya Nayak,and Bimal K. Roy. Character-ization of catastrophic faults intwo-dimensional reconfigurablesystolic arrays with unidirec-tional links. Information Pro-cessing Letters, 92(4):189–197,November 30, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Meijer:2009:ACS
[MNRR09] Henk Meijer, Yurai Nunez-Rodrıguez, and David Rappa-port. An algorithm for comput-ing simple k-factors. Informa-tion Processing Letters, 109(12):620–625, May 31, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 237
Mosheiov:2006:SMS
[MO06] Gur Mosheiov and Daniel Oron.Single machine scheduling withbatch-dependent setup times.Information Processing Letters,98(2):73–78, April 30, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Monnot:2001:MFD
[Mon01] Jerome Monnot. The maximumf-depth spanning tree problem.Information Processing Letters,80(4):179–187, November 30,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/34/28/abstract.html.
Monnot:2002:DAR
[Mon02] Jerome Monnot. Differentialapproximation results for thetraveling salesman and relatedproblems. Information Process-ing Letters, 82(5):229–235, June15, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Monnot:2005:LPM
[Mon05] Jerome Monnot. The labeledperfect matching in bipartitegraphs. Information ProcessingLetters, 96(3):81–88, November15, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Montassier:2006:NCS
[Mon06] Mickael Montassier. A note onthe not 3-choosability of some
families of planar graphs. In-formation Processing Letters, 99(2):68–71, July 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Montoya:2008:PCP
[Mon08] J. Andres Montoya. The pa-rameterized complexity of prob-ability amplification. Informa-tion Processing Letters, 109(1):46–53, December 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Moreno:2005:BSB
[Mor05] Eduardo Moreno. De Bruijn se-quences and De Bruijn graphsfor a general language. Infor-mation Processing Letters, 96(6):214–219, December 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Morosan:2006:NBS
[Mor06] Calin D. Morosan. On the num-ber of broadcast schemes in net-works. Information ProcessingLetters, 100(5):188–193, Decem-ber 16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Muller-Olm:2004:CPP
[MOS04] Markus Muller-Olm and HelmutSeidl. Computing polynomialprogram invariants. Informa-tion Processing Letters, 91(5):233–244, September 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 238
Moser:2008:RBM
[Mos08a] Philippe Moser. Resource-bounded measure on probabilis-tic classes. Information Pro-cessing Letters, 106(6):241–245,June 15, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Moss:2008:CM
[Mos08b] Lawrence S. Moss. Confusion ofmemory. Information ProcessingLetters, 107(3–4):114–119, July31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Mitsuhashi:2006:RRD
[MOY06] Ichiro Mitsuhashi, Michio Oya-maguchi, and Toshiyuki Ya-mada. The reachability andrelated decision problems formonadic and semi-constructorTRSs. Information Process-ing Letters, 98(6):219–224, June30, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Moura:2002:NVA
[MP02] Arnaldo V. Moura and Guil-herme A. Pinto. A note on theverification of automata specifi-cations of probabilistic real-timesystems. Information Process-ing Letters, 82(5):223–228, June15, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Melancon:2004:GCA
[MP04] Guy Melancon and FabricePhilippe. Generating connected
[MP08a] Claire Mathieu and Charalam-pos Papamanthou. Distortionlower bounds for line embed-dings. Information ProcessingLetters, 108(4):175–178, Octo-ber 31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Mitchell:2008:MPE
[MP08b] Joseph S. B. Mitchell andValentin Polishchuk. Minimum-perimeter enclosures. Informa-tion Processing Letters, 107(3–4):120–124, July 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Majewski:2009:AET
[MP09] Krzysztof Majewski and NicholasPippenger. Attribute estimationand testing quasi-symmetry. In-formation Processing Letters,109(4):233–237, January 31,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Mehlhorn:2002:APS
[MPSS02] Kurt Mehlhorn, Volker Priebe,Guido Schafer, and NaveenSivadasan. All-pairs shortest-paths computation in the pres-ence of negative cycles. Infor-mation Processing Letters, 81
[MR01a] Wendy Myrvold and FrankRuskey. Ranking and unrank-ing permutations in linear time.Information Processing Letters,79(6):281–284, September 30,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/80/37/31/abstract.html.
Myrvold:2001:RUPb
[MR01b] Wendy Myrvold and FrankRuskey. Ranking and unrank-ing permutations in linear time.Information Processing Letters,79(6):281–284, September 30,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/80/37/31/abstract.html.
Montassier:2006:NFC
[MR06] Mickael Montassier and AndreRaspaud. A note on 2-facialcoloring of plane graphs. In-formation Processing Letters, 98(6):235–241, June 30, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Mohamed:2008:LEP
[MR08] Adnan Mohamed and R. S. Ra-makrishna. Linear election in
[MR09a] Daniel Marx and Igor Razgon.Constant ratio fixed-parameterapproximation of the edge mul-ticut problem. Information Pro-cessing Letters, 109(20):1161–1166, September 30, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Massberg:2009:BTC
[MR09b] Jens Maßberg and Dieter Raut-enbach. Binary trees with choos-able edge lengths. Informa-tion Processing Letters, 109(18):1087–1092, August 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Mousavi:2005:SCF
[MRG05] MohammadReza Mousavi, MichelReniers, and Jan Friso Groote.A syntactic commutativity for-mat for SOS. Information Pro-cessing Letters, 93(5):217–223,March 16, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Maity:2002:ECF
[MRN02] Soumen Maity, Bimal K. Roy,and Amiya Nayak. On enu-meration of catastrophic faultpatterns. Information Pro-cessing Letters, 81(4):209–212,February 28, 2002. CODEN
[MRS03] S. Mantaci, A. Restivo, andM. Sciortino. Burrows–Wheelertransform and Sturmian words.Information Processing Letters,86(5):241–246, June 15, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Morig:2009:LBC
[MRST09] Marc Morig, Dieter Rautenbach,Michiel Smid, and Jan Tusch.An Ω(n logn) lower bound forcomputing the sum of even-ranked elements. InformationProcessing Letters, 109(16):955–956, July 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Mostefaoui:2000:BCM
[MRT00] Achour Mostefaoui, Michel Ray-nal, and Frederic Tronel. FromBinary Consensus to Multi-valued Consensus in asyn-chronous message-passing sys-tems. Information Process-ing Letters, 73(5–6):207–212,March 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[MS03] Olivier Markowitch and ShahrokhSaeednia. Cryptanalysis of theWu–Varadhrajan fair exchangeprotocol. Information Process-ing Letters, 87(3):169–171, Au-gust 16, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Markey:2004:PCM
[MS04] N. Markey and Ph. Schnoebe-len. A PTIME-complete match-ing problem for SLP-compressedwords. Information Process-ing Letters, 90(1):3–6, April15, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Markey:2006:MCP
[MS06] Nicolas Markey and PhilippeSchnoebelen. Mu-calculus pathchecking. Information Pro-cessing Letters, 97(6):225–230,March 31, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[MSS09] Takaaki Mizuki, Takuya Sato,and Hideaki Sone. A one-round secure message broadcast-ing protocol through a key shar-ing tree. Information ProcessingLetters, 109(15):842–845, July16, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Massuthe:2008:CFP
[MSSW08] Peter Massuthe, AlexanderSerebrenik, Natalia Sidorova,and Karsten Wolf. Can I finda partner? Undecidability ofpartner existence for open nets.Information Processing Letters,108(6):374–378, November 30,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Maggiolo-Schettini:2002:DLT
[MST02] Andrea Maggiolo-Schettini andSimone Tini. On disjunction ofliterals in triggers of statechartstransitions. Information Pro-cessing Letters, 84(6):305–310,December 31, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[MTXL09] Meijie Ma, Xuegong Tan, Jun-Ming Xu, and Guizhen Liu. Anote on “The super connectivityof augmented cubes”. Informa-tion Processing Letters, 109(12):592–593, May 31, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).See [MLX08].
Monroy:2005:GTT
[MU05] Ruy Fabila Monroy and J. Urru-tia. Graham triangulations and
REFERENCES 242
triangulations with a center areHamiltonian. Information Pro-cessing Letters, 93(6):295–299,March 31, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Mulzer:2009:NPS
[Mul09] Wolfgang Mulzer. A note on pre-decessor searching in the pointermachine model. InformationProcessing Letters, 109(13):726–729, June 15, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Mamut:2008:VVP
[MV08] Aygul Mamut and Elkin Vumar.Vertex vulnerability parametersof Kronecker products of com-plete graphs. Information Pro-cessing Letters, 106(6):258–262,June 15, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Martin-Vide:2001:SUP
[MVM01] Carlos Martın-Vide and Vic-tor Mitrana. Some unde-cidable problems for parallelcommunicating finite automatasystems. Information Pro-cessing Letters, 77(5–6):239–245, March 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/32/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/32/27/article.
pdf.
Martin-Vide:2007:RAM
[MVM07] Carlos Martın-Vide and VictorMitrana. Remarks on arbitrarymultiple pattern interpretations.Information Processing Letters,101(5):209–214, March 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Meidl:2003:LCP
[MW03] Wilfried Meidl and Arne Win-terhof. On the linear complexityprofile of explicit nonlinear pseu-dorandom numbers. Informa-tion Processing Letters, 85(1):13–18, January 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Min:2006:DCN
[MW06] Chen Min and Wang Weifan.The 2-dipath chromatic numberof Halin graphs. InformationProcessing Letters, 99(2):47–53,July 31, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ma:2009:SOD
[MY09] Bin Ma and Hongyi Yao. Seedoptimization for i.i.d. similari-ties is no easier than optimalGolomb ruler design. Informa-tion Processing Letters, 109(19):1120–1124, September 15, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Mandoiu:2000:NMH
[MZ00] Ion I. Mandoiu and Alexan-der Z. Zelikovsky. A note
REFERENCES 243
on the MST heuristic forbounded edge-length Steinertrees with minimum numberof Steiner points. InformationProcessing Letters, 75(4):165–167, September 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/29/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/29/28/article.
pdf.
Nagamochi:2005:CMC
[Nag05a] Hiroshi Nagamochi. On comput-ing minimum (s, t)-cuts in di-graphs. Information ProcessingLetters, 93(5):231–237, March16, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Nagy:2005:LES
[Nag05b] Benedek Nagy. On the languageequivalence of NE star-patterns.Information Processing Letters,95(3):396–400, August 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[Nau01] David A. Naumann. Calcu-lating sharp adaptation rules.Information Processing Let-ters, 77(2–4):201–208, Febru-ary 28, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
45/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/45/article.
pdf.
Navarro:2005:NBA
[NB05] Gonzalo Navarro and NievesBrisaboa. New bounds on D-aryoptimal codes. Information Pro-cessing Letters, 96(5):178–184,December 16, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Narayanaswamy:2007:NHN
[NBCS07] N. S. Narayanaswamy, N. Bel-kale, L. S. Chandran, andN. Sivadasan. A note on theHadwiger number of circular arcgraphs. Information ProcessingLetters, 104(1):10–13, Septem-ber 30, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Noore:2005:MRL
[NC05] A. Noore and P. L. Cross.Modeling the reliability oflarge dynamic distributed non-homogeneous networks. Infor-mation Processing Letters, 93(2):57–61, January 31, 2005.
[NCBJ02] C. T. Ng, T. C. E. Cheng,A. Bachman, and A. Janiak.Three scheduling problems withdeteriorating jobs to minimizethe total completion time. In-formation Processing Letters, 81(6):327–333, March 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/37/33/abstract.html.
Ng:2002:SNH
[NCY02] C. T. Ng, T. C. E. Cheng,and J. J. Yuan. Strong NP-hardness of the single machinemulti-operation jobs total com-pletion time scheduling problem.Information Processing Letters,82(4):187–191, May 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Ngo:2002:NBH
[NDG02] Hung Quang Ngo, Ding-Zhu Du,and Ronald L. Graham. Newbounds on a hypercube coloringproblem. Information Process-ing Letters, 84(5):265–269, De-cember 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Nebel:2007:LGC
[Neb07] Markus E. Nebel. On the lex-icographical generation of com-
[NEK03] Richard Nock, Tapio Elomaa,and Matti Kaariainen. ReducedError Pruning of branching pro-grams cannot be approximatedto within a logarithmic factor.Information Processing Letters,87(2):73–78, July 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Nguyen:2005:CHR
[NG05] Linh Anh Nguyen and RajeevGore. Completeness of hyper-resolution via the semantics ofdisjunctive logic programs. In-formation Processing Letters, 95(2):363–369, July 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Nagy-Gyorgy:2008:OHC
[NGI08] J. Nagy-Gyorgy and Cs. Im-reh. Online hypergraph col-oring. Information ProcessingLetters, 109(1):23–26, December16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Nagamochi:2001:MCS
[NII01] Hiroshi Nagamochi, ToshimasaIshii, and Hiro Ito. Mini-mum cost source location prob-lem with vertex-connectivity re-quirements in digraphs. Infor-mation Processing Letters, 80
[Nik00] Stavros D. Nikolopoulos. Rec-ognizing cographs and thresh-old graphs through a classifica-tion of their edges. Informa-tion Processing Letters, 74(3–4):129–139, May 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/63/27/
31/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/63/27/31/article.
pdf.
Nikolik:2006:TSO
[Nik06] Borislav Nikolik. Test suite os-cillations. Information Process-ing Letters, 98(2):47–55, April30, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Nivasch:2004:CDU
[Niv04] Gabriel Nivasch. Cycle detec-tion using a stack. Informa-tion Processing Letters, 90(3):135–140, May 16, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Nagamochi:2007:MCS
[NK07] Hiroshi Nagamochi and YokoKamidoi. Minimum cost subpar-titions in graphs. Information
[NKS09] Joong Chae Na, Dong KyueKim, and Jeong Seop Sim. Find-ing the longest common non-superstring in linear time. In-formation Processing Letters,109(18):1066–1070, August 31,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Na:2009:ILC
[NKSK09] Joong Chae Na, Namhee Kim,Jeong Seop Sim, and Dong KyueKim. Improving on-line con-struction of two-dimensionalsuffix trees for square matrices.Information Processing Letters,109(10):504–508, April 30, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Nielsen:2005:FDS
[NN05] Frank Nielsen and RichardNock. A fast deterministicsmallest enclosing disk approx-imation algorithm. Informa-tion Processing Letters, 93(6):263–268, March 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Nielsen:2008:SEI
[NN08] Frank Nielsen and RichardNock. On the smallest enclos-ing information disk. Informa-tion Processing Letters, 105(3):
REFERENCES 246
93–97, January 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Nielson:2007:WFN
[NNP07] Flemming Nielson, Hanne RiisNielson, and Henrik Pilegaard.What is a free name in a pro-cess algebra? Information Pro-cessing Letters, 103(5):188–194,August 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Nikolopoulos:2004:LCN
[NNR04] S. D. Nikolopoulos, C. Nomikos,and P. Rondogiannis. A limitcharacterization for the numberof spanning trees of graphs. In-formation Processing Letters, 90(6):307–313, June 30, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Nielson:2001:KLE
[NNS01] Flemming Nielson, Hanne RiisNielson, and Mooly Sagiv.Kleene’s logic with equality. In-formation Processing Letters, 80(3):131–137, November 15, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/35/29/abstract.html.
Nagamochi:2007:AMR
[NO07] Hiroshi Nagamochi and KoheiOkada. Approximating theminmax rooted-tree cover in atree. Information ProcessingLetters, 104(5):173–178, Novem-ber 30, 2007. CODEN IFPLAT.
ISSN 0020-0190 (print), 1872-6119 (electronic).
Novotny:2009:MRR
[NON09] Sarah Novotny, Juan Ortiz, andDarren A. Narayan. Minimalk-rankings and the rank num-ber of P 2
n . Information Pro-cessing Letters, 109(3):193–198,January 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Nordstrom:2009:SWP
[Nor09] Jakob Nordstrom. A simplifiedway of proving trade-off resultsfor resolution. Information Pro-cessing Letters, 109(18):1030–1035, August 31, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Nikolopoulos:2000:PFF
[NP00] Stavros D. Nikolopoulos andCharis Papadopoulos. On theperformance of the first-fit col-oring algorithm on permuta-tion graphs. Information Pro-cessing Letters, 75(6):265–273,November 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/31/
29/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/31/29/article.
pdf.
Namneh:2007:FSF
[NP07] Rami Al Na’mneh and W. DavidPan. Five-step FFT algo-rithm with reduced computa-
[NPW01] Enrico Nardelli, Guido Proietti,and Peter Widmayer. A fastercomputation of the most vitaledge of a shortest path. In-formation Processing Letters, 79(2):81–85, June 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[NR08] Zeev Nutov and Daniel Reich-man. Approximating maximumsatisfiable subsystems of linearequations of bounded width.Information Processing Letters,106(5):203–207, May 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Nayak:2000:ITS
[NRS00] A. Nayak, J. Ren, and N. San-toro. An improved testingscheme for catastrophic faultpatterns. Information Pro-cessing Letters, 73(5–6):199–206, March 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/28/
33/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/28/33/article.
pdf.
Nomikos:2009:SEL
[NRW09] Christos Nomikos, Panos Ron-dogiannis, and William W.Wadge. Strong equivalenceof logic programs under theinfinite-valued semantics. Infor-mation Processing Letters, 109(11):576–581, May 16, 2009.
[NS02] Edwin Naroska and Uwe Schwiegelshohn.On an on-line scheduling prob-lem for parallel jobs. Informa-tion Processing Letters, 81(6):297–304, March 31, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/37/
28/abstract.html.
Nagamochi:2004:SRM
[NSI04] Hiroshi Nagamochi, TakahisaSuzuki, and Toshimasa Ishii. Asimple recognition of maximalplanar graphs. Information Pro-cessing Letters, 89(5):223–226,March 16, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Narayanan:2006:PRM
[NSR06] Arvind Narayanan, K. Sri-nathan, and C. Pandu Ran-gan. Perfectly Reliable Mes-sage Transmission. Informa-tion Processing Letters, 100(1):23–28, October 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Neumann:2002:CWA
[NSW02a] Jakub Neumann, Andrzej Szepi-etowski, and Igor Walukiewicz.Complexity of weak acceptanceconditions in tree automata. In-formation Processing Letters, 84(4):181–187, November 30, 2002.
[NSW02b] John Noga, Steve Seiden, andGerhard J. Woeginger. A fasteroff-line algorithm for the TCPacknowledgement problem. In-formation Processing Letters, 81(2):71–73, January 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/33/29/abstract.html.
Ng:2000:SDA
[NSZ00] Joseph Kee-Yin Ng, ShibinSong, and Wei Zhao. Sta-tistical delay analysis on anATM switch with self-similar in-put traffic. Information Pro-cessing Letters, 74(3–4):163–173, May 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/63/27/
35/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/63/27/35/article.
pdf.
Niehren:2000:RCC
[NTT00] Joachim Niehren, Sophie Ti-son, and Ralf Treinen. Onrewrite constraints and con-text unification. Informa-tion Processing Letters, 74(1–2):35–40, April 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 249
URL http://www.elsevier.
nl/gej-ng/10/23/20/63/25/
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/25/30/article.
pdf.
Nunes:2004:MRE
[Nun04] I. Nunes. Method redefinition—ensuring alternative behaviors.Information Processing Letters,92(6):279–285, December 31,2004. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Nutov:2009:NRS
[Nut09] Zeev Nutov. A note on RootedSurvivable Networks. Informa-tion Processing Letters, 109(19):1114–1119, September 15, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Nielsen:2002:LSP
[NWZ02] Benny K. Nielsen, Pawel Win-ter, and Martin Zachariasen. Onthe location of Steiner pointsin uniformly-oriented Steinertrees. Information ProcessingLetters, 83(5):237–241, Septem-ber 15, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Nagamochi:2004:CEC
[NY04a] Hiroshi Nagamochi and NobuyasuYamada. Counting edge cross-ings in a 2-layered drawing. In-formation Processing Letters, 91(5):221–225, September 2004.
[OB03] Michael Okun and AmnonBarak. A new approach for ap-proximating node deletion prob-lems. Information ProcessingLetters, 88(5):231–236, Decem-ber 16, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Ostrovsky-Berman:2005:TMR
[OB05] Yaron Ostrovsky-Berman. Thetransportation metric and re-lated problems. InformationProcessing Letters, 95(4):461–465, August 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[OPR07] Nenad Obradovic, Joseph Pe-ters, and Goran Ruzic. Efficientdomination in circulant graphswith two chord lengths. Infor-mation Processing Letters, 102(6):253–258, June 15, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
ODwyer:2005:SNN
[OR05] Carl O’Dwyer and DanielRichardson. Spiking neural netswith symbolic internal state.Information Processing Letters,95(6):529–536, September 30,2005. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Orlov:2009:ORN
[Orl09] Michael Orlov. Optimized ran-dom number generation in an in-terval. Information ProcessingLetters, 109(13):722–725, June15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Ogryczak:2003:MSL
[OT03] Wlodzimierz Ogryczak and ArieTamir. Minimizing the sum ofthe k largest functions in linear
[Pad05] Sahadeo Padhye. Partial knownplaintext attack on Koyamascheme. Information ProcessingLetters, 96(3):96–100, November15, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Paeng:2003:SCU
[Pae03] Seong-Hun Paeng. On the se-curity of cryptosystem using au-tomorphism groups. Informa-tion Processing Letters, 88(6):293–298, December 31, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Pallo:2000:EUB
[Pal00] Jean Pallo. An efficient up-per bound of the rotation dis-tance of binary trees. Informa-tion Processing Letters, 73(3–4):87–92, February 29, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/62/27/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/62/27/26/article.
pdf.
Pallo:2003:GBT
[Pal03a] Jean Pallo. Generating bi-nary trees by Glivenko classes
REFERENCES 252
on Tamari lattices. Informa-tion Processing Letters, 85(5):235–238, March 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Pallo:2003:RAR
[Pal03b] Jean Marcel Pallo. Right-armrotation distance between bi-nary trees. Information Process-ing Letters, 87(4):173–177, Au-gust 31, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Pallo:2009:WAR
[Pal09] Jean Marcel Pallo. Weak asso-ciativity and restricted rotation.Information Processing Letters,109(10):514–517, April 30, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Pandurangan:2005:SRA
[Pan05] Gopal Pandurangan. On a sim-ple randomized algorithm forfinding a 2-factor in sparsegraphs. Information Process-ing Letters, 95(1):321–327, July16, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Papakonstantinou:2009:NWP
[Pap09] Periklis A. Papakonstantinou.A note on width-parameterizedSAT: An exact machine-modelcharacterization. InformationProcessing Letters, 110(1):8–12,December 1, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Parnas:2003:SPM
[Par03] David Lorge Parnas. Structuredprogramming: A minor part ofsoftware engineering. Informa-tion Processing Letters, 88(1–2):53–58, October 17, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Parhami:2005:HSO
[Par05] Behrooz Parhami. The Hamil-tonicity of swapped (OTIS) net-works built of Hamiltonian com-ponent networks. InformationProcessing Letters, 95(4):441–445, August 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Parhami:2008:ISB
[Par08] Behrooz Parhami. On isomor-phisms and similarities betweengeneralized Petersen networksand periodically regular chordalrings. Information ProcessingLetters, 107(6):246–251, August31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Park:2011:CGR
[Par11] Moonju Park. Comments on“Generalized rate monotonicschedulability bounds using rel-ative period ratios”. Informa-tion Processing Letters, 111(7):334–337, March 1, 2011. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).See [WLLS08].
REFERENCES 253
Patthak:2002:QCT
[PBD+02] A. C. Patthak, I. Bhattacharya,A. Dasgupta, Pallab Dasgupta,and P. P. Chakrabarti. Quan-tified Computation Tree Logic.Information Processing Letters,82(3):123–129, May 16, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/86/34/28/abstract.html.
Park:2000:CEM
[PC00] Ho-Hyun Park and Chin-WanChung. Complexity of esti-mating multi-way join resultsizes for area skewed spatialdata. Information Process-ing Letters, 76(3):121–129, De-cember 15, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/27/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/27/28/article.
pdf.
Park:2004:HPC
[PC04] Chong-Dae Park and Kyung-Yong Chwa. Hamiltonian prop-erties on the class of hypercube-like networks. InformationProcessing Letters, 91(1):11–17,July 16, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Pan:2005:IPN
[PC05a] Jun-Jie Pan and Gerard J.Chang. Isometric-path num-
bers of block graphs. Informa-tion Processing Letters, 93(2):99–102, January 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Punnen:2005:BM
[PC05b] Abraham P. Punnen and OlenaChapovska. The bottleneck k-MST. Information ProcessingLetters, 95(5):512–517, Septem-ber 15, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Petkovic:2004:MFS
[PCB04] Tatjana Petkovic, MiroslavCiric, and Stojan Bogdanovic.Minimal forbidden subwords.Information Processing Letters,92(5):211–218, December 16,2004. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Park:2003:ESA
[PCC03] Yongsu Park, Tae-Sun Chung,and Yookun Cho. An efficientstream authentication schemeusing tree chaining. Informa-tion Processing Letters, 86(1):1–8, April 15, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Pai:2008:NIU
[PCW08] Kung-Jui Pai, Jou-Ming Chang,and Yue-Li Wang. A Note on“An improved upper bound onthe queuenumber of the hyper-cube”. Information ProcessingLetters, 108(3):107–109, Octo-ber 16, 2008. CODEN IFPLAT.
REFERENCES 254
ISSN 0020-0190 (print), 1872-6119 (electronic). See [HH07].
Pai:2009:UBQ
[PCW09] Kung-Jui Pai, Jou-Ming Chang,and Yue-Li Wang. Upperbounds on the queuenumber ofk-ary n-cubes. InformationProcessing Letters, 110(2):50–56, December 16, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Panda:2003:LTR
[PD03] B. S. Panda and Sajal K. Das.A linear time recognition algo-rithm for proper interval graphs.Information Processing Letters,87(3):153–161, August 16, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Panda:2009:PAG
[PD09] B. S. Panda and Sajal K.Das. A parallel algorithm forgenerating bicompatible elimi-nation orderings of proper inter-val graphs. Information Process-ing Letters, 109(18):1041–1046,August 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Peczarski:2006:ITC
[Pec06] Marcin Peczarski. An improve-ment of the tree code con-struction. Information Process-ing Letters, 99(3):92–95, August16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Peczarski:2007:FJA
[Pec07] Marcin Peczarski. The Ford–Johnson algorithm still un-beaten for less than 47 ele-ments. Information ProcessingLetters, 101(3):126–128, Febru-ary 14, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Penna:2002:ATT
[Pen02] Paolo Penna. On the approx-imability of two tree drawingconventions. Information Pro-cessing Letters, 82(5):237–242,June 15, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Pestov:2000:GSS
[Pes00] Vladimir Pestov. On the ge-ometry of similarity search: Di-mensionality curse and concen-tration of measure. Informa-tion Processing Letters, 73(1–2):47–51, January 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/25/
33/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/25/33/article.
pdf.
Pessoa:2008:NCE
[Pes08] Artur Alves Pessoa. A noteon the construction of error de-tecting/correcting prefix codes.Information Processing Letters,107(1):34–38, June 30, 2008.CODEN IFPLAT. ISSN 0020-
[PG06] Shailesh Patil and Vijay K.Garg. Adaptive general per-fectly periodic scheduling. In-formation Processing Letters, 98(3):107–114, May 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Petersen:2009:RMR
[PG09] Holger Petersen and SzymonGrabowski. Range mode andrange median queries in con-stant time and sub-quadraticspace. Information ProcessingLetters, 109(4):225–228, Jan-uary 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[PHG08] Kai Puolamaki, Sami Han-hijarvi, and Gemma C. Gar-riga. An approximation ratiofor biclustering. InformationProcessing Letters, 108(2):45–49, September 30, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Park:2001:RTE
[PHK01] Dong-Joo Park, Shin Heu, andHyoung-Joo Kim. The RS-tree:An efficient data structure fordistance browsing queries. In-formation Processing Letters, 80(4):195–203, November 30, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/34/30/abstract.html.
REFERENCES 256
Piotrow:2002:NCB
[Pio02] Marek Piotrow. A note onconstructing binary heaps withperiodic networks. Informa-tion Processing Letters, 83(3):129–134, August 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Podgorelec:2002:EID
[PK02] Vili Podgorelec and Peter Kokol.Evolutionary induced decisiontrees for dangerous softwaremodules prediction. Informa-tion Processing Letters, 82(1):31–38, April 15, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/86/27/
31/abstract.html.
Patkar:2001:NOCa
[PN01a] Sachin B. Patkar and H. Narayanan.A note on optimal coveringaugmentation for graphic poly-matroids. Information Pro-cessing Letters, 79(6):285–290,September 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/80/37/
32/abstract.html.
Patkar:2001:NOCb
[PN01b] Sachin B. Patkar and H. Narayanan.A note on optimal coveringaugmentation for graphic poly-matroids. Information Pro-cessing Letters, 79(6):285–290,September 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190
[Pol03] Jan Poland. Finding smoothmaps is NP-complete. Informa-tion Processing Letters, 85(5):249–253, March 16, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Poland:2004:CTE
[Pol04] Jan Poland. A coding theo-rem for Enumerable Output Ma-chines. Information Process-ing Letters, 91(4):157–161, Au-gust 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Poon:2003:VMS
[Poo03] C. K. Poon. Verifying mini-mum stable circuit values. In-formation Processing Letters, 86(1):27–32, April 15, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Parker:2004:ACB
[PP04] Richard Parker and AndrewPlater. Addition chains with abounded number of registers. In-formation Processing Letters, 90(5):247–252, June 15, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Pelc:2005:BLB
[PP05a] Andrzej Pelc and David Pe-leg. Broadcasting with locally
[PP05b] Andrea Pietracaprina and Gep-pino Pucci. Optimal many-to-one routing on the mesh withconstant queues. InformationProcessing Letters, 96(1):24–29,October 16, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Pinchinat:2005:DCP
[PR05] Sophie Pinchinat and StephaneRiedweg. A decidable classof problems for control underpartial observation. Informa-tion Processing Letters, 95(4):454–460, August 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Premkumar:2000:OUA
[Pre00] A. B. Premkumar. On the op-timal utilization of all availablestates in the 2n moduli set. In-formation Processing Letters, 75(1–2):51–56, July 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/25/
33/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/25/33/article.
pdf.
Pretzel:2002:CSE
[Pre02] Oliver Pretzel. Characterizationof simple edge-firing games. In-formation Processing Letters, 84(5):235–236, December 16, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Procaccia:2008:NQC
[Pro08] Ariel D. Procaccia. A note onthe query complexity of the Con-dorcet winner problem. Infor-mation Processing Letters, 108(6):390–393, November 30, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Priami:2001:ASN
[PRSS01] Corrado Priami, Aviv Regev,Ehud Shapiro, and WilliamSilverman. Application of astochastic name-passing calcu-lus to representation and sim-ulation of molecular processes.Information Processing Letters,80(1):25–31, October 15, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/27/30/abstract.html.
Padro:2002:LBI
[PS02] Carles Padro and German Saez.Lower bounds on the infor-mation rate of secret sharingschemes with homogeneous ac-cess structure. InformationProcessing Letters, 83(6):345–351, September 30, 2002. CO-
REFERENCES 258
DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Pustylnik:2003:MSS
[PS03] Gennady Pustylnik and MichaSharir. The Minkowski sumof a simple polygon and a seg-ment. Information ProcessingLetters, 85(4):179–184, Febru-ary 28, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Perst:2004:MFT
[PS04a] Thomas Perst and Helmut Seidl.Macro forest transducers. In-formation Processing Letters, 89(3):141–149, February 14, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Pettie:2004:SLT
[PS04b] Seth Pettie and Peter Sanders.A simpler linear time 2/3 −ε approximation for maximumweight matching. InformationProcessing Letters, 91(6):271–276, September 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Pinlou:2006:OVA
[PS06] Alexandre Pinlou and EricSopena. Oriented vertex and arccolorings of outerplanar graphs.Information Processing Letters,100(3):97–104, November 15,2006. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Polishchuk:2009:SLA
[PS09] Valentin Polishchuk and JukkaSuomela. A simple local 3-approximation algorithm forvertex cover. Information Pro-cessing Letters, 109(12):642–645, May 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Philippou:2001:HRC
[PSL+01] Anna Philippou, Oleg Sokolsky,Insup Lee, Rance Cleaveland,and Scott A. Smolka. Hidingresources that can fail: An ax-iomatic perspective. Informa-tion Processing Letters, 80(1):3–13, October 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/84/27/
28/abstract.html.
Penn:2000:CMO
[PT00] Michal Penn and Moshe Tennen-holtz. Constrained multi-objectauctions and b-matching. In-formation Processing Letters, 75(1–2):29–34, July 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/25/
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/25/30/article.
pdf.
Peng:2006:TAM
[PT06] Z. S. Peng and H. F. Ting.An O(n log n)-time algorithm
REFERENCES 259
for the maximum constrainedagreement subtree problem forbinary trees. Information Pro-cessing Letters, 100(4):137–144,November 30, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ponse:2001:ERS
[PU01] Alban Ponse and Yaroslav S.Usenko. Equivalence of recursivespecifications in process algebra.Information Processing Letters,80(1):59–65, October 15, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/27/34/abstract.html.
Pudlak:2000:NUD
[Pud00] Pavel Pudlak. A note on theuse of determinant for prov-ing lower bounds on the sizeof linear circuits. Informa-tion Processing Letters, 74(5–6):197–201, June 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/28/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/28/27/article.
pdf.
Pavan:2007:RPC
[PW07] A. Pavan and Fengming Wang.Robustness of PSPACE-completesets. Information ProcessingLetters, 103(3):102–104, July31, 2007. CODEN IFPLAT.
[PZ09] Abraham P. Punnen and Ruo-nan Zhang. Bottleneck flows inunit capacity networks. Infor-mation Processing Letters, 109(6):334–338, February 28, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Qureshi:2001:PAT
[QH01] Kalim Qureshi and MasahikoHatanaka. A practical approachof task scheduling and load bal-ancing on heterogeneous dis-tributed raytracing systems. In-formation Processing Letters, 79(2):65–71, June 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/31/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/31/27/article.
pdf.
Quisquater:2005:SCC
[QPV05] Michael Quisquater, Bart Pre-neel, and Joos Vandewalle.
REFERENCES 260
Spectral characterization ofcryptographic Boolean functionssatisfying the (extended) propa-gation criterion of degree l andorder k. Information Process-ing Letters, 93(1):25–28, Jan-uary 16, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Quaglia:2002:RET
[Qua02] Francesco Quaglia. A restric-tion of the elastic time algo-rithm. Information ProcessingLetters, 83(5):243–249, Septem-ber 15, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Qian:2006:HMP
[QW06] Jianbo Qian and Cao An Wang.How much precision is neededto compare two sums of squareroots of integers? InformationProcessing Letters, 100(5):194–198, December 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Raffinot:2001:MRS
[Raf01] Mathieu Raffinot. On maxi-mal repeats in strings. Infor-mation Processing Letters, 80(3):165–169, November 15, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/35/34/abstract.html.
Rahn:2008:MDI
[Rah08] Mirko Rahn. More decidableinstances of Post’s correspon-
[Ram06] Narad Rampersad. The statecomplexity of L2 and Lk. In-formation Processing Letters, 98(6):231–234, June 30, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Rampersad:2007:CFS
[Ram07] Narad Rampersad. On thecontext-freeness of the set ofwords containing overlaps. In-formation Processing Letters,102(2–3):74–78, April 30, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Rao:2001:RFM
[Rao01] Josyula R. Rao. On therole of formal methods in se-curity. Information Process-ing Letters, 77(2–4):209–212,February 28, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
46/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/46/article.
pdf.
Rao:2002:TST
[Rao02] S. Srinivasa Rao. Time-spacetrade-offs for compressed suffix
[Rau05] Dieter Rautenbach. Lowerbounds on treespan. Informa-tion Processing Letters, 96(2):67–70, October 31, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Ravelomanana:2007:APW
[Rav07] Vlady Ravelomanana. An-other proof of Wright’s inequal-ities. Information ProcessingLetters, 104(1):36–39, Septem-ber 30, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Razgon:2007:APC
[Raz07] Igor Razgon. A 2O(k)poly(n)algorithm for the parameter-ized Convex Recoloring prob-lem. Information ProcessingLetters, 104(2):53–58, October16, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Rastsvetaev:2002:QCF
[RB02] A. L. Rastsvetaev and L. D.Beklemishev. On the query com-plexity of finding a local max-imum point. Information Pro-cessing Letters, 84(6):327–332,December 31, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Roy:2007:ETT
[RB07] Rahul Roy and Amitava Bagchi.On estimating the time taken torectify faults in a software pack-age during the system testingphase. Information ProcessingLetters, 104(5):168–172, Novem-ber 30, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Roy:2009:NFH
[RBDN09] Sasanka Roy, Subhasis Bhat-tacharjee, Sandip Das, and Sub-has C. Nandy. A new fast heuris-tic for labeling points. Informa-tion Processing Letters, 109(10):478–484, April 30, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Rijmen:2008:RSA
[RBF08] Vincent Rijmen, Paulo S. L. M.Barreto, and Decio L. Gaz-zoni Filho. Rotation symme-try in algebraically generatedcryptographic substitution ta-bles. Information ProcessingLetters, 106(6):246–250, June15, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Ryu:2006:DST
[RC06] Pum-Mo Ryu and Key-SunChoi. Determining the speci-ficity of terms using inside–outside information: a neces-sary condition of term hierarchymining. Information Process-ing Letters, 100(2):76–82, Octo-ber 31, 2006. CODEN IFPLAT.
REFERENCES 262
ISSN 0020-0190 (print), 1872-6119 (electronic).
Ruiz:2007:GNC
[RCA07] D. Ruiz, R. Corchuelo, andJ. L. Arjona. Generating non-conspiratorial executions. Infor-mation Processing Letters, 103(4):157–162, August 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Regev:2002:PAM
[Reg02] Oded Regev. Priority algo-rithms for makespan minimiza-tion in the subset model. In-formation Processing Letters, 84(3):153–157, November 15, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Remy:2004:RCS
[Rem04] Jan Remy. Resource con-strained scheduling on multiplemachines. Information Process-ing Letters, 91(4):177–182, Au-gust 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Reznik:2005:ADA
[Rez05] Yuriy A. Reznik. On the av-erage depth of asymmetric LC-tries. Information ProcessingLetters, 96(3):106–113, Novem-ber 15, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
[RGDN04] Sasanka Roy, Partha P. Goswami,Sandip Das, and Subhas C.Nandy. Optimal algorithm fora special point-labeling problem.Information Processing Letters,89(2):91–98, January 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Rothe:2002:CEP
[RH02] Jorg Rothe and Lane A. Hemas-paandra. On characterizingthe existence of partial one-way permutations. Informa-tion Processing Letters, 82(3):165–171, May 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/86/34/
35/abstract.html.
Rick:2000:SFL
[Ric00] Claus Rick. Simple andfast linear space computa-tion of longest common sub-sequences. Information Pro-cessing Letters, 75(6):275–281,November 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190
[Ric02] Martin Richards. A note con-cerning the closest point pair al-gorithm. Information Process-ing Letters, 82(4):193–195, May31, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Richomme:2003:SNF
[Ric03] G. Richomme. Some non finitelygenerated monoids of repetition-free endomorphisms. Informa-tion Processing Letters, 85(2):61–66, January 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Rizzi:2003:RVA
[Riz03] Romeo Rizzi. On Rajagopalanand Vazirani’s 3/2-approximationbound for the Iterated 1-Steinerheuristic. Information Process-ing Letters, 86(6):335–338, June30, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Reddy:2003:RBT
[RK03] P. Krishna Reddy and MasaruKitsuregawa. Reducing theblocking in two-phase commitwith backup sites. InformationProcessing Letters, 86(1):39–47,
April 15, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Rahman:2005:CSI
[RK05a] M. Sohel Rahman and M. Kaykobad.Complexities of some interestingproblems on spanning trees. In-formation Processing Letters, 94(2):93–97, April 30, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Rahman:2005:HCH
[RK05b] M. Sohel Rahman and M. Kaykobad.On Hamiltonian cycles andHamiltonian paths. InformationProcessing Letters, 94(1):37–41,April 15, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Rapaic:2009:TVP
[RK09] Milan R. Rapaic and ZeljkoKanovic. Time-varying PSO —convergence analysis, convergence-related parameterization andnew parameter adjustmentschemes. Information Process-ing Letters, 109(11):548–552,May 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Raidl:2002:ELS
[RL02] Gunther R. Raidl and IvanaLjubic. Evolutionary localsearch for the edge-biconnectivityaugmentation problem. Infor-mation Processing Letters, 82(1):39–45, April 15, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 264
URL http://www.elsevier.
com/gej-ng/10/23/20/86/27/
32/abstract.html.
Rombo:2009:OEM
[Rom09] Simona E. Rombo. Optimalextraction of motif patterns in2D. Information Processing Let-ters, 109(17):1015–1020, August16, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Rosen:2002:NMN
[Ros02] Adi Rosen. A note on modelsfor non-probabilistic analysis ofpacket switching networks. In-formation Processing Letters, 84(5):237–240, December 16, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[RP03] Desh Ranjan and Enrico Pon-telli. The Level-Ancestor prob-lem on Pure Pointer Machines.Information Processing Letters,85(5):275–283, March 16, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[RR00] F. Roussel and I. Rusu. Rec-ognizing i-triangulated graphsin O(mn) time. InformationProcessing Letters, 76(3):141–147, December 15, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/27/
31/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/27/31/article.
pdf.
Radhakrishnan:2001:TBS
[RR01] Jaikumar Radhakrishnan andVenkatesh Raman. A trade-off between search and updatein dictionaries. InformationProcessing Letters, 80(5):243–247, December 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/84/36/
31/abstract.html.
Rautenbach:2009:PSC
[RR09] Dieter Rautenbach and FriedrichRegen. On packing shortestcycles in graphs. InformationProcessing Letters, 109(14):816–821, June 30, 2009. CODEN IF-
[RRB00] Andreu Riera, Josep Rifa, andJoan Borrell. Efficient construc-tion of vote-tags to allow openobjection to the tally in elec-tronic elections. InformationProcessing Letters, 75(5):211–215, October 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/30/
28/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/30/28/article.
pdf.
Riege:2007:IEA
[RRSY07] Tobias Riege, Jorg Rothe, Hol-ger Spakowski, and Masaki Ya-mamoto. An improved exact al-gorithm for the domatic num-ber problem. Information Pro-cessing Letters, 101(3):101–106,February 14, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Rajsbaum:2008:IAF
[RRT08] Sergio Rajsbaum, Michel Ray-nal, and Corentin Travers. Animpossibility about failure de-tectors in the iterated immedi-ate snapshot model. Informa-tion Processing Letters, 108(3):160–164, October 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Ron:2007:HED
[RRV07] Dana Ron, Amir Rosenfeld, andSalil Vadhan. The hardnessof the Expected Decision Depthproblem. Information Pro-cessing Letters, 101(3):112–118,February 14, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Rao:1994:USR
[RRW94] Rajesh P. N. Rao, Jorg Rothe,and Osamu Watanabe. Upwardseparation for FewP and relatedclasses. Information ProcessingLetters, 52(4):175–180, Novem-ber 25, 1994. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic). See corrigen-dum [RRW00].
Rao:2000:CUS
[RRW00] Rajesh P. N. Rao, Jorg Rothe,and Osamu Watanabe. Corri-gendum to “Upward separationfor FewP and related classes”,Information Processing Letters52(4) (1994) 175–180. Infor-mation Processing Letters, 74(1–2):89, April 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/25/
37/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/25/37/article.
pdf. See [RRW94].
Rajasekaran:2005:GPS
[RS05] Sanguthevar Rajasekaran andSandeep Sen. A generalization of
REFERENCES 266
the 0–1 principle for sorting. In-formation Processing Letters, 94(1):43–47, April 15, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Raja:2006:CLC
[RS06] N. Raja and R. K. Shyamasun-dar. A closer look at constraintsas processes. Information Pro-cessing Letters, 98(5):206–210,June 15, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Raman:2007:IFP
[RS07a] Venkatesh Raman and SaketSaurabh. Improved fixed pa-rameter tractable algorithms fortwo “edge” problems: MAX-CUT and MAXDAG. Informa-tion Processing Letters, 104(2):65–72, October 16, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Raman:2007:PCI
[RS07b] Venkatesh Raman and SomnathSikdar. Parameterized com-plexity of the induced subgraphproblem in directed graphs.Information Processing Letters,104(3):79–85, October 31, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Reyzin:2007:LPA
[RS07c] Lev Reyzin and Nikhil Srivas-tava. On the longest path al-gorithm for reconstructing treesfrom distance matrices. Infor-mation Processing Letters, 101
(3):98–100, February 14, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Rostamabadi:2008:OPR
[RSGK08] Farshad Rostamabadi, ImanSadeghi, Mohammad Ghodsi,and Ramtin Khosravi. Opti-mal point removal in closed-2PM labeling. Information Pro-cessing Letters, 105(3):108–113,January 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Rapaport:2008:MPI
[RST08] Ivan Rapaport, Karol Suchan,and Ioan Todinca. Mini-mal proper interval completions.Information Processing Letters,106(5):195–202, May 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Ramos:2007:EQT
[RSV07] J. Guadalupe Ramos, JosepSilva, and German Vidal. En-suring the quasi-termination ofneeded narrowing computations.Information Processing Letters,101(5):220–226, March 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Ravelomanana:2000:PME
[RT00] Vlady Ravelomanana and LoysThimonier. Patchworks andmetablocks enumeration. In-formation Processing Letters, 73(3–4):77–86, February 29, 2000.
[Rug03] Salvatore Ruggieri. On comput-ing the semi-sum of two integers.Information Processing Letters,87(2):67–71, July 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Raspaud:2009:GCN
[RW09] Andre Raspaud and JiaojiaoWu. Game chromatic numberof toroidal grids. InformationProcessing Letters, 109(21–22):1183–1186, October 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Roh:2008:EII
[RY08] Jong-Won Roh and Byoung-KeeYi. Efficient indexing of inter-val time sequences. InformationProcessing Letters, 109(1):1–12,December 16, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Ramnath:2000:IE
[RZ00] Sarnath Ramnath and PeiyiZhao. On the isomorphismof expressions. InformationProcessing Letters, 74(3–4):97–102, May 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190
[Sae00] Shahrokh Saeednia. On the se-curity of a convertible groupsignature scheme. InformationProcessing Letters, 73(3–4):93–96, February 29, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/62/27/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/62/27/27/article.
pdf.
Saeednia:2002:IBS
[Sae02] Shahrokh Saeednia. An identity-based society oriented signaturescheme with anonymous sign-ers. Information Processing Let-ters, 83(6):295–299, September30, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic). See cryptanal-ysis [Sha03a].
Saeednia:2003:NGS
[Sae03] Shahrokh Saeednia. A noteon Girault’s self-certified model.Information Processing Letters,86(6):323–327, June 30, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 268
Sakai:2006:LSA
[Sak06] Yoshifumi Sakai. A linearspace algorithm for comput-ing a longest common increas-ing subsequence. InformationProcessing Letters, 99(5):203–207, September 15, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Sanders:2001:SPP
[San01a] Beverly A. Sanders. The short-est path in parallel. InformationProcessing Letters, 77(2–4):213–217, February 28, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/29/
47/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/29/47/article.
pdf.
Santhanam:2001:LBC
[San01b] Rahul Santhanam. Lowerbounds on the complexity ofrecognizing SAT by Turingmachines. Information Pro-cessing Letters, 79(5):243–247,September 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/80/34/
31/abstract.html.
Sarbazi-Azad:2001:ACH
[SAOKM01] H. Sarbazi-Azad, M. Ould-Khaoua, and L. M. Macken-zie. Algorithmic constructionof Hamiltonians in pyramids.Information Processing Letters,
[Sar00] Palash Sarkar. A note onthe spectral characterizationof correlation immune Booleanfunctions. Information Pro-cessing Letters, 74(5–6):191–195, June 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/28/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/28/26/article.
pdf.
Sarkar:2008:GMS
[Sar08] Palash Sarkar. A general mixingstrategy for the ECB-Mix-ECBmode of operation. InformationProcessing Letters, 109(2):121–123, December 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Sasaki:2002:TOD
[Sas02] Atsushi Sasaki. A time-optimaldistributed sorting algorithm ona line network. InformationProcessing Letters, 83(1):21–26,July 16, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Sasatte:2008:IFA
[Sas08] Prashant Sasatte. Improved
REFERENCES 269
FPT algorithm for feedback ver-tex set problem in bipartitetournament. Information Pro-cessing Letters, 105(3):79–82,January 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Savelli:2004:NDC
[Sav04] A. Savelli. On numerically de-cipherable codes and their ho-mophonic partitions. Informa-tion Processing Letters, 90(3):103–108, May 16, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Sawitzki:2007:LBO
[Saw07] Daniel Sawitzki. Lower boundson the OBDD size of two funda-mental functions’ graphs. Infor-mation Processing Letters, 101(2):66–71, January 31, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[SB02] Anand Srinivasan and San-joy Baruah. Deadline-basedscheduling of periodic task sys-tems on multiprocessors. In-formation Processing Letters, 84(2):93–98, October 31, 2002.
[SB04] Yong H. Shin and HyokyungBahn. A scalable Web cachesharing scheme. InformationProcessing Letters, 91(5):227–232, September 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Sun:2006:DMA
[SB06] Zheng Sun and Tian-MingBu. On discretization meth-ods for approximating optimalpaths in regions with direction-dependent costs. InformationProcessing Letters, 97(4):146–152, February 28, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Schneider:2000:DPS
[Sch00a] Markus Schneider. On distri-bution properties of sequenceswith perfect linear complex-ity profile. Information Pro-cessing Letters, 74(3–4):175–182, May 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/63/27/
36/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/63/27/36/article.
pdf.
Schonhage:2000:VCR
[Sch00b] Arnold Schonhage. Varia-tions on computing recipro-
REFERENCES 270
cals of power series. Infor-mation Processing Letters, 74(1–2):41–46, April 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/25/
31/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/25/31/article.
pdf.
Schnorr:2001:SGH
[Sch01] C. P. Schnorr. Small generichardcore subsets for the dis-crete logarithm: Short se-cret DL-keys. InformationProcessing Letters, 79(2):93–98, June 30, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/31/
31/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/31/31/article.
pdf.
Schnoebelen:2002:VLC
[Sch02a] Ph. Schnoebelen. Verifying lossychannel systems has nonprimi-tive recursive complexity. In-formation Processing Letters,83(5):251–261, September 15,2002. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Schwiebert:2002:TNO
[Sch02b] Loren Schwiebert. There is nooptimal routing policy for thetorus. Information ProcessingLetters, 83(6):331–336, Septem-
ber 30, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Schoning:2006:SSD
[Sch06] Uwe Schoning. Smaller super-concentrators of density 28. In-formation Processing Letters, 98(4):127–129, May 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Schwarz:2008:OSS
[Sch08] Ulrich M. Schwarz. Onlinescheduling on semi-related ma-chines. Information ProcessingLetters, 108(1):38–40, Septem-ber 15, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Schweitzer:2009:UIM
[Sch09] Pascal Schweitzer. Using theincompressibility method to ob-tain local lemma results forRamsey-type problems. Infor-mation Processing Letters, 109(4):229–232, January 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Shih:2008:SMC
[SCHT08] Lun-Min Shih, Chieh-Feng Chi-ang, Lih-Hsing Hsu, and JimmyJ. M. Tan. Strong Menger con-nectivity with conditional faultson the class of hypercube-likenetworks. Information Process-ing Letters, 106(2):64–69, April15, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 271
Shan:2007:AGB
[SCK07] Erfang Shan, T. C. E. Cheng,and Liying Kang. Absorbant ofgeneralized de Bruijn digraphs.Information Processing Letters,105(1):6–11, December 31, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Saha:2009:CSP
[SD09] Chandan Saha and Sandip Das.Covering a set of points in aplane using two parallel rect-angles. Information ProcessingLetters, 109(16):907–912, July31, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Shan:2009:TDN
[SDC09] Erfang Shan, Yanxia Dong, andYukun Cheng. The twin domi-nation number in generalized deBruijn digraphs. InformationProcessing Letters, 109(15):856–860, July 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Seager:2004:GAD
[Sea04] Suzanne M. Seager. The greedyalgorithm for domination ingraphs of maximum degree 3.Information Processing Letters,89(2):53–56, January 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
without spurious factors. Infor-mation Processing Letters, 102(6):247–252, June 15, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Segerlind:2005:ESB
[Seg05] Nathan Segerlind. Exponentialseparation between Res(k) andRes(k + 1) for k ≤ ε logn. In-formation Processing Letters, 93(4):185–190, February 28, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Segal:2008:FAM
[Seg08] Michael Segal. Fast algorithmfor multicast and data gather-ing in wireless networks. Infor-mation Processing Letters, 107(1):29–33, June 30, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Seppanen:2005:UBA
[Sep05] Jouni K. Seppanen. Upperbound for the approximation ra-tio of a class of hypercube seg-mentation algorithms. Infor-mation Processing Letters, 93(3):139–141, February 14, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Servedio:2001:LETa
[Ser01a] Rocco A. Servedio. On thelimits of efficient teachability.Information Processing Letters,79(6):267–272, September 30,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119
REFERENCES 272
(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/80/37/29/abstract.html.
Servedio:2001:LETb
[Ser01b] Rocco A. Servedio. On thelimits of efficient teachability.Information Processing Letters,79(6):267–272, September 30,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/80/37/29/abstract.html.
Serre:2003:NWP
[Ser03] Olivier Serre. Note on winningpositions on pushdown gameswith ω-regular conditions. In-formation Processing Letters, 85(6):285–291, March 31, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Seynhaeve:2001:SCT
[Sey01] Franck Seynhaeve. Set con-straints and topology. Informa-tion Processing Letters, 80(3):145–150, November 15, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/35/31/abstract.html.
Srivastava:2003:DAF
[SG03] Saurabh Srivastava and R. K.Ghosh. Distributed algorithmsfor finding and maintaining ak-tree core in a dynamic net-work. Information ProcessingLetters, 88(4):187–194, Novem-ber 30, 2003. CODEN IFPLAT.
ISSN 0020-0190 (print), 1872-6119 (electronic).
Sezgin:2005:DSC
[SG05] Ali Sezgin and Ganesh Gopalakr-ishnan. On the definition of se-quential consistency. Informa-tion Processing Letters, 96(6):193–196, December 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Shi:2004:ASS
[SGH04] Zhengnan Shi, Wayne Goddard,and Stephen T. Hedetniemi. Ananonymous self-stabilizing algo-rithm for 1-maximal indepen-dent set in trees. InformationProcessing Letters, 91(2):77–83,July 31, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[Shi03a] Jau-Der Shih. Fault-tolerantwormhole routing for hypercubenetworks. Information Process-ing Letters, 86(2):93–100, April30, 2003. CODEN IFPLAT.
REFERENCES 274
ISSN 0020-0190 (print), 1872-6119 (electronic).
Shih:2003:FTWb
[Shi03b] Jau-Der Shih. A fault-tolerantwormhole routing scheme fortorus networks with nonconvexfaults. Information ProcessingLetters, 88(6):271–278, Decem-ber 31, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Shim:2008:RKA
[Shi08] Kyung-Ah Shim. Rogue-key at-tacks on the multi-designatedverifiers signature scheme. In-formation Processing Letters,107(2):83–86, July 16, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Shparlinski:2000:LCN
[Shp00] Igor E. Shparlinski. Lin-ear complexity of the Naor–Reingold pseudo-random func-tion. Information Process-ing Letters, 76(3):95–99, De-cember 15, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/27/
24/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/27/24/article.
pdf.
Shparlinski:2002:SMS
[Shp02] Igor E. Shparlinski. Security of
most significant bits of gx2
. In-formation Processing Letters, 83
(2):109–113, July 31, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Shparlinski:2004:UDD
[Shp04] Igor E. Shparlinski. On the uni-formity of distribution of the de-cryption exponent in fixed en-cryption exponent RSA. In-formation Processing Letters, 92(3):143–147, November 15, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Shparlinski:2007:BFC
[Shp07] Igor E. Shparlinski. Bounds onthe Fourier coefficients of theweighted sum function. Infor-mation Processing Letters, 103(3):83–87, July 31, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Sibeyn:2004:EMM
[Sib04] Jop F. Sibeyn. External ma-trix multiplication and all-pairsshortest path. Information Pro-cessing Letters, 91(2):99–106,July 31, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Sidorowicz:2007:GCN
[Sid07] Elzbieta Sidorowicz. The gamechromatic number and the gamecolouring number of cactuses.Information Processing Letters,102(4):147–151, May 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
REFERENCES 275
Simonsen:2004:CRC
[Sim04] Jakob Grue Simonsen. On con-fluence and residuals in Cauchyconvergent transfinite rewriting.Information Processing Letters,91(3):141–146, August 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Sintzoff:2003:DCO
[Sin03] Michel Sintzoff. On the designof correct and optimal dynami-cal systems and games. Informa-tion Processing Letters, 88(1–2):59–65, October 17, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Shi:2005:ONO
[SJ05] Qingmin Shi and Joseph JaJa.Optimal and near-optimal algo-rithms for generalized intersec-tion reporting on pointer ma-chines. Information ProcessingLetters, 95(3):382–388, August16, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Shen:2008:LCB
[SJ08] Haibin Shen and Yier Jin.Low complexity bit parallelmultiplier for GF(2m) gener-ated by equally-spaced trino-mials. Information ProcessingLetters, 107(6):211–215, August31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Spriggs:2002:NBM
[SK02] Michael J. Spriggs and J. MarkKeil. A new bound for map la-beling with uniform circle pairs.Information Processing Letters,81(1):47–53, January 16, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
[SK08b] Joanna Skowronek-Kaziow. Somedigraphs arising from numbertheory and remarks on thezero-divisor graph of the ringZn. Information Processing Let-ters, 108(3):165–169, October16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Shmulevich:2001:AAM
[SKA01] Ilya Shmulevich, Aleksey D.Korshunov, and Jaakko As-tola. Almost all monotoneBoolean functions are polynomi-ally learnable using membershipqueries. Information ProcessingLetters, 79(5):211–213, Septem-ber 15, 2001. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
[SKP+02] Minyoung Sung, Soyoung Kim,Sangsoo Park, Naehyuck Chang,and Heonshik Shin. Compara-tive performance evaluation ofJava threads for embedded ap-plications: Linux Thread vs.Green Thread. Information Pro-cessing Letters, 84(4):221–225,November 30, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Skulrattanakulchai:2002:ECG
[Sku02a] San Skulrattanakulchai. 4-edge-coloring graphs of maximum de-gree 3 in linear time. Infor-mation Processing Letters, 81(4):191–195, February 28, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/35/30/abstract.html.
Skurczynski:2002:CBT
[Sku02b] Jerzy Skurczynski. A character-ization of Buchi tree automata.Information Processing Letters,81(1):29–33, January 16, 2002.CODEN IFPLAT. ISSN 0020-
[Sku04] San Skulrattanakulchai. Acycliccolorings of subcubic graphs. In-formation Processing Letters, 92(4):161–167, November 30, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Skulrattanakulchai:2006:LVC
[Sku06] San Skulrattanakulchai. ∆-Listvertex coloring in linear time.Information Processing Letters,98(3):101–106, May 16, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Singh:2001:SRG
[SL01] Gautam B. Singh and DonglinLiu. Sequence retrieval fromgenomic databases. Infor-mation Processing Letters, 79(1):25–32, May 31, 2001.CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http:/
/www.elsevier.nl/gej%2Dng/
10/23/20/80/25/29/abstract.
html; http://www.elsevier.
nl/gej%2Dng/10/23/20/80/25/
29/article.pdf.
Shiowattana:2006:OLB
[SL06a] Dungjade Shiowattana andSatyanarayana V. Lokam. Anoptimal lower bound for 2-querylocally decodable linear codes.
REFERENCES 277
Information Processing Letters,97(6):244–250, March 31, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Stump:2006:KBC
[SL06b] Aaron Stump and Bernd Lochner.Knuth–Bendix completion oftheories of commuting group en-domorphisms. Information Pro-cessing Letters, 98(5):195–198,June 15, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Shi:2005:IGN
[SLL+05] X. H. Shi, Y. C. Liang, H. P.Lee, C. Lu, and L. M. Wang. Animproved GA and a novel PSO-GA-based hybrid algorithm. In-formation Processing Letters, 93(5):255–261, March 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Shi:2007:PSO
[SLL+07] X. H. Shi, Y. C. Liang, H. P. Lee,C. Lu, and Q. X. Wang. Par-ticle swarm optimization-basedalgorithms for TSP and gener-alized TSP. Information Pro-cessing Letters, 103(5):169–176,August 31, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Su:2008:IAF
[SLT08] Hsin-Hao Su, Chin Lung Lu,and Chuan Yi Tang. Animproved algorithm for finding
a length-constrained maximum-density subtree in a tree. Infor-mation Processing Letters, 109(2):161–164, December 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Swain:2002:PIS
[SM02] Anjan Kumar Swain and Alan S.Morris. Performance improve-ment of self-adaptive evolu-tionary methods with a dy-namic lower bound. Informa-tion Processing Letters, 82(1):55–63, April 15, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/86/27/
34/abstract.html.
Stanica:2003:CCR
[SM03] Pantelimon Stanica and Sub-hamoy Maitra. A construc-tive count of rotation symmetricfunctions. Information Process-ing Letters, 88(6):299–304, De-cember 31, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Smart:2001:NCP
[Sma01] N. P. Smart. A note on the x-coordinate of points on an ellip-tic curve in characteristic two.Information Processing Letters,80(5):261–263, December 15,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/36/34/abstract.html.
REFERENCES 278
Smorodinsky:2008:NOF
[Smo08] Shakhar Smorodinsky. A noteon the online First-Fit algo-rithm for coloring k-inductivegraphs. Information ProcessingLetters, 109(1):44–45, December16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Solomonoff:2008:PUN
[Sol08] Ray J. Solomonoff. The prob-ability of “undefined” (non-converging) output in generat-ing the universal probability dis-tribution. Information Pro-cessing Letters, 106(6):238–240,June 15, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Sopena:2002:TEO
[Sop02] Eric Sopena. There exist ori-ented planar graphs with ori-ented chromatic number atleast sixteen. InformationProcessing Letters, 81(6):309–312, March 31, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/37/
30/abstract.html.
Song:2007:BNN
[SPKL07] Moon Bae Song, Kwang JinPark, Ki-Sik Kong, and Sang KeunLee. Bottom-up nearest neigh-bor search for R-trees. Informa-tion Processing Letters, 101(2):78–85, January 31, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Srinivasan:2008:NDN
[Sri08] Aravind Srinivasan. A noteon the distribution of the num-ber of prime factors of the in-tegers. Information ProcessingLetters, 109(2):133–135, Decem-ber 31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Serra-Sagrista:2000:ELP
[SS00] Joan Serra-Sagrista. Enu-meration of lattice points inl1 norm. Information Pro-cessing Letters, 76(1–2):39–44,November 20, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/24/
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/24/30/article.
pdf.
Schwarzer:2002:COS
[SS02] Fabian Schwarzer and AchimSchweikard. On the complex-ity of one-shot translational sep-arability. Information Process-ing Letters, 83(4):187–194, Au-gust 31, 2002. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Sanders:2003:BLT
[SS03a] Peter Sanders and Jop F.Sibeyn. A bandwidth latencytradeoff for broadcast and re-duction. Information Process-ing Letters, 86(1):33–38, April15, 2003. CODEN IFPLAT.
REFERENCES 279
ISSN 0020-0190 (print), 1872-6119 (electronic).
Sawada:2003:SEO
[SS03b] J. Sawada and J. P. Spinrad.From a simple elimination order-ing to a strong elimination or-dering in linear time. Informa-tion Processing Letters, 86(6):299–302, June 30, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Schobbens:2002:TLT
[SSSS02] P. Y. Schobbens, G. Saake,A. Sernadas, and C. Sernadas.A two-level temporal logic forevolving specifications. Informa-tion Processing Letters, 83(3):167–172, August 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Shim:2004:ECC
[SSYM04] Jeong Min Shim, Seok Il Song,Jae Soo Yoo, and Young SooMin. An efficient cache con-scious multi-dimensional indexstructure. Information Pro-cessing Letters, 92(3):133–142,November 15, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Saks:2000:LDS
[SSZZ00] Michael Saks, Aravind Srini-vasan, Shiyu Zhou, and DavidZuckerman. Low discrepancysets yield approximate min-wise independent permutationfamilies. Information Pro-cessing Letters, 73(1–2):29–32,January 31, 2000. CODEN
[ST00] Matthias Schonlau and MartinTheus. Detecting masqueradesin intrusion detection based onunpopular commands. Informa-tion Processing Letters, 76(1–2):33–38, November 20, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/24/
29/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/24/29/article.
pdf.
Sung:2002:EGR
[ST02] Shao-Chin Sung and KeisukeTanaka. An exponential gapwith the removal of one negationgate. Information ProcessingLetters, 82(3):155–157, May 16,2002. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/86/34/33/abstract.html.
Sung:2004:LNB
[ST04a] Shao Chin Sung and KeisukeTanaka. Limiting negations inbounded-depth circuits: An ex-tension of Markov’s theorem. In-formation Processing Letters, 90
REFERENCES 280
(1):15–20, April 15, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Szepietowski:2004:NOC
[ST04b] Andrzej Szepietowski and MonikaTargan. A note on the orientedchromatic number of grids. In-formation Processing Letters, 92(2):65–70, October 31, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Srivastava:2005:TBP
[ST05] Nikhil Srivastava and Alan D.Taylor. Tight bounds on plu-rality. Information ProcessingLetters, 96(3):93–95, November15, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Shioura:2006:EPE
[ST06] Akiyoshi Shioura and TakeshiTokuyama. Efficiently pric-ing European-Asian options-ultimate implementation andanalysis of the AMO algorithm.Information Processing Letters,100(6):213–219, December 31,2006. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Saule:2009:AST
[ST09] Erik Saule and Denis Trys-tram. Analyzing scheduling withtransient failures. InformationProcessing Letters, 109(11):539–542, May 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Staiger:2005:CDE
[Sta05] Ludwig Staiger. Constructivedimension equals Kolmogorovcomplexity. Information Pro-cessing Letters, 93(3):149–153,February 14, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Stefankovic:2000:AOD
[Ste00] Daniel Stefankovic. Acyclic ori-entations do not lead to opti-mal deadlock-free packet rout-ing algorithms. InformationProcessing Letters, 73(5–6):221–225, March 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/62/28/
36/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/62/28/36/article.
pdf.
Stewart:2008:FPT
[Ste08] Iain A. Stewart. On the fixed-parameter tractability of param-eterized model-checking prob-lems. Information Process-ing Letters, 106(1):33–36, March31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Shih:2007:EBC
[STH07] Lun-Min Shih, Jimmy J. M.Tan, and Lih-Hsing Hsu. Edge-bipancyclicity of conditionalfaulty hypercubes. InformationProcessing Letters, 105(1):20–25, December 31, 2007. CO-
REFERENCES 281
DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Stinson:2004:ACS
[Sti04] D. R. Stinson. Attack on aconcast signature scheme. In-formation Processing Letters, 91(1):39–41, July 16, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Studer:2009:CKD
[Stu09] Thomas Studer. Commonknowledge does not have theBeth property. InformationProcessing Letters, 109(12):611–614, May 31, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Subramanian:2006:AHA
[Sub06] C. R. Subramanian. Analy-sis of a heuristic for acyclicedge colouring. InformationProcessing Letters, 99(6):227–229, September 30, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Sung:2001:INC
[Sun01] Pantelimon Stanicaand Soo HakSung. Improving the non-linearity of certain balancedBoolean functions with good lo-cal and global avalanche char-acteristics. Information Pro-cessing Letters, 79(4):167–172,August 15, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/33/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/33/27/article.
pdf.
Suomela:2007:AIC
[Suo07] Jukka Suomela. Approxima-bility of identifying codes andlocating–dominating codes. In-formation Processing Letters,103(1):28–33, June 30, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Slivnik:2005:PLP
[SV05] Bostjan Slivnik and Bostjan Vil-fan. Producing the left parseduring bottom-up parsing. In-formation Processing Letters, 96(6):220–224, December 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Steinwandt:2008:OTS
[SV08] Rainer Steinwandt and Viktoria I.Villanyi. A one-time signa-ture using run-length encod-ing. Information Processing Let-ters, 108(4):179–185, October31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Smith:2009:EPS
[SV09] Rebecca Smith and Vincent Vat-ter. The enumeration of permu-tations sortable by pop stacks inparallel. Information ProcessingLetters, 109(12):626–629, May31, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
[SW05b] Igor E. Shparlinski and ArneWinterhof. On the linearcomplexity of bounded integersequences over different mod-uli. Information Processing Let-ters, 96(5):175–177, December16, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Shen:2007:SCP
[SW07a] Liang Shen and Yingqian Wang.A sufficient condition for a pla-nar graph to be 3-choosable.Information Processing Letters,104(4):146–151, November 15,2007. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Shparlinski:2007:QPR
[SW07b] Igor E. Shparlinski and ArneWinterhof. Quantum periodreconstruction of approximatesequences. Information Pro-cessing Letters, 103(6):211–215,September 15, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Salamon:2008:FST
[SW08] Gabor Salamon and GaborWiener. On finding spanning
trees with few leaves. Infor-mation Processing Letters, 105(5):164–169, February 29, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Spoerhase:2009:ASM
[SW09] J. Spoerhase and H.-C. Wirth.An O(n(log n)2/ log logn) algo-rithm for the single maximumcoverage location or the (1, Xp)-medianoid problem on trees.Information Processing Letters,109(8):391–394, March 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Sui:2004:CBA
[SWCC04] Hongfei Sui, Jianxin Wang,Jianer Chen, and SongqiaoChen. The cost of becominganonymous: on the participantpayload in Crowds. InformationProcessing Letters, 90(2):81–86,April 30, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Saia:2008:RCC
[SY08] Jared Saia and Maxwell Young.Reducing communication costsin robust peer-to-peer networks.Information Processing Letters,106(4):152–158, May 16, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Su:2004:APL
[SYL04] Yih-Ching Su, Chu-Sing Yang,and Chen-Wei Lee. The anal-
REFERENCES 283
ysis of packet loss predictionfor Gilbert-model with loss rateuplink. Information Process-ing Letters, 90(3):155–159, May16, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
parl:2004:LCA
[SZ04] Petra Sparl and Janez Zerovnik.2-local 5/4-competitive algo-rithm for multicoloring triangle-free hexagonal graphs. Informa-tion Processing Letters, 90(5):239–246, June 15, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Szabo:2003:SPN
[Sza03] Tibor Szabo. On the spectrumof projective norm-graphs. In-formation Processing Letters, 86(2):71–74, April 30, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Szepietowski:2006:NAO
[Sze06] Andrzej Szepietowski. A noteon alternating one-pebble Tur-ing machines with sublogarith-mic space. Information Process-ing Letters, 98(5):174–176, June15, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Szepietowski:2008:FTM
[Sze08] Andrzej Szepietowski. FoolingTuring machines with sublog-arithmic space: a note on“For completeness, sublogarith-mic space is no space” by M.
[SZM09] Hadas Shachnai, Lisa Zhang,and Tomomi Matsui. A noteon generalized rank aggregation.Information Processing Letters,109(13):647–651, June 15, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Sun:2008:MHA
[SZQ08] Li Sun, Fuji Zhang, and JianguoQian. Multi-hop all-to-all opti-cal routings in Cartesian prod-uct networks. Information Pro-cessing Letters, 107(6):252–256,August 31, 2008. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Takenaga:2008:PCE
[TA08] Yasuhiko Takenaga and ShigeruArai. PSPACE-completeness ofan escape problem. Informa-tion Processing Letters, 108(4):229–233, October 31, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Takamura:2004:SVA
[TAI04] Masataka Takamura, Tom Alt-man, and Yoshihide Igarashi.Speedup of Vidyasankar’s algo-rithm for the group k-exclusionproblem. Information Process-ing Letters, 91(2):85–91, July
[Tak00] Daisuke Takahashi. A fast al-gorithm for computing large Fi-bonacci numbers. InformationProcessing Letters, 75(6):243–246, November 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/31/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/31/25/article.
pdf.
Takaoka:2005:TAA
[Tak05] Tadao Takaoka. AnO(n3 log logn/ logn)time algorithm for the all-pairsshortest path problem. Infor-mation Processing Letters, 96(5):155–161, December 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Talbot:2000:FFO
[Tal00] Jean-Marc Talbot. The ∃∀2
fragment of the first-order the-ory of atomic set constraintsis Π0
1-hard. Information Pro-cessing Letters, 74(1–2):27–33, April 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/63/25/
29/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/25/29/article.
pdf.
Tambouratzis:2000:SHC
[Tam00] T. Tambouratzis. Solvingthe Hamiltonian cycle prob-lem via an artificial neuralnetwork. Information Pro-cessing Letters, 75(6):237–242,November 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/31/
24/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/31/24/article.
pdf.
Tan:2000:OBB
[Tan00] Xuehou Tan. On optimalbridges between two convex re-gions. Information Process-ing Letters, 76(4–6):163–168,December 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/28/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/28/26/article.
pdf.
Tan:2001:FCS
[Tan01a] Xuehou Tan. Fast computa-tion of shortest watchman routesin simple polygons. Informa-tion Processing Letters, 77(1):27–33, January 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
REFERENCES 285
nl/gej-ng/10/23/20/68/24/
29/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/24/29/article.
pdf.
Tan:2001:OCV
[Tan01b] Xuehou Tan. Optimal compu-tation of the Voronoi diagramof disjoint clusters. Informa-tion Processing Letters, 79(3):115–119, July 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[Tan06b] Xuehou Tan. A 2-approximationalgorithm for the Zookeeper’sProblem. Information Process-ing Letters, 100(5):183–187, De-cember 16, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Tan:2007:SSP
[Tan07] Xuehou Tan. Sweeping sim-ple polygons with the minimumnumber of chain guards. Infor-mation Processing Letters, 102(2–3):66–71, April 30, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Tan:2008:NIC
[Tan08] Jinsong Tan. A note on the inap-proximability of correlation clus-tering. Information ProcessingLetters, 108(5):331–335, Novem-ber 15, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
[Tar04] Andrzej Tarlecki. Editorial. In-formation Processing Letters, 90
REFERENCES 286
(1):1–2, April 15, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Tatti:2006:CCQ
[Tat06] Nikolaj Tatti. Computationalcomplexity of queries based onitemsets. Information Process-ing Letters, 98(5):183–187, June15, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
terBeek:2005:MTA
[tBK05] Maurice H. ter Beek and JettyKleijn. Modularity for teamsof I/O automata. InformationProcessing Letters, 95(5):487–495, September 15, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Tongchim:2002:PGA
[TC02] Shisanu Tongchim and Prab-has Chongstitvatana. Paral-lel genetic algorithm with pa-rameter adaptation. Informa-tion Processing Letters, 82(1):47–54, April 15, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/86/27/
33/abstract.html.
Toroslu:2004:DPS
[TC04] Ismail H. Toroslu and AhmetCosar. Dynamic programmingsolution for multiple query op-timization problem. Informa-tion Processing Letters, 92(3):149–155, November 15, 2004.
[tC09] Balder ten Cate. A note onthe expressibility problem formodal logics and star-free reg-ular expressions. InformationProcessing Letters, 109(10):509–513, April 30, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Tian:2009:OSU
[TCNY09] Ji Tian, T. C. E. Cheng, C. T.Ng, and Jinjiang Yuan. On-line scheduling on unboundedparallel-batch machines to mini-mize the makespan. InformationProcessing Letters, 109(21–22):1211–1215, October 31, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Tian:2009:NSI
[TD09] Cong Tian and Zhenhua Duan.A note on stutter-invariantPLTL. Information ProcessingLetters, 109(13):663–667, June15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Tan:2002:OOA
[TH02] Zhiyi Tan and Yong He. Optimalonline algorithm for schedul-ing on two identical machineswith machine availability con-straints. Information ProcessingLetters, 83(6):323–329, Septem-ber 30, 2002. CODEN IFPLAT.
REFERENCES 287
ISSN 0020-0190 (print), 1872-6119 (electronic).
Tan:2003:FSS
[TH03] Xuehou Tan and Tomio Hirata.Finding shortest safari routesin simple polygons. Informa-tion Processing Letters, 87(4):179–186, August 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[The02] The Eindhoven Tuesday After-noon Club. On computing alongest path in a tree. Informa-tion Processing Letters, 81(2):93–96, January 31, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/85/33/
33/abstract.html.
Thomasian:2005:RVR
[Tho05] Alexander Thomasian. Recon-struct versus read-modify writesin RAID. Information Pro-cessing Letters, 93(4):163–168,February 28, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Tsai:2007:PBH
[TJ07] Chang-Hsiung Tsai and Shu-Yun Jiang. Path bipancyclic-ity of hypercubes. Informa-tion Processing Letters, 101(3):93–97, February 14, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Teoh:2006:RBM
[TJC+06] Andrew Teoh, Beng Jin, TeeConnie, David Ngo, and ChekLing. Remarks on BioHashand its mathematical founda-tion. Information ProcessingLetters, 100(4):145–150, Novem-ber 30, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Tzeng:2007:SSE
[TJH07] Chi-Hung Tzeng, Jehn-RueyJiang, and Shing-Tsaan Huang.A self-stabilizing (∆ + 4)-edge-coloring algorithm for planargraphs in anonymous uniformsystems. Information ProcessingLetters, 101(4):168–173, Febru-ary 28, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Tzeng:2009:SSA
[TJH09] Chi-Hung Tzeng, Jehn-RueyJiang, and Shing-Tsaan Huang.A self-stabilizing algorithm forthe maximum planarizationproblem in complete bipartitenetworks. Information Process-ing Letters, 109(10):518–522,April 30, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 288
Tsuchiya:2002:BQS
[TK02] Tatsuhiro Tsuchiya and TohruKikuno. Byzantine quorum sys-tems with maximum availability.Information Processing Letters,83(2):71–77, July 31, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Tomita:2009:RVG
[TK09] Kohji Tomita and HaruhisaKurokawa. On the reachabilityof a version of graph-rewritingsystem. Information ProcessingLetters, 109(14):777–782, June30, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Tanaka:2007:IFK
[TKS07] Yuuki Tanaka, Hiroyuki Kawai,and Yukio Shibata. Isomor-phic factorization, the Kro-necker product and the line di-graph. Information ProcessingLetters, 101(2):72–77, January31, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Tsai:2002:LFF
[TLH02] Yin-Te Tsai, Yaw-Ling Lin, andF. R. Hsu. The on-line first-fit algorithm for radio frequencyassignment problems. Informa-tion Processing Letters, 84(4):195–199, November 30, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Thomasian:2005:ENQ
[TLZ05] Alexander Thomasian, Yue Li,and Lijuan Zhang. Exact k-NN queries on clustered SVDdatasets. Information Process-ing Letters, 94(6):247–252, June30, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
[TM09] Yingzhi Tian and Jixiang Meng.λc-Optimally half vertex tran-sitive graphs with regularity k.Information Processing Letters,109(13):683–686, June 15, 2009.CODEN IFPLAT. ISSN 0020-
REFERENCES 289
0190 (print), 1872-6119 (elec-tronic).
Tavares:2008:HRT
[TMSO08] Eduardo Tavares, Paulo Ma-ciel, Bruno Silva, and Meuse N.Oliveira, Jr. Hard real-timetasks’ scheduling consideringvoltage scaling, precedence andexclusion relations. Informa-tion Processing Letters, 108(2):50–59, September 30, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
To:2009:UFA
[To09] Anthony Widjaja To. Unaryfinite automata vs. arithmeticprogressions. Information Pro-cessing Letters, 109(17):1010–1014, August 16, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Tonien:2006:TTS
[Ton06] Dongvu Tonien. On a traitortracing scheme from ACISP2003. Information ProcessingLetters, 100(1):21–22, October16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Touzet:2003:TED
[Tou03] Helene Touzet. Tree edit dis-tance with gaps. InformationProcessing Letters, 85(3):123–129, February 14, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Trelea:2003:PSO
[Tre03] Ioan Cristian Trelea. The par-ticle swarm optimization algo-rithm: convergence analysis andparameter selection. Informa-tion Processing Letters, 85(6):317–325, March 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Tripakis:2004:UPD
[Tri04] Stavros Tripakis. Undecidableproblems of decentralized obser-vation and control on regularlanguages. Information Process-ing Letters, 90(1):21–28, April15, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Tripakis:2006:FTD
[Tri06] Stavros Tripakis. Folk the-orems on the determinizationand minimization of timed au-tomata. Information ProcessingLetters, 99(6):222–226, Septem-ber 30, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Ta-Shma:2002:SIE
[TS02] Amnon Ta-Shma. Storing in-formation with extractors. In-formation Processing Letters,83(5):267–274, September 15,2002. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Tsai:2003:CLC
[Tsa03] Yin-Te Tsai. The constrainedlongest common subsequence
[Tsa06] Boaz Tsaban. Fast genera-tors for the Diffie–Hellman keyagreement protocol and mali-cious standards. InformationProcessing Letters, 99(4):145–148, August 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Tsai:2007:CEH
[Tsa07] Chang-Hsiung Tsai. Cyclesembedding in hypercubes withnode failures. Information Pro-cessing Letters, 102(6):242–246,June 15, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Tse:2005:SNL
[Tse05] Savio S. H. Tse. A short note onthe lower bound of dilation forO(log n)-label interval routing.Information Processing Letters,95(2):351–353, July 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Tsin:2002:SRD
[Tsi02] Y. H. Tsin. Some remarks ondistributed depth-first search.Information Processing Letters,82(4):173–178, May 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Tsin:2004:FED
[Tsi04] Y. H. Tsin. On finding an eardecomposition of an undirectedgraph distributively. Informa-tion Processing Letters, 91(3):147–153, August 16, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Tsin:2007:ISS
[Tsi07] Yung H. Tsin. An im-proved self-stabilizing algorithmfor biconnectivity and bridge-connectivity. Information Pro-cessing Letters, 102(1):27–34,April 15, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Tsur:2008:FAG
[Tsu08] Dekel Tsur. Faster algorithmsfor guided tree edit distance.Information Processing Letters,108(4):251–254, October 31,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Tsai:2004:SCP
[TTH04] Chang-Hsiung Tsai, JimmyJ. M. Tan, and Lih-Hsing Hsu.The super-connected property ofrecursive circulant graphs. In-formation Processing Letters, 91(6):293–298, September 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Tsai:2002:FTH
[TTLH02] Chang-Hsiung Tsai, JimmyJ. M. Tan, Tyne Liang, and
REFERENCES 291
Lih-Hsing Hsu. Fault-tolerantHamiltonian laceability of hy-percubes. Information Pro-cessing Letters, 83(6):301–306,September 30, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Turski:2003:IWF
[Tur03] W ladys law M. Turski. It wasfun. Information ProcessingLetters, 88(1–2):7–12, October17, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Turau:2007:LSS
[Tur07] Volker Turau. Linear self-stabilizing algorithms for the in-dependent and dominating setproblems using an unfair dis-tributed scheduler. Informa-tion Processing Letters, 103(3):88–93, July 31, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Trahan:2002:SMA
[TV02] Jerry L. Trahan and Ramachan-dran Vaidyanathan. Scal-ing multiple addition and pre-fix sums on the reconfigurablemesh. Information Process-ing Letters, 82(6):277–282, June30, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Takenaga:2006:TNC
[TW06] Yasuhiko Takenaga and TobyWalsh. Tetravex is NP-complete. Information Pro-cessing Letters, 99(5):171–174,
September 15, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Tan:2008:NAS
[TYP08] Xuegong Tan, Shun-Zheng Yu,and Jin Han Park. A noteabout some properties of BCgraphs. Information ProcessingLetters, 108(6):398–401, Novem-ber 30, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Tang:2001:EAS
[TYW01] Shyue-Ming Tang, Fu-Long Yeh,and Yue-Li Wang. An ef-ficient algorithm for solvingthe homogeneous set sand-wich problem. InformationProcessing Letters, 77(1):17–22, January 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/24/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/24/27/article.
pdf.
Telelis:2005:AEA
[TZ05] Orestis A. Telelis and Vas-silis Zissimopoulos. Absoluteo(logm) error in approximatingrandom set covering: an averagecase analysis. Information Pro-cessing Letters, 94(4):171–177,May 31, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 292
Telelis:2008:DBO
[TZ08] Orestis A. Telelis and VassilisZissimopoulos. Dynamic bottle-neck optimization for k-edge and2-vertex connectivity. Informa-tion Processing Letters, 106(6):251–257, June 15, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Uehara:2000:PAA
[UC00] Ryuhei Uehara and Zhi-ZhongChen. Parallel approxima-tion algorithms for maximumweighted matching in generalgraphs. Information Pro-cessing Letters, 76(1–2):13–17,November 20, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/24/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/24/26/article.
pdf.
Ultes-Nitsche:2007:PSC
[UN07] Ulrich Ultes-Nitsche. A power-set construction for reduc-ing Buchi automata to non-determinism degree two. Infor-mation Processing Letters, 101(3):107–111, February 14, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Ukkonen:2009:RAA
[UPGM09] Antti Ukkonen, Kai Puolamaki,Aristides Gionis, and HeikkiMannila. A randomized approxi-mation algorithm for computing
[Vah07] Jan Vahrenhold. An in-placealgorithm for Klee’s measureproblem in two dimensions. In-formation Processing Letters,102(4):169–174, May 16, 2007.CODEN IFPLAT. ISSN 0020-
REFERENCES 293
0190 (print), 1872-6119 (elec-tronic).
Vajnovszki:2008:MRG
[Vaj08] Vincent Vajnovszki. More re-strictive Gray codes for neck-laces and Lyndon words. Infor-mation Processing Letters, 106(3):96–99, April 30, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Valiant:2004:LRC
[Val04a] Paul Valiant. The Log-RankConjecture and low degree poly-nomials. Information Process-ing Letters, 89(2):99–103, Jan-uary 31, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Valiente:2004:TUS
[Val04b] Gabriel Valiente. Trading unini-tialized space for time. Informa-tion Processing Letters, 92(1):9–13, October 16, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
VandenBussche:2001:RQU
[Van01] Jan Van den Bussche. Rewrit-ing queries using views overmonadic database schemas. In-formation Processing Letters, 79(3):111–114, July 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/80/32/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/80/32/26/article.
pdf.
Vanherpe:2003:SOP
[Van03] Jean-Marie Vanherpe. Some op-timization problems on weak-bisplit graphs. Information Pro-cessing Letters, 88(6):305–310,December 31, 2003. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
VanRoy:2007:M
[Van07] Benjamin Van Roy. MIN. Infor-mation Processing Letters, 102(2–3):72–73, April 30, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Vassilevska:2009:EAC
[Vas09] Virginia Vassilevska. Efficientalgorithms for clique problems.Information Processing Letters,109(4):254–257, January 31,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Vieira:2008:CRF
[VB08] Gustavo M. D. Vieira andLuiz E. Buzato. On the coor-dinator’s rule for Fast Paxos.Information Processing Let-ters, 107(5):183–187, August16, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
vandeBult:2008:PMC
[vdBW08] Fokko J. van de Bult and Ger-hard J. Woeginger. The prob-lem of the moody chess play-ers. Information Processing Let-ters, 108(5):336–337, November15, 2008. CODEN IFPLAT.
REFERENCES 294
ISSN 0020-0190 (print), 1872-6119 (electronic).
vanDijk:2006:ICS
[vDKST06] Marten van Dijk, Tom Keve-naar, Geert-Jan Schrijen, andPim Tuyls. Improved con-structions of secret sharingschemes by applying (λ, ω)-decompositions. InformationProcessing Letters, 99(4):154–157, August 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
vanDeursen:2009:NFP
[vDR09] Ton van Deursen and SasaRadomirovic. On a new formalproof model for RFID locationprivacy. Information Process-ing Letters, 110(2):57–61, De-cember 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
vanderZwaag:2001:CFP
[vdZ01] Mark B. van der Zwaag. Thecones and foci proof techniquefor timed transition systems.Information Processing Letters,80(1):33–40, October 15, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/27/31/abstract.html.
Veanes:2000:FTR
[Vea00] Margus Veanes. Farmer’sTheorem revisited. Informa-tion Processing Letters, 74(1–2):47–53, April 2000. CO-DEN IFPLAT. ISSN 0020-0190
[Ver02] Rakesh Verma. Algorithms andreductions for rewriting prob-lems. II. Information ProcessingLetters, 84(4):227–233, Novem-ber 30, 2002. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Verhoeven:2006:EAL
[Ver06] Yves F. Verhoeven. Enhancedalgorithms for Local Search. In-formation Processing Letters, 97(5):171–176, March 16, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Vereshchagin:2007:KCE
[Ver07] Nikolai K. Vereshchagin. Kol-mogorov complexity of enumer-ating finite sets. InformationProcessing Letters, 103(1):34–39, June 30, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Vestergaard:2006:CAS
[Ves06] Rene Vestergaard. A construc-tive approach to sequential Nashequilibria. Information Process-ing Letters, 97(2):46–51, Jan-uary 31, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 295
Veloso:2002:LMI
[VFV02] Paulo A. S. Veloso, Jose L. Fi-adeiro, and Sheila R. M. Veloso.On local modularity and inter-polation in entailment systems.Information Processing Letters,82(4):203–211, May 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Vigneron:2000:AFM
[VGG+00] Antoine Vigneron, Lixin Gao,Mordecai J. Golin, Giuseppe F.Italiano, and Bo Li. An al-gorithm for finding a k-medianin a directed tree. Informa-tion Processing Letters, 74(1–2):81–88, April 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[Vig03] Antoine Vigneron. Reporting in-tersections among thick objects.Information Processing Letters,85(2):87–92, January 31, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Vinodchandran:2004:AMN
[Vin04] N. V. Vinodchandran. AMexp 6⊆(NP ∩ coNP)/poly. InformationProcessing Letters, 89(1):43–47,January 16, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Vincent:2004:IUS
[VL04] Millist W. Vincent and JixueLiu. Irrelevant updates and self-maintainability in transitive clo-sure database views. Informa-tion Processing Letters, 89(1):25–29, January 16, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Voorhies:2006:FSM
[VLK06] Seth Voorhies, Hyunyoung Lee,and Andreas Klappenecker. Fairservice for mice in the pres-ence of elephants. Informa-tion Processing Letters, 99(3):96–101, August 16, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 296
Voorhoeve:2001:IFD
[VM01] Marc Voorhoeve and SjoukeMauw. Impossible futuresand determinism. Informa-tion Processing Letters, 80(1):51–58, October 15, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/84/27/
33/abstract.html.
Vogler:2008:ASP
[Vog08] Walter Vogler. Another shortproof of optimality for the MINcache replacement algorithm.Information Processing Letters,106(5):219–220, May 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Volzer:2004:CPF
[Vol04] Hagen Volzer. A constructiveproof for FLP. Information Pro-cessing Letters, 92(2):83–87, Oc-tober 31, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Volkmann:2007:RAC
[Vol07] Lutz Volkmann. Restricted arc-connectivity of digraphs. In-formation Processing Letters,103(6):234–239, September 15,2007. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
over a public key cryptosystembased on Lyndon words. In-formation Processing Letters, 80(5):239–242, December 15, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/84/36/30/abstract.html.
Verstraeten:2005:IWR
[VSSV05] D. Verstraeten, B. Schrauwen,D. Stroobandt, and J. VanCampenhout. Isolated wordrecognition with the LiquidState Machine : a case study.Information Processing Letters,95(6):521–528, September 30,2005. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Vu:2005:CSP
[Vu05] Thuy Duong Vu. The compres-sion structure of a process. In-formation Processing Letters, 96(6):225–229, December 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Veloso:2001:LMV
[VV01] Paulo A. S. Veloso and SheilaR. M. Veloso. On localmodularity variants and Π-institutions. Information Pro-cessing Letters, 77(5–6):247–253, March 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/32/
28/abstract.html; http:
REFERENCES 297
//www.elsevier.nl/gej-ng/
10/23/20/68/32/28/article.
pdf.
Vesel:2002:ILB
[VZ02] Aleksander Vesel and JanezZerovnik. Improved lower boundon the Shannon capacity of C7.Information Processing Letters,81(5):277–282, March 16, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/36/34/abstract.html.
Wongngamnit:2001:RLG
[WA01] Chinda Wongngamnit and DanaAngluin. Robot localizationin a grid. Information Pro-cessing Letters, 77(5–6):261–267, March 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/32/
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/32/30/article.
pdf.
Wang:2001:OAC
[Wan01] D. P. Wang. An optimal algo-rithm for constructing an opti-mal bridge between two simplerectilinear polygons. Informa-tion Processing Letters, 79(5):229–236, September 15, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/80/34/29/abstract.html.
Wang:2004:UFG
[Wan04] Guilin Wang. Universal forgeryon a group signature schemeusing self-certified public keys.Information Processing Letters,89(5):227–231, March 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wang:2007:BEI
[Wan07] Junhu Wang. Binary equal-ity implication constraints, nor-mal forms and data redundancy.Information Processing Letters,101(1):20–25, January 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wang:2008:ANN
[Wan08] Yusu Wang. Approximatingnearest neighbor among trian-gles in convex position. Infor-mation Processing Letters, 108(6):379–385, November 30, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wang:2001:HTM
[WC01] Guoqing Wang and T. C. Ed-win Cheng. Heuristics fortwo-machine no-wait flowshopscheduling with an availabil-ity constraint. InformationProcessing Letters, 80(6):305–309, December 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/84/37/
32/abstract.html.
REFERENCES 298
Walczak:2003:MVW
[WC03] Krzysztof Walczak and Woj-ciech Cellary. Modeling virtualworlds in databases. Informa-tion Processing Letters, 88(1–2):67–72, October 17, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Wang:2008:FFH
[WC08] Wen-Qing Wang and Xie-BinChen. A fault-free Hamiltoniancycle passing through prescribededges in a hypercube with faultyedges. Information ProcessingLetters, 107(6):205–210, August31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Wang:2009:TNT
[WC09] Weifan Wang and Dong Chen.(2, 1)-total number of trees withmaximum degree three. Infor-mation Processing Letters, 109(14):805–810, June 30, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wu:2008:FCH
[WCFC08] Ruei-Yu Wu, Gen-Huey Chen,Jung-Sheng Fu, and Gerard J.Chang. Finding cycles in hi-erarchical hypercube networks.Information Processing Letters,109(2):112–115, December 31,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Wang:2008:ILB
[WCH08] Jianxin Wang, Jianer Chen, andMin Huang. An improved lowerbound on approximation algo-rithms for the Closest Substringproblem. Information Process-ing Letters, 107(1):24–28, June30, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Weisman:2004:VDM
[WCK04] Amit Weisman, L. Paul Chew,and Klara Kedem. Voronoidiagrams of moving points inthe plane and of lines in space:tight bounds for simple config-urations. Information Process-ing Letters, 92(5):245–251, De-cember 16, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Wan:2002:NML
[WCX02] Yingyu Wan, Guoliang Chen,and Yinlong Xu. A note on theminimum label spanning tree.Information Processing Letters,84(2):99–101, October 31, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wang:2000:TMW
[WCY00] Cao An Wang, Francis Y. Chin,and Boting Yang. Triangula-tions without minimum-weightdrawing. Information Pro-cessing Letters, 74(5–6):183–189, June 30, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 299
URL http://www.elsevier.
nl/gej-ng/10/23/20/63/28/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/63/28/25/article.
pdf.
Wegener:2000:WCE
[Weg00] Ingo Wegener. Worst caseexamples for operations onOBDDs. Information Pro-cessing Letters, 74(3–4):91–96, May 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/29/28/24/63/27/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
29/28/24/63/27/25/article.
pdf.
Wegener:2002:SCP
[Weg02] Ingo Wegener. A simplified cor-rectness proof for a well-knownalgorithm computing stronglyconnected components. Infor-mation Processing Letters, 83(1):17–19, July 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Weston:2004:FPT
[Wes04] Mark Weston. A fixed-parameter tractable algorithmfor matrix domination. Informa-tion Processing Letters, 90(5):267–272, June 15, 2004. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Westphal:2008:NCT
[Wes08] Stephan Westphal. A noteon the k-Canadian TravellerProblem. Information Process-ing Letters, 106(3):87–89, April30, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Wu:2003:IMT
[WHLH03] Tzong-Sun Wu, Chien-LungHsu, Han-Yu Lin, and Po-Sheng Huang. Improvement ofthe Miyazaki–Takaragi thresh-old digital signature scheme. In-formation Processing Letters, 88(4):183–186, November 30, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wehrman:2009:GMS
[WHO09] Ian Wehrman, C. A. R. Hoare,and Peter W. O’Hearn. Graph-ical models of separation logic.Information Processing Letters,109(17):1001–1004, August 16,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Wu:2004:EAM
[WHZ04] Bang Ye Wu, Zheng-Nan Huang,and Fu-Jie Zhan. Exact algo-rithms for the minimum latencyproblem. Information Process-ing Letters, 92(6):303–309, De-cember 31, 2004. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
REFERENCES 300
Williams:2009:FPL
[Wil09] Ryan Williams. Finding paths oflength k in O∗(2k) time. Infor-mation Processing Letters, 109(6):315–318, February 28, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Winkowski:2003:ACI
[Win03] Jozef Winkowski. An alge-braic characterization of inde-pendence of Petri net pro-cesses. Information ProcessingLetters, 88(1–2):73–81, October17, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Windsor:2004:SPF
[Win04] Aaron Windsor. A simple proofthat finding a maximal indepen-dent set in a graph is in NC. In-formation Processing Letters, 92(4):185–187, November 30, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wirth:2003:HSC
[Wir03] Niklaus Wirth. Hardware/software co-design then andnow. Information ProcessingLetters, 88(1–2):83–87, October17, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Wang:2002:AAB
[WL02] Lusheng Wang and Zimao Li.An approximation algorithm for
a bottleneck k-Steiner tree prob-lem in the Euclidean plane. In-formation Processing Letters, 81(3):151–156, February 14, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/34/32/abstract.html.
Wu:2003:SLD
[WL03] Chin-Chia Wu and Wen-ChiungLee. Scheduling linear de-teriorating jobs to minimizemakespan with an availabilityconstraint on a single machine.Information Processing Letters,87(2):89–93, July 31, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Wang:2008:OD
[WL08] Shiying Wang and ShangweiLin. λ′-optimal digraphs. Infor-mation Processing Letters, 108(6):386–389, November 30, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wang:2008:NCP
[WLC08] Yingqian Wang, Huajing Lu,and Ming Chen. A note on 3-choosability of planar graphs.Information Processing Letters,105(5):206–211, February 29,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Wei:2008:GRM
[WLLS08] Hsin-Wen Wei, Kwei-Jay Lin,Wan-Chen Lu, and Wei-Kuan
REFERENCES 301
Shih. Generalized rate mono-tonic schedulability bounds us-ing relative period ratios. Infor-mation Processing Letters, 107(5):142–148, August 16, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). See [Par11].
Wan:2007:SIC
[WLP07] Guohua Wan, Joseph Y.-T. Le-ung, and Michael L. Pinedo.Scheduling imprecise computa-tion tasks on uniform processors.Information Processing Letters,104(2):45–52, October 16, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wagh:2000:CCW
[WMG00] Meghanad D. Wagh, PrakashMath, and Osman Guzide.Cyclic-cubes and wrap-aroundbutterflies. Information Pro-cessing Letters, 75(1–2):25–27, July 31, 2000. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/25/
29/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/25/29/article.
pdf.
Wang:2007:FTP
[WMX07] Wei-Wei Wang, Mei-Jie Ma,and Jun-Ming Xu. Fault-tolerant pancyclicity of aug-mented cubes. InformationProcessing Letters, 103(2):52–56, July 16, 2007. CODEN IF-
[WNR00] Poul Frederick Williams, MachaNikolskaıa, and Antoine Rauzy.Bypassing BDD construction forreliability analysis. Informa-tion Processing Letters, 75(1–2):85–89, July 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/25/
40/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/25/40/article.
pdf.
Woeginger:2001:RPT
[Woe01] Gerhard J. Woeginger. Thereconstruction of polyominoesfrom their orthogonal projec-tions. Information Process-ing Letters, 77(5–6):225–229,March 31, 2001. CODENIFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/32/
25/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/32/25/article.
pdf.
Woeginger:2009:CPM
[Woe09] Gerhard J. Woeginger. Acomment on parallel-machinescheduling under a grade ofservice provision to minimizemakespan. Information Pro-cessing Letters, 109(7):341–342,March 16, 2009. CODEN IF-
[Wol06] Guy Wolfovitz. The complex-ity of depth-3 circuits comput-ing symmetric Boolean func-tions. Information ProcessingLetters, 100(2):41–46, October31, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Wotawa:2001:VRH
[Wot01] Franz Wotawa. A variantof Reiter’s hitting-set algo-rithm. Information Process-ing Letters, 79(1):45–51, May31, 2001. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic). URL http:/
/www.elsevier.nl/gej%2Dng/
10/23/20/80/25/32/abstract.
html; http://www.elsevier.
nl/gej%2Dng/10/23/20/80/25/
32/article.pdf.
Wu:2001:ESAa
[WS01a] Jie Wu and Li Sheng. An effi-cient sorting algorithm for a se-quence of kings in a tournament.Information Processing Letters,79(6):297–299, September 30,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/80/37/34/abstract.html.
Wu:2001:ESAb
[WS01b] Jie Wu and Li Sheng. An effi-cient sorting algorithm for a se-quence of kings in a tournament.
Information Processing Letters,79(6):297–299, September 30,2001. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/80/37/34/abstract.html.
Wu:2006:LCD
[WS06] Jigang Wu and ThambipillaiSrikanthan. Low-complex dy-namic programming algorithmfor hardware/software partition-ing. Information Processing Let-ters, 98(2):41–46, April 30, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Worah:2007:LTD
[WS07] Pratik Worah and Sandeep Sen.A linear time deterministic al-gorithm to find a small sub-set that approximates the cen-troid. Information ProcessingLetters, 105(1):17–19, December31, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Wang:2005:BPL
[WTC05] Xianbing Wang, Yong MengTeo, and Jiannong Cao. A biva-lency proof of the lower boundfor uniform consensus. Infor-mation Processing Letters, 96(5):167–174, December 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wu:2000:PTA
[Wu00] Bang Ye Wu. Polynomial time
REFERENCES 303
algorithms for some minimumlatency problems. InformationProcessing Letters, 75(5):225–229, October 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/30/
30/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/30/30/article.
pdf.
Wu:2007:NC
[Wu07] Zhilin Wu. A note on the charac-terization of TL[EF]. Informa-tion Processing Letters, 102(2–3):48–54, April 30, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[Wu09a] Bang Ye Wu. An optimal algo-rithm for the maximum-densitypath in a tree. InformationProcessing Letters, 109(17):975–979, August 16, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Wu:2009:AUB
[Wu09b] Yufeng Wu. An analytical upperbound on the minimum num-
ber of recombinations in the his-tory of SNP sequences in popu-lations. Information ProcessingLetters, 109(9):427–431, April15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Wu:2003:OAI
[WW03] Jer-Shyan Wu and Yu-KuoWang. An optimal algorithmto implement the Hanoi towerswith parallel moves. Informa-tion Processing Letters, 86(6):289–293, June 30, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Wu:2009:CDS
[WW09] J. Wu and R. Wei. Com-ments on “Distributed symmet-ric key management for mobilead hoc networks”. InformationProcessing Letters, 109(14):822–824, June 30, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Wang:2004:FVS
[WWC04] Fu-Hsing Wang, Yue-Li Wang,and Jou-Ming Chang. Feedbackvertex sets in star graphs. In-formation Processing Letters, 89(4):203–208, February 28, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wong:2005:FEF
[WWGF05] Angeline Wong, Leejay Wu,Phillip B. Gibbons, and Chris-tos Faloutsos. Fast estimation
REFERENCES 304
of fractal dimension and corre-lation integral on stream data.Information Processing Letters,93(2):91–97, January 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wang:2008:SPG
[WWW08] De-Qiang Wang, Yu-Peng Wen,and Ke-Lun Wang. A smallerplanar graph without 4-, 5-cycles and intersecting trianglesthat is not 3-choosable. Infor-mation Processing Letters, 108(3):87–89, October 16, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Wang:2005:SJU
[WX05] Ji-Bo Wang and Zun-Quan Xia.Scheduling jobs under decreas-ing linear deterioration. Infor-mation Processing Letters, 94(2):63–69, April 30, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Weifan:2006:LMF
[WY06] Wang Weifan and Wang Yiqiao.L(p, q)-labelling of K4-minorfree graphs. Information Pro-cessing Letters, 98(5):169–173,June 15, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Wan:2001:SMSa
[WYL01a] Guohua Wan, Benjamin P.-C.Yen, and Chung-Lun Li. Singlemachine scheduling to minimizetotal compression plus weighted
flow cost is NP-hard. Informa-tion Processing Letters, 79(6):273–280, September 30, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/80/37/30/abstract.html.
Wan:2001:SMSb
[WYL01b] Guohua Wan, Benjamin P.-C.Yen, and Chung-Lun Li. Singlemachine scheduling to minimizetotal compression plus weightedflow cost is NP-hard. Informa-tion Processing Letters, 79(6):273–280, September 30, 2001.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/80/37/30/abstract.html.
Wu:2006:PTA
[WYL06] Gang Wu, Jia-Huai You, andGuohui Lin. A polynomialtime algorithm for the minimumquartet inconsistency problemwith O(n) quartet errors. Infor-mation Processing Letters, 100(4):167–171, November 30, 2006.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[XDZ05] Yinfeng Xu, Wenqiang Dai, andBinhai Zhu. A lower bound onthe edge l∞ radius of Saitouand Nei’s method for phyloge-netic reconstruction. Informa-tion Processing Letters, 94(5):225–230, June 15, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Xiao:2005:SPA
[XH05] Lu Xiao and Howard M. Heys.A simple power analysis attackagainst the key schedule of theCamellia block cipher. Informa-tion Processing Letters, 95(3):409–412, August 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Xiaofang:2007:CTG
[Xia07] Luo Xiaofang. The 4-choosabilityof toroidal graphs without inter-secting triangles. InformationProcessing Letters, 102(2–3):85–91, April 30, 2007. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Xirotiri:2006:SSS
[Xir06] Olga Xirotiri. Simulation of si-multaneous safe recursion overan arbitrary structure. Infor-mation Processing Letters, 99(2):72–81, July 31, 2006. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
[XL00] Jue Xue and Ju Liu. A network-flow-based lower bound for theminimum weighted integer col-oring problem. InformationProcessing Letters, 76(1–2):45–50, November 20, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/67/24/
31/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/67/24/31/article.
pdf.
Xu:2005:SCL
[XLMH05] Jun-Ming Xu, Min Lu, MeijieMa, and Angelika Hellwig. Su-per connectivity of line graphs.Information Processing Letters,94(4):191–195, May 31, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
[XUT01] Limin Xiang, Kazuo Ushijima,and Changjie Tang. On generat-ing k-ary trees in computer rep-resentation. Information Pro-cessing Letters, 77(5–6):231–238, March 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/68/32/
26/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/68/32/26/article.
pdf.
Xu:2005:LRA
[XX05a] Guang Xu and Jinhui Xu. AnLP rounding algorithm for ap-proximating uncapacitated fa-cility location problem withpenalties. Information Process-ing Letters, 94(3):119–123, May16, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Xu:2005:EPM
[XX05b] Min Xu and Jun-Ming Xu.Edge-pancyclicity of Mobiuscubes. Information ProcessingLetters, 96(4):136–140, Novem-ber 30, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Xu:2007:FIA
[XX07] Min Xu and Jun-Ming Xu. Theforwarding indices of augmentedcubes. Information ProcessingLetters, 101(5):185–189, March16, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Xu:2005:FDC
[XXH05] Min Xu, Jun-Ming Xu, and Xin-Min Hou. Fault diameter ofCartesian product graphs. In-formation Processing Letters, 93(5):245–248, March 16, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Xu:2005:SCS
[XXZ05] Jun-Ming Xu, Min Xu, andQiang Zhu. The super con-
REFERENCES 307
nectivity of shuffle-cubes. In-formation Processing Letters, 96(4):123–127, November 30, 2005.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Xu:2007:FDP
[XY07] Jun-Ming Xu and Chao Yang.Fault diameter of productgraphs. Information ProcessingLetters, 102(6):226–228, June15, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Xu:2007:FTA
[XZX07] Jun-Ming Xu, Qiang Zhu, andMin Xu. Fault-tolerant analysisof a class of networks. Informa-tion Processing Letters, 103(6):222–226, September 15, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Yamaguchi:2004:FMC
[YAM04] Atsuko Yamaguchi, Kiyoko F.Aoki, and Hiroshi Mamitsuka.Finding the maximum commonsubgraph of a partial k-treeand a graph with a polynomi-ally bounded number of span-ning trees. Information Process-ing Letters, 92(2):57–63, Octo-ber 31, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Yang:2000:CBQ
[Yan00] Jae Dong Yang. A concept-based query evaluation with in-definite fuzzy triples. Informa-
[YC94] Jing Ho Yan and Gerard J.Chang. The path-partitionproblem in block graphs. In-formation Processing Letters,52(6):317–322, December 23,1994. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic). See corrigendum[Cha02b].
REFERENCES 308
Yilmaz:2009:ETB
[YC09] Okan Yilmaz and Ing-Ray Chen.Elastic threshold-based admis-sion control for QoS satisfac-tion with reward optimizationfor servicing multiple priorityclasses in wireless networks.Information Processing Letters,109(15):868–875, July 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Ying:2007:CQW
[YCFD07] Mingsheng Ying, Jianxin Chen,Yuan Feng, and Runyao Duan.Commutativity of quantumweakest preconditions. Infor-mation Processing Letters, 104(4):152–158, November 15, 2007.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Yi:2007:ESC
[YCKK07] Kwangkeun Yi, Hosik Choi, Jae-hwang Kim, and Yongdai Kim.An empirical study on clas-sification methods for alarmsfrom a bug-finding static C an-alyzer. Information ProcessingLetters, 102(2–3):118–123, April30, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Yang:2006:MNG
[YCML06] Xiaofan Yang, Jianqiu Cao,Graham M. Megson, and JunLuo. Minimum neighborhood ina generalized cube. InformationProcessing Letters, 97(3):88–93,
February 14, 2006. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Yang:2004:GHT
[YELM04] Xiaofan Yang, David J. Evans,Hongjian Lai, and Graham M.Megson. Generalized honey-comb torus is Hamiltonian. In-formation Processing Letters, 92(1):31–37, October 16, 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Yang:2005:MIS
[YEM05] Xiaofan Yang, David J. Evans,and Graham M. Megson. Max-imum induced subgraph of arecursive circulant. Informa-tion Processing Letters, 95(1):293–298, July 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Hsieh:2002:VRS
[yH02] Sun yuan Hsieh. On vertex rank-ing of a starlike graph. Informa-tion Processing Letters, 82(3):131–135, May 16, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/86/34/
29/abstract.html.
Yang:2005:FAC
[YHC05] I-Hsuan Yang, Chien-Pin Huang,and Kun-Mao Chao. A fastalgorithm for computing alongest common increasing sub-sequence. Information Pro-cessing Letters, 93(5):249–253,
REFERENCES 309
March 16, 2005. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
[Yij04] YijieHan. Improved algorithmfor all pairs shortest paths. In-formation Processing Letters, 91(5):245–250, September 2004.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Yang:2003:FTC
[YLTH03] Ming-Chien Yang, Tseng-KueiLi, Jimmy J. M. Tan, and Lih-Hsing Hsu. Fault-tolerant cycle-embedding of crossed cubes. In-formation Processing Letters, 88(4):149–154, November 30, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Yoshinaka:2009:EPG
[Yos09] Ryo Yoshinaka. An elemen-tary proof of a generalization ofdouble Greibach normal form.Information Processing Letters,109(10):490–492, April 30, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Youn:2008:WRB
[YPKL08] Taek-Young Youn, Young-HoPark, Changhan Kim, and Jon-gin Lim. Weakness in a RSA-based password authenticatedkey exchange protocol. Infor-mation Processing Letters, 108(6):339–342, November 30, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Yoshida:2003:NMC
[YSK03] Kiyoaki Yoshida, Yasumasa Su-jaku, and Tohru Kohda. Num-ber of mutual connections inneighborhoods and its applica-tion to self-diagnosable systems.Information Processing Letters,88(3):89–94, November 15, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Yamashita:2004:SPR
[YSK04] Masafumi Yamashita, IchiroSuzuki, and Tiko Kameda.Searching a polygonal regionby a group of stationary k-searchers. Information Process-ing Letters, 92(1):1–8, October16, 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Yunes:2008:SAS
[Yun08] Jean-Baptiste Yunes. A 4-states algebraic solution to lin-ear cellular automata synchro-nization. Information Process-ing Letters, 107(2):71–75, July16, 2008. CODEN IFPLAT.
REFERENCES 310
ISSN 0020-0190 (print), 1872-6119 (electronic).
Yuster:2006:FCC
[Yus06] Raphael Yuster. Finding andcounting cliques and indepen-dent sets in r-uniform hyper-graphs. Information ProcessingLetters, 99(4):130–134, August31, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Yan:2009:AME
[YWW09] Guofeng Yan, Jianxin Wang,and Weiping Wang. An analyt-ical model for end-to-end com-munication channel over PLCNbased on QBDs. InformationProcessing Letters, 109(23–24):1252–1259, November 15, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Ye:2003:LSE
[YZ03] Deshi Ye and Guochuan Zhang.On-line scheduling with extend-able working time on a smallnumber of machines. Infor-mation Processing Letters, 85(4):171–177, February 28, 2003.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Ye:2007:MTP
[YZ07] Deshi Ye and Guochuan Zhang.Maximizing the throughput ofparallel jobs on hypercubes.Information Processing Letters,102(6):259–263, June 15, 2007.
[YZ08] Jun Yan and Jian Zhang. An ef-ficient method to generate feasi-ble paths for basis path testing.Information Processing Letters,107(3–4):87–92, July 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Zhou:2009:LDG
[yZyLZ09] Qi yan Zhou, San yang Liu, andQiang Zhu. Local diagnosabilityof generic star-pyramid graph.Information Processing Letters,109(13):695–699, June 15, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Zuhily:2007:OMP
[ZB07] Areej Zuhily and Alan Burns.Optimal (D−J)-monotonic pri-ority assignment. InformationProcessing Letters, 103(6):247–250, September 15, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Zhang:2004:AIB
[ZC04] Fangguo Zhang and XiaofengChen. Attack on an ID-based authenticated group keyagreement scheme from PKC2004. Information Process-ing Letters, 91(4):191–193, Au-gust 2004. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
REFERENCES 311
Zhang:2009:CII
[ZC09a] Fangguo Zhang and XiaofengChen. Cryptanalysis and im-provement of an ID-based ad-hoc anonymous identificationscheme at CT-RSA 05. Informa-tion Processing Letters, 109(15):846–849, July 16, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Zhang:2009:BCA
[ZC09b] Jialin Zhang and Wei Chen.Bounded cost algorithms formultivalued consensus using bi-nary consensus instances. In-formation Processing Letters,109(17):1005–1009, August 16,2009. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Zhang:2009:IUR
[ZC09c] Jialin Zhang and Wei Chen.Implementing uniform reliablebroadcast with binary consensusin systems with fair-lossy links.Information Processing Letters,110(1):13–19, December 1, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Zheng:2006:TLB
[ZCF+06] Feifeng Zheng, Francis Y. L.Chin, Stanley P. Y. Fung,Chung Keung Poon, and Yin-feng Xu. A tight lower boundfor job scheduling with cancel-lation. Information Process-ing Letters, 97(1):1–3, January16, 2006. CODEN IFPLAT.
ISSN 0020-0190 (print), 1872-6119 (electronic).
Zeadally:2000:PEJ
[Zea00] S. Zeadally. Performance evalu-ation of a Java-based network-ing Application ProgrammingInterface (API). InformationProcessing Letters, 75(5):199–209, October 31, 2000. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
nl/gej-ng/10/23/20/64/30/
27/abstract.html; http:
//www.elsevier.nl/gej-ng/
10/23/20/64/30/27/article.
pdf.
Zelke:2007:OPE
[Zel07] Mariano Zelke. Optimal per-edge processing times in thesemi-streaming model. Informa-tion Processing Letters, 104(3):106–112, October 31, 2007. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Zemmari:2008:HRG
[Zem08] Akka Zemmari. On handshakesin random graphs. InformationProcessing Letters, 108(3):119–123, October 16, 2008. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Zanuttini:2002:UFS
[ZH02] Bruno Zanuttini and Jean-Jacques Hebrard. A unifiedframework for structure iden-tification. Information Pro-cessing Letters, 81(6):335–339,March 31, 2002. CODEN
[ZH05] Huaming Zhang and Xin He.Visibility representation of planegraphs via canonical orderingtree. Information ProcessingLetters, 96(2):41–48, October31, 2005. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Zhang:2006:SSL
[ZH06] Huaming Zhang and Xin He. Onsimultaneous straight-line gridembedding of a planar graphand its dual. Information Pro-cessing Letters, 99(1):1–6, July16, 2006. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Zhou:2007:CAS
[ZH07] Yuren Zhou and Jun He. Con-vergence analysis of a self-adaptive multi-objective evo-lutionary algorithm based ongrids. Information ProcessingLetters, 104(4):117–122, Novem-ber 15, 2007. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Zhao:2006:NDN
[Zha06] Yunlei Zhao. A note on theDwork–Naor timed deniable au-thentication. Information Pro-cessing Letters, 100(1):1–7, Oc-tober 16, 2006. CODEN IF-
[Zho08] Xiang Zhou. Ehrenfeucht–fraısse games in finite set theory.Information Processing Letters,108(1):3–9, September 15, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Zobel:2001:MHT
[ZHW01] Justin Zobel, Steffen Heinz, andHugh E. Williams. In-memoryhash tables for accumulatingtext vocabularies. InformationProcessing Letters, 80(6):271–277, December 31, 2001. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
com/gej-ng/10/23/20/84/37/
27/abstract.html.
Ziegler:2008:AAR
[Zie08] Valentin Ziegler. Approxima-tion algorithms for restrictedBayesian network structures. In-formation Processing Letters,108(2):60–63, September 30,2008. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
[Ziv09] Stanislav Zivny. Structuralproperties of oracle classes. In-formation Processing Letters,109(19):1131–1135, September15, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Zhou:2005:HEI
[ZJ05] Sheng Zhou and Christopher B.Jones. HCPO: an efficient in-sertion order for incremental De-launay triangulation. Informa-tion Processing Letters, 93(1):37–42, January 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Zhang:2006:FET
[ZLJ06] Xianchao Zhang, Weifa Liang,and He Jiang. Flow equiva-lent trees in undirected node-edge-capacitated planar graphs.Information Processing Letters,100(3):110–115, November 15,2006. CODEN IFPLAT. ISSN0020-0190 (print), 1872-6119(electronic).
Zhang:2009:BNC
[ZLM09] Xindong Zhang, Juan Liu, andJixiang Meng. The bondagenumber in complete t-partite di-graphs. Information ProcessingLetters, 109(17):997–1000, Au-gust 16, 2009. CODEN IF-PLAT. ISSN 0020-0190 (print),1872-6119 (electronic).
Zheng:2005:DSG
[ZLR+05] Jun Zheng, Shahram Latifi,Emma Regentova, Kai Luo, andXiaolong Wu. Diagnosability ofstar graphs under the compari-son diagnosis model. Informa-tion Processing Letters, 93(1):29–36, January 16, 2005. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Zimmermann:2002:SSG
[ZLT02] W. Zimmermann, W. Lowe, andD. Trystram. On schedulingsend-graphs and receive-graphsunder the LogP-model. Infor-mation Processing Letters, 82(2):83–92, April 30, 2002. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).URL http://www.elsevier.
[ZLZ09] Kewen Zhao, Yue Lin, and PingZhang. A sufficient conditionfor pancyclic graphs. Informa-tion Processing Letters, 109(17):991–996, August 16, 2009. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
REFERENCES 314
Zhou:2003:DFD
[ZM03] Jianjun Zhou and MartinMuller. Depth-first discovery al-gorithm for incremental topolog-ical sorting of directed acyclicgraphs. Information ProcessingLetters, 88(4):195–200, Novem-ber 30, 2003. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Zhao:2003:LTA
[ZNI03] Liang Zhao, Hiroshi Nagamochi,and Toshihide Ibaraki. A lineartime 5/3-approximation for theminimum strongly-connectedspanning subgraph problem. In-formation Processing Letters, 86(2):63–70, April 30, 2003. CO-DEN IFPLAT. ISSN 0020-0190(print), 1872-6119 (electronic).
Zhang:2008:CPG
[ZS08] Haihui Zhang and Zhiren Sun.On 3-choosability of planargraphs without certain cycles.Information Processing Letters,107(3–4):102–106, July 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Zhou:2009:FCG
[ZS09] Sizhong Zhou and Qiqing Shen.On fractional (f, n)-criticalgraphs. Information ProcessingLetters, 109(14):811–815, June30, 2009. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
Zhou:2002:EMS
[ZSN02] Hai Zhou, Narendra Shenoy, andWilliam Nicholls. Efficient mini-mum spanning tree constructionwithout Delaunay triangulation.Information Processing Letters,81(5):271–276, March 16, 2002.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic). URL http://www.
elsevier.com/gej-ng/10/23/
20/85/36/33/abstract.html.
Zhang:2008:IPS
[ZSZY08] Changsheng Zhang, Jigui Sun,Xingjun Zhu, and QingyunYang. An improved particleswarm optimization algorithmfor flowshop scheduling prob-lem. Information ProcessingLetters, 108(4):204–209, Octo-ber 31, 2008. CODEN IFPLAT.ISSN 0020-0190 (print), 1872-6119 (electronic).
[ZXZ08] Feifeng Zheng, Yinfeng Xu, andE. Zhang. How much can looka-head help in online single ma-chine scheduling. InformationProcessing Letters, 106(2):70–74, April 15, 2008. CODEN IF-
[ZZ08] Hamid Zarrabi-Zadeh. Flyingover a polyhedral terrain. Infor-mation Processing Letters, 105(3):103–107, January 31, 2008.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).
Zanuttini:2009:NSC
[ZZ09] Bruno Zanuttini and StanislavZivny. A note on some collapseresults of valued constraints.Information Processing Letters,109(11):534–538, May 16, 2009.CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (elec-tronic).