default search action
Information Processing Letters, Volume 85
Volume 85, Number 1, 16 January 2003
- Dimitris J. Kavvadias, Elias C. Stavropoulos:
Monotone Boolean dualization is in co-NP[log2n]. 1-6 - Jun-Ki Min, Jae-Yong Ahn, Chin-Wan Chung:
Efficient extraction of schemas for XML documents. 7-12 - Wilfried Meidl, Arne Winterhof
:
On the linear complexity profile of explicit nonlinear pseudorandom numbers. 13-18 - Elvira Albert, Michael Hanus
A residualizing semantics for the partial evaluation of functional logic programs. 19-25 - Cheng-Yuan Ku, Din-Yuen Chan, Lain-Chyr Hwang:
Optimal reservation policy for two queues in tandem. 27-30 - Jae-Hoon Kim, Kyung-Yong Chwa:
Online deadline scheduling on faster machines. 31-37 - Edgar Chávez
Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. 39-46 - Idit Keidar, Sergio Rajsbaum
A simple proof of the uniform consensus synchronous lower bound. 47-52 - Francis Y. L. Chin, Fu Lee Wang:
Erratum to: "Efficient algorithm for transversal of disjoint convex polygons". 53 - Francis Y. L. Chin, Hong Shen, Fu Lee Wang
Transversal of disjoint convex polygons. 55-60
Volume 85, Number 2, 31 January 2003
- Gwénaël Richomme:
Some non finitely generated monoids of repetition-free endomorphisms. 61-66 - Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev:
On-line restricted assignment of temporary tasks with unknown durations. 67-72 - Marianne Durand:
Asymptotic analysis of an optimized quicksort algorithm. 73-77 - K. Vidyasankar:
A simple group mutual l-exclusion algorithm. 79-85 - Antoine Vigneron
Reporting intersections among thick objects. 87-92 - Jong 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. 93-97 - Chin-Chen Chang, Chi-Yien Chung:
An efficient protocol for anonymous multicast and reception. 99-103 - Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair:
Parametric analysis of overall min-cuts and applications in undirected networks. 105-109 - Amparo Fúster-Sabater, Pedro García-Mochales:
On the balancedness of nonlinear generators of binary sequences. 111-116
Volume 85, Number 3, 14 February 2003
- Wlodzimierz Ogryczak
Minimizing the sum of the k largest functions in linear time. 117-122 - Hélène Touzet:
Tree edit distance with gaps. 123-129 - Ying Miao:
A combinatorial characterization of regular anonymous perfect threshold schemes. 131-135 - Zuhua Shao:
Proxy signature schemes based on factoring. 137-143 - Dhananjay M. Dhamdhere, K. Gururaja, Prajakta G. Ganu:
A compact execution history for dynamic slicing. 145-152 - Chris Giannella, Edward L. Robertson:
A note on approximation measures for multi-valued dependencies in relational databases. 153-158 - Tsung-Chuan Huang, Slo-Li Chu:
A statement based parallelizing framework for processor-in-memory architectures. 159-163 - Guilherme Dias da Fonseca
Kinetic heap-ordered trees: Tight analysis and improved algorithms. 165-169
Volume 85, Number 4, 28 February 2003
- Deshi Ye, Guochuan Zhang
On-line scheduling with extendable working time on a small number of machines. 171-177 - Gennady Pustylnik, Micha Sharir:
The Minkowski sum of a simple polygon and a segment. 179-184 - Chang-Chun Lu, Shi-Chun Tsai:
A note on unscrambling address lines. 185-189 - Takashi Horiyama, Toshihide Ibaraki:
Translation among CNFs, characteristic models and ordered binary decision diagrams. 191-198 - Satoshi Fujita:
On-line grid-packing with a single active grid. 199-204 - Po-Hsueh Huang, Yin-Te Tsai, Chuan Yi Tang:
A fast algorithm for the alpha-connected two-center decision problem. 205-210 - Doratha E. Drake
A simple approximation algorithm for the weighted matching problem. 211-213 - Jong Ha Ko, Sang-Hee Kim, Jong-Kyu Lee:
An ENA algorithm to enhance the performance of TCP over satellite links. 215-219 - Jurriaan Hage:
Enumerating submultisets of multisets. 221-226
Volume 85, Number 5, 16 March 2003
- Richard Cole, Costas S. Iliopoulos, Thierry Lecroq
On special families of morphisms related to [delta]-matching and don't care symbols. 227-233 - Jean Marcel Pallo:
Generating binary trees by Glivenko classes on Tamari lattices. 235-238 - Ferdinando Cicalese, Ugo Vaccaro:
Binary search with delayed and missing answers. 239-247 - Jan Poland:
Finding smooth maps is NP-complete. 249-253 - Jayadev Misra:
Derivation of a parallel string matching algorithm. 255-260 - Guillaume Fertin
On the oriented chromatic number of grids. 261-266 - Ming Li, John Tromp
Sharpening Occam's razor. 267-274 - Desh Ranjan, Enrico Pontelli
The Level-Ancestor problem on Pure Pointer Machines. 275-283
Volume 85, Number 6, 31 March 2003
- Olivier Serre:
Note on winning positions on pushdown games with [omega]-regular conditions. 285-291 - Yury Lifshits:
A lower bound on the size of ε-free NFA corresponding to a regular expression. 293-299 - Noga Alon:
A simple algorithm for edge-coloring bipartite multigraphs. 301-302 - Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz:
Drawing K2, n: A lower bound. 303-305 - Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy:
A combinatorial algorithm for MAX CSP. 307-315 - Ioan Cristian Trelea
The particle swarm optimization algorithm: convergence analysis and parameter selection. 317-325 - Markus Bläser:
Computing small partial coverings. 327-331 - Sinichiro Kawano, Koichi Yamazaki
Worst case analysis of a greedy algorithm for graph thickness. 333-337 - Chi-Sung Laih, Shin Yan Chiou:
Cryptanalysis of an optimized protocol for mobile network authentication and security. 339-341
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.
last updated on 2024-12-22 19:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: