Apostolico–Giancarlo algorithm
E1119492
UNEXPLORED
The Apostolico–Giancarlo algorithm is an efficient string-search algorithm that refines and extends Boyer–Moore–style techniques to achieve fast pattern matching, particularly in worst-case scenarios.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Apostolico–Giancarlo algorithm canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T14773339 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Apostolico–Giancarlo algorithm Context triple: [Boyer–Moore string-search algorithm, influenced, Apostolico–Giancarlo algorithm]
-
A.
Cristian's algorithm
Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
-
B.
Benettin algorithm
The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
-
C.
Marzullo's algorithm
Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
-
D.
Thompson's algorithm
Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical analysis.
-
E.
Warnock algorithm
The Warnock algorithm is a classic hidden surface determination technique in computer graphics that recursively subdivides a scene into smaller regions to efficiently resolve visibility.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Apostolico–Giancarlo algorithm Target entity description: The Apostolico–Giancarlo algorithm is an efficient string-search algorithm that refines and extends Boyer–Moore–style techniques to achieve fast pattern matching, particularly in worst-case scenarios.
-
A.
Cristian's algorithm
Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
-
B.
Benettin algorithm
The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
-
C.
Marzullo's algorithm
Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
-
D.
Thompson's algorithm
Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical analysis.
-
E.
Warnock algorithm
The Warnock algorithm is a classic hidden surface determination technique in computer graphics that recursively subdivides a scene into smaller regions to efficiently resolve visibility.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.