Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 79
Volume 79, Number 1, 31 May 2001
- Kuo-Liang Chung, Wen-Ming Yan:
An efficient algorithm for the Fourier transform on a compressed image in restricted quadtree and shading format. 1-5 - Ferucio Laurentiu Tiplea, Erkki Mäkinen
:
A note on synchronized extension systems. 7-9 - Yu-Wei Chen, Kuo-Liang Chung:
Fault-tolerant algorithm for Fast Fourier Transform on hypercubes. 11-16 - Alessandro Agnetis, Paolo Detti, Carlo Meloni, Dario Pacciarelli:
A linear algorithm for the Hamiltonian completion number of the line graph of a tree. 17-24 - Gautam B. Singh, Donglin Liu:
Sequence retrieval from genomic databases. 25-32 - Eric C. R. Hehner:
Variables and scopes considered formally. 33-38 - Neil C. Audsley:
On priority assignment in fixed priority scheduling. 39-44 - Franz Wotawa:
A variant of Reiter's hitting-set algorithm. 45-51
Volume 79, Number 2, 30 June 2001
- Gianluca De Marco, Andrzej Pelc:
Faster broadcasting in unknown radio networks. 53-56 - Jochen Burghardt, Florian Kammüller, Jeff W. Sanders:
On the antisymmetry of Galois embeddings. 57-63 - Kalim Qureshi, Masahiko Hatanaka:
A practical approach of task scheduling and load balancing on heterogeneous distributed raytracing systems. 65-71 - Kien-Weh Chin, Hsu-Chun Yen:
The symmetry number problem for trees. 73-79 - Enrico Nardelli, Guido Proietti, Peter Widmayer:
A faster computation of the most vital edge of a shortest path. 81-85 - Catherine McCartin:
An improved algorithm for the jump number problem. 87-92 - Claus-Peter Schnorr:
Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys. 93-98 - Rachid Guerraoui:
On the hardness of failure-sensitive agreement problems. 99-104
Volume 79, Number 3, 31 July 2001
- Christof Löding:
Efficient minimization of deterministic weak omega-automata. 105-109 - Jan Van den Bussche:
Rewriting queries using views over monadic database schemas. 111-114 - Xuehou Tan:
Optimal computation of the Voronoi diagram of disjoint clusters. 115-119 - Friedrich Eisenbrand:
Short vectors of planar lattices via continued fractions. 121-126 - Kil-Hyun Jeong, Jong-Kyu Lee, Hee-Kuck Oh:
Performance analysis of a multicasting protocol with contention-less minislots. 127-133 - Lusheng Chen, Fang-Wei Fu, Victor K. Wei:
On the constructions of highly nonlinear zigzag functions and unbiased functions. 135-140 - Stavros S. Cosmadakis, Gabriel M. Kuper, Leonid Libkin:
On the orthographic dimension of definable sets. 141-145 - József Békési, Gábor Galambos:
Worst-case analysis of the Iterated Longest Fragment algorithm. 147-153
Volume 79, Number 4, 15 August 2001
- Piotr Chrzastowski-Wachtel, Jerzy Tyszkiewicz, Achim G. Hoffmann, Arthur Ramer:
Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker. 155-160 - Jaap-Henk Hoepman:
Can an operation both update the state and return a meaningful value in the asynchronous PRAM model? 161-166 - Pantelimon Stanica, Soo Hak Sung:
Improving the nonlinearity of certain balanced Boolean functions with good local and global avalanche characteristics. 167-172 - Emanuel Knill, Raymond Laflamme:
Quantum computing and quadratically signed weight enumerators. 173-179 - Uriel Feige, Marek Karpinski, Michael Langberg:
A note on approximating Max-Bisection on regular graphs. 181-188 - Valmir Carneiro Barbosa, Mario R. F. Benevides, Ayru L. Oliveira Filho:
A priority dynamics for generalized drinking philosophers. 189-195 - Graham Hutton, Jeremy Gibbons:
The generic approximation lemma. 197-201
Volume 79, Number 5, 15 September 2001
- Robert Fidytek, Andrzej Wlodzimierz Mostowski, Rafal Somla, Andrzej Szepietowski:
Algorithms counting monotone Boolean functions. 203-209 - Ilya Shmulevich, Aleksey D. Korshunov, Jaakko Astola:
Almost all monotone Boolean functions are polynomially learnable using membership queries. 211-213 - Binay K. Bhattacharya, Robert Benkoczi:
On computing the optimal bridge between two convex polygons. 215-221 - Brona Brejová:
Analyzing variants of Shellsort. 223-227 - D. P. Wang:
An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons. 229-236 - Adrian Dumitrescu, William L. Steiger:
Space-time trade-offs for some ranking and searching queries. 237-241 - Rahul Santhanam:
Lower bounds on the complexity of recognizing SAT by Turing machines. 243-247 - Alex de V. Garcia, Edward Hermann Haeusler:
Code migration and program maintainability A categorical perspective. 249-254
Volume 79, Number 6, 30 September 2001
- Paola Bonizzoni, Claudio Ferretti, Giancarlo Mauri, Rosalba Zizza:
Separating some splicing models. 255-259 - Toshihiro Fujito:
On approximability of the independent/connected edge dominating set problems. 261-266 - Rocco A. Servedio:
On the limits of efficient teachability. 267-272 - Guohua Wan, Benjamin P.-C. Yen, Chung-Lun Li:
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. 273-280 - Wendy J. Myrvold, Frank Ruskey:
Ranking and unranking permutations in linear time. 281-284 - Sachin B. Patkar, H. Narayanan:
A note on optimal covering augmentation for graphic polymatroids. 285-290 - Svetlana A. Kravchenko, Frank Werner:
A heuristic algorithm for minimizing mean flow time with unit setups. 291-296 - Jie Wu, Li Sheng:
An efficient sorting algorithm for a sequence of kings in a tournament. 297-299
a service of 
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-04-17 20:30 CEST 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:
