Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/ipl/ipl90.bht:"
@article{DBLP:journals/ipl/AgerDM04, author = {Mads Sig Ager and Olivier Danvy and Jan Midtgaard}, title = {A functional correspondence between call-by-need evaluators and lazy abstract machines}, journal = {Inf. Process. Lett.}, volume = {90}, number = {5}, pages = {223--232}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.012}, doi = {10.1016/J.IPL.2004.02.012}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AgerDM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AlWehaibiKAE04, author = {Abdullah AlWehaibi and Michel Kadoch and Anjali Agarwal and Ahmed K. Elhakeem}, title = {Packet loss probability for DiffServ over {IP} and {MPLS} reliable homogeneous multicast networks}, journal = {Inf. Process. Lett.}, volume = {90}, number = {2}, pages = {73--80}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.008}, doi = {10.1016/J.IPL.2004.01.008}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/AlWehaibiKAE04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/AlvarezBDFS04, author = {Carme {\`{A}}lvarez and Maria J. Blesa and Josep D{\'{\i}}az and Antonio Fern{\'{a}}ndez and Maria J. Serna}, title = {The complexity of deciding stability under {FFS} in the Adversarial Queueing model}, journal = {Inf. Process. Lett.}, volume = {90}, number = {5}, pages = {261--266}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.016}, doi = {10.1016/J.IPL.2004.02.016}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AlvarezBDFS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Bereg04, author = {Sergey Bereg}, title = {Transforming pseudo-triangulations}, journal = {Inf. Process. Lett.}, volume = {90}, number = {3}, pages = {141--145}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.021}, doi = {10.1016/J.IPL.2004.01.021}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Bereg04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Breit04, author = {Joachim Breit}, title = {An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint}, journal = {Inf. Process. Lett.}, volume = {90}, number = {6}, pages = {273--278}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.03.004}, doi = {10.1016/J.IPL.2004.03.004}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Breit04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Bunde04, author = {David P. Bunde}, title = {{SPT} is optimally competitive for uniprocessor flow}, journal = {Inf. Process. Lett.}, volume = {90}, number = {5}, pages = {233--238}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.013}, doi = {10.1016/J.IPL.2004.02.013}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Bunde04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CaiW04, author = {Jin{-}yi Cai and Osamu Watanabe}, title = {Relativized collapsing between {BPP} and {PH} under stringent oracle access}, journal = {Inf. Process. Lett.}, volume = {90}, number = {3}, pages = {147--154}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.004}, doi = {10.1016/J.IPL.2004.02.004}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CaiW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChangLL04, author = {Maw{-}Shang Chang and Chin{-}Hua Lin and Chuan{-}Min Lee}, title = {New upper bounds on feedback vertex numbers in butterflies}, journal = {Inf. Process. Lett.}, volume = {90}, number = {6}, pages = {279--285}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.03.005}, doi = {10.1016/J.IPL.2004.03.005}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChangLL04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChinSFHK04, author = {Francis Y. L. Chin and Alfredo De Santis and Anna Lisa Ferrara and Ngai Lam Ho and S. K. Kim}, title = {A simple algorithm for the constrained sequence problems}, journal = {Inf. Process. Lett.}, volume = {90}, number = {4}, pages = {175--179}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.008}, doi = {10.1016/J.IPL.2004.02.008}, timestamp = {Sun, 06 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChinSFHK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChocklerG04, author = {Hana Chockler and Dan Gutfreund}, title = {A lower bound for testing juntas}, journal = {Inf. Process. Lett.}, volume = {90}, number = {6}, pages = {301--305}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.023}, doi = {10.1016/J.IPL.2004.01.023}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChocklerG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CholviB04, author = {Vicent Cholvi and Josep Bernab{\'{e}}u}, title = {Relationships between memory models}, journal = {Inf. Process. Lett.}, volume = {90}, number = {2}, pages = {53--58}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.007}, doi = {10.1016/J.IPL.2004.01.007}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CholviB04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Diaconescu04, author = {Razvan Diaconescu}, title = {Herbrand theorems in arbitrary institutions}, journal = {Inf. Process. Lett.}, volume = {90}, number = {1}, pages = {29--37}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.005}, doi = {10.1016/J.IPL.2004.01.005}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Diaconescu04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Doberkat04, author = {Ernst{-}Erich Doberkat}, title = {Factoring stochastic relations}, journal = {Inf. Process. Lett.}, volume = {90}, number = {4}, pages = {161--166}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.009}, doi = {10.1016/J.IPL.2004.02.009}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Doberkat04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FreschiB04, author = {Valerio Freschi and Alessandro Bogliolo}, title = {Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism}, journal = {Inf. Process. Lett.}, volume = {90}, number = {4}, pages = {167--173}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.011}, doi = {10.1016/J.IPL.2004.02.011}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FreschiB04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FriedmanMR04, author = {Roy Friedman and Achour Most{\'{e}}faoui and Michel Raynal}, title = {A weakest failure detector-based asynchronous consensus protocol for f{\textless}n}, journal = {Inf. Process. Lett.}, volume = {90}, number = {1}, pages = {39--46}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.001}, doi = {10.1016/J.IPL.2004.01.001}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FriedmanMR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FujitoD04, author = {Toshihiro Fujito and Takashi Doi}, title = {A 2-approximation {NC} algorithm for connected vertex cover and tree cover}, journal = {Inf. Process. Lett.}, volume = {90}, number = {2}, pages = {59--63}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.011}, doi = {10.1016/J.IPL.2004.01.011}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FujitoD04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GerbessiotisS04, author = {Alexandros V. Gerbessiotis and Constantinos J. Siniolakis}, title = {Probabilistic integer sorting}, journal = {Inf. Process. Lett.}, volume = {90}, number = {4}, pages = {187--193}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.007}, doi = {10.1016/J.IPL.2004.02.007}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/GerbessiotisS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GiacomoLP04, author = {Emilio Di Giacomo and Giuseppe Liotta and Maurizio Patrignani}, title = {A note on 3D orthogonal drawings with direction constrained edges}, journal = {Inf. Process. Lett.}, volume = {90}, number = {2}, pages = {97--101}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.015}, doi = {10.1016/J.IPL.2004.01.015}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/GiacomoLP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GuillaumeL04, author = {Jean{-}Loup Guillaume and Matthieu Latapy}, title = {Bipartite structure of all complex networks}, journal = {Inf. Process. Lett.}, volume = {90}, number = {5}, pages = {215--221}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.03.007}, doi = {10.1016/J.IPL.2004.03.007}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/GuillaumeL04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HarveyM04, author = {Nicholas J. A. Harvey and J. Ian Munro}, title = {Deterministic SkipNet}, journal = {Inf. Process. Lett.}, volume = {90}, number = {4}, pages = {205--208}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.019}, doi = {10.1016/J.IPL.2004.01.019}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HarveyM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Hierons04, author = {Robert M. Hierons}, title = {Using a minimal number of resets when testing from a finite state machine}, journal = {Inf. Process. Lett.}, volume = {90}, number = {6}, pages = {287--292}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.03.003}, doi = {10.1016/J.IPL.2004.03.003}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Hierons04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/IwamaY04, author = {Kazuo Iwama and Kouki Yonezawa}, title = {The orthogonal {CNN} problem}, journal = {Inf. Process. Lett.}, volume = {90}, number = {3}, pages = {115--120}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.022}, doi = {10.1016/J.IPL.2004.01.022}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/IwamaY04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/JiTG04, author = {Mingjun Ji and Huanwen Tang and Juan Guo}, title = {A single-point mutation evolutionary programming}, journal = {Inf. Process. Lett.}, volume = {90}, number = {6}, pages = {293--299}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.03.002}, doi = {10.1016/J.IPL.2004.03.002}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/JiTG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KallahallaV04, author = {Mahesh Kallahalla and Peter J. Varman}, title = {Analysis of simple randomized buffer management for parallel {I/O}}, journal = {Inf. Process. Lett.}, volume = {90}, number = {1}, pages = {47--52}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.009}, doi = {10.1016/J.IPL.2004.01.009}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KallahallaV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KerenidisW04, author = {Iordanis Kerenidis and Ronald de Wolf}, title = {Quantum symmetrically-private information retrieval}, journal = {Inf. Process. Lett.}, volume = {90}, number = {3}, pages = {109--114}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.003}, doi = {10.1016/J.IPL.2004.02.003}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KerenidisW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KimPL04, author = {Sang{-}Wook Kim and Dae{-}Hyun Park and Heon{-}Gil Lee}, title = {Efficient processing of subsequence matching with the Euclidean metric in time-series databases}, journal = {Inf. Process. Lett.}, volume = {90}, number = {5}, pages = {253--260}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.014}, doi = {10.1016/J.IPL.2004.02.014}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KimPL04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KorshL04, author = {James F. Korsh and Paul LaFollette}, title = {Constant time generation of derangements}, journal = {Inf. Process. Lett.}, volume = {90}, number = {4}, pages = {181--186}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.006}, doi = {10.1016/J.IPL.2004.02.006}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KorshL04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KourisMT04, author = {Ioannis N. Kouris and Christos Makris and Athanasios K. Tsakalidis}, title = {Efficient automatic discovery of 'hot' itemsets}, journal = {Inf. Process. Lett.}, volume = {90}, number = {2}, pages = {65--72}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.013}, doi = {10.1016/J.IPL.2004.01.013}, timestamp = {Mon, 01 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KourisMT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KranakisKS04, author = {Evangelos Kranakis and Danny Krizanc and Sunil M. Shende}, title = {Approximate hotlink assignment}, journal = {Inf. Process. Lett.}, volume = {90}, number = {3}, pages = {121--128}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.012}, doi = {10.1016/J.IPL.2004.01.012}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/KranakisKS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LeshMMM04, author = {Neal Lesh and Joe Marks and A. McMahon and Michael Mitzenmacher}, title = {Exhaustive approaches to 2D rectangular perfect packings}, journal = {Inf. Process. Lett.}, volume = {90}, number = {1}, pages = {7--14}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.006}, doi = {10.1016/J.IPL.2004.01.006}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LeshMMM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Liu04, author = {Ding Liu}, title = {A note on point location in arrangements of hyperplanes}, journal = {Inf. Process. Lett.}, volume = {90}, number = {2}, pages = {93--95}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.010}, doi = {10.1016/J.IPL.2004.01.010}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Liu04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Lucas04a, author = {Joan M. Lucas}, title = {A direct algorithm for restricted rotation distance}, journal = {Inf. Process. Lett.}, volume = {90}, number = {3}, pages = {129--134}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.001}, doi = {10.1016/J.IPL.2004.02.001}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Lucas04a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MarkeyS04, author = {Nicolas Markey and Philippe Schnoebelen}, title = {A PTIME-complete matching problem for SLP-compressed words}, journal = {Inf. Process. Lett.}, volume = {90}, number = {1}, pages = {3--6}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.002}, doi = {10.1016/J.IPL.2004.01.002}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MarkeyS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MelanconP04, author = {Guy Melan{\c{c}}on and Fabrice Philippe}, title = {Generating connected acyclic digraphs uniformly at random}, journal = {Inf. Process. Lett.}, volume = {90}, number = {4}, pages = {209--213}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2003.06.002}, doi = {10.1016/J.IPL.2003.06.002}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MelanconP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MontagneE04, author = {Eur{\'{\i}}pides Montagne and Anand Ekambaram}, title = {An optimal storage format for sparse matrices}, journal = {Inf. Process. Lett.}, volume = {90}, number = {2}, pages = {87--92}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.014}, doi = {10.1016/J.IPL.2004.01.014}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MontagneE04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/NikolopoulosNR04, author = {Stavros D. Nikolopoulos and Christos Nomikos and Panos Rondogiannis}, title = {A limit characterization for the number of spanning trees of graphs}, journal = {Inf. Process. Lett.}, volume = {90}, number = {6}, pages = {307--313}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.03.001}, doi = {10.1016/J.IPL.2004.03.001}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/NikolopoulosNR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/NishimuraY04, author = {Harumichi Nishimura and Tomoyuki Yamakami}, title = {Polynomial time quantum computation with advice}, journal = {Inf. Process. Lett.}, volume = {90}, number = {4}, pages = {195--204}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.005}, doi = {10.1016/J.IPL.2004.02.005}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/NishimuraY04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Nivasch04, author = {Gabriel Nivasch}, title = {Cycle detection using a stack}, journal = {Inf. Process. Lett.}, volume = {90}, number = {3}, pages = {135--140}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.016}, doi = {10.1016/J.IPL.2004.01.016}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Nivasch04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ParkerP04, author = {Richard Parker and Andrew Plater}, title = {Addition chains with a bounded number of registers}, journal = {Inf. Process. Lett.}, volume = {90}, number = {5}, pages = {247--252}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.015}, doi = {10.1016/J.IPL.2004.02.015}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ParkerP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Savelli04, author = {A. Savelli}, title = {On numerically decipherable codes and their homophonic partitions}, journal = {Inf. Process. Lett.}, volume = {90}, number = {3}, pages = {103--108}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.010}, doi = {10.1016/J.IPL.2004.02.010}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Savelli04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/SparlZ04, author = {Petra Sparl and Janez Zerovnik}, title = {2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs}, journal = {Inf. Process. Lett.}, volume = {90}, number = {5}, pages = {239--246}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.017}, doi = {10.1016/J.IPL.2004.02.017}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/SparlZ04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/SuYL04, author = {Yih{-}Ching Su and Chu{-}Sing Yang and Chen{-}Wei Lee}, title = {The analysis of packet loss prediction for Gilbert-model with loss rate uplink}, journal = {Inf. Process. Lett.}, volume = {90}, number = {3}, pages = {155--159}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.017}, doi = {10.1016/J.IPL.2004.01.017}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/SuYL04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/SuiWCC04, author = {Hongfei Sui and Jianxin Wang and Jianer Chen and Songqiao Chen}, title = {The cost of becoming anonymous: on the participant payload in Crowds}, journal = {Inf. Process. Lett.}, volume = {90}, number = {2}, pages = {81--86}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.018}, doi = {10.1016/J.IPL.2004.01.018}, timestamp = {Fri, 21 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/SuiWCC04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/SungT04, author = {Shao Chin Sung and Keisuke Tanaka}, title = {Limiting negations in bounded-depth circuits: An extension of Markov's theorem}, journal = {Inf. Process. Lett.}, volume = {90}, number = {1}, pages = {15--20}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.003}, doi = {10.1016/J.IPL.2004.01.003}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/SungT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Tarlecki04, author = {Andrzej Tarlecki}, title = {Editorial}, journal = {Inf. Process. Lett.}, volume = {90}, number = {1}, pages = {1--2}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.02.002}, doi = {10.1016/J.IPL.2004.02.002}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Tarlecki04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Tripakis04, author = {Stavros Tripakis}, title = {Undecidable problems of decentralized observation and control on regular languages}, journal = {Inf. Process. Lett.}, volume = {90}, number = {1}, pages = {21--28}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.004}, doi = {10.1016/J.IPL.2004.01.004}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Tripakis04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Weston04, author = {Mark Weston}, title = {A fixed-parameter tractable algorithm for matrix domination}, journal = {Inf. Process. Lett.}, volume = {90}, number = {5}, pages = {267--272}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2002.12.001}, doi = {10.1016/J.IPL.2002.12.001}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Weston04.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.