default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 76
Volume 76, Numbers 1-2, 20 November 2000
- Riccardo Focardi
, Flaminia L. Luccio, David Peleg:
Feedback vertex set in hypercubes. 1-5 - Sergei Bespamyatnikh, Michael Segal:
Enumerating longest increasing subsequences and patience sorting. 7-11 - Ryuhei Uehara, Zhi-Zhong Chen:
Parallel approximation algorithms for maximum weighted matching in general graphs. 13-17 - Tomasz Borzyszkowski:
Generalized interpolation in CASL. 19-24 - Lanfranco Lopriore:
Protection in a single-address-space environment. 25-32 - Matthias Schonlau, Martin Theus:
Detecting masquerades in intrusion detection based on unpopular commands. 33-38 - Joan Serra-Sagristà:
Enumeration of lattice points in l1 norm. 39-44 - Jue Xue, Ju Liu:
A network-flow-based lower bound for the minimum weighted integer coloring problem. 45-50 - Joep Aerts, Jan H. M. Korst, Sebastian Egner:
Random duplicate storage strategies for load balancing in multimedia servers. 51-59 - Jin-yi Cai, Ajay Nerurkar:
A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. 61-66 - L. Javier García-Villalba, Amparo Fúster-Sabater:
On the linear complexity of the sequences generated by nonlinear filterings. 67-73 - Chu Min Li:
Equivalency reasoning to solve a class of hard SAT problems. 75-81 - Francesc Comellas, Javier Ozón, Joseph G. Peters:
Deterministic small-world communication networks. 83-90 - Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto:
Evolutionary graph colouring. 91-94
Volume 76, Number 3, 15 December 2000
- Igor E. Shparlinski:
Linear complexity of the Naor-Reingold pseudo-random function. 95-99 - Akira Higuchi, Naofumi Takagi:
A fast addition algorithm for elliptic curve arithmetic in GF(2n) using projective coordinates. 101-103 - Keon-Jik Lee, Kee-Young Yoo:
Linear systolic multiplier/squarer for fast exponentiation. 105-111 - Kuo-Liang Chung, Wen-Ming Yan:
On the number of spanning trees of a multi-complete/star related graph. 113-119 - Ho-Hyun Park, Chin-Wan Chung:
Complexity of estimating multi-way join result sizes for area skewed spatial data. 121-129 - Leslie Lamport, Sharon E. Perl, William E. Weihl:
When does a correct mutual exclusion algorithm guarantee mutual exclusion? 131-134 - Hyun-Sung Kim, Sung-Woo Lee, Kee-Young Yoo:
Partitioned systolic architecture for modular multiplication in GF(2m). 135-139 - Florian Roussel, Irena Rusu:
Recognizing i-triangulated graphs in O(mn) time. 141-147
Volume 76, Number 4-6, 31 December 2000
- Leah Epstein:
A note on on-line scheduling with precedence constraints on identical machines. 149-153 - Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore:
Limited bookmark randomized online algorithms for the paging problem. 155-162 - Xuehou Tan:
On optimal bridges between two convex regions. 163-168 - Limin Xiang, Kazuo Ushijima, Changjie Tang:
Efficient loopless generation of Gray codes for k-ary trees. 169-174 - Erez Hartuv, Ron Shamir:
A clustering algorithm based on graph connectivity. 175-181
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-11-22 19:43 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:
