Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
probe complexity
Description:
Probe complexity is a measure of the number of probes or queries required by an algorithm to solve a computational problem.
Primary topic:
Complexity and Algorithms in Graphs (25%)
Related topics:
Complexity and Algorithms in Graphs (25%),
Algorithms and Data Compression (22%),
Distributed systems and fault tolerance (16%),
Computational Geometry and Mesh Generation (9%)
OpenAlex ID:
keywords/probe-complexity
Robin hood hashing
1985
·
Pedro Celis
, Per-Ake Larson
, et al.
·
Annual Symposium on Foundations of Computer Science
·
160
Some improvements to total degree tests
2002
·
K. Friedl
, M. Sudan
·
Israel Symposium on Theory and Computing Systems (ISTCS)
·
101
Low-Complexity Probing via Finding Subnetworks
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
PDF
Pareto Probing: Trading Off Accuracy for Complexity
2020
·
Tiago Pimentel
, Naomi Saphra
, et al.
·
Conference on Empirical Methods in Natural Language Processing (EMNLP)
·
88
PDF
Exegesis of Self-Organizing Linear Search
1981
·
Gaston H. Gonnet
, J. Ian Munro
, et al.
·
SIAM Journal on Computing
·
76
Sensitive mRNA Detection by Fluorescence In Situ Hybridization Using Horseradish Peroxidase-labeled Oligodeoxynucleotides and Tyramide Signal Amplification
1998
·
Mariëtte P.C. van de Corput
, Roeland W. Dirks
, et al.
·
Journal of Histochemistry & Cytochemistry
·
66
Information theoretical probe selection for hybridisation experiments
2000
·
Ralf Herwig
, Armin O. Schmitt
, et al.
·
Bioinformatics
·
49
PDF
Scalable and dynamic quorum systems
2003
·
Moni Naor
, Udi Wieder
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
47
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions
1999
·
Rasmus Pagh
·
Lecture notes in computer science
·
47
Probing Convex Polygons with X-rays
1988
·
Herbert Edelsbrunner
, Steven S. Skiena
·
SIAM Journal on Computing
·
47
Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs
2014
·
Guy Even
, Moti Medina
, et al.
·
Lecture notes in computer science
·
44
Short Locally Testable Codes and Proofs (Survey)
2005
·
Oded Goldreich
·
Electronic colloquium on computational complexity
·
43
On the power of two, three and four probes
2009
·
Noga Alon
, Uriel Feige
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
41
Determining the shape of a convex n-sided polygon by using 2n + k tactile probes
1986
·
Herbert J. Bernstein
·
Information Processing Letters
·
36
The analysis of linear probing sort by the use of a new mathematical transform
1984
·
Gaston H Gonnet
, J Ian Munro
·
Journal of Algorithms
·
35
Individual differences in resting heart rate and spontaneous electrodermal activity as predictors of attentional processes: effects on anticipatory heart rate decelaration and task performance
1990
·
Heinz Zimmer
, Gerhard Vossel
, et al.
·
International Journal of Psychophysiology
·
32
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
2002
·
David Peleg
, Avishai Wool
·
SIAM Journal on Discrete Mathematics
·
30
Generalized Sorting with Predictions
2021
·
Pinyan Lu
, Xuandi Ren
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
24
PDF
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
1996
·
David Peleg
, Avishai Wool
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
22
The Randomized Local Computation Complexity of the Lovász Local Lemma
2021
·
Sebastian Brandt
, Christoph Grunau
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
21
PDF
Scalable and dynamic quorum systems
2005
·
Moni Naor
, Udi Wieder
·
Distributed Computing
·
21
Optimal Bounds for Open Addressing Without Reordering
2024
·
Martín Farach-Colton
, Andrew Krapivin
, et al.
·
Annual Symposium on Foundations of Computer Science
·
19
PDF
How to find a battleship
1989
·
Amos Fiat
, Adi Shamir
·
Networks
·
19
Local Computation Algorithms for Spanners
2019
·
Parter, Merav
, Rubinfeld, Ronitt
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
17
PDF
Optimal Sequencing by Hybridization in Rounds
2002
·
Alan M. Frieze
, Bjarni V. Halldórsson
·
Journal of Computational Biology
·
17
Show more works
View as search
Works count:
104
Citation count:
1,442
Year
Topic
Type