Before revision:  Our data structure uses only a constant number of probes per query and does not have any dependency on L. We apply similar techniques for proving cell-probe lower bounds for the discrete Fr\'echet distance matching known upper bounds .
After revision:  Our data structure uses only a constant number of probes per query and does not have any dependency on L. We apply similar techniques for proving cell-probe lower bounds for the discrete Fr\'echet distance .