Journal: Inf. Process. Lett.

Volume 85, Issue 6

285 -- 291Olivier Serre. Note on winning positions on pushdown games with [omega]-regular conditions
293 -- 299Yury Lifshits. A lower bound on the size of [epsiv]-free NFA corresponding to a regular expression
301 -- 302Noga Alon. A simple algorithm for edge-coloring bipartite multigraphs
303 -- 305Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz. Drawing K::2, n::: A lower bound
307 -- 315Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy. A combinatorial algorithm for MAX CSP
317 -- 325Ioan Cristian Trelea. The particle swarm optimization algorithm: convergence analysis and parameter selection
327 -- 331Markus Bläser. Computing small partial coverings
333 -- 337Sinichiro Kawano, Koichi Yamazaki. Worst case analysis of a greedy algorithm for graph thickness
339 -- 341Chi-Sung Laih, Shin Yan Chiou. Cryptanalysis of an optimized protocol for mobile network authentication and security

Volume 85, Issue 5

227 -- 233Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter. On special families of morphisms related to [delta]-matching and don t care symbols
235 -- 238Jean Marcel Pallo. Generating binary trees by Glivenko classes on Tamari lattices
239 -- 247Ferdinando Cicalese, Ugo Vaccaro. Binary search with delayed and missing answers
249 -- 253Jan Poland. Finding smooth maps is NP-complete
255 -- 260Jayadev Misra. Derivation of a parallel string matching algorithm
261 -- 266Guillaume Fertin, André Raspaud, Arup Roychowdhury. On the oriented chromatic number of grids
267 -- 274Ming Li, John Tromp, Paul M. B. Vitányi. Sharpening Occam s razor
275 -- 283Desh Ranjan, Enrico Pontelli. The Level-Ancestor problem on Pure Pointer Machines

Volume 85, Issue 4

171 -- 177Deshi Ye, Guochuan Zhang. On-line scheduling with extendable working time on a small number of machines
179 -- 184Gennady Pustylnik, Micha Sharir. The Minkowski sum of a simple polygon and a segment
185 -- 189Chang-Chun Lu, Shi-Chun Tsai. A note on unscrambling address lines
191 -- 198Takashi Horiyama, Toshihide Ibaraki. Translation among CNFs, characteristic models and ordered binary decision diagrams
199 -- 204Satoshi Fujita. On-line grid-packing with a single active grid
205 -- 210Po-Hsueh Huang, Yin-Te Tsai, Chuan Yi Tang. A fast algorithm for the alpha-connected two-center decision problem
211 -- 213Doratha E. Drake, Stefan Hougardy. A simple approximation algorithm for the weighted matching problem
215 -- 219Jong Ha Ko, Sang-Hee Kim, Jong-Kyu Lee. An ENA algorithm to enhance the performance of TCP over satellite links
221 -- 226Jurriaan Hage. Enumerating submultisets of multisets

Volume 85, Issue 3

117 -- 122Wlodzimierz Ogryczak, Arie Tamir. Minimizing the sum of the k largest functions in linear time
123 -- 129Hélène Touzet. Tree edit distance with gaps
131 -- 135Ying Miao. A combinatorial characterization of regular anonymous perfect threshold schemes
137 -- 143Zuhua Shao. Proxy signature schemes based on factoring
145 -- 152Dhananjay M. Dhamdhere, K. Gururaja, Prajakta G. Ganu. A compact execution history for dynamic slicing
153 -- 158Chris Giannella, Edward L. Robertson. A note on approximation measures for multi-valued dependencies in relational databases
159 -- 163Tsung-Chuan Huang, Slo-Li Chu. A statement based parallelizing framework for processor-in-memory architectures
165 -- 169Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo. Kinetic heap-ordered trees: Tight analysis and improved algorithms

Volume 85, Issue 2

61 -- 66Gwénaël Richomme. Some non finitely generated monoids of repetition-free endomorphisms
67 -- 72Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev. On-line restricted assignment of temporary tasks with unknown durations
73 -- 77Marianne Durand. Asymptotic analysis of an optimized quicksort algorithm
79 -- 85K. Vidyasankar. A simple group mutual l-exclusion algorithm
87 -- 92Antoine Vigneron. Reporting intersections among thick objects
93 -- 97Jong-Min Kim, Donghee Lee, Sam H. Noh, Sang Lyul Min, Yookun Cho, Chong-Sang Kim. An accurate and practical buffer allocation model for the buffer cache based on marginal gains
99 -- 103Chin-Chen Chang, Chi-Yien Chung. An efficient protocol for anonymous multicast and reception
105 -- 109Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair. Parametric analysis of overall min-cuts and applications in undirected networks
111 -- 116Amparo Fúster-Sabater, Pedro García-Mochales. On the balancedness of nonlinear generators of binary sequences

Volume 85, Issue 1

1 -- 6Dimitris J. Kavvadias, Elias C. Stavropoulos. Monotone Boolean dualization is in co-NP[log:::2:::n]
7 -- 12Jun-Ki Min, Jae-Yong Ahn, Chin-Wan Chung. Efficient extraction of schemas for XML documents
13 -- 18Wilfried Meidl, Arne Winterhof. On the linear complexity profile of explicit nonlinear pseudorandom numbers
19 -- 25Elvira Albert, Michael Hanus, Germán Vidal. A residualizing semantics for the partial evaluation of functional logic programs
27 -- 30Cheng-Yuan Ku, Din-Yuen Chan, Lain-Chyr Hwang. Optimal reservation policy for two queues in tandem
31 -- 37Jae-Hoon Kim, Kyung-Yong Chwa. Online deadline scheduling on faster machines
39 -- 46Edgar Chávez, Gonzalo Navarro. Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces
47 -- 52Idit Keidar, Sergio Rajsbaum. A simple proof of the uniform consensus synchronous lower bound
53 -- 0Francis Y. L. Chin, Fu Lee Wang. Erratum to: Efficient algorithm for transversal of disjoint convex polygons
55 -- 60Francis Y. L. Chin, Hong Shen, Fu Lee Wang. Transversal of disjoint convex polygons