Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 158
Volume 158, Numbers 1&2, 20 May 1996
- Joaquim Gabarró, Conrado Martinez
, Xavier Messeguer:
A Design of a Parallel Dictionary Using Skip Lists. 1-33 - Michel Koskas:
About the p-Paperfolding Words. 35-51 - Afonso Ferreira, Miltos D. Grammatikakis:
Randomized Routing on Generalized Hypercubes. 53-64 - Stéphane Fabre:
Dépendance de systèmes de numération associés à des puissances d'un nombre de Pisot. 65-79 - Natasa Jonoska:
Sofic Shifts with Synchronizing Presentations. 81-115 - Marc Demange, Vangelis Th. Paschos:
On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory. 117-141 - Yoram Hirshfeld, Mark Jerrum, Faron Moller:
A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. 143-159 - Taishin Y. Nishida, Arto Salomaa:
Slender 0L Languages. 161-176 - Dany Breslauer:
Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm. 177-192 - Manindra Agrawal, Vikraman Arvind:
Geometric Sets of Low Information Content. 193-219 - Sarah Mocas:
Separating Classes in the Exponential-Time Hierarchy From Classes in PH. 221-231 - G. Ramalingam, Thomas W. Reps:
On the Computational Complexity of Dynamic Graph Problems. 233-277 - Yoshikane Takahashi:
Solving Optimization Problems with Variable-Constraint by an Extended Cohen-Grossberg Model. 279-341 - Uri Zwick, Mike Paterson:
The Complexity of Mean Payoff Games on Graphs. 343-359 - Manindra Agrawal, Vikraman Arvind:
Quasi-Linear Truth-Table Reductions to p-Selective Sets. 361-370 - Serge Burckel:
Closed Iterative Calculus. 371-378
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-05-05 00:55 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:
