Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIGACT News, Volume 36, 2005
Volume 36, Number 1, March 2005
- William I. Gasarch:
Review of "Proofs that Really Count: The Art of Combinatorial Proof by Arthur T. Benjamin and Jennifer J. Quinn"; MAA, 2003. 12-14 - Mats Kindahl:
Review of "Types and Programming Languages by Benjamin C. Pierce"; The MIT Press, 2002. 15-20 - Lawrence S. Moss:
Joint review of "Introduction To Natural Computation by Dana H. Ballard"; MIT Press, 1997, ISBN 0-262-52258-6 and "Mathematical Methods in Artificial Intelligence by Edward A. Bender", IEEE Press, 1996 ISBN 0-8186-7200-5. 21-24
- Scott Aaronson:
Guest Column: NP-complete problems and physical reality. 30-52
- Michel Reynal:
A short introduction to failure detectors for asynchronous distributed systems. 53-70
- Wojciech Jawor:
Three dozen papers on online algorithms. 71-85
- Riccardo Pucella:
The finite and the infinite in temporal logic. 86-99 - Dror G. Feitelson, Ahuva Mu'alem:
On the definition of "on-line" in job scheduling problems. 122-131 - Antti Ylikoski:
The halting problem on finite and infinite computers. 132-138
Volume 36, Number 2, June 2005
- William I. Gasarch:
The book review column. 3-4 - William I. Gasarch:
Review of "Cryptological Mathematics by Robert Lewand"; MAA, 2000, $33.95, Softcover. 4-7 - Nikolaos Papanikolaou:
Review of "Data Privacy and Security by David Salomon"; Spring-Verlag, 2003, $51.48, Hardcover. 8-13 - Jonathan Katz:
Comparative book review: Cryptography: An Introduction by V. V. Yaschenko (American Mathematical Society, 2002); Cryptanalysis of Number Theoretic Ciphers by S.S. Wagstaff, Jr. (Chapman & Hall/CRC Press, 2003); RSA and Public-Key Cryptography by R. A. Mollin (Chapman & Hall/CRC Press, 2003); Foundations of Cryptography, vol. 1: Basic Tools by O. Goldreich, (Cambridge University Press, 2001). 14-19
- Subhash Khot:
Guest column: inapproximability results via Long Code based PCPs. 25-42
- Samir Khuller:
Four colors suffice! 43-44
- Alejandro López-Ortiz:
Algorithmic foundations of the internet. 45-62
- Sandy Irani, Kirk Pruhs:
Algorithmic problems in power management. 63-76
- Riccardo Pucella:
Logical verification and equational verification. 77-88 - Ulisses Ferreira:
The sets of real and complex numbers are denumerable. 126-130 - Y. C. Tay:
What should computer science students learn from mathematics? 131-143
Volume 36, Number 3, September 2005
- William I. Gasarch:
The book review column. 4-5 - Nikolaos Papanikolaou:
Review of "Classical and Quantum Computing with C++ and Java Simulations, by Yorick Hardy and Willi-Hans Steeb", Birkhauser Verlag, 2001. 5-9 - E. Jonathan Chapin:
Review of "Integer Programming, by Laurence A. Wolsey", Wiley and Sons 1998. 10-12 - Georg Essl:
Review of "Computational Line Geometry, by H. Pottmann and J. Wallner", Springer Verlag, 2001. 13-17 - Riccardo Pucella:
Review of "Logic for Computer Scientists, by Uwe Schöning", Birkhauser, 1994. 17-19 - James Glenn:
Review of "Teaching Statistics Using Baseball, by Jim Albert", MAA, 2003. 19-21
- Dean F. Kelley:
Technical report column. 22-23
- Lane A. Hemaspaandra:
SIGACT news complexity theory column 48. 24-38
- Foto N. Afrati:
Report on PODS 2005. 39-40
- Sergio Rajsbaum:
ACM SIGACT news distributed computing column 19. 41-50
- Riccardo Pucella:
SIGACT news logic column 13. 51-66
- Marek Chrobak:
SIGACT news online algorithms column 8. 67 - Reza Dorrigiv, Alejandro López-Ortiz:
A Survey of Performance Measures for On-line Algorithms. 67-81
- Rocky Ross:
Education forum: trying again with MathML. 82-84
- Rocky Ross:
Textbooks. 84-93 - Vladik Kreinovich, Luc Longpré:
Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures). 107-112 - Amir M. Ben-Amram:
The Church-Turing thesis and its look-alikes. 113-114
Volume 36, Number 4, December 2005
- William I. Gasarch:
The book review column. 4-5 - Maulik A. Dave:
Review of "Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenge by Michael H. Goldwasser, David S. Johnson, Catherine C. McGeoch", American Mathematical Society 2002. 5-8 - Raymond Wan
:
Review of "Genomic Perl From Bioinformatics Basics to Working Code by Rex A. Dwyer", Cambridge University Press 2003, 0-521-80177-X. 9-12 - William Fahle:
Review of "Graphs, Networks, and Algorithms (second edition) by Dieter Jungnickel", Springer-Verlag 2005. 12-14 - Wenzhong Zhao:
Review of "Immunocomputing: Principles and Applications by Alexander O. Tarakanov, Victor A. Skormin, Svetlana P. Sokolova", Springer-Verlag New York, Inc. 2003. 14-17 - Frédéric Loulergue:
Review of "Term Rewriting Systems by Terese", Cambridge University Press 2003, 0-521-39115-6. 17-20
- Lane A. Hemaspaandra:
SIGACT news complexity theory column 49. 24-35 - Sergio Rajsbaum:
ACM SIGACT news distributed computing column 20. 36-46 - Riccardo Pucella:
SIGACT news logic column 14. 47-69
- Rocky Ross:
Education forum. 70-71 - Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert:
On quantum versions of record-breaking algorithms for SAT. 103-108 - Isaiah Pinchas Kantorovitz:
A note on turing machine computability of rule driven systems. 109-110 - Tim Roughgarden:
An interview with Vladimir Trifonov 2005 Danny Lewin best student paper award winner. 111-114
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-06-29 00:39 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:
