Global Information Lookup Global Information

SIAM Journal on Computing information


SIAM Journal on Computing
DisciplineComputer science
LanguageEnglish
Edited byRobert Krauthgamer
Publication details
History1972–present
Publisher
Society for Industrial and Applied Mathematics (United States)
FrequencyBimonthly
Open access
no
Standard abbreviations
ISO 4SIAM J. Comput.
Indexing
CODENSMJCAT
ISSN0097-5397 (print)
1095-7111 (web)
Links
  • Journal homepage
  • Online access

The SIAM Journal on Computing is a scientific journal focusing on the mathematical and formal aspects of computer science. It is published by the Society for Industrial and Applied Mathematics (SIAM).

Although its official ISO abbreviation is SIAM J. Comput., its publisher and contributors frequently use the shorter abbreviation SICOMP.

SICOMP typically hosts the special issues of the IEEE Annual Symposium on Foundations of Computer Science (FOCS) and the Annual ACM Symposium on Theory of Computing (STOC), where about 15% of papers published in FOCS and STOC each year are invited to these special issues. For example, Volume 48 contains 11 out of 85 papers published in FOCS 2016.[1]

  1. ^ Dinur, Irit; Meir, Or; Kopparty, Swastik (2019). "Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016)". SIAM Journal on Computing. 48 (2): 451. doi:10.1137/19N974762.

and 19 Related for: SIAM Journal on Computing information

Request time (Page generated in 1.1857 seconds.)

SIAM Journal on Computing

Last Update:

The SIAM Journal on Computing is a scientific journal focusing on the mathematical and formal aspects of computer science. It is published by the Society...

Word Count : 154

SIAM Journal on Scientific Computing

Last Update:

The SIAM Journal on Scientific Computing (SISC), formerly SIAM Journal on Scientific & Statistical Computing, is a scientific journal focusing on the...

Word Count : 414

Society for Industrial and Applied Mathematics

Last Update:

1980 SIAM Journal on Scientific Computing (SISC), since 1993 formerly SIAM Journal on Scientific and Statistical Computing, since 1980 SIAM Journal on Discrete...

Word Count : 2232

Clique problem

Last Update:

clique function with at most (1/6)log log N negation gates", SIAM Journal on Computing, 35 (1): 201–216, doi:10.1137/S0097539701396959, MR 2178806. Arora...

Word Count : 9876

Computational complexity of matrix multiplication

Last Update:

matrix multiplication". SIAM Journal on Computing. 11 (2): 263–267. doi:10.1137/0211020. D. Coppersmith; S. Winograd (1981). "On the asymptotic complexity...

Word Count : 4178

Distributed computing

Last Update:

Naor, Moni; Stockmeyer, Larry (1995), "What can be computed locally?" (PDF), SIAM Journal on Computing, 24 (6): 1259–1277, CiteSeerX 10.1.1.29.669, doi:10...

Word Count : 5466

Minimum spanning tree

Last Update:

Spira, P. M.; Pan, A. (1975), "On finding and updating spanning trees and shortest paths" (PDF), SIAM Journal on Computing, 4 (3): 375–380, doi:10.1137/0204032...

Word Count : 5421

Element distinctness problem

Last Update:

Galil, Zvi (2001), "Topological Lower Bounds on Algebraic Random Access Machines", SIAM Journal on Computing, 31 (3): 722–761, doi:10.1137/S0097539797329397...

Word Count : 893

Manuel Blum

Last Update:

Cryptographically Strong Sequences of Pseudorandom Bits" (PDF). SIAM Journal on Computing. 13 (4): 850. doi:10.1137/0213053. S2CID 7008910. Blum, M.; Floyd...

Word Count : 618

Quantum computing

Last Update:

SIAM Journal on Computing. 26 (5): 1411–1473. CiteSeerX 10.1.1.144.7852. doi:10.1137/S0097539796300921. Aaronson, Scott (2013). Quantum Computing Since...

Word Count : 12492

Graph isomorphism problem

Last Update:

Selkow, Stanley M. (1980-08-01). "Random Graph Isomorphism". SIAM Journal on Computing. 9 (3): 628–635. doi:10.1137/0209047. ISSN 0097-5397. McKay (1981)...

Word Count : 4069

Maximal independent set

Last Update:

Problem". SIAM Journal on Computing. 15 (4): 1036–1053. CiteSeerX 10.1.1.225.5475. doi:10.1137/0215074. "Principles of Distributed Computing (lecture 7)"...

Word Count : 5451

Matrix chain multiplication

Last Update:

(January 2019). "Revisiting "Computation of Matrix Chain Products". SIAM Journal on Computing. 48 (5): 1481–1486. doi:10.1137/18m1195401. S2CID 203009883. Cormen...

Word Count : 2644

Additive noise differential privacy mechanisms

Last Update:

(2012). "Universally Utility-maximizing Privacy Mechanisms". SIAM Journal on Computing. 41 (6): 1673–1693. arXiv:0811.2841. doi:10.1137/09076828X. Gupte...

Word Count : 1246

Verifiable computing

Last Update:

Verifiable computing (or verified computation or verified computing) enables a computer to offload the computation of some function, to other perhaps untrusted...

Word Count : 1887

Umesh Vazirani

Last Update:

Vazirani, Umesh (1997), "Strengths and weaknesses of quantum computing", SIAM Journal on Computing, 26 (5): 1510–1523, arXiv:quant-ph/9701001, Bibcode:1997quant...

Word Count : 547

Polygonal chain

Last Update:

Tamassia, Roberto (1987), "On embedding a graph in the grid with the minimum number of bends", SIAM Journal on Computing, 16 (3): 421–444, doi:10.1137/0216030...

Word Count : 993

Stable marriage problem

Last Update:

SIAM Journal on Computing. 16 (1): 111–128. doi:10.1137/0216010. MR 0873255. Pittel, Boris (1989). "The average number of stable matchings". SIAM Journal...

Word Count : 2432

Polynomial evaluation

Last Update:

Coefficients Which are Hard to Compute". SIAM Journal on Computing. 3 (2): 128–149. doi:10.1137/0203010. Schnorr, C. P. (1979), "On the additive complexity of...

Word Count : 3146

PDF Search Engine © AllGlobal.net