default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeriklis A. Papakonstantinou
Person information
- affiliation: Tsinghua University, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Songhua He, Periklis A. Papakonstantinou:
The Effect of Weight Precision on the Neuron Count in Deep ReLU Networks. ICML 2024- 2023
- [j11]Hafiz Salman Asif, Jaideep Vaidya
, Periklis A. Papakonstantinou:
Identifying Anomalies While Preserving Privacy. IEEE Trans. Knowl. Data Eng. 35(12): 12264-12281 (2023) - 2022
- [j10]Hafiz Salman Asif, Periklis A. Papakonstantinou, Stephanie Shiau, Vivek K. Singh, Jaideep Vaidya:
Intelligent Pandemic Surveillance via Privacy-Preserving Crowdsensing. IEEE Intell. Syst. 37(4): 88-96 (2022) - [i13]Dimitris Achlioptas, Amrit Daswaney, Periklis A. Papakonstantinou:
Hide and Seek: Scaling Machine Learning for Combinatorial Optimization via the Probabilistic Method. CoRR abs/2211.15368 (2022) - [i12]Songhua He, Periklis A. Papakonstantinou:
Deep Neural Networks: The Missing Complexity Parameter. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c18]Hafiz Salman Asif, Periklis A. Papakonstantinou, Stephanie Shiau, Vivek K. Singh, Jaideep Vaidya:
Accurately and Privately Reporting Crowdsensed COVID-19 Data. AMIA 2021
2010 – 2019
- 2019
- [j9]Shiteng Chen, Periklis A. Papakonstantinou:
Depth Reduction for Composites. SIAM J. Comput. 48(2): 668-686 (2019) - [c17]Hafiz Salman Asif, Periklis A. Papakonstantinou, Jaideep Vaidya:
How to Accurately and Privately Identify Anomalies. CCS 2019: 719-736 - 2016
- [j8]Shiteng Chen, Periklis A. Papakonstantinou:
Correlation lower bounds from correlation upper bounds. Inf. Process. Lett. 116(8): 537-540 (2016) - [c16]Sixue Liu, Periklis A. Papakonstantinou:
Local Search for Hard SAT Formulas: The Strength of the Polynomial Law. AAAI 2016: 732-738 - [c15]Shiteng Chen, Periklis A. Papakonstantinou:
Depth-Reduction for Composites. FOCS 2016: 99-108 - [c14]Periklis A. Papakonstantinou, Jia Xu, Guang Yang:
On the Power and Limits of Distance-Based Learning. ICML 2016: 2263-2271 - [i11]Shiteng Chen, Periklis A. Papakonstantinou:
Depth-reduction for composites. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i10]Shiteng Chen, Periklis A. Papakonstantinou:
Correlation lower bounds from correlation upper bounds. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j7]Matei David, Periklis A. Papakonstantinou:
Tradeoff lower lounds for stack machines. Comput. Complex. 23(1): 99-146 (2014) - [j6]Eric Allender, Shiteng Chen, Tiancheng Lou, Periklis A. Papakonstantinou, Bangsheng Tang:
Width-Parametrized SAT: Time--Space Tradeoffs. Theory Comput. 10: 297-339 (2014) - [c13]Periklis A. Papakonstantinou, Jia Xu, Zhu Cao:
Bagging by Design (on the Suboptimality of Bagging). AAAI 2014: 2041-2047 - [c12]Periklis A. Papakonstantinou, Dominik Scheder, Hao Song:
Overlays and Limited Memory Communication. CCC 2014: 298-308 - [c11]Periklis A. Papakonstantinou, Guang Yang:
Cryptography with Streaming Algorithms. CRYPTO (2) 2014: 55-70 - [i9]Periklis A. Papakonstantinou:
The Depth Irreducibility Hypothesis. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c10]Joshua Brody, Shiteng Chen, Periklis A. Papakonstantinou, Hao Song, Xiaoming Sun:
Space-bounded communication complexity. ITCS 2013: 159-172 - [i8]Periklis A. Papakonstantinou, Dominik Scheder, Hao Song:
Overlays and Limited Memory Communication Mode(l)s. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c9]Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan:
Pseudorandomness for Linear Length Branching Programs and Stack Machines. APPROX-RANDOM 2012: 447-458 - [c8]Periklis A. Papakonstantinou, Guang Yang:
A Remark on One-Wayness versus Pseudorandomness. COCOON 2012: 482-494 - [i7]Eric Allender, Shiteng Chen, Tiancheng Lou, Periklis A. Papakonstantinou, Bangsheng Tang:
Time-space tradeoffs for width-parameterized SAT: Algorithms and lower bounds. Electron. Colloquium Comput. Complex. TR12 (2012) - [i6]Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis:
How powerful are the DDH hard groups? Electron. Colloquium Comput. Complex. TR12 (2012) - [i5]Periklis A. Papakonstantinou, Guang Yang:
A remark on one-wayness versus pseudorandomness. Electron. Colloquium Comput. Complex. TR12 (2012) - [i4]Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis:
How powerful are the DDH hard groups? IACR Cryptol. ePrint Arch. 2012: 653 (2012) - 2011
- [j5]Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos:
How strong is Nisanʼs pseudo-random generator? Inf. Process. Lett. 111(16): 804-808 (2011) - [c7]Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan:
Pseudorandomness for Read-Once Formulas. FOCS 2011: 240-246 - [c6]Matei David, Phuong Nguyen, Periklis A. Papakonstantinou, Anastasios Sidiropoulos:
Computationally Limited Randomness. ICS 2011: 522-536 - [c5]Josh Bronson, Ali Juma, Periklis A. Papakonstantinou:
Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators. TCC 2011: 504-521 - [i3]Shiteng Chen, Tiancheng Lou, Periklis A. Papakonstantinou, Bangsheng Tang:
Width-parameterized SAT: Time-Space Tradeoffs. CoRR abs/1108.2385 (2011) - [i2]Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan:
Pseudorandomness for read-once formulas. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [b1]Periklis A. Papakonstantinou:
Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity. University of Toronto, Canada, 2010 - [j4]Periklis A. Papakonstantinou, Charles Rackoff:
Characterizing sets of jobs that admit optimal greedy-like algorithms. J. Sched. 13(2): 163-176 (2010) - [c4]Matei David, Periklis A. Papakonstantinou:
Trade-Off Lower Bounds for Stack Machines. CCC 2010: 163-171
2000 – 2009
- 2009
- [j3]Christophe Meyer, Periklis A. Papakonstantinou:
On the complexity of constructing Golomb Rulers. Discret. Appl. Math. 157(4): 738-748 (2009) - [j2]Periklis A. Papakonstantinou:
A note on width-parameterized SAT: An exact machine-model characterization. Inf. Process. Lett. 110(1): 8-12 (2009) - [c3]Periklis A. Papakonstantinou:
On the Structure of Optimal Greedy Computation (for Job Scheduling). MFCS 2009: 612-623 - [i1]Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos:
Polynomial Time with Restricted Use of Randomness. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c2]Dan Boneh, Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis, Brent Waters:
On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations. FOCS 2008: 283-292 - [c1]Konstantinos Georgiou, Periklis A. Papakonstantinou:
Complexity and Algorithms for Well-Structured k-SAT Instances. SAT 2008: 105-118 - 2006
- [j1]Periklis A. Papakonstantinou:
Hierarchies for classes of priority algorithms for Job Scheduling. Theor. Comput. Sci. 352(1-3): 181-189 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
