The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for CCC with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1985-1993 (16) 1994-1996 (36) 1997 (36) 1998 (31) 1999 (37) 2000 (34) 2001 (35) 2002 (38) 2003 (38) 2004 (40) 2005 (45) 2006 (40) 2007 (37) 2008 (43) 2009 (47) 2010 (32) 2011 (34) 2012 (39) 2013 (33) 2014 (35) 2015 (35) 2016 (67) 2017 (39) 2018 (33) 2019 (65) 2020 (45) 2021 (49) 2022 (46) 2023 (44) 2024 (6)
Publication types (Num. hits)
article(73) inproceedings(1052) proceedings(30)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 538 occurrences of 322 keywords

Results
Found 1155 publication records. Showing 1155 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
135Nian-Feng Tzeng, Po-Jen Chuang A Pairwise Substitutional Fault Tolerance Technique for the Cube-Connected Cycles Architecture. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF cube-connected cycles architecture, CCC, fault-tolerant CCC structure, fault-tolerantstructure, fault tolerance, VLSI, fault tolerant computing, reconfiguration, multiprocessor interconnection networks, VLSI layout, reliability analysis, performance degradation, layout area
83Christoph Lüth, Markus Roggenbach, Lutz Schröder CCC - The Casl Consistency Checker. Search on Bibsonomy WADT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
75Istehad Chowdhury, Mohammad Zulkernine Can complexity, coupling, and cohesion metrics be used as early indicators of vulnerabilities? Search on Bibsonomy SAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF security, complexity, empirical study, software metrics, coupling, vulnerability, software security, cohesion
68Bhaskar P. Deosarkar, Narendra Singh Yadav, Rajendra Prasad Yadav Chain based Conical Clustering (CCC) framework for data gathering in WSNs. Search on Bibsonomy ICON The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
67Andrzej Roslanowski, Saharon Shelah Sweet & sour and other flavours of ccc forcing notions. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Definable forcing notions, Forcing with norms, Strong ccc properties
60Yogesh Reddy Kondareddy, Prathima Agrawal Synchronized MAC Protocol For Multi-Hop Cognitive Radio Networks. Search on Bibsonomy ICC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
60Mingyuan Yu, Xianping Huang, Li Jiang, Ronghua Liang Combined Public Key Cryptosystem Based on Conic Curves over the Ring Zn. Search on Bibsonomy CSSE (3) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
60Ying-Hong Wang, Chin-Yung Yu, Ping-Fang Fu A Coverage and Connectivity Method to Cluster Topology in Wireless Sensor Networks. Search on Bibsonomy AINA Workshops (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
60Yunhong Gu, Robert L. Grossman Supporting Configurable Congestion Control in Data Transport Services. Search on Bibsonomy SC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
60Guihai Chen, Francis C. M. Lau 0001 Tighter Layouts of the Cube-Connected Cycles. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF routing, VLSI, Interconnection networks, embedding, layout, cube-connected cycles
60Angkul Kongmunvattana, Santipong Tanchatchawal, Nian-Feng Tzeng Coherence-based Coordinated Checkpointing for Software Distributed Shared Memory Systems. Search on Bibsonomy ICDCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
60Dikran S. Meliksetian, C. Y. Roger Chen Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF multiprocessor structure, exact network diameter, fault tolerant computing, hypercube networks, diameter, cube-connected cycles, performanceevaluation, optimal routing algorithm
53Emanuele Viola On Constructing Parallel Pseudorandom Generators from One-Way Functions. Search on Bibsonomy CCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Pseudorandom generator construction, one-way function, black-box, restriction, constant-depth circuit, noise sensitivity, hardness amplification
53Thomas Fang Zheng, Zhanjiang Song, Lihong Zhang, Michael Brasser, Wei Wu, Jing Deng CCC Speaker Recognition Evaluation 2006: Overview, Methods, Data, Results and Perspective. Search on Bibsonomy ISCSLP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Evaluation, Speaker recognition
53Yasunori Harada, Kenichi Yamazaki, Richard Potter CCC: User-Defined Object Structure in C. Search on Bibsonomy ECOOP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
45Massimo Strano, Carlos Molina-Jiménez, Santosh K. Shrivastava Implementing a Rule-Based Contract Compliance Checker. Search on Bibsonomy I3E The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
45Sang-Woon Kim, Robert P. W. Duin A Combine-Correct-Combine Scheme for Optimizing Dissimilarity-Based Classifiers. Search on Bibsonomy CIARP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
45Xiao Wu 0001, Chong-Wah Ngo, Alexander G. Hauptmann Multimodal News Story Clustering With Pairwise Visual Near-Duplicate Constraint. Search on Bibsonomy IEEE Trans. Multim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
45Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir Connected Coloring Completion for General Graphs: Algorithms and Complexity. Search on Bibsonomy COCOON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Topics Algorithms and Complexity, Bioinformatics
45Mohammad Amin Dallaali, Malin Premaratne Controlled Content Crossover: A New Crossover Scheme and Its Application to Optical Network Component Allocation Problem. Search on Bibsonomy GECCO (2) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
45Y. Pu, Daniel Andresen Distributed Processing for Cinematic Holographic Particle Image Velocimetry. Search on Bibsonomy HPDC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
45Ralf Klasing Improved Compressions of Cube-Connected Cycles Networks. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF cube-connected cycles network, Parallel computations, interconnection networks, parallel architectures, network simulation, graph embedding
45Ralf Klasing Improved Compressions of Cube-Connected Cycles Networks. Search on Bibsonomy WG The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
45Gaétan Hains, John Mullins Array Structures and Data-Parallel Algorithms. Search on Bibsonomy Euro-Par, Vol. II The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
45Isaac Yi-Yuan Lee, Sheng-De Wang Ring-Connected Hypercubes and Their Relationship to Cubical Ring Connected Cycles and Dynamic Redundancy Networks. Search on Bibsonomy ACM Conference on Computer Science The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
45Graham Campbell 0002, Thomas A. DeFanti, Jeff Frederiksen, Stephen A. Joyce, Lawrence A. Leske Two bit/pixel full color encoding. Search on Bibsonomy SIGGRAPH The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
45Pierre-Louis Curien Typed Categorial Combinatory Logic. Search on Bibsonomy TAPSOFT, Vol.1 The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
45Hiroyuki Sato E-CCC: Between CCC and Topos. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
45Hiroyuki Sato E-CCC: Between CCC and Topos, - its Expressive Power from the Viewpoint of Data Type Theory. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
44HyeongRag Kim, Hoon-Jae Lee 0001, Sang-Jae Moon A Security Enhancement of the E0 Cipher in Bluetooth System. Search on Bibsonomy KES-AMSTA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF CCC-SG, Stream cipher, Cryptosystem
38Amnon Ta-Shma (eds.) 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK Search on Bibsonomy CCC The full citation details ... 2023 DBLP  BibTeX  RDF
38 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Deepanshu Kush, Shubhangi Saraf Near-Optimal Set-Multilinear Formula Lower Bounds. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Per Austrin, Kilian Risse Sum-Of-Squares Lower Bounds for the Minimum Circuit Size Problem. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Prerona Chatterjee, Pavel Hrubes New Lower Bounds Against Homogeneous Non-Commutative Circuits. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Gil Cohen, Itay Cohen 0003 Spectral Expanding Expanders. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li 0006, Yu Zheng 0014, Minshen Zhu On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Yanyi Liu, Rafael Pass Leakage-Resilient Hardness vs Randomness. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Andris Ambainis, Aleksandrs Belovs An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Dieter van Melkebeek, Nicollas M. Sdroievski Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin Protocols. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Srinivasan Arunachalam, Uma Girish Trade-Offs Between Entanglement and Communication. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Dmitriy Kunisky, Xifan Yu A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Peter Ivanov, Liam Pavlovic, Emanuele Viola On Correlation Bounds Against Polynomials. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She On the Algebraic Proof Complexity of Tensor Isomorphism. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Russell Impagliazzo, Sasank Mouli, Toniann Pitassi Lower Bounds for Polynomial Calculus with Extension Variables over Finite Fields. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Bruno Pasqualotto Cavalar, Igor C. Oliveira Constant-Depth Circuits vs. Monotone Circuits. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, Yu-Ching Shen On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Tommaso d'Orsi, Luca Trevisan A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Dorna Abdolazimi, Shayan Oveis Gharan An Improved Trickle down Theorem for Partite Complexes. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Anand Natarajan, Chinmay Nirkhe A Distribution Testing Oracle Separating QMA and QCMA. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan 0001, Sébastien Tavenas Towards Optimal Depth-Reductions for Algebraic Formulas. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Vinayak M. Kumar Tight Correlation Bounds for Circuits Between AC0 and TC0. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Dean Doron, Roei Tell Derandomization with Minimal Memory Footprint. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Rahul Santhanam An Algorithmic Approach to Uniform Lower Bounds. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Xi Chen 0001, Yuhao Li 0002, Mihalis Yannakakis Reducing Tarski to Unique Tarski (In the Black-Box Model). Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Dorit Aharonov, Sandy Irani Translationally Invariant Constraint Optimization Problems. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Emanuele Viola New Sampling Lower Bounds via the Separator. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Lunjia Hu, Inbal Livni Navon, Omer Reingold Generative Models of Huge Objects. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Shuichi Hirahara, Zhenjian Lu, Hanlin Ren Bounded Relativization. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar Criticality of AC⁰-Formulae. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley Separation of the Factorization Norm and Randomized Communication Complexity. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Josh Alman, Jaroslaw Blasiok Matrix Multiplication and Number on the Forehead Communication. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Abhranil Chatterjee 0001, Sumanta Ghosh, Rohit Gurjar, Roshan Raj Border Complexity of Symbolic Determinant Under Rank One Restriction. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Abhibhav Garg, Rafael Oliveira 0006, Shir Peleg, Akash Kumar Sengupta Radical Sylvester-Gallai Theorem for Tuples of Quadratics. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Eshan Chattopadhyay, Jyun-Jie Liao Hardness Against Linear Branching Programs and More. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Ben Davis, Robert Robere Colourful TFNP and Propositional Proofs. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Halley Goldberg, Valentine Kabanets Improved Learning from Kolmogorov Complexity. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Lennart Bittel, Sevag Gharibian, Martin Kliesch The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
38Shachar Lovett (eds.) 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  BibTeX  RDF
38Michael E. Saks, Rahul Santhanam On Randomized Reductions to the Random Strings. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Dan Karliner, Roie Salama, Amnon Ta-Shma The Plane Test Is a Local Tester for Multiplicity Codes. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Shuichi Hirahara Symmetry of Information from Meta-Complexity. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Svyatoslav Gryaznov, Pavel Pudlák, Navid Talebanfard Linear Branching Programs and Directional Affine Extractors. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Zander Kelley, Raghu Meka Random Restrictions and PRGs for PTFs in Gaussian Space. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Lijie Chen 0001, Jiatu Li, Tianqi Yang 0001 Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Scott Aaronson, DeVon Ingram, William Kretschmer The Acrobatics of BQP. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Nutan Limaye, Srikanth Srinivasan 0001, Sébastien Tavenas On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Guy Blanc, Dean Doron New Near-Linear Time Decodable Codes Closer to the GV Bound. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Karthik C. S., Subhash Khot Almost Polynomial Factor Inapproximability for Parameterized k-Clique. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Deepanshu Kush, Shubhangi Saraf Improved Low-Depth Set-Multilinear Circuit Lower Bounds. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Yanyi Liu, Rafael Pass On One-Way Functions from NP-Complete Problems. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Till Tantau On the Satisfaction Probability of k-CNF Formulas. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff ℓp-Spread and Restricted Isometry Properties of Sparse Random Matrices. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Xin Lyu 0002 Improved Pseudorandom Generators for AC⁰ Circuits. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Gal Arnon, Alessandro Chiesa, Eylon Yogev Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Yanyi Liu, Rafael Pass Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Nikhil Bansal 0001, Makrand Sinha, Ronald de Wolf Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38James Cook, Ian Mertz Trading Time and Space in Catalytic Branching Programs. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Sandy Irani, Anand Natarajan, Chinmay Nirkhe, Sujit Rao, Henry Yuen Quantum Search-To-Decision Reductions and the State Synthesis Problem. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Harm Derksen, Visu Makam, Jeroen Zuiddam Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Andrej Bogdanov, William M. Hoza, Gautam Prakriya, Edward Pyne Hitting Sets for Regular Branching Programs. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Louis Golowich, Salil P. Vadhan Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan 0001 Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Ivan Mihajlin, Anastasia Sofronova A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top Gates. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Dmitry Sokolov 0001 Pseudorandom Generators, Resolution and Heavy Width. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Sarah Bordage, Mathieu Lhotel, Jade Nardi, Hugues Randriam Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Ryan O'Donnell, Kevin Pratt High-Dimensional Expanders from Chevalley Groups. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Vikraman Arvind, Pushkar S. Joglekar On Efficient Noncommutative Polynomial Factorization via Higman Linearization. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Erfan Khaniki Nisan-Wigderson Generators in Proof Complexity: New Lower Bounds. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Amol Aggarwal, Josh Alman Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation. Search on Bibsonomy CCC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1155 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
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