default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIGACT News, Volume 33, 2002
Volume 33, Number 1, March 2002
- William I. Gasarch:
The book review column. 3-20
- Joel I. Seiferas:
Reprints from computing reviews. 21-22
- Robert H. Sloan:
NSF report: theory of computing program. 28
- Lane A. Hemaspaandra:
SIGACT news complexity theory column 35. 32-45 - Sergio Rajsbaum:
ACM SIGACT news Distributed Computing Column 6. 46-53 - Ted Herman:
Self-stabilization at WSS'01 and DISC'01. 54-57 - Joseph O'Rourke:
Computational geometry column 43. 58-60
- Rocky Ross:
Accountability and the public trust. 61-66 - Henry Hamburger, Dana Richards:
Logic and language models for computer science. 67-70
- Jeffrey O. Shallit:
The computational complexity of the local postage stamp problem. 90-94
Volume 33, Number 2, June 2002
- William I. Gasarch:
The book review column. 2-9 - Boleslaw Mikolajczak:
Review of Petri Net Algebra. 10-14 - Ivelin Ivanov:
Review of Combinatorial Optimization - Theory and Algorithms. 14-16 - Marios Mavronicolas:
Review of Introduction to Distributed Algorithms. 16-18 - William I. Gasarch:
Review of Calculated Bets. 19-20
- Joel I. Seiferas:
Reprints from Computing Reviews. 21-23 - Robert H. Sloan:
NSF report: theory of computing program. 27-28 - David J. Haglin:
Technical report column. 29-30
- Samir Khuller:
Algorithms column: the vertex cover problem. 31-33 - Lane A. Hemaspaandra:
SIGACT news complexity theory column 36. 34-47 - Sergio Rajsbaum:
ACM SIGACT news distributed computing column 7. 48-51 - Seth Gilbert
, Nancy A. Lynch:
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. 51-59 - Rajmohan Rajaraman:
Topology control and routing in ad hoc networks: a survey. 60-73
- Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpré, Monica Aviles:
Computing variance for interval data is NP-hard. 108-118
Volume 33, Number 3, September 2002
- William I. Gasarch:
The book review column. 6 - R. Gregory Taylor:
Modern computer algebra. 7-16 - E. W. Cenek:
Computability and complexity theory and the complexity theory companion. 17-19 - P. Daniel Hestand:
Mathematical theory of domains. 19-22 - Joel I. Seiferas:
Reprints from computing reviews. 23-24
- Lane A. Hemaspaandra:
SIGACT news complexity theory comun 37. 32-49 - Sergio Rajsbaum:
ACM SIGACT news distributed computing column 8. 50 - Henri Casanova:
Distributed computing research issues in grid computing. 50-70
- Rocky Ross:
Space wars and other things. 71-74 - Vijay Shivshanker Gupta:
Communication complexity for file synchronization is undecidable. 110-112
Volume 33, Number 4, December 2002
- William I. Gasarch:
The book review column. 4-5 - Maulik A. Dave:
Review of the clausal theory of types. 8-9 - Suresh Venkatasubramanian:
Discrete mathematical problems with medical applications DIMACS volume 55. 9-11 - Ivelin Ivanov:
Parallel processing and parallel algorithms: theory and computation. 12-14 - Ian Parberry:
Things a computer scientist rarely talks about. 14-15 - Hassan Masum:
Review of a new kind of science. 15-21
- Lane A. Hemaspaandra:
SIGACT news complexity theory column 38. 22-36 - Sergio Rajsbaum:
ACM SIGACT news distributed computing column 9. 37-54
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-12-27 21:26 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:
