Keyword

probe complexity

Description: Probe complexity is a measure of the number of probes or queries required by an algorithm to solve a computational problem.
OpenAlex ID: keywords/probe-complexity
1985 · Pedro Celis, Per-Ake Larson, et al. · Annual Symposium on Foundations of Computer Science · 160
2002 · K. Friedl, M. Sudan · Israel Symposium on Theory and Computing Systems (ISTCS) · 101
2021 · Steven Cao, Victor Sanh, et al. · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · 93
2020 · Tiago Pimentel, Naomi Saphra, et al. · Conference on Empirical Methods in Natural Language Processing (EMNLP) · 88
1981 · Gaston H. Gonnet, J. Ian Munro, et al. · SIAM Journal on Computing · 76
1998 · Mariëtte P.C. van de Corput, Roeland W. Dirks, et al. · Journal of Histochemistry & Cytochemistry · 66
2000 · Ralf Herwig, Armin O. Schmitt, et al. · Bioinformatics · 49
2003 · Moni Naor, Udi Wieder · ACM Symposium on Principles of Distributed Computing (PODC) · 47
1999 · Rasmus Pagh · Lecture notes in computer science · 47
1988 · Herbert Edelsbrunner, Steven S. Skiena · SIAM Journal on Computing · 47
2014 · Guy Even, Moti Medina, et al. · Lecture notes in computer science · 44
2005 · Oded Goldreich · Electronic colloquium on computational complexity · 43
2009 · Noga Alon, Uriel Feige · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 41
1986 · Herbert J. Bernstein · Information Processing Letters · 36
1984 · Gaston H Gonnet, J Ian Munro · Journal of Algorithms · 35
2002 · David Peleg, Avishai Wool · SIAM Journal on Discrete Mathematics · 30
2021 · Pinyan Lu, Xuandi Ren, et al. · Society for Industrial and Applied Mathematics eBooks · 24
1996 · David Peleg, Avishai Wool · ACM Symposium on Principles of Distributed Computing (PODC) · 22
2021 · Sebastian Brandt, Christoph Grunau, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 21
2005 · Moni Naor, Udi Wieder · Distributed Computing · 21
2024 · Martín Farach-Colton, Andrew Krapivin, et al. · Annual Symposium on Foundations of Computer Science · 19
1989 · Amos Fiat, Adi Shamir · Networks · 19
2019 · Parter, Merav, Rubinfeld, Ronitt, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 17
2002 · Alan M. Frieze, Bjarni V. Halldórsson · Journal of Computational Biology · 17
Works count: 104
Citation count: 1,442
Year
Topic
Type