Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Reingold, Omer
2008.
Undirected connectivity in log-space.
Journal of the ACM,
Vol. 55,
Issue. 4,
p.
1.
Bardsley, Peter
Clausen, Andrew P.
and
Teague, Vanessa
2008.
Cryptographic Commitment and Simultaneous Exchange.
SSRN Electronic Journal,
Antunes, Luís
and
Fortnow, Lance
2009.
Worst-Case Running Times for Average-Case Algorithms.
p.
298.
Rao B.V., Raghavendra
and
Sarma M.N., Jayalal
2009.
Computer Science - Theory and Applications.
Vol. 5675,
Issue. ,
p.
286.
Ito, Tsuyoshi
Kobayashi, Hirotada
and
Matsumoto, Keiji
2009.
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies.
p.
217.
Jadliwala, Murtuza
Duan, Qi
Upadhyaya, Shambhu
and
Xu, Jinhui
2009.
Towards a theory for securing time synchronization in wireless sensor networks.
p.
201.
Braverman, Mark
Cook, Stephen
McKenzie, Pierre
Santhanam, Rahul
and
Wehr, Dustin
2009.
Mathematical Foundations of Computer Science 2009.
Vol. 5734,
Issue. ,
p.
175.
Rad, Habibollah Arasteh
Samsudin, Khairulmizam
Ramli, Abdul Rahman
and
Tehrani, Mohamad Bagher
2009.
The Design and Implementation of a Stress Tool for Traffic Infraction Registration System.
p.
133.
Lamperski, Andrew
2009.
Representations and algorithms for finite-state bisimulations of linear discrete-time control systems.
p.
51.
Payaro, Miquel
and
Palomar, Daniel P.
2009.
On optimal precoding in linear vector Gaussian channels with arbitrary input distribution.
p.
1085.
Stannett, Mike
2009.
The computational status of physics.
Natural Computing,
Vol. 8,
Issue. 3,
p.
517.
Roughgarden, Tim
2010.
Computing equilibria: a computational complexity perspective.
Economic Theory,
Vol. 42,
Issue. 1,
p.
193.
Lovett, Shachar
Mukhopadhyay, Partha
and
Shpilka, Amir
2010.
Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields.
p.
695.
Goldreich, Oded
2010.
Property Testing.
Vol. 6390,
Issue. ,
p.
105.
Li, Xi
2010.
How to Take Advantage of Distrusted Parties or Secure Auxiliary Computations for Every Language in NP.
Information Security Journal: A Global Perspective,
Vol. 19,
Issue. 3,
p.
160.
Ito, Tsuyoshi
2010.
Automata, Languages and Programming.
Vol. 6198,
Issue. ,
p.
140.
Goldreich, Oded
2010.
Property Testing.
Vol. 6390,
Issue. ,
p.
65.
Jadliwala, Murtuza
Bilogrevic, Igor
and
Hubaux, Jean-Pierre
2011.
Computer Security – ESORICS 2011.
Vol. 6879,
Issue. ,
p.
548.
2011.
Real‐Time Systems Design and Analysis.
p.
267.
Raghavendra Rao, B. V.
and
Jayalal Sarma, M. N.
2011.
On the Complexity of Matroid Isomorphism Problem.
Theory of Computing Systems,
Vol. 49,
Issue. 2,
p.
246.