Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/ipl/ipl107.bht:"
@article{DBLP:journals/ipl/AlmeidaZ08, author = {Jorge Almeida and Marc Zeitoun}, title = {Description and analysis of a bottom-up {DFA} minimization algorithm}, journal = {Inf. Process. Lett.}, volume = {107}, number = {2}, pages = {52--59}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.01.003}, doi = {10.1016/J.IPL.2008.01.003}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/AlmeidaZ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AndrenHM08, author = {Daniel Andr{\'{e}}n and Lars Hellstr{\"{o}}m and Klas Markstr{\"{o}}m}, title = {Fast multiplication of matrices over a finitely generated semiring}, journal = {Inf. Process. Lett.}, volume = {107}, number = {6}, pages = {230--234}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.03.004}, doi = {10.1016/J.IPL.2008.03.004}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AndrenHM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ArkinMS08, author = {Esther M. Arkin and Joseph S. B. Mitchell and Jack Snoeyink}, title = {Capturing crossings: Convex hulls of segment and plane intersections}, journal = {Inf. Process. Lett.}, volume = {107}, number = {5}, pages = {194--197}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.03.024}, doi = {10.1016/J.IPL.2008.03.024}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/ArkinMS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AusielloBL08, author = {Giorgio Ausiello and Vincenzo Bonifaci and Luigi Laura}, title = {The online Prize-Collecting Traveling Salesman Problem}, journal = {Inf. Process. Lett.}, volume = {107}, number = {6}, pages = {199--204}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.03.002}, doi = {10.1016/J.IPL.2008.03.002}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/AusielloBL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BleischwitzS08, author = {Yvonne Bleischwitz and Florian Schoppmann}, title = {New efficiency results for makespan cost sharing}, journal = {Inf. Process. Lett.}, volume = {107}, number = {2}, pages = {64--70}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.01.005}, doi = {10.1016/J.IPL.2008.01.005}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BleischwitzS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Chan08, author = {Timothy M. Chan}, title = {Well-separated pair decomposition in linear time?}, journal = {Inf. Process. Lett.}, volume = {107}, number = {5}, pages = {138--141}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.008}, doi = {10.1016/J.IPL.2008.02.008}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Chan08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChaoLL08, author = {Yi{-}Hsiung Chao and Shun{-}Shii Lin and Kwei{-}Jay Lin}, title = {Schedulability issues for {EDZL} scheduling on real-time multiprocessor systems}, journal = {Inf. Process. Lett.}, volume = {107}, number = {5}, pages = {158--164}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.014}, doi = {10.1016/J.IPL.2008.02.014}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChaoLL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChiangWT08, author = {Mao{-}Lun Chiang and Shu{-}Chin Wang and Lin{-}Yu Tseng}, title = {The incremental agreement}, journal = {Inf. Process. Lett.}, volume = {107}, number = {5}, pages = {165--170}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.012}, doi = {10.1016/J.IPL.2008.02.012}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/ChiangWT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Chu08, author = {Frank Pok Man Chu}, title = {A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements}, journal = {Inf. Process. Lett.}, volume = {107}, number = {1}, pages = {7--12}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2007.12.009}, doi = {10.1016/J.IPL.2007.12.009}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Chu08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DelbotL08, author = {Fran{\c{c}}ois Delbot and Christian Laforest}, title = {A better list heuristic for vertex cover}, journal = {Inf. Process. Lett.}, volume = {107}, number = {3-4}, pages = {125--127}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.004}, doi = {10.1016/J.IPL.2008.02.004}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/DelbotL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DuffyOS08, author = {Ken R. Duffy and Neil O'Connell and Art{\"{e}}m Sapozhnikov}, title = {Complexity analysis of a decentralised graph colouring algorithm}, journal = {Inf. Process. Lett.}, volume = {107}, number = {2}, pages = {60--63}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.01.002}, doi = {10.1016/J.IPL.2008.01.002}, timestamp = {Sun, 09 Dec 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/DuffyOS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DunkelmanK08, author = {Orr Dunkelman and Nathan Keller}, title = {Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers}, journal = {Inf. Process. Lett.}, volume = {107}, number = {5}, pages = {133--137}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.01.011}, doi = {10.1016/J.IPL.2008.01.011}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/DunkelmanK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/EngelhardtM08, author = {Kai Engelhardt and Yoram Moses}, title = {Single-bit messages are insufficient for data link over duplicating channels}, journal = {Inf. Process. Lett.}, volume = {107}, number = {6}, pages = {235--239}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.03.010}, doi = {10.1016/J.IPL.2008.03.010}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/EngelhardtM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FitzgeraldJ08, author = {John S. Fitzgerald and Cliff B. Jones}, title = {The connection between two ways of reasoning about partial functions}, journal = {Inf. Process. Lett.}, volume = {107}, number = {3-4}, pages = {128--132}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.005}, doi = {10.1016/J.IPL.2008.02.005}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FitzgeraldJ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Fu08, author = {Jung{-}Sheng Fu}, title = {Conditional fault Hamiltonicity of the complete graph}, journal = {Inf. Process. Lett.}, volume = {107}, number = {3-4}, pages = {110--113}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.001}, doi = {10.1016/J.IPL.2008.02.001}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Fu08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GarciaPL08, author = {Pedro Garc{\'{\i}}a and Manuel {V{\'a}zquez de Parga} and Dami{\'{a}}n L{\'{o}}pez}, title = {On the efficient construction of quasi-reversible automata for reversible languages}, journal = {Inf. Process. Lett.}, volume = {107}, number = {1}, pages = {13--17}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2007.12.004}, doi = {10.1016/J.IPL.2007.12.004}, timestamp = {Wed, 13 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/GarciaPL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Gavril08, author = {Fanica Gavril}, title = {Minimum weight feedback vertex sets in circle graphs}, journal = {Inf. Process. Lett.}, volume = {107}, number = {1}, pages = {1--6}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2007.12.003}, doi = {10.1016/J.IPL.2007.12.003}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Gavril08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GoldwasserM08, author = {Michael H. Goldwasser and Arundhati Bagchi Misra}, title = {A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts}, journal = {Inf. Process. Lett.}, volume = {107}, number = {6}, pages = {240--245}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.03.003}, doi = {10.1016/J.IPL.2008.03.003}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/GoldwasserM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Gutner08, author = {Shai Gutner}, title = {Elementary approximation algorithms for prize collecting Steiner tree problems}, journal = {Inf. Process. Lett.}, volume = {107}, number = {1}, pages = {39--44}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2007.12.010}, doi = {10.1016/J.IPL.2007.12.010}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Gutner08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/JuanHS08, author = {Justie Su{-}tzu Juan and Chun{-}Ming Huang and I{-}Fan Sun}, title = {The strong distance problem on the Cartesian product of graphs}, journal = {Inf. Process. Lett.}, volume = {107}, number = {2}, pages = {45--51}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.01.001}, doi = {10.1016/J.IPL.2008.01.001}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/JuanHS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LaiH08, author = {Pao{-}Lien Lai and Hong{-}Chun Hsu}, title = {The two-equal-disjoint path cover problem of Matching Composition Network}, journal = {Inf. Process. Lett.}, volume = {107}, number = {1}, pages = {18--23}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2007.12.006}, doi = {10.1016/J.IPL.2007.12.006}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LaiH08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LaueM08, author = {S{\"{o}}ren Laue and Domagoj Matijevic}, title = {Approximating k-hop minimum spanning trees in Euclidean metrics}, journal = {Inf. Process. Lett.}, volume = {107}, number = {3-4}, pages = {96--101}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.01.004}, doi = {10.1016/J.IPL.2008.01.004}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LaueM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LeeTH08, author = {Chung{-}Meng Lee and Jimmy J. M. Tan and Lih{-}Hsing Hsu}, title = {Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position}, journal = {Inf. Process. Lett.}, volume = {107}, number = {5}, pages = {171--176}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.013}, doi = {10.1016/J.IPL.2008.02.013}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LeeTH08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Liedloff08, author = {Mathieu Liedloff}, title = {Finding a dominating set on bipartite graphs}, journal = {Inf. Process. Lett.}, volume = {107}, number = {5}, pages = {154--157}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.009}, doi = {10.1016/J.IPL.2008.02.009}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Liedloff08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LinC08, author = {Min{-}Sheng Lin and Yung{-}Jui Chen}, title = {Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph}, journal = {Inf. Process. Lett.}, volume = {107}, number = {6}, pages = {257--264}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.03.008}, doi = {10.1016/J.IPL.2008.03.008}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LinC08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LoofBM08, author = {Karel De Loof and Bernard De Baets and Hans E. De Meyer}, title = {On the random generation of monotone data sets}, journal = {Inf. Process. Lett.}, volume = {107}, number = {6}, pages = {216--220}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.03.007}, doi = {10.1016/J.IPL.2008.03.007}, timestamp = {Fri, 05 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LoofBM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LopezR08, author = {Mario Alberto L{\'{o}}pez and Shlomo Reisner}, title = {Hausdorff approximation of 3D convex polytopes}, journal = {Inf. Process. Lett.}, volume = {107}, number = {2}, pages = {76--82}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.01.010}, doi = {10.1016/J.IPL.2008.01.010}, timestamp = {Wed, 06 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LopezR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MahajanS08, author = {Meena Mahajan and Jayalal Sarma}, title = {Rigidity of a simple extended lower triangular matrix}, journal = {Inf. Process. Lett.}, volume = {107}, number = {5}, pages = {149--153}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.010}, doi = {10.1016/J.IPL.2008.02.010}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MahajanS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MajumderB08, author = {Subhashis Majumder and Bhargab B. Bhattacharya}, title = {On the density and discrepancy of a 2D point set with applications to thermal analysis of {VLSI} chips}, journal = {Inf. Process. Lett.}, volume = {107}, number = {5}, pages = {177--182}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.011}, doi = {10.1016/J.IPL.2008.02.011}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MajumderB08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MitchellP08, author = {Joseph S. B. Mitchell and Valentin Polishchuk}, title = {Minimum-perimeter enclosures}, journal = {Inf. Process. Lett.}, volume = {107}, number = {3-4}, pages = {120--124}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.007}, doi = {10.1016/J.IPL.2008.02.007}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MitchellP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Miyazaki08, author = {Takunari Miyazaki}, title = {On the asymmetric complexity of the group-intersection problem}, journal = {Inf. Process. Lett.}, volume = {107}, number = {5}, pages = {188--193}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.015}, doi = {10.1016/J.IPL.2008.02.015}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Miyazaki08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MontassierRWW08, author = {Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud and Weifan Wang and Yingqian Wang}, title = {A relaxation of Havel's 3-color problem}, journal = {Inf. Process. Lett.}, volume = {107}, number = {3-4}, pages = {107--109}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.003}, doi = {10.1016/J.IPL.2008.02.003}, timestamp = {Fri, 21 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MontassierRWW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Moss08, author = {Lawrence S. Moss}, title = {Confusion of memory}, journal = {Inf. Process. Lett.}, volume = {107}, number = {3-4}, pages = {114--119}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.002}, doi = {10.1016/J.IPL.2008.02.002}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Moss08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Parhami08, author = {Behrooz Parhami}, title = {On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings}, journal = {Inf. Process. Lett.}, volume = {107}, number = {6}, pages = {246--251}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.03.005}, doi = {10.1016/J.IPL.2008.03.005}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Parhami08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Pessoa08, author = {Artur Alves Pessoa}, title = {A note on the construction of error detecting/correcting prefix codes}, journal = {Inf. Process. Lett.}, volume = {107}, number = {1}, pages = {34--38}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2007.12.008}, doi = {10.1016/J.IPL.2007.12.008}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Pessoa08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Segal08, author = {Michael Segal}, title = {Fast algorithm for multicast and data gathering in wireless networks}, journal = {Inf. Process. Lett.}, volume = {107}, number = {1}, pages = {29--33}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2007.12.007}, doi = {10.1016/J.IPL.2007.12.007}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Segal08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ShenJ08, author = {Haibin Shen and Yier Jin}, title = {Low complexity bit parallel multiplier for GF(2\({}^{\mbox{m}}\)) generated by equally-spaced trinomials}, journal = {Inf. Process. Lett.}, volume = {107}, number = {6}, pages = {211--215}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.01.012}, doi = {10.1016/J.IPL.2008.01.012}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ShenJ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Shim08, author = {Kyung{-}Ah Shim}, title = {Rogue-key attacks on the multi-designated verifiers signature scheme}, journal = {Inf. Process. Lett.}, volume = {107}, number = {2}, pages = {83--86}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2007.11.021}, doi = {10.1016/J.IPL.2007.11.021}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Shim08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Skowronek-Kaziow08, author = {Joanna Skowronek{-}Kazi{\'{o}}w}, title = {1, 2 Conjecture - the multiplicative version}, journal = {Inf. Process. Lett.}, volume = {107}, number = {3-4}, pages = {93--95}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.01.006}, doi = {10.1016/J.IPL.2008.01.006}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Skowronek-Kaziow08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/SunZQ08, author = {Li Sun and Fuji Zhang and Jianguo Qian}, title = {Multi-hop all-to-all optical routings in Cartesian product networks}, journal = {Inf. Process. Lett.}, volume = {107}, number = {6}, pages = {252--256}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.03.006}, doi = {10.1016/J.IPL.2008.03.006}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/SunZQ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ValdeonEOV08, author = {Jos{\'{e}} Miguel Ca{\~{n}}ete Valde{\'{o}}n and Fernando Enr{\'{\i}}quez and F. Javier Ortega and Ernesto Vel{\'{a}}quez}, title = {Clarifying the semantics of value in use cases through Jackson's Problem Frames}, journal = {Inf. Process. Lett.}, volume = {107}, number = {6}, pages = {221--229}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.03.009}, doi = {10.1016/J.IPL.2008.03.009}, timestamp = {Wed, 06 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ValdeonEOV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/VieiraB08, author = {Gustavo M. D. Vieira and Luiz Eduardo Buzato}, title = {On the coordinator's rule for Fast Paxos}, journal = {Inf. Process. Lett.}, volume = {107}, number = {5}, pages = {183--187}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.03.001}, doi = {10.1016/J.IPL.2008.03.001}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/VieiraB08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/WangC08, author = {Wen{-}Qing Wang and Xie{-}Bin Chen}, title = {A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges}, journal = {Inf. Process. Lett.}, volume = {107}, number = {6}, pages = {205--210}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.016}, doi = {10.1016/J.IPL.2008.02.016}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/WangC08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/WangCH08, author = {Jianxin Wang and Jianer Chen and Min Huang}, title = {An improved lower bound on approximation algorithms for the Closest Substring problem}, journal = {Inf. Process. Lett.}, volume = {107}, number = {1}, pages = {24--28}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2007.12.005}, doi = {10.1016/J.IPL.2007.12.005}, timestamp = {Fri, 21 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/WangCH08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/WeiLLS08, author = {Hsin{-}Wen Wei and Kwei{-}Jay Lin and Wan{-}Chen Lu and Wei{-}Kuan Shih}, title = {Generalized rate monotonic schedulability bounds using relative period ratios}, journal = {Inf. Process. Lett.}, volume = {107}, number = {5}, pages = {142--148}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.006}, doi = {10.1016/J.IPL.2008.02.006}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/WeiLLS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/YanZ08, author = {Jun Yan and Jian Zhang}, title = {An efficient method to generate feasible paths for basis path testing}, journal = {Inf. Process. Lett.}, volume = {107}, number = {3-4}, pages = {87--92}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.01.007}, doi = {10.1016/J.IPL.2008.01.007}, timestamp = {Wed, 11 Jul 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/YanZ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Yunes08, author = {Jean{-}Baptiste Yun{\`{e}}s}, title = {A 4-states algebraic solution to linear cellular automata synchronization}, journal = {Inf. Process. Lett.}, volume = {107}, number = {2}, pages = {71--75}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.01.009}, doi = {10.1016/J.IPL.2008.01.009}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Yunes08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ZhangS08, author = {Haihui Zhang and Zhiren Sun}, title = {On 3-choosability of planar graphs without certain cycles}, journal = {Inf. Process. Lett.}, volume = {107}, number = {3-4}, pages = {102--106}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.01.008}, doi = {10.1016/J.IPL.2008.01.008}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ZhangS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.