The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "TCC"( http://dblp.L3S.de/Venues/TCC )

URL (DBLP): http://dblp.uni-trier.de/db/conf/tcc

Publication years (Num. hits)
2004 (29) 2005 (33) 2006 (32) 2007 (32) 2008 (35) 2009 (36) 2010 (36) 2011 (38) 2012 (37) 2013 (42) 2014 (31)
Publication types (Num. hits)
inproceedings(370) proceedings(11)
Venues (Conferences, Journals, ...)
TCC(381)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 58 occurrences of 51 keywords

Results
Found 381 publication records. Showing 381 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Chris Peikert Some Recent Progress in Lattice-Based Cryptography. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs Proofs of Retrievability via Hardness Amplification. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1S. Dov Gordon, Jonathan Katz Complete Fairness in Multi-party Computation without an Honest Majority. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan Fairness with an Honest Minority and a Rational Majority. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF game theory, fairness, secret sharing
1Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, Vinod Vaikuntanathan Weak Verifiable Random Functions. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets Security Amplification for InteractiveCryptographic Primitives. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee Simple, Black-Box Constructions of Adaptively Secure Protocols. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Serge Fehr, Christian Schaffner Composing Quantum Protocols in a Classical Environment. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Rafael Pass, Hoeteck Wee Black-Box Constructions of Two-Party Protocols from One-Way Functions. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF black-box constructions, zero-knowledge arguments, trapdoor commitments, parallel coin-tossing, non-malleable commitments, secure two-party computation
1Hemanta K. Maji, Manoj Prabhakaran 0001, Mike Rosulek Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Alon Rosen, Gil Segev 0001 Chosen-Ciphertext Security via Correlated Products. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Yevgeniy Dodis, Jonathan Katz, Adam D. Smith, Shabsi Walfish Composability and On-Line Deniability of Authentication. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Emily Shen, Elaine Shi, Brent Waters Predicate Privacy in Encryption Systems. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Iftach Haitner, Thomas Holenstein On the (Im)Possibility of Key Dependent Encryption. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Key-dependent input, Black-box separations, One-way functions
1Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan Simultaneous Hardcore Bits and Cryptography against Memory Attacks. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jürg Wullschleger Oblivious Transfer from Weak Noisy Channels. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs Universally Composable Multiparty Computation with Partially Isolated Parties. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF public-key infrastructure, multiparty computation, universally composable security
1Iftach Haitner, Alon Rosen, Ronen Shaltiel On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Witness-Hiding, Arthur Merlin protocols, Zero-Knowledge, Black-box reductions
1Cynthia Dwork The Differential Privacy Frontier (Extended Abstract). Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti Simulation-Based Concurrent Non-malleable Commitments and Decommitments. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Eli Biham, Yaron J. Goren, Yuval Ishai Basing Weak Public-Key Cryptography on Strong One-Way Functions. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Merkle’s puzzles, quantum computing, Public-key cryptography, one-way functions, bounded storage model
1Vadim Lyubashevsky, Daniele Micciancio Asymptotically Efficient Lattice-Based Digital Signatures. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF noninteractive zero-knowledge proofs, quantum zero knowledge, computational complexity, cryptography, Arthur-Merlin games, commitment schemes
1Ittai Abraham, Danny Dolev, Joseph Y. Halpern Lower Bounds on Implementing Robust and Resilient Mediators. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Gillat Kol, Moni Naor Cryptography and Game Theory: Designing Protocols for Exchanging Information. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Vipul Goyal, Jonathan Katz Universally Composable Multi-party Computation with an Unreliable Common Reference String. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Aggelos Kiayias, Hong-Sheng Zhou Equivocal Blind Signatures and Adaptive UC-Security. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen OT-Combiners via Secure Computation. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Amos Beimel, Noam Livne, Carles Padró Matroids Can Be Far from Ideal Secret Sharing. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Iftach Haitner Semi-honest to Malicious Oblivious Transfer - The Black-Box Way. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jonathan Katz Which Languages Have 4-Round Zero-Knowledge Proofs? Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Marc Fischlin, Anja Lehmann Multi-property Preserving Combiners for Hash Functions. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Lior Malka How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF non-interactive, perfect zero-knowledge, error shifting, complete problems, cryptography, perfect simulation
1Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya P-signatures and Noninteractive Anonymous Credentials. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam Concurrent Non-malleable Commitments from Any One-Way Function. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Rafael Pass, Muthuramakrishnan Venkitasubramaniam On Constant-Round Concurrent Zero-Knowledge. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Serge Fehr, Christian Schaffner Randomness Extraction Via delta -Biased Masking in the Presence of a Quantum Attacker. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Ran Canetti (eds.) Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Shai Halevi, Tal Rabin Degradation and Amplification of Computational Hardness. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Amir Herzberg, Igal Yoffe The Layered Games Framework for Specifications and Analysis of Security Protocols. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Rosario Gennaro Faster and Shorter Password-Authenticated Key Exchange. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Paul Valiant Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Shai Halevi, Steven A. Myers, Charles Rackoff On Seed-Incompressible Functions. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Joe Kilian, André Madeira, Martin J. Strauss, Xuan Zheng Fast Private Norm Estimation and Heavy Hitters. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Carmit Hazay, Yehuda Lindell Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Shien Jin Ong, Salil P. Vadhan An Equivalence Between Zero Knowledge and Commitments. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Zuzana Beerliová-Trubíniová, Matthias Fitzi, Martin Hirt, Ueli M. Maurer, Vassilis Zikas MPC vs. SFE: Perfect Security in a Unified Corruption Model. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Zuzana Beerliová-Trubíniová, Martin Hirt Perfectly-Secure MPC with Linear Communication Complexity. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF hyper-invertible matrix, efficiency, Multi-party computation, perfect security
1Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF black-box constructions, Public-key encryption, semantic security, non-malleability
1Iftach Haitner, Jonathan J. Hoch, Gil Segev 0001 A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Sergei Izmalkov, Matt Lepinski, Silvio Micali Verifiably Secure Devices. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jonathan Katz Bridging Game Theory and Cryptography: Recent Results and Future Directions. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Nenad Dedic, Danny Harnik, Leonid Reyzin Saving Private Randomness in One-Way Functions and Pseudorandom Generators. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Daniele Micciancio, Scott Yilek The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Hirotada Kobayashi General Properties of Quantum Zero-Knowledge Proofs. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Matthias Fitzi, Matthew K. Franklin, Juan A. Garay, Harsha Vardhan Simhadri Towards Optimal and Efficient Perfectly Secure Message Transmission. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan Securely Obfuscating Re-encryption. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001 On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Dan Boneh, Brent Waters Conjunctive, Subset, and Range Queries on Encrypted Data. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Yehuda Lindell Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Ben Adida, Douglas Wikström How to Shuffle in Public. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michael Backes 0001, Jörn Müller-Quade, Dominique Unruh On the Necessity of Rewinding in Secure Multiparty Computation. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Amos Beimel, Matthew K. Franklin Weakly-Private Secret Sharing Schemes. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Shafi Goldwasser, Guy N. Rothblum On Best-Possible Obfuscation. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Douglas Wikström Designated Confirmer Signatures Revisited. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Salil P. Vadhan (eds.) Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Yuval Ishai, Anat Paskin Evaluating Branching Programs on Encrypted Data. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Dennis Hofheinz, John Malone-Lee, Martijn Stam Obfuscation for Cryptographic Purposes. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF point functions, obfuscation
1Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish Universally Composable Security with Global Setup. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Saurabh Panjwani Tackling Adaptive Corruptions in Multicast Encryption Protocols. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Adaptive Corruptions, Selective Decryption, Multicast, Encryption
1Hoeteck Wee One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Interactive hashing, statistically hiding commitments, black-box lower bounds
1Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin Secure Linear Algebra Using Linearly Recurrent Sequences. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Secure Linear Algebra, Linearly Recurrent Sequences, Wiedemann’s Algorithm
1Krzysztof Pietrzak, Douglas Wikström Parallel Repetition of Computationally Sound Protocols Revisited. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Masayuki Abe, Serge Fehr Perfect NIZK with Adaptive Soundness. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Carl Bosley, Yevgeniy Dodis Does Privacy Require True Randomness? Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke Lee, Richard J. Lipton, Shabsi Walfish Intrusion-Resilient Key Exchange in the Bounded Retrieval Model. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michel Abdalla, Jens-Matthias Bohli, María Isabel González Vasco, Rainer Steinwandt (Password) Authenticated Key Establishment: From 2-Party to Group. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF protocol compiler, common reference string model, key establishment, password-based authentication
1Nicholas Hopper, David Molnar, David A. Wagner 0001 From Weak to Strong Watermarking. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Amos Beimel, Renen Hallak, Kobbi Nissim Private Approximation of Clustering and Vertex Cover. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Jaume Martí-Farré, Carles Padró On Secret Sharing Schemes, Matroids and Polymatroids. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Ideal access structures, Secret sharing, Matroids, Ideal secret sharing schemes, Information rate, Polymatroids
1Yael Gertner, Tal Malkin, Steven A. Myers Towards a Separation of Semantic and CCA Security for Public Key Encryption. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Jörn Müller-Quade, Dominique Unruh Long-Term Security and Universal Composability. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF long-term security, commitment, zero-knowledge, Universal Composability
1Melissa Chase Multi-authority Attribute Based Encryption. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Hoeteck Wee Lower Bounds for Non-interactive Zero-Knowledge. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF set-up assumptions, lower bounds, Non-interactive zero-knowledge
1Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Matthias Christandl, Artur Ekert, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim, Renato Renner Unifying Classical and Quantum Key Distillation. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Remo Meier, Bartosz Przydatek, Jürg Wullschleger Robuster Combiners for Oblivious Transfer. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF robust combiners, weak oblivious transfer, oblivious transfer
1Tatsuaki Okamoto Efficient Blind and Partially Blind Signatures Without Random Oracles. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Ivan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen, Tomas Toft Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Kobbi Nissim, Enav Weinreb Communication Efficient Secure Linear Algebra. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Piotr Indyk, David P. Woodruff Polylogarithmic Private Approximations and Efficient Matching. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Adam Bender, Jonathan Katz, Ruggero Morselli Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Stefan Dziembowski Intrusion-Resilience Via the Bounded-Storage Model. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Dario Catalano, Yevgeniy Dodis, Ivan Visconti Mercurial Commitments: Minimal Assumptions and Efficient Constructions. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Yevgeniy Dodis, Prashant Puniya On the Relation Between the Ideal Cipher and the Random Oracle Models. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam D. Smith Calibrating Noise to Sensitivity in Private Data Analysis. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Thomas Holenstein Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Moti Yung, Yunlei Zhao Interactive Zero-Knowledge with Restricted Random Oracles. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Chi-Jen Lu On the Complexity of Parallel Hardness Amplification for One-Way Functions. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Amos Beimel, Noam Livne On Matroids and Non-ideal Secret Sharing. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
Displaying result #201 - #300 of 381 (100 per page; Change: )
Pages: [<<][1][2][3][4][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license