bctcs.ac.uk
Useful TCS Links | BCTCS
http://www.bctcs.ac.uk/index.php/news-and-resources
British Colloquium for Theoretical Computer Science. Annual Agenda and Minutes. Annual Agenda and Minutes. British Colloquium for Theoretical Computer Science. Algorithms Conference List maintained by Glasgow University. Mathematical Logic Conference List maintained by COMS. Algorithms and Complexity Resources. Handbook of Practical Logic and Automated Reasoning.
hipc.org
HIPC -- Sponsors
http://www.hipc.org/hipc2015/sponsors.php
IEEE International Conference on High Performance Computing. Go to bottom of page for Supporting Industry and Organizations and Exhibitor manuals). HiPC 2015 is co-sponsored by. IEEE Computer Society Technical Committee on Parallel Processing (TCPP). ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). ACM Special Interest Group on Computer Architecture (SIGARCH). IFIP Working Group on Concurrent Systems. Manufacturers' Association for Information Technology (MAIT). Birds of a Feather.
dialm-pomc2010.engineering.asu.edu
Home
http://dialm-pomc2010.engineering.asu.edu/index.htm
Welcome to DIALM-POMC 2010. The Sixth ACM SIGACT/SIGMOBILE International Workshop on FOUNDATIONS OF MOBILE COMPUTING. Cambridge, Massachusetts, Usa. September 16th, 2010. DIALM-POMC, the Joint Workshop on Foundations of Mobile Computing, will be co-located with DISC 2010. In Cambridge, Massachusetts, USA. We are proud to announce that DIALM 2010 will feature 2 keynote speakers:. All submitted papers will be rigorously reviewed by technical program committee members. Accepted papers will be published ...
toc.cse.iitk.ac.in
Special Issue in Honor of Rajeev Motwani (1962-2009): Guest Editors' Foreword: Theory of Computing: An Open Access Electronic Journal in Theoretical Computer Science
http://toc.cse.iitk.ac.in/articles/v008a002/index.html
Http:/ theoryofcomputing.org ISSN 1557-2862. Endorsed by ACM SIGACT. 2012) Article 2 pp. 53-54. Special Issue in Honor of Rajeev Motwani (1962-2009). Rajeev Motwani's outstanding contributions to theoretical computer science, in diverse topics such as probabilistically checkable proofs, algorithmic combinatorics, streaming algorithms, and similarity search, to name just a few, have had an indelible influence on the field. This issue of Theory of Computing. We thank the authors of these papers for their c...
toctest.cs.uchicago.edu
Quantum Proofs for Classical Theorems: Theory of Computing: An Open Access Electronic Journal in Theoretical Computer Science
http://toctest.cs.uchicago.edu/articles/gs002
Http:/ theoryofcomputing.org ISSN 1557-2862. Endorsed by ACM SIGACT. Theory of Computing Library. Quantum Proofs for Classical Theorems. And Ronald de Wolf. Published: March 9, 2011 (54 pages). Download article from ToC site:. Quantum arguments, quantum computing, quantum information, polynomial approximation. DOI: 10.4086/toc.gs.2011.002. 2011 Andrew Drucker and Ronald de Wolf. Licensed under a Creative Commons Attribution License (CC-BY).
toctest.cs.uchicago.edu
Fast Matrix Multiplication: Theory of Computing: An Open Access Electronic Journal in Theoretical Computer Science
http://toctest.cs.uchicago.edu/articles/gs005
Http:/ theoryofcomputing.org ISSN 1557-2862. Endorsed by ACM SIGACT. Theory of Computing Library. By Markus Bläser. Published: December 24, 2013 (60 pages). Download article from ToC site:. Fast matrix multiplication, bilinear complexity, tensor rank. We give an overview of the history of fast algorithms for matrix multiplication. Along the way, we look at some other fundamental problems in algebraic complexity like polynomial evaluation. DOI: 10.4086/toc.gs.2013.005. 2013 Markus Bläser.
toctest.cs.uchicago.edu
An Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem: Theory of Computing: An Open Access Electronic Journal in Theoretical Computer Science
http://toctest.cs.uchicago.edu/articles/gs006
Http:/ theoryofcomputing.org ISSN 1557-2862. Endorsed by ACM SIGACT. Theory of Computing Library. An Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem. Published: July 29, 2015 (14 pages). Download article from ToC site:. Additive combinatorics, Fourier analysis. DOI: 10.4086/toc.gs.2015.006. Licensed under a Creative Commons Attribution License (CC-BY).
toctest.cs.uchicago.edu
Absolutely Sound Testing of Lifted Codes: Theory of Computing: An Open Access Electronic Journal in Theoretical Computer Science
http://toctest.cs.uchicago.edu/articles/v011a012
Http:/ theoryofcomputing.org ISSN 1557-2862. Endorsed by ACM SIGACT. 2015) Article 12 pp. 299-338. APPROX-RANDOM 2013 Special Issue. Absolutely Sound Testing of Lifted Codes. Received: September 11, 2013. Revised: February 23, 2015. Published: August 13, 2015. Download article from ToC site:. Locally testable codes, affine-invariant codes, lifted codes, query complexity, soundness. APPROX-RANDOM 2013 special issue. H11, F.1.3. Pages 671-682, 2013. DOI: 10.4086/toc.2015.v011a012.
SOCIAL ENGAGEMENT