-
Notifications
You must be signed in to change notification settings - Fork 45
/
Copy pathreferences.bib
1868 lines (1664 loc) · 54.2 KB
/
references.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
@inproceedings{chan2018more,
title={More logarithmic-factor speedups for 3SUM,(median,+)-convolution, and some geometric 3SUM-hard problems},
author={Chan, Timothy M.},
booktitle={Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms},
pages={881--897},
year={2018},
organization={SIAM}
}
@article{baran2008subquadratic,
title={Subquadratic algorithms for 3{SUM}},
author={Baran, Ilya and Demaine, Erik D and P{\u{a}}tra{\c{s}}cu, Mihai},
journal={Algorithmica},
volume={50},
number={4},
pages={584--596},
year={2008},
publisher={Springer}
}
@inproceedings{han2002sorting,
title={Sorting integers in ${O}(n \log \log n)$ expected time and linear space},
author={Han, Y and Thorup, M},
booktitle={IEEE Symposium on Foundations of Computer Science (FOCS)},
year={2002}
}
@inproceedings{han2002integer,
title={Integer sorting in ${O}(n\sqrt{\log \log n})$ expected time and linear space},
author={Han, Yijie and Thorup, Mikkel},
booktitle={The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.},
pages={135--144},
year={2002},
organization={IEEE}
}
@inproceedings{han2002deterministic,
title={Deterministic sorting in ${O}(n \log \log n)$ time and linear space},
author={Han, Yijie},
booktitle={Proceedings of the thiry-fourth annual ACM symposium on Theory of computing},
pages={602--608},
year={2002},
organization={ACM}
}
@article{mirzaian1985selection,
title={Selection in X+ Y and matrices with sorted rows and columns},
author={Mirzaian, Andranik and Arjomandi, Eshrat},
journal={Information processing letters},
volume={20},
number={1},
pages={13--17},
year={1985},
publisher={Elsevier}
}
@article{frederickson1993optimal,
title={An optimal algorithm for selection in a min-heap},
author={Frederickson, Greg N},
journal={Information and Computation},
volume={104},
number={2},
pages={197--214},
year={1993},
publisher={Elsevier}
}
@inproceedings{Chan2004RefinedUA,
title={Refined Upper and Lower Bounds for 2-SUM},
author={AlexanderC. L. Chan and William I. Gasarch and Clyde P. Kruskal},
year={2004}
}
@article{jin2018simple,
title={A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum},
author={Jin, Ce and Wu, Hongxun},
journal={arXiv preprint arXiv:1807.11597},
year={2018}
}
@inproceedings{jin2018simple1,
title={A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum},
author={Jin, Ce and Wu, Hongxun},
booktitle={2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
year={2018}
}
@article{pisinger1999linear,
title={Linear time algorithms for knapsack problems with bounded weights},
author={Pisinger, David},
journal={Journal of Algorithms},
volume={33},
number={1},
pages={1--14},
year={1999},
publisher={Elsevier}
}
@article{Koiliaris2018Subset,
title={Subset Sum Made Simple},
author={Koiliaris, Konstantinos and Xu, Chao},
year={2018},
}
@inproceedings{koiliaris2017faster,
title={A faster pseudopolynomial time algorithm for subset sum},
author={Koiliaris, Konstantinos and Xu, Chao},
booktitle={Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms},
pages={1062--1072},
year={2017},
organization={SIAM}
}
@article{deleglise1996computing,
title={Computing pi(x): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method},
author={Del{\'e}glise, Marc and Rivat, Jo{\"e}l},
journal={Mathematics of Computation of the American Mathematical Society},
volume={65},
number={213},
pages={235--245},
year={1996}
}
@article{2015arXiv150301839S,
author = {{Staple}, Douglas B.},
title = "{The combinatorial algorithm for computing pi(x)}",
journal = {arXiv e-prints},
keywords = {Mathematics - Number Theory, Computer Science - Data Structures and Algorithms, 11N05 (Primary), 11Y16, 11-04 (Secondary)},
year = "2015",
month = "Mar",
eid = {arXiv:1503.01839},
pages = {arXiv:1503.01839},
archivePrefix = {arXiv},
eprint = {1503.01839},
primaryClass = {math.NT},
adsurl = {https://ui.adsabs.harvard.edu/abs/2015arXiv150301839S},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@book{galway2004analytic,
title={Analytic computation of the prime-counting function},
author={Galway, William Floyd},
year={2004},
publisher={University of Illinois at Urbana-Champaign}
}
@article{lagarias1987computing,
title={Computing $\pi$ (x): An analytic method},
author={Lagarias, Jeffrey C and Odlyzko, Andrew M.},
journal={Journal of Algorithms},
volume={8},
number={2},
pages={173--191},
year={1987},
publisher={Elsevier}
}
@incollection{lagarias1984new,
title={New algorithms for computing $\pi$ (x)},
author={Lagarias, JC and Odlyzko, AM},
booktitle={Number theory},
pages={176--193},
year={1984},
publisher={Springer}
}
@article{frederickson1984generalized,
title={Generalized selection and ranking: sorted matrices},
author={Frederickson, Greg N and Johnson, Donald B},
journal={SIAM Journal on computing},
volume={13},
number={1},
pages={14--30},
year={1984},
publisher={SIAM}
}
@article{frederickson1990erratum,
title={Erratum: generalized selection and ranking: sorted matrices},
author={Frederickson, Greg N and Johnson, Donald B},
journal={SIAM Journal on Computing},
volume={19},
number={1},
pages={205},
year={1990},
publisher={Society for Industrial and Applied Mathematics}
}
@article{frederickson1982complexity,
title={The complexity of selection and ranking in ${X}+{Y}$ and matrices with sorted columns},
author={Frederickson, Greg N and Johnson, Donald B},
journal={Journal of Computer and System Sciences},
volume={24},
number={2},
pages={197--208},
year={1982},
publisher={Elsevier}
}
@inproceedings{frederickson1980generalized,
title={Generalized selection and ranking (Preliminary Version)},
author={Frederickson, Greg N and Johnson, Donald B},
booktitle={Proceedings of the twelfth annual ACM symposium on Theory of computing},
pages={420--428},
year={1980}
}
@article{pollard1975monte,
title={A Monte Carlo method for factorization},
author={Pollard, John M},
journal={BIT Numerical Mathematics},
volume={15},
number={3},
pages={331--334},
year={1975},
publisher={Springer}
}
@article{crochemore2001fast,
title={A fast and practical bit-vector algorithm for the longest common subsequence problem},
author={Crochemore, Maxime and Iliopoulos, Costas S and Pinzon, Yoan J and Reid, James F},
journal={Information Processing Letters},
volume={80},
number={6},
pages={279--285},
year={2001},
publisher={Elsevier}
}
@article{masek1980faster,
title={A faster algorithm computing string edit distances},
author={Masek, William J and Paterson, Michael S},
journal={Journal of Computer and System sciences},
volume={20},
number={1},
pages={18--31},
year={1980},
publisher={Elsevier}
}
@inproceedings{puatracscu2010possibility,
title={On the possibility of faster SAT algorithms},
author={P{\u{a}}tra{\c{s}}cu, Mihai and Williams, Ryan},
booktitle={Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms},
pages={1065--1075},
year={2010},
organization={SIAM}
}
@article{bentley1980decomposable,
title={Decomposable searching problems I. Static-to-dynamic transformation},
author={Bentley, Jon Louis and Saxe, James B},
journal={Journal of Algorithms},
volume={1},
number={4},
pages={301--358},
year={1980},
publisher={Elsevier}
}
@book{Rabin1985Randomized,
title={Randomized algorithms in number theory},
author={Rabin, Michael O and Shallit, Jeffery O},
year={1985},
}
@article{chung2005optimal,
title={An optimal algorithm for the maximum-density segment problem},
author={Chung, Kai-min and Lu, Hsueh-I},
journal={SIAM Journal on Computing},
volume={34},
number={2},
pages={373--387},
year={2005},
publisher={SIAM}
}
@article{thorup2007equivalence,
title={Equivalence between priority queues and sorting},
author={Thorup, Mikkel},
journal={Journal of the ACM (JACM)},
volume={54},
number={6},
pages={28},
year={2007},
publisher={ACM}
}
@article{misra1982finding,
title={Finding repeated elements},
author={Misra, Jayadev and Gries, David},
journal={Science of computer programming},
volume={2},
number={2},
pages={143--152},
year={1982},
publisher={Elsevier}
}
@incollection{boyer1991mjrty,
title={{MJRTY}-a fast majority vote algorithm},
author={Boyer, Robert S and Moore, J Strother},
booktitle={Automated Reasoning},
pages={105--117},
year={1991},
publisher={Springer}
}
@article{fredman1975computing,
title={On computing the length of longest increasing subsequences},
author={Fredman, Michael L},
journal={Discrete Mathematics},
volume={11},
number={1},
pages={29--35},
year={1975},
publisher={Elsevier}
}
@article{crochemore2010fast,
title={Fast computation of a longest increasing subsequence and application},
author={Crochemore, Maxime and Porat, Ely},
journal={Information and computation},
volume={208},
number={9},
pages={1054--1059},
year={2010},
publisher={Elsevier}
}
@article{gajentaan1995class,
title={On a class of O (n2) problems in computational geometry},
author={Gajentaan, Anka and Overmars, Mark H},
journal={Computational geometry},
volume={5},
number={3},
pages={165--185},
year={1995},
publisher={Elsevier}
}
@techreport{brown1977fast,
title={A Fast Merging Algorithm.},
author={Brown, Mark R and Tarjan, Robert E},
year={1977},
institution={STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE}
}
@book{har2011geometric,
title={Geometric approximation algorithms},
author={Har-Peled, Sariel},
number={173},
year={2011},
publisher={American Mathematical Soc.}
}
@article{szemeredi1983extremal,
title={Extremal problems in discrete geometry},
author={Szemer{\'e}di, Endre and Trotter, William T.},
journal={Combinatorica},
volume={3},
number={3-4},
pages={381--392},
year={1983},
publisher={Springer}
}
@book{edelsbrunner2012algorithms,
title={Algorithms in combinatorial geometry},
author={Edelsbrunner, Herbert},
volume={10},
year={2012},
publisher={Springer Science \& Business Media}
}
@inproceedings{groz2012deterministic,
title={Deterministic regular expressions in linear time},
author={Groz, Benot{\^\i}t and Maneth, Sebastian and Staworko, Slawek},
booktitle={Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems},
pages={49--60},
year={2012},
organization={ACM}
}
@inproceedings{bille2009faster,
title={Faster regular expression matching},
author={Bille, Philip and Thorup, Mikkel},
booktitle={International Colloquium on Automata, Languages, and Programming},
pages={171--182},
year={2009},
organization={Springer}
}
@article{edelsbrunner1986halfplanar,
title={Halfplanar range search in linear space and O (n0. 695) query time},
author={Edelsbrunner, Herbert and Welzl, Emo},
journal={Information Processing Letters},
volume={23},
number={5},
pages={289--293},
year={1986},
publisher={Elsevier}
}
@article{patrascu2006logarithmic,
title={Logarithmic lower bounds in the cell-probe model},
author={P{\u{a}}tra{\c{s}}cu, Mihai and Demaine, Erik D},
journal={SIAM Journal on Computing},
volume={35},
number={4},
pages={932--963},
year={2006},
publisher={SIAM}
}
@inproceedings{puaatracscu2004tight,
title={Tight bounds for the partial-sums problem},
author={P{\u{a}}atra{\c{s}}cu, Mihai and Demaine, Erik D},
booktitle={Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms},
pages={20--29},
year={2004},
organization={Society for Industrial and Applied Mathematics}
}
@inproceedings{chan2010counting,
title={Counting inversions, offline orthogonal range counting, and related problems},
author={Chan, Timothy M. and P{\u{a}}tra{\c{s}}cu, Mihai},
booktitle={Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms},
pages={161--173},
year={2010},
organization={Society for Industrial and Applied Mathematics}
}
@inproceedings{dietz1989optimal,
title={Optimal algorithms for list indexing and subset rank},
author={Dietz, Paul F},
booktitle={Workshop on Algorithms and Data Structures},
pages={39--46},
year={1989},
organization={Springer}
}
@inproceedings{le2014powers,
title={Powers of tensors and fast matrix multiplication},
author={Le Gall, Fran{\c{c}}ois},
booktitle={Proceedings of the 39th international symposium on symbolic and algebraic computation},
pages={296--303},
year={2014},
organization={ACM}
}
@article{yuster2005fast,
title={Fast sparse matrix multiplication},
author={Yuster, Raphael and Zwick, Uri},
journal={ACM Transactions On Algorithms (TALG)},
volume={1},
number={1},
pages={2--13},
year={2005},
publisher={ACM}
}
@inproceedings{le2012faster,
title={Faster algorithms for rectangular matrix multiplication},
author={Le Gall, Fran{\c{c}}ois},
booktitle={2012 IEEE 53rd annual symposium on foundations of computer science},
pages={514--523},
year={2012},
organization={IEEE}
}
@article{fredman1975computing,
title={On computing the length of longest increasing subsequences},
author={Fredman, Michael L},
journal={Discrete Mathematics},
volume={11},
number={1},
pages={29--35},
year={1975},
publisher={Elsevier}
}
@article{hunt1977fast,
title={A fast algorithm for computing longest common subsequences},
author={Hunt, James W and Szymanski, Thomas G},
journal={Communications of the ACM},
volume={20},
number={5},
pages={350--353},
year={1977},
publisher={ACM}
}
@book{bengtsson2007computing,
title={Computing maximum-scoring segments optimally},
author={Bengtsson, Fredrik and Chen, Jingsen},
year={2007},
publisher={Lule{\aa} tekniska universitet}
}
@inproceedings{nederlof2012reducing,
title={Reducing a target interval to a few exact queries},
author={Nederlof, Jesper and van Leeuwen, Erik Jan and van der Zwaan, Ruben},
booktitle={International Symposium on Mathematical Foundations of Computer Science},
pages={718--727},
year={2012},
organization={Springer}
}
@article{frederickson2017optimal,
title={Optimal Parametric Search for Path and Tree Partitioning},
author={Frederickson, Greg N and Zhou, Samson},
journal={arXiv preprint arXiv:1711.00599},
year={2017}
}
@inproceedings{frederickson1991optimal,
title={Optimal algorithms for tree partitioning},
author={Frederickson, Greg N},
booktitle={SODA},
volume={91},
pages={168--177},
year={1991}
}
@article{kaplan2018selection,
title={Selection from heaps, row-sorted matrices and ${X}+{Y}$ using soft heaps},
author={Kaplan, Haim and Kozma, L{\'a}szl{\'o} and Zamir, Or and Zwick, Uri},
journal={arXiv preprint arXiv:1802.07041},
year={2018}
}
@article{verhoeff2004settling,
title={Settling multiple debts efficiently: An invitation to computing science},
author={Verhoeff, Tom and others},
journal={Informatics in Education-An International Journal},
volume={3},
number={1},
pages={105--126},
year={2004},
publisher={Vilniaus Universiteto Leidykla}
}
@article{rubinchik2018eertree,
title={EERTREE: an efficient data structure for processing palindromes in strings},
author={Rubinchik, Mikhail and Shur, Arseny M},
journal={European Journal of Combinatorics},
volume={68},
pages={249--265},
year={2018},
publisher={Elsevier}
}
@article{fici2014subquadratic,
title={A subquadratic algorithm for minimum palindromic factorization},
author={Fici, Gabriele and Gagie, Travis and K{\"a}rkk{\"a}inen, Juha and Kempa, Dominik},
journal={Journal of Discrete Algorithms},
volume={28},
pages={41--48},
year={2014},
publisher={Elsevier}
}
@inproceedings{durocher2011range,
title={Range majority in constant time and linear space},
author={Durocher, Stephane and He, Meng and Munro, J Ian and Nicholson, Patrick K and Skala, Matthew},
booktitle={International Colloquium on Automata, Languages, and Programming},
pages={244--255},
year={2011},
organization={Springer}
}
@inproceedings{yao1982space,
title={Space-time tradeoff for answering range queries},
author={Yao, Andrew C},
booktitle={Proceedings of the fourteenth annual ACM symposium on Theory of computing},
pages={128--136},
year={1982},
organization={ACM}
}
@book{alon1987optimal,
title={Optimal preprocessing for answering on-line product queries},
author={Alon, Noga and Schieber, Baruch},
year={1987},
publisher={Citeseer}
}
@inproceedings{beame1999optimal,
title={Optimal bounds for the predecessor problem},
author={Beame, Paul and Fich, Faith E},
booktitle={STOC},
volume={99},
pages={295--304},
year={1999},
organization={Citeseer}
}
@inproceedings{patrascu2014dynamic,
title={Dynamic integer sets with optimal rank, select, and predecessor search},
author={P{\u{a}}tra{\c{s}}cu, Mihai and Thorup, Mikkel},
booktitle={2014 IEEE 55th Annual Symposium on Foundations of Computer Science},
pages={166--175},
year={2014},
organization={IEEE}
}
@article{navarro2016optimal,
title={Optimal encodings for range majority queries},
author={Navarro, Gonzalo and Thankachan, Sharma V},
journal={Algorithmica},
volume={74},
number={3},
pages={1082--1098},
year={2016},
publisher={Springer}
}
@article{kopelowitz2019strong,
title={The Strong 3SUM-INDEXING Conjecture is False},
author={Kopelowitz, Tsvi and Porat, Ely},
journal={arXiv preprint arXiv:1907.11206},
year={2019}
}
@inproceedings{Zhu2016An,
title={An Optimal Algorithm for a Computer Game in Linear Time},
author={Zhu, Daxin and Wang, Xiaodong},
booktitle={International Conference on Smart Computing \& Communication},
year={2016},
}
@inproceedings{bringmann2017dichotomy,
title={A dichotomy for regular expression membership testing},
author={Bringmann, Karl and Gr{\o}nlund, Allan and Larsen, Kasper Green},
booktitle={2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)},
pages={307--318},
year={2017},
organization={IEEE}
}
@article{alon1997finding,
title={Finding and counting given length cycles},
author={Alon, Noga and Yuster, Raphael and Zwick, Uri},
journal={Algorithmica},
volume={17},
number={3},
pages={209--223},
year={1997},
publisher={Springer}
}
@inproceedings{alon1994color,
title={Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs},
author={Alon, Noga and Yuster, Raphael and Zwick, Uri},
booktitle={STOC},
volume={94},
pages={326--335},
year={1994}
}
@article{keikha2017maximum,
title={Maximum-area triangle in a convex polygon, revisited},
author={Keikha, Vahideh and L{\"o}ffler, Maarten and Mohades, Ali and Urhausen, J{\'e}r{\^o}me and van der Hoog, Ivor},
journal={arXiv preprint arXiv:1705.11035},
year={2017}
}
@article{jin2017maximal,
title={Maximal area triangles in a convex polygon},
author={Jin, Kai},
journal={arXiv preprint arXiv:1707.04071},
year={2017}
}
@inproceedings{dobkin1979general,
title={On a general method for maximizing and minimizing among certain geometric problems},
author={Dobkin, David P and Snyder, Lawrence},
booktitle={20th Annual Symposium on Foundations of Computer Science (sfcs 1979)},
pages={9--17},
year={1979},
organization={IEEE}
}
@article{grabowski2016new,
title={New tabulation and sparse dynamic programming based techniques for sequence similarity problems},
author={Grabowski, Szymon},
journal={Discrete Applied Mathematics},
volume={212},
pages={96--103},
year={2016},
publisher={Elsevier}
}
@inproceedings{chan2016deterministic,
title={Deterministic APSP, orthogonal vectors, and more: Quickly derandomizing Razborov-Smolensky},
author={Chan, Timothy M. and Williams, Ryan},
booktitle={Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms},
pages={1246--1255},
year={2016},
organization={Society for Industrial and Applied Mathematics}
}
@inproceedings{abboud2015more,
title={More applications of the polynomial method to algorithm design},
author={Abboud, Amir and Williams, Ryan and Yu, Huacheng},
booktitle={Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms},
pages={218--230},
year={2015},
organization={Society for Industrial and Applied Mathematics}
}
@inproceedings{afshani2017independent,
title={Independent range sampling, revisited},
author={Afshani, Peyman and Wei, Zhewei},
booktitle={25th Annual European Symposium on Algorithms (ESA 2017)},
year={2017},
organization={Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik}
}
@article{afshani2019independent,
title={Independent range sampling, revisited again},
author={Afshani, Peyman and Phillips, Jeff M},
journal={arXiv preprint arXiv:1903.08014},
year={2019}
}
@article{erickson1999finding,
title={Finding longest arithmetic progressions},
author={Erickson, Je},
year={1999},
publisher={Citeseer}
}
@article{dudek2020all,
title={All non-trivial variants of 3-LDT are equivalent},
author={Dudek, Bart{\l}omiej and Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
journal={arXiv preprint arXiv:2001.01289},
year={2020}
}
@article{fredman1978complexity,
title={On the complexity of computing the measure of $\cup$[ai, bi]},
author={Fredman, Michael L and Weide, Bruce},
journal={Communications of the ACM},
volume={21},
number={7},
pages={540--544},
year={1978},
publisher={ACM}
}
@inproceedings{backurs2016regular,
title={Which regular expression patterns are hard to match?},
author={Backurs, Arturs and Indyk, Piotr},
booktitle={2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)},
pages={457--466},
year={2016},
organization={IEEE}
}
@inproceedings{chan2013klee,
title={Klee's measure problem made easy},
author={Chan, Timothy M.},
booktitle={2013 IEEE 54th annual symposium on foundations of computer science},
pages={410--419},
year={2013},
organization={IEEE}
}
@inproceedings{williams2014faster,
title={Faster all-pairs shortest paths via circuit complexity},
author={Williams, Ryan},
booktitle={Proceedings of the forty-sixth annual ACM symposium on Theory of computing},
pages={664--673},
year={2014}
}
@inproceedings{chan2016deterministic,
title={Deterministic apsp, orthogonal vectors, and more: Quickly derandomizing razborov-smolensky},
author={Chan, Timothy M. and Williams, Ryan},
booktitle={Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms},
pages={1246--1255},
year={2016},
organization={SIAM}
}
@article{thorup1999undirected,
title={Undirected single-source shortest paths with positive integer weights in linear time},
author={Thorup, Mikkel},
journal={Journal of the ACM (JACM)},
volume={46},
number={3},
pages={362--394},
year={1999},
publisher={ACM New York, NY, USA}
}
@article{eppstein1995dynamic,
title={Dynamic Euclidean minimum spanning trees and extrema of binary functions},
author={Eppstein, David},
journal={Discrete \& Computational Geometry},
volume={13},
number={1},
pages={111--122},
year={1995},
publisher={Springer}
}
@inproceedings{chan2020dynamic,
title={Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique},
author={Chan, Timothy M.},
booktitle={Symposium on Simplicity in Algorithms},
pages={33--37},
year={2020},
organization={SIAM}
}
@article{vaidya1989geometry,
title={Geometry helps in matching},
author={Vaidya, Pravin M},
journal={SIAM Journal on Computing},
volume={18},
number={6},
pages={1201--1225},
year={1989},
publisher={SIAM}
}
@article{agarwal2000vertical,
title={Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications},
author={Agarwal, Pankaj K and Efrat, Alon and Sharir, Micha},
journal={SIAM Journal on Computing},
volume={29},
number={3},
pages={912--953},
year={2000},
publisher={SIAM}
}
@article{karger1995randomized,
title={A randomized linear-time algorithm to find minimum spanning trees},
author={Karger, David R and Klein, Philip N and Tarjan, Robert E},
journal={Journal of the ACM (JACM)},
volume={42},
number={2},
pages={321--328},
year={1995},
publisher={ACM New York, NY, USA}
}
@inproceedings{alstrup2001optimal,
title={Optimal static range reporting in one dimension},
author={Alstrup, Stephen and Brodal, Gerth and Rauhe, Theis},
booktitle={Proceedings of the thirty-third annual ACM symposium on Theory of computing},
pages={476--482},
year={2001}
}
@inproceedings{mortensen2005dynamic,
title={On dynamic range reporting in one dimension},
author={Mortensen, Christian Worm and Pagh, Rasmus and P{\u{a}}tra{\c{s}}cu, Mihai},
booktitle={Proceedings of the thirty-seventh annual ACM symposium on Theory of computing},
pages={104--111},
year={2005}
}
@article{sladkey2012successive,
title={A Successive Approximation Algorithm for Computing the Divisor Summatory Function},
author={Sladkey, Richard},
journal={arXiv preprint arXiv:1206.3369},
year={2012}
}
@inproceedings{chan2020change,
title={On the Change-Making Problem},
author={Chan, Timothy M. and He, Qizheng},
booktitle={Symposium on Simplicity in Algorithms},
pages={38--42},
year={2020},
organization={SIAM}
}
@inproceedings{yuan2010data,
title={Data structures for range minimum queries in multidimensional arrays},
author={Yuan, Hao and Atallah, Mikhail J},
booktitle={Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms},
pages={150--160},
year={2010},
organization={SIAM}
}
@inproceedings{golin2011encoding,
title={Encoding 2D range maximum queries},
author={Golin, Mordecai and Iacono, John and Krizanc, Danny and Raman, Rajeev and Rao, S Srinivasa},
booktitle={International Symposium on Algorithms and Computation},
pages={180--189},
year={2011},
organization={Springer}
}
@inproceedings{karczmarz2019min,
title={Min-Cost Flow in Unit-Capacity Planar Graphs},
author={Karczmarz, Adam and Sankowski, Piotr},
booktitle={27th Annual European Symposium on Algorithms (ESA 2019)},
year={2019}
}
@inproceedings{mozes2010shortest,
title={Shortest paths in planar graphs with real lengths in ${O}(n\log^2 n/\log\log n)$ time},
author={Mozes, Shay and Wulff-Nilsen, Christian},
booktitle={European Symposium on Algorithms},
pages={206--217},
year={2010},
organization={Springer}
}
@article{mirzaian1985selection,
title={Selection in X+ Y and matrices with sorted rows and columns},
author={Mirzaian, Andranik and Arjomandi, Eshrat},
journal={Information processing letters},
volume={20},
number={1},
pages={13--17},
year={1985},
publisher={Elsevier}
}
@article{gabow1985linear,
title={A linear-time algorithm for a special case of disjoint set union},
author={Gabow, Harold N and Tarjan, Robert Endre},
journal={Journal of computer and system sciences},
volume={30},
number={2},
pages={209--221},
year={1985},
publisher={Elsevier}
}
@article{kwok1999static,
title={Static scheduling algorithms for allocating directed task graphs to multiprocessors},
author={Kwok, Yu-Kwong and Ahmad, Ishfaq},
journal={ACM Computing Surveys (CSUR)},
volume={31},
number={4},
pages={406--471},
year={1999},
publisher={ACM New York, NY, USA}
}
@article{ullman1975np,
title={NP-complete scheduling problems},
author={Ullman, Jeffrey D.},
journal={Journal of Computer and System sciences},
volume={10},
number={3},
pages={384--393},
year={1975},
publisher={Academic Press}
}
@article{gronlund2017fast,
title={Fast exact k-means, k-medians and bregman divergence clustering in 1d},
author={Gr{\o}nlund, Allan and Larsen, Kasper Green and Mathiasen, Alexander and Nielsen, Jesper Sindahl and Schneider, Stefan and Song, Mingzhou},
journal={arXiv preprint arXiv:1701.07204},
year={2017}
}
@article{wang2016line,
title={Line-constrained k-median, k-means, and k-center problems in the plane},
author={Wang, Haitao and Zhang, Jingru},
journal={International Journal of Computational Geometry \& Applications},
volume={26},
number={3-4},
pages={185--210},
year={2016},
publisher={World Scientific}
}
@book{knuth2011art,
title={The art of computer programming, volume 4A: combinatorial algorithms, part 1},
author={Knuth, Donald E},
year={2011},
publisher={Pearson Education India}
}
@article{har2005fast,
title={Fast algorithms for computing the smallest k-enclosing circle},
author={Har-Peled, Sariel and Mazumdar, Soham},
journal={Algorithmica},
volume={41},
number={3},
pages={147--157},
year={2005},
publisher={Springer}
}
@article{efrat1994computing,
title={Computing the smallest k-enclosing circle and related problems},
author={Efrat, Alon and Sharir, Micha and Ziv, Alon},