Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 74
Volume 74, Numbers 1-2, April 2000
- Johan Håstad
:
On bounded occurrence constraint satisfaction. 1-6 - François Bertault:
A force-directed algorithm that preserves edge-crossing properties. 7-13 - Manfred Göbel:
Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order. 15-18 - Alok Baveja, Aravind Srinivasan:
Approximating low-congestion routing and column-restricted packing problems. 19-25 - Jean-Marc Talbot:
The forall-exists2 fragment of the first-order theory of atomic set constraints is Pi01-hard. 27-33 - Joachim Niehren, Sophie Tison, Ralf Treinen:
On rewrite constraints and context unification. 35-40 - Arnold Schönhage:
Variations on computing reciprocals of power series. 41-46 - Margus Veanes:
Farmer's Theorem revisited. 47-53 - Carlos H. C. Duarte, T. S. E. Maibaum:
A rely-guarantee discipline for open distributed systems design. 55-63 - Theodosis Dimitrakos, T. S. E. Maibaum:
On a generalized modularization theorem. 65-71 - Wolfgang W. Bein, Lawrence L. Larmore:
Trackless online algorithms for the server problem. 73-79 - Antoine Vigneron, Lixin Gao, Mordecai J. Golin, Giuseppe F. Italiano, Bo Li:
An algorithm for finding a k-median in a directed tree. 81-88 - Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe:
Corrigendum to "Upward separation for FewP and related classes". 89
Volume 74, Numbers 3-4, 31 May 2000
- Ingo Wegener:
Worst case examples for operations on OBDDs. 91-96 - Sarnath Ramnath, Peiyi Zhao:
On the isomorphism of expressions. 97-102 - Kuo-Liang Chung:
On finding medians of weighted discrete points. 103-106 - Harold N. Gabow:
Path-based depth-first search for strong and biconnected components. 107-114 - Ton Kloks, Dieter Kratsch, Haiko Müller:
Finding and counting small induced subgraphs efficiently. 115-121 - Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A fast cost scaling algorithm for submodular flow. 123-128 - Stavros D. Nikolopoulos:
Recognizing cographs and threshold graphs through a classification of their edges. 129-139 - Laurent Granvilliers, Gaétan Hains:
A conservative scheme for parallel interval narrowing. 141-146 - Agostino Dovier, Enrico Pontelli, Gianfranco Rossi:
A necessary condition for Constructive Negation in Constraint Logic Programming. 147-156 - Dimitris J. Kavvadias, Martha Sideri, Elias C. Stavropoulos:
Generating all maximal models of a Boolean expression. 157-162 - Joseph Kee-Yin Ng, Shibin Song, Wei Zhao:
Statistical delay analysis on an ATM switch with self-similar input traffic. 163-173 - Markus Schneider:
On distribution properties of sequences with perfect linear complexity profile. 175-182
Volume 74, Numbers 5-6, 30 June 2000
- Cao An Wang, Francis Y. L. Chin, Boting Yang:
Triangulations without minimum-weight drawing. 183-189 - Palash Sarkar:
A note on the spectral characterization of correlation immune Boolean functions. 191-195 - Pavel Pudlák:
A note on the use of determinant for proving lower bounds on the size of linear circuits. 197-201 - Jérôme Olivier Durand-Lose:
Randomized uniform self-stabilizing mutual exclusion. 203-207 - Jae Dong Yang:
A concept-based query evaluation with indefinite fuzzy triples. 209-214 - Sukhamay Kundu:
An optimal O(N2) algorithm for computing the min-transitive closure of a weighted graph. 215-220 - Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, Pierre Wolper:
An efficient automata approach to some problems on context-free grammars. 221-227 - Weimin Chen:
Multi-subsequence searching. 229-233 - Byoung Mo Im, Myoung-Ho Kim, Hyung-Il Kang, Jae Soo Yoo:
Declustering signature files based on a dynamic measure. 235-241 - Alfredo De Santis, Barbara Masucci:
On secret set schemes. 243-251 - Gautam Das, Michiel H. M. Smid:
A lower bound for approximating the geometric minimum weight matching. 253-255 - Jenn-Wei Lin, Sy-Yen Kuo:
Resolving error propagation in distributed systems. 257-262 - Samir Khuller:
Addendum to "An O(|V|2) algorithm for single connectedness". 263
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-25 04:40 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:
