default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIGACT News, Volume 29, 1998
Volume 29, Number 1, March 1998
- William I. Gasarch:
The Book Review Column. 2 - Brian Postow:
Book Review: Basic Simple Type Theory by J. Roger Hindley (Cambridge University Press 1997). 5-8 - Neal Koblitz:
Book Review: Discrete Mathematics in the Schools. Ed. by Joseph G. Rosenstein, Deborah S. Franzblau, and Fred S. Roberts (American Mathematical Society). 8-12 - Joel I. Seiferas:
Reprints from computing reviews. 13-14 - Samir Khuller:
Open problems: 16. 15-17 - Rocky Ross:
EDUCATION FORUM: Reflections on Turning Fifty. 21-31 - Kirk Pruhs:
How to design dynamic programming algorithms sans recursion. 32-35
Volume 29, Number 2, June 1998
- Lane A. Hemaspaandra
:
Take-home complexity. 9-13 - Joseph O'Rourke:
Computational geometry column 33. 14-20 - William I. Gasarch:
The Book Review Column. 17 - Randeep Bhatia, Yoram J. Sussmann:
Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997). 17-20 - Samir Khuller:
Book review: Selected Papers on Computer Science by Donald E. Knuth. 21-26 - Joel I. Seiferas:
Reprints from Computing Reviews. 27-28 - Rakesh K. Sinha:
Technical report column. 30-32 - Rocky Ross:
Mathematics on the Web. 33-41 - Mark Allen Weiss:
Data structures and problem solving using Java. 42-49 - Ian Parberry:
Everything you wanted to know about the running time of Mergesort but were afraid to ask. 50-57
Volume 29, Number 3, September 1998
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses. 10-22 - Jan Paredaens:
Database theory column: report on PODs '98. 23-26 - Pankaj K. Agarwal, Joseph O'Rourke:
Computational geometry. 27-32 - Dennis M. Volpano, Geoffrey Smith:
Confinement properties for programming languages. 33-42 - William I. Gasarch:
The Book Review Column. 43 - Anish Arora:
Book Review: Verification of Sequential and Concurrent Programs by Krzysztof R. Apt and Ernst-Riidiger Olderog (Springer-Verlag New York, 1997). 46-48 - Jerry James:
Book Review: Algorithms and Programming: Problems and Solutions by Alexander Shen (Birkhauser Boston, 1997). 48-52 - Joel I. Seiferas:
Reprints from Computing Reviews. 53-54 - Rocky Ross:
Graduate degrees on the Web. 56-57 - Andy Huang:
Computation of the Knuth-Morris-Pratt skip tables. 59-61 - Harry R. Lewis, Christos H. Papadimitriou:
Elements of the Theory of Computation. 62-78 - Luc Longpré:
Report on COMPLEXITY 1998. 92-93 - Avrim Blum, Prabhakar Raghavan:
On a theory of computing symposia. 104-111
Volume 29, Number 4, December 1998
- William I. Gasarch:
The Book Review Column. 2-4 - Sanjay Gupta:
Book Review: Theories of Computability by Nicholas Pippenger (Cambridge University Press 1997). 5-10 - Alexander Dekhtyar:
Book Review: Vicious Circles by Jon Barwise and Lawrence Moss (Cambridge University Press 1996). 10-14 - Joel I. Seiferas:
Reprints from Computing Reviews. 15-16 - Lane A. Hemaspaandra, Alan L. Selman:
Writing and editing complexity theory: tales and tools. 20-27 - Dan Suciu:
An overview of semistructured data. 28-38 - Peter W. O'Hearn:
Polymorphism, objects and abstract types. 39-50 - Rocky Ross:
Education forum: Web Enhanced Textbooks. 51-57 - John E. Savage:
A new approach to the first theory course. 58-62 - Pierluigi Crescenzi, Viggo Kann:
How to find the best approximation results. 90-97 - Alexander E. Kostin, Svetlana A. Tchoudaikina:
Yet another reachability algorithm for Petri nets. 98-110
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 2025-01-24 17:03 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:
