| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang |
On the (im)possibility of obfuscating programs.  |
J. ACM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Salil P. Vadhan |
Special issue from RANDOM'09: Editors' Foreword. |
Computational Complexity |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yevgeniy Dodis, Thomas Ristenpart, Salil P. Vadhan |
Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources. |
TCC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Salil P. Vadhan, Colin Jia Zheng |
Characterizing pseudoentropy and simplifying pseudorandom generator constructions. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Salil P. Vadhan, Colin Jia Zheng |
Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Salil P. Vadhan |
On the complexity of computational problems regarding distributions (a survey). |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan |
The Limits of Two-Party Differential Privacy. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mohammad Mahmoody, Tal Moran, Salil P. Vadhan |
Non-Interactive Time-Stamping and Proofs of Work in the Random Oracle Model. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kai-Min Chung, Omer Reingold, Salil P. Vadhan |
S-T connectivity on digraphs with a known stationary distribution. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil P. Vadhan |
Truthful Mechanisms for Agents that Value Privacy |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman |
Deterministic extractors for small-space sources. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Salil P. Vadhan |
Computational Complexity. |
Encyclopedia of Cryptography and Security (2nd Ed.) |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Salil P. Vadhan, Avi Wigderson |
Simplified Derandomization of BPP Using a Hitting Set Generator. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Salil P. Vadhan |
On the Complexity of Computational Problems Regarding Distributions. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Ullman, Salil P. Vadhan |
PCPs and the Hardness of Generating Private Synthetic Data. |
TCC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Mahmoody, Tal Moran, Salil P. Vadhan |
Time-Lock Puzzles in the Random Oracle Model. |
CRYPTO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan |
On Approximating the Entropy of Polynomial Mappings. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, Salil P. Vadhan (eds.) |
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011 |
STOC |
2011 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Omer Reingold, Salil P. Vadhan |
Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jonathan Ullman, Salil P. Vadhan |
PCPs and the Hardness of Generating Synthetic Data. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan |
On Approximating the Entropy of Polynomial Mappings. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan |
Improved Delegation of Computation using Fully Homomorphic Encryption. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
Universal One-Way Hash Functions via Inaccessible Entropy. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Guy N. Rothblum, Salil P. Vadhan |
Are PCPs Inherent in Efficient Arguments? |
Computational Complexity |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yakir Reshef, Salil P. Vadhan |
On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Salil P. Vadhan |
A Lower Bound on List Size for List Decoding. |
IEEE Transactions on Information Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
Universal One-Way Hash Functions via Inaccessible Entropy. |
EUROCRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eleanor Birrell, Salil P. Vadhan |
Composition of Zero-Knowledge Proofs with Efficient Provers. |
TCC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan |
Improved Delegation of Computation Using Fully Homomorphic Encryption. |
CRYPTO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan |
Boosting and Differential Privacy. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan |
The Limits of Two-Party Differential Privacy. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Omer Reingold, Salil P. Vadhan |
Efficiency improvements in constructing pseudorandom generators from one-way functions. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
security preserving, one-way function, pseudorandom generator |
| 1 | Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
Inaccessible Entropy. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Guy N. Rothblum, Salil P. Vadhan |
Are PCPs Inherent in Efficient Arguments? |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs |
Proofs of Retrievability via Hardness Amplification. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eleanor Birrell, Salil P. Vadhan |
Composition of Zero-Knowledge Proofs with Efficient Provers. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan |
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
error-correcting codes, Expander graphs, condensers, list decoding, randomness extractors |
| 1 | Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold, Salil P. Vadhan |
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs |
Proofs of Retrievability via Hardness Amplification. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan |
Fairness with an Honest Minority and a Rational Majority. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
game theory, fairness, secret sharing |
| 1 | Ilya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan |
Computational Differential Privacy. |
CRYPTO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan |
Pseudorandom Bit Generators That Fool Modular Sums. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan |
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy N. Rothblum, Salil P. Vadhan |
Are PCPs Inherent in Efficient Arguments? |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan |
On the complexity of differentially private data release: efficient algorithms and hardness results. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
exponential mechanism, privacy, cryptography, traitor tracing, differential privacy |
| 1 | Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
Inaccessible entropy. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
interactive hashing, computational complexity, cryptography, zero knowledge, one-way functions, commitment schemes |
| 1 | Dan Gutfreund, Salil P. Vadhan |
Limitations of Hardness vs. Randomness under Uniform Reductions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan |
Dense Subsets of Pseudorandom Sets. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan |
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan |
Fairness with an Honest Minority and a Rational Majority. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Minh-Huyen Nguyen, Salil P. Vadhan |
Simpler Session-Key Generation from Short Random Passwords. |
J. Cryptology |
2008 |
DBLP DOI BibTeX RDF |
Human-memorizable passwords, Authentication, Cryptographic protocols, Key exchange, Secure two-party computation |
| 1 | Kai-Min Chung, Salil P. Vadhan |
Tight Bounds for Hashing Block Sources |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Saurabh Sanghvi, Salil P. Vadhan |
The Round Complexity of Two-Party Random Selection. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Mitzenmacher, Salil P. Vadhan |
Why simple hash functions work: exploiting the entropy in a data stream. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan |
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. |
TCC |
2008 |
DBLP DOI BibTeX RDF |
noninteractive zero-knowledge proofs, quantum zero knowledge, computational complexity, cryptography, Arthur-Merlin games, commitment schemes |
| 1 | Shien Jin Ong, Salil P. Vadhan |
An Equivalence Between Zero Knowledge and Commitments. |
TCC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan |
The Complexity of Distinguishing Markov Random Fields. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Gutfreund, Salil P. Vadhan |
Limitations of Hardness vs. Randomness under Uniform Reductions. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
derandomization, pseudorandom generators, black-box reductions |
| 1 | Kai-Min Chung, Salil P. Vadhan |
Tight Bounds for Hashing Block Sources. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan |
Dense Subsets of Pseudorandom Sets. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Amir Rosenfeld, Salil P. Vadhan |
The hardness of the Expected Decision Depth problem. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai-Min Chung, Omer Reingold, Salil P. Vadhan |
S-T Connectivity on Digraphs with a Known Stationary Distribution. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan |
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dragos Florin Ciocan, Salil P. Vadhan |
Interactive and Noninteractive Zero Knowledge Coincide in the Help Model. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Salil P. Vadhan |
Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword. |
Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Trevisan, Salil P. Vadhan |
Pseudorandomness and Average-Case Complexity Via Uniform Reductions. |
Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
Subject classification, 68Q10 |
| 1 | Salil P. Vadhan |
The unified theory of pseudorandomness: guest column. |
SIGACT News |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Shien Jin Ong, Salil P. Vadhan |
Derandomization in Cryptography. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Shien Jin Ong, Salil P. Vadhan |
Zero Knowledge and Soundness Are Symmetric. |
EUROCRYPT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Salil P. Vadhan (eds.) |
Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings |
TCC |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee |
Amplifying Collision Resistance: A Complexity-Theoretic Treatment. |
CRYPTO |
2007 |
DBLP DOI BibTeX RDF |
hash functions, combiners, collision resistance, hardness amplification |
| 1 | Kai-Min Chung, Omer Reingold, Salil P. Vadhan |
S-T Connectivity on Digraphs with a Known Stationary Distribution. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan |
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
error-correcting codes, expander graphs, condensers, list decoding, randomness extractors |
| 1 | Salil P. Vadhan |
The Complexity of Zero Knowledge. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan |
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan |
Extractors and condensers from univariate polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Salil P. Vadhan |
An Unconditional Study of Computational Zero Knowledge. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Shien Jin Ong, Salil P. Vadhan |
Zero Knowledge and Soundness are Symmetric. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ronen Gradwohl, Salil P. Vadhan, David Zuckerman |
Random Selection with an Adversarial Majority. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan |
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Shien Jin Ong, Salil P. Vadhan |
Zero Knowledge and Soundness are Symmetric. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Yehuda Lindell, Salil P. Vadhan |
Lower bounds for non-black-box zero knowledge. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Healy, Salil P. Vadhan, Emanuele Viola |
Using Nondeterminism to Amplify Hardness. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Salil P. Vadhan |
An Unconditional Study of Computational Zero Knowledge. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan |
Concurrent Zero Knowledge Without Complexity Assumptions. |
TCC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Gradwohl, Salil P. Vadhan, David Zuckerman |
Random Selection with an Adversarial Majority. |
CRYPTO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Grant Schoenebeck, Salil P. Vadhan |
The computational complexity of nash equilibria in concisely represented games. |
ACM Conference on Electronic Commerce |
2006 |
DBLP DOI BibTeX RDF |
circuit games, concise games, graph games, nash equilibrium, computational game theory |
| 1 | Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan |
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Reingold, Luca Trevisan, Salil P. Vadhan |
Pseudorandom walks on regular digraphs and the RL vs. L problem. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
universal traversal sequence, zig-zag product, derandomization, expander graphs, mixing time, space-bounded computation |
| 1 | Minh-Huyen Nguyen, Salil P. Vadhan |
Zero knowledge with efficient provers. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
language-dependent commitment schemes, computational complexity, cryptography, zero-knowledge |
| 1 | Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman |
Deterministic extractors for small-space sources. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
pseudorandomness, randomness extractors |
| 1 | Saurabh Sanghvi, Salil P. Vadhan |
The Round Complexity of Two-Party Random Selection |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Grant Schoenebeck, Salil P. Vadhan |
The Computational Complexity of Nash Equilibria in Concisely Represented Games |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Omer Reingold, Luca Trevisan, Salil P. Vadhan |
Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Luca Trevisan, Salil P. Vadhan, David Zuckerman |
Compression of Samplable Sources |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Eyal Rozenman, Salil P. Vadhan |
Derandomized Squaring of Graphs |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan |
Concurrent Zero Knowledge without Complexity Assumptions |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Shien Jin Ong, Salil P. Vadhan |
Derandomization in Cryptography |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan |
Concurrent Zero Knowledge without Complexity Assumptions. |
IACR Cryptology ePrint Archive |
2005 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")