A singly-exponential stratification scheme for real semi-algebraic varieties and its applications (English)
National licence
- New search for: Chazelle, Bernard
- New search for: Edelsbrunner, Herbert
- New search for: Guibas, Leonidas J.
- New search for: Sharir, Micha
- New search for: Chazelle, Bernard
- New search for: Edelsbrunner, Herbert
- New search for: Guibas, Leonidas J.
- New search for: Sharir, Micha
In:
Automata, Languages and Programming
;
179-193
;
1989
- Article/Chapter (Book) / Electronic Resource
-
Title:A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
-
Contributors:Chazelle, Bernard ( author ) / Edelsbrunner, Herbert ( author ) / Guibas, Leonidas J. ( author ) / Sharir, Micha ( author )
-
Published in:Automata, Languages and Programming ; 179-193Lecture Notes in Computer Science ; 372 ; 179-193
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:1989-01-01
-
Size:15 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Realizable and unrealizable specifications of reactive systemsAbadi, Martín / Lamport, Leslie / Wolper, Pierre et al. | 1989
- 18
-
Limitations of the upward separation technique (preliminary version)Allender, Eric et al. | 1989
- 31
-
Lower bounds for the low hierarchyAllender, Eric / Hemachandra, Lane A. et al. | 1989
- 46
-
Efficient text searching of regular expressionsBaeza-Yates, Ricardo A. / Gonnet, Gaston H. et al. | 1989
- 63
-
Factors of wordsBeauquier, Danièle / Pin, Jean-Eric et al. | 1989
- 80
-
Asymptotically optimal distributed consensusBerman, Piotr / Garay, Juan A. et al. | 1989
- 95
-
Time lower bounds for CREW-PRAM computation of monotone functionsBilardi, Gianfranco / Moitra, Abha et al. | 1989
- 108
-
Subduing self-applicationBöhm, Corrado et al. | 1989
- 123
-
Everything in NP can be argued in perfect zero-knowledge in a bounded number of roundsBrassard, Gilles / Crépeau, Claude / Yung, Moti et al. | 1989
- 137
-
Polymorphic rewriting conserves algebraic strong normalization and confluenceBreazu-Tannen, Val / Gallier, Jean et al. | 1989
- 151
-
Completion of finite codes with finite deciphering delayBruyere, Véronique et al. | 1989
- 164
-
Relational semantics for recursive types and bounded quantificationCardone, Felice et al. | 1989
- 179
-
A singly-exponential stratification scheme for real semi-algebraic varieties and its applicationsChazelle, Bernard / Edelsbrunner, Herbert / Guibas, Leonidas J. / Sharir, Micha et al. | 1989
- 194
-
About primitive recursive algorithmsColson, Loïc et al. | 1989
- 207
-
The definability of equational graphs in monadic second-order logicCourcelle, B. et al. | 1989
- 222
-
Dominoes and the regularity of DNA splicing languagesCulik, Karel II / Harju, Tero et al. | 1989
- 234
-
Causal treesDarondeau, Ph. / Degano, P. et al. | 1989
- 249
-
Infinite normal formsDershowitz, Nachum / Kaplan, Stéphane / Plaisted, David A. et al. | 1989
- 263
-
On recent trends in algebraic specificationEhrig, H. / Pepper, P. / Orejas, F. et al. | 1989
- 289
-
Automata with storage on infinite wordsEngelfriet, Joost / Hoogeboom, Hendrik Jan et al. | 1989
- 304
-
Parallel algorithmic techniques for combinatorial computationEppstein, David / Galil, Zvi et al. | 1989
- 319
-
On dice and coins: models of computation for random generationFeldman, David / Impagliazzo, Russell / Naor, Moni / Nisan, Noam / Rudich, Steven / Shamir, Adi et al. | 1989
- 341
-
An optimal probabilistic algorithm for synchronous Byzantine agreementFeldman, Paul / Micali, Silvio et al. | 1989
- 379
-
Finding triconnected components by local replacementsFussell, Donald / Ramachandran, Vijaya / Thurimella, Ramakrishna et al. | 1989
- 394
-
An improved algorithm for approximate string matchingGalil, Zvi / Park, Kunsoo et al. | 1989
- 405
-
A pointer-free data structure for merging heaps and min-max heapsGambosi, Giorgio / Nardelli, Enrico / Talamo, Maurizio et al. | 1989
- 423
-
Structured operational semantics and bisimulation as a congruenceGroote, Jan Friso / Vaandrager, Frits et al. | 1989
- 439
-
Parallel retrieval of scattered informationHagerup, Torben / Nowak, Manfred et al. | 1989
- 451
-
Tensor rank is NP-completeHåstad, Johan et al. | 1989
- 461
-
The complexity of nonlinear separable optimizationHochbaum, Dorit S. / Shanthikumar, J. George et al. | 1989
- 473
-
General methods for the analysis of the maximum size of dynamic data structuresKenyon-Mathieu, Claire M. / Vitter, Jeffrey Scott et al. | 1989
- 488
-
How to share concurrent asynchronous wait-free variablesLi, Ming / Vitanyi, Paul M. B. et al. | 1989
- 506
-
A new approach to formal language theory by kolmogorov complexityLi, Ming / Vitanyi, Paul M. B. et al. | 1989
- 521
-
Dynamic algorithms in D.E. Knuth's model: A probabilistic analysisLouchard, G. / Randrianarimanana, B. / Schott, R. et al. | 1989
- 534
-
Completing the temporal pictureManna, Zohar / Pnueli, Amir et al. | 1989
- 559
-
Lower bounds for computations with the floor operationMansour, Yishay / Schieber, Baruch / Tiwari, Prasoon et al. | 1989
- 574
-
Programming, transforming, and proving with function abstractions and memoriesMason, Ian / Talcott, Carolyn et al. | 1989
- 589
-
Automata theory meets circuit complexityMcKenzie, P. / Thérien, D. et al. | 1989
- 603
-
Two versus one index register and modifiable versus non-modifiable programsMehlhorn, K. / Paul, W. J. et al. | 1989
- 610
-
Shortest paths without a mapPapadimitriou, Christos H. / Yannakakis, Mihalis et al. | 1989
- 621
-
Modular system design applying graph grammars techniquesParisi-Presicce, Francesco et al. | 1989
- 637
-
Partial communationsPerrin, Dominique et al. | 1989
- 652
-
On the synthesis of an asynchronous reactive modulePnueli, Amir / Rosner, Roni et al. | 1989
- 672
-
The complexity of controlled selectionPruhs, Kirk / Manber, Udi et al. | 1989
- 687
-
Memory versus randomization in on-line algorithmsRaghavan, Prabhakar / Snir, Marc et al. | 1989
- 704
-
Syntactic control of interference Part 2Reynolds, John C. et al. | 1989
- 723
-
Characteristic formulaeSteffen, Bernhard et al. | 1989
- 733
-
A combinatorial technique for separating counting complexity classesTorán, Jacobo et al. | 1989
- 745
-
Horn programs and semicomputable relations on abstract structuresTucker, J. V. / Zucker, J. I. et al. | 1989
- 761
-
A note on model checking the modal v-calculusWinskel, Glynn et al. | 1989
- 773
-
DI-domains as information systemsZhang, Guo Qiang et al. | 1989