Chen, P. P.
, Wang, Z. Y., Yu, S. W., Hong, J. M., Poulsen, P. R., Ji, Y. L., Miao, B. Y.
, Han, M. & Wang, G. H. (1998).
Self-organization of Te clusters in nanofilm by low energy beam deposition.
Physics Letters, Section A: General, Atomic and Solid State Physics,
244(5), 407-412.
https://doi.org/10.1016/S0375-9601(98)00346-6
Chaugule, P., Kumar, M., Limaye, N., Mohapatra, C. K., She, A.
& Srinivasan, S. (2023).
Schur Polynomials Do Not Have Small Formulas If the Determinant does not.
Computational Complexity,
32(1), Artikel 3.
https://doi.org/10.1007/s00037-023-00236-x
Chatzopoulos, S., Vergoulis, T., Skoutas, D., Dalamagas, T., Tryfonopoulos, C.
& Karras, P. (2023).
Atrapos: Real-time Evaluation of Metapath Query Workloads. I
ACM Web Conference 2023 - Proceedings of the World Wide Web Conference, WWW 2023 (s. 2487-2498). Association for Computing Machinery.
https://doi.org/10.1145/3543507.3583322
Chatzigiannakis, I., Michail, O., Nikolaou, S.
, Pavlogiannis, A. & Spirakis, P. G. (2011).
Passively mobile communicating machines that use restricted space.
Theoretical Computer Science,
412(46), 6469-6483.
https://doi.org/10.1016/j.tcs.2011.07.001
Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R.
& Pavlogiannis, A. (2019).
Faster algorithms for dynamic algebraicqueries in basic RSMs with constant treewidth.
ACM Transactions on Programming Languages and Systems,
41(4), Artikel 23.
https://doi.org/10.1145/3363525
Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R.
& Pavlogiannis, A. (2020).
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. I P. Müller (red.),
Programming Languages and Systems- 29th European Symposium on Programming, ESOP 2020 held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Proceedings (s. 112-140). Springer.
https://doi.org/10.1007/978-3-030-44914-8_5
Chatterjee, K., Svoboda, J., Žikelić, Đ.
, Pavlogiannis, A. & Tkadlec, J. (2022).
Social balance on networks: Local minima and best-edge dynamics.
Physical Review E,
106(3), Artikel 034321.
https://doi.org/10.1103/PhysRevE.106.034321
Chase, M., Derler, D., Goldfeder, S.
, Orlandi, C., Ramacher, S., Rechberger, C., Slamanig, D. & Zaverucha, G. (2017).
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives. I
CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (s. 1825-1842). Association for Computing Machinery.
https://doi.org/10.1145/3133956.3133997
Chan, H.-L., Lam, T.-W.
, Lee, L. K., Pan, J., Ting, H.-F.
& Zhang, Q. (2011).
Edit Distance to Monotonicity in Sliding Windows.
Lecture Notes in Computer Science,
7074, 564-573.
https://doi.org/10.1007/978-3-642-25591-5_58
Chan, S.-H., Lam, T.-W.
, Lee, L. K., Liu, C.-M. & Ting, H.-F. (2011).
Sleep Management on Multiple Machines for Energy and Flow Time.
Lecture Notes in Computer Science,
6755, 219-231.
https://doi.org/10.1007/978-3-642-22006-7_19
Chan, T. M., Durocher, S.
, Larsen, K. G., Morrison, J.
& Wilkinson, B. T. (2012).
Linear-Space Data Structures for Range Mode Query in Arrays.
Leibniz International Proceedings in Informatics,
14, 290-301.
https://doi.org/10.4230/LIPIcs.STACS.2012.290
Chan, T. M., Durocher, S.
, Larsen, K. G., Morrison, J. & Wilkinson, B. T. (2014).
Linear-Space Data Structures for Range Mode Query in Arrays.
Theory of Computing Systems,
55(4), 719-741.
https://doi.org/10.1007/s00224-013-9455-2
Chakraborty, S., Ganesh, C.
, Pancholi, M. R. & Sarkar, P. (2021).
Reverse Firewalls for Adaptively Secure MPC without Setup. I M. Tibouchi & H. Wang (red.),
Advances in Cryptology – ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part 2: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6–10, 2021, Proceedings, Part II (s. 335-364). Springer.
https://doi.org/10.1007/978-3-030-92075-3_12
Chakraborty, S., Kayal, C.
& Paraashar, M. (2022).
Separations Between Combinatorial Measures for Transitive Functions. I M. Bojanczyk, E. Merelli & D. P. Woodruff (red.),
49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 Artikel 36 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.ICALP.2022.36
Chakraborty, S., Kayal, C., Mittal, R.
, Paraashar, M., Sanyal, S. & Saurabh, N. (2023).
On the Composition of Randomized Query Complexity and Approximate Degree. I N. Megow & A. Smith (red.),
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, APPROX/RANDOM 2023 Artikel 63 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.63
Cascudo Pueyo, I., Damgård, I. B., David, B. M., Giacomelli, I., Nielsen, J. B. & Trifiletti, R. (2015).
Additively Homomorphic UC commitments with Optimal Amortized Overhead. I J. Katz (red.),
Public-Key Cryptography, PKC 2015: 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30-April 1, 2015, Proceedings (s. 495–515). Springer.
https://doi.org/10.1007/978-3-662-46447-2_22
Cascudo Pueyo, I., Cramer, R., Mirandola, D., Padró, C. & Xing, C. (2015).
On Secret Sharing with Nonlinear Product Reconstruction.
S I A M Journal on Discrete Mathematics,
29(2), 1114-1131.
https://doi.org/10.1137/130931886