@article{Markey-Schnoebelen/04,
AUTHOR = {Markey, N. and Schnoebelen, Ph.},
TITLE = {A PTIME-complete matching problem for SLP-compressed words},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {1},
PAGES = {3-6},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, pattern-matching, compressed strings, complexity},
URL = {DOI:10.1016/j.ipl.2004.01.002},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lesh-Marks-McMahon-Mitzenmacher/04,
AUTHOR = {Lesh, N. and Marks, J. and McMahon, A. and Mitzenmacher, M.},
TITLE = {Exhaustive approaches to 2D rectangular perfect packings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {1},
PAGES = {7-14},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {perfect packing, strip packing problem, branch-and-bound, algorithms},
URL = {DOI:10.1016/j.ipl.2004.01.006},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sung-Tanaka/04,
AUTHOR = {Sung, Shao Chin and Tanaka, Keisuke},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, circuit complexity, negation-limited circuits},
URL = {DOI:10.1016/j.ipl.2004.01.003},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tripakis/04,
AUTHOR = {Tripakis, Stavros},
TITLE = {Undecidable problems of decentralized observation and control on regular languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {1},
PAGES = {21-28},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed systems, observation, control, synthesis, undecidability},
URL = {DOI:10.1016/j.ipl.2004.01.004},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diaconescu/04,
AUTHOR = {Diaconescu, R{\u{a}}zvan},
TITLE = {Herbrand theorems in arbitrary institutions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {1},
PAGES = {29-37},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {institutions, logic programming, Herbrand theorems, specification languages, formal methods},
URL = {DOI:10.1016/j.ipl.2004.01.005},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Friedman-Mostefaoui-Raynal/04,
AUTHOR = {Friedman, Roy and Mostefaoui, Achour and Raynal, Michel},
TITLE = {A weakest failure detector-based asynchronous consensus protocol for $f < n$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {1},
PAGES = {39-46},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {asynchronous distributed system, consensus, distributed algorithms, fault tolerance, process crash, unreliable failure detector},
URL = {DOI:10.1016/j.ipl.2004.01.001},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kallahalla-Varman/04,
AUTHOR = {Kallahalla, Mahesh and Varman, Peter J.},
TITLE = {Analysis of simple randomized buffer management for parallel I/O},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {1},
PAGES = {47-52},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {parallel I/O, prefetching, caching, buffer management, analysis of algorithms, randomization, competitive ratio},
URL = {DOI:10.1016/j.ipl.2004.01.009},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cholvi-Bernabeu/04,
AUTHOR = {Cholvi, Vicent and Bernab{\'e}u, Josep},
TITLE = {Relationships between memory models},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {2},
PAGES = {53-58},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, memory models, consistency models, distributed systems, concurrency},
URL = {DOI:10.1016/j.ipl.2004.01.007},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fujito-Doi/04,
AUTHOR = {Fujito, Toshihiro and Doi, Takashi},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, parallel algorithms, connected vertex cover, tree cover},
URL = {DOI:10.1016/j.ipl.2004.01.011},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kouris-Makris-Tsakalidis/04,
AUTHOR = {Kouris, Ioannis N. and Makris, Christos H. and Tsakalidis, Athanasios K.},
TITLE = {Efficient automatic discovery of ''hot'' itemsets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {2},
PAGES = {65-72},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data mining, association rules, hot itemsets, databases, algorithms},
URL = {DOI:10.1016/j.ipl.2004.01.013},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{AlWehaibi-Kadoch-Agarwal-ElHakeem/04,
AUTHOR = {AlWehaibi, Abdullah and Kadoch, Michael and Agarwal, Anjali and ElHakeem, Ahmed},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, packet loss, multicast, IP, MPLS},
URL = {DOI:10.1016/j.ipl.2004.01.008},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sui-Wang-Chen-Chen/04,
AUTHOR = {Sui, Hongfei and Wang, Jianxin and Chen, Jianer and Chen, Songqiao},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {anonymous communication, security in digital systems, crowds},
URL = {DOI:10.1016/j.ipl.2004.01.018},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Montagne-Ekambaram/04,
AUTHOR = {Montagne, Eur{\'{\i}}pides and Ekambaram, Anand},
TITLE = {An optimal storage format for sparse matrices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {2},
PAGES = {87-92},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {sparse matrix, matrix vector product, data structures},
URL = {DOI:10.1016/j.ipl.2004.01.014},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu/04,
AUTHOR = {Liu, Ding},
TITLE = {A note on point location in arrangements of hyperplanes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {2},
PAGES = {93-95},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, point location, hyperplane arrangements},
URL = {DOI:10.1016/j.ipl.2004.01.010},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{di_Giacomo-Liotta-Patrignani/04,
AUTHOR = {di Giacomo, Emilio and Liotta, Giuseppe and Patrignani, Maurizio},
TITLE = {A note on 3D orthogonal drawings with direction constrained edges},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {2},
PAGES = {97-101},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {3D orthogonal drawings, computational geometry},
URL = {DOI:10.1016/j.ipl.2004.01.015},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Savelli/04,
AUTHOR = {Savelli, A.},
TITLE = {On numerically decipherable codes and their homophonic partitions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {3},
PAGES = {103-108},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, cumerically decipherable code, comophonically decipherable code, homophonic partition, multivalued encoding},
URL = {DOI:10.1016/j.ipl.2004.02.010},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kerenidis-de_Wolf/04,
AUTHOR = {Kerenidis, Iordanis and de Wolf, Ronald},
TITLE = {Quantum symmetrically-private information retrieval},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {3},
PAGES = {109-114},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {private information retrieval, information retrieval, user privacy, data privacy, quantum computing},
URL = {DOI:10.1016/j.ipl.2004.02.003},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Iwama-Yonezawa/04,
AUTHOR = {Iwama, Kazuo and Yonezawa, Kouki},
TITLE = {The orthogonal $CNN$ problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {3},
PAGES = {115-120},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, competitive analysis, server problems},
URL = {DOI:10.1016/j.ipl.2004.01.022},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kranakis-Krizanc-Shende/04,
AUTHOR = {Kranakis, Evangelos and Krizanc, Danny and Shende, Sunil},
TITLE = {Approximate hotlink assignment},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {3},
PAGES = {121-128},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, hotlink, probability distribution, web, tree},
URL = {DOI:10.1016/j.ipl.2004.01.012},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lucas/04a,
AUTHOR = {Lucas, Joan M.},
TITLE = {A direct algorithm for restricted rotation distance},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {3},
PAGES = {129-134},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, data structures, combinatorial problems, binary trees},
URL = {DOI:10.1016/j.ipl.2004.02.001},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nivasch/04,
AUTHOR = {Nivasch, Gabriel},
TITLE = {Cycle detection using a stack},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {3},
PAGES = {135-140},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cycle detection, algorithms, analysis of algorithms, stack, time/memory tradeoff, random function},
URL = {DOI:10.1016/j.ipl.2004.01.016},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bereg/04,
AUTHOR = {Bereg, Sergey},
TITLE = {Transforming pseudo-triangulations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {3},
PAGES = {141-145},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {pseudo-triangles, pseudo-triangulations, flips, analysis of algorithms, computational geometry, triangulation of a polygon},
URL = {DOI:10.1016/j.ipl.2004.01.021},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cai-Watanabe/04,
AUTHOR = {Cai, Jin-Yi and Watanabe, Osamu},
TITLE = {Relativized collapsing between $BPP$ and $PH$ under stringent oracle access},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {3},
PAGES = {147-154},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, stringent relativization, polynomial hierarchy, switching lemma, decision tree complexity, bounded error probabilistic polynomial time},
URL = {DOI:10.1016/j.ipl.2004.02.004},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Su-Yang-Lee/04,
AUTHOR = {Su, Yih-Ching and Yang, Chu-Sing and Lee, Chen-Wei},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {packet loss prediction, Gilbert-model, loss rate uplink, algorithms, FEC, joint source-channel coding},
URL = {DOI:10.1016/j.ipl.2004.01.017},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Doberkat/04,
AUTHOR = {Doberkat, Ernst-Erich},
TITLE = {Factoring stochastic relations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {4},
PAGES = {161-166},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {concurrency, stochastic relations, congruences, factor systems},
URL = {DOI:10.1016/j.ipl.2004.02.009},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Freschi-Bogliolo/04,
AUTHOR = {Freschi, Valerio and Bogliolo, Alessandro},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, longest common subsequence, run-length encoding, string comparison, parallel processing},
URL = {DOI:10.1016/j.ipl.2004.02.011},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chin-de_Santis-Ferrara-Ho-Kim/04,
AUTHOR = {Chin, Francis Y.L. and de Santis, Alfredo and Ferrara, Anna Lisa and Ho, N.L. and Kim, S.K.},
TITLE = {A simple algorithm for the constrained sequence problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {4},
PAGES = {175-179},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {constrained longest common subsequence, algorithms, dynamic programming, sequence alignment},
URL = {DOI:10.1016/j.ipl.2004.02.008},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Korsh-LaFollette/04,
AUTHOR = {Korsh, James F. and LaFollette, Paul S.},
TITLE = {Constant time generation of derangements},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {4},
PAGES = {181-186},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, loopless, derangements, gray code, fixed points},
URL = {DOI:10.1016/j.ipl.2004.02.006},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gerbessiotis-Siniolakis/04,
AUTHOR = {Gerbessiotis, Alexandros V. and Siniolakis, Constantinos J.},
TITLE = {Probabilistic integer sorting},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {4},
PAGES = {187-193},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, integer sorting, sorting uniform keys},
URL = {DOI:10.1016/j.ipl.2004.02.007},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nishimura-Yamakami/04,
AUTHOR = {Nishimura, Harumichi and Yamakami, Tomoyuki},
TITLE = {Polynomial time quantum computation with advice},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {4},
PAGES = {195-204},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, quantum circuit, advice function},
URL = {DOI:10.1016/j.ipl.2004.02.005},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Harvey-Munro/04,
AUTHOR = {Harvey, Nicholas J.A. and Munro, J. Ian},
TITLE = {Deterministic SkipNet},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {4},
PAGES = {205-208},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, distributed computing, overlay networks},
URL = {DOI:10.1016/j.ipl.2004.01.019},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Melancon-Philippe/04,
AUTHOR = {Melan{\c{c}}on, Guy and Philippe, Fabrice},
TITLE = {Generating connected acyclic digraphs uniformly at random},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {4},
PAGES = {209-213},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, random generation, simply connected acyclic directed graphs},
URL = {DOI:10.1016/j.ipl.2003.06.002},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guillaume-Latapy/04,
AUTHOR = {Guillaume, Jean-Loup and Latapy, Matthieu},
TITLE = {Bipartite structure of all complex networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {5},
PAGES = {215-221},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graphs, interconnection networks, modelling, bipartite graphs},
URL = {DOI:10.1016/j.ipl.2004.03.007},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ager-Danvy-Midtgaard/04,
AUTHOR = {Ager, Mads Sig and Danvy, Olivier and Midtgaard, Jan},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {functional programming, program derivation, interpreters, abstract machines, closure conversion, cps transformation, defunctionalization},
URL = {DOI:10.1016/j.ipl.2004.02.012},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bunde/04,
AUTHOR = {Bunde, David P.},
TITLE = {SPT is optimally competitive for uniprocessor flow},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {5},
PAGES = {233-238},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, on-line algorithms, scheduling},
URL = {DOI:10.1016/j.ipl.2004.02.013},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sparl-Zerovnik/04,
AUTHOR = {{\v{S}}parl, Petra and {\v{Z}}erovnik, Janez},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, approximation algorithms, graph coloring, frequency planning, cellular networks, 2-local distributed algorithms},
URL = {DOI:10.1016/j.ipl.2004.02.017},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Parker-Plater/04,
AUTHOR = {Parker, Richard and Plater, Andrew},
TITLE = {Addition chains with a bounded number of registers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {5},
PAGES = {247-252},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {exponentiation, addition chains, analysis of algorithms},
URL = {DOI:10.1016/j.ipl.2004.02.015},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kim-Park-Lee/04,
AUTHOR = {Kim, Sang-Wook and Park, Dae-Hyun and Lee, Heon-Gil},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data mining, subsequence matching, time-series databases, databases},
URL = {DOI:10.1016/j.ipl.2004.02.014},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alvarez-Blesa-Daz-Fernandez-Serna/04,
AUTHOR = {{\`A}lvarez, C. and Blesa, M. and D{\'{\i}}az, J. and Fern{\'a}ndez, A. and Serna, M.},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, packet-switched interconnection networks, interconnection networks, adversarial queueing theory, greedy scheduling protocols, network stability},
URL = {DOI:10.1016/j.ipl.2004.02.016},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Weston/04,
AUTHOR = {Weston, Mark},
TITLE = {A fixed-parameter tractable algorithm for matrix domination},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {5},
PAGES = {267-272},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, parameterized complexity, graph algorithms, analysis of algorithms},
URL = {DOI:10.1016/j.ipl.2002.12.001},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Breit/04,
AUTHOR = {Breit, J.},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, flow shop scheduling, worst-case analysis},
URL = {DOI:10.1016/j.ipl.2004.03.004},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Lin-Lee/04,
AUTHOR = {Chang, Maw-Shang and Lin, Chin-Hua and Lee, Chuan-Min},
TITLE = {New upper bounds on feedback vertex numbers in butterflies},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {6},
PAGES = {279-285},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, butterfly, feedback vertex sets},
URL = {DOI:10.1016/j.ipl.2004.03.005},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hierons/04,
AUTHOR = {Hierons, R.M.},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {finite state machine, test generation algorithm, reset, minimization, graph algorithms},
URL = {DOI:10.1016/j.ipl.2004.03.003},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ji-Tang-Guo/04,
AUTHOR = {Ji, Mingjun and Tang, Huanwen and Guo, Juan},
TITLE = {A single-point mutation evolutionary programming},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {6},
PAGES = {293-299},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {single-point mutation, classical evolutionary programming, fast evolutionary programming, generalized evolutionary programming, algorithms},
URL = {DOI:10.1016/j.ipl.2004.03.002},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chockler-Gutfreund/04,
AUTHOR = {Chockler, Hana and Gutfreund, Dan},
TITLE = {A lower bound for testing juntas},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {90},
NUMBER = {6},
PAGES = {301-305},
YEAR = {2004},
EDITOR = {Tarlecki, A.},
KEYWORDS = {property testing, boolean functions, computational complexity, randomized algorithms},
URL = {DOI:10.1016/j.ipl.2004.01.023},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nikolopoulos-Nomikos-Rondogiannis/04,
AUTHOR = {Nikolopoulos, S.D. and Nomikos, C. and Rondogiannis, P.},
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},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graphs, spanning trees, combinatorial problems},
URL = {DOI:10.1016/j.ipl.2004.03.001},
PUBLISHER = {Elsevier Science B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}