-
Notifications
You must be signed in to change notification settings - Fork 2
/
algorithms.bib
597 lines (546 loc) · 19.7 KB
/
algorithms.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
%% This BibTeX bibliography file was created using BibDesk.
%% http://bibdesk.sourceforge.net/
%% Created for Jeff Erickson at 2021-06-25 11:17:34 -0500
%% Saved with string encoding Unicode (UTF-8)
@inproceedings{ckpps-facsd-16,
arxiv = {1608.03270},
author = {Cohen, Michael B. and Kelner, Jonathan and Peebles, John and Peng, Richard and Sidford, Aaron and Vladu, Adrian},
booktitle = {Proc. 57th Ann. IEEE Symp. Found. Comput. Sci.},
date-added = {2021-06-25 10:57:31 -0500},
date-modified = {2021-06-25 11:01:57 -0500},
doi = {10.1109/FOCS.2016.69},
pages = {583--592},
title = {Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More},
year = {2016}}
@inproceedings{ckkpp-sdlsn-18,
arxiv = {1811.10722},
author = {Cohen, Michael B. and Kelner, Jonathan and Kyng, Rasmus and Peebles, John and Peng, Richard and Rao, Anup B. and Sidford, Aaron},
booktitle = {Proc. 59th Ann. IEEE Symp. Found. Comput. Sci.},
date-added = {2021-06-22 13:48:15 -0500},
date-modified = {2021-06-25 10:59:25 -0500},
doi = {10.1109/FOCS.2018.00089},
pages = {898--909},
title = {Solving Directed {Laplacian} Systems in Nearly-Linear Time through Sparse {LU} Factorizations},
year = {2018},
Bdsk-Url-1 = {https://doi.org/10.1109/FOCS.2018.00089}}
@article{b-simig-68,
author = {Bareiss, Erwin H.},
date-added = {2021-06-22 13:34:58 -0500},
date-modified = {2021-06-22 13:36:16 -0500},
doi = {10.2307/2004533},
journal = {Math. Comput.},
number = {103},
pages = {565--578},
read = {1},
title = {{Sylvester's} Identity and multistep integer-preserving {Gaussian} elimination},
volume = {22},
year = {1968},
Bdsk-Url-1 = {https://doi.org/10.2307/2004533}}
@article{ay-msnda-13,
author = {Alon, Noga and Yuster, Raphael},
comments = {Full version of \cite{ay-slstn-10}},
date-added = {2021-06-20 17:40:14 -0500},
date-modified = {2021-06-20 17:49:53 -0500},
doi = {10.1145/2508028.2505989},
journal = {J. ACM},
keywords = {nested dissection, asymmetric, arbitrary fields},
number = {4},
pages = {25:1--25:8},
title = {Matrix Sparsification and Nested Dissection over Arbitrary Fields},
volume = {60},
year = {2013},
Bdsk-Url-1 = {https://doi.org/10.1145/2508028.2505989}}
@inproceedings{ay-slstn-10,
author = {Alon, Noga and Yuster, Raphael},
booktitle = {Proc. 51st Ann. IEEE Symp. Found. Comput. Sci.},
comments = {Full version in \cite{ay-msnda-13}},
date-added = {2021-06-20 17:28:22 -0500},
date-modified = {2021-06-25 10:59:44 -0500},
doi = {10.1109/FOCS.2010.28},
keywords = {nested dissection, asymmetric, arbitrary fields},
pages = {225--234},
title = {Solving linear systems through nested dissection},
year = {2010},
Bdsk-Url-1 = {https://doi.org/10.1109/FOCS.2010.28}}
@inproceedings{l-ptfmm-14,
author = {Le~Gall, Fran{\c c}ois},
booktitle = {Proc. 25th int. Symb. Alg. Comput.},
date-added = {2021-05-31 17:52:36 -0500},
date-modified = {2021-05-31 17:52:36 -0500},
doi = {10.1145/2608628.2608664},
pages = {296--303},
title = {Powers of tensors and fast matrix multiplication},
year = {2014},
Bdsk-Url-1 = {https://doi.org/10.1145/2608628.2608664}}
@article{j-easps-77,
author = {Johnson, Donald B.},
date-added = {2020-07-12 17:50:21 -0500},
date-modified = {2020-07-12 17:50:45 -0500},
doi = {10.1145/321992.321993},
journal = {J. Assoc. Comput. Mach.},
number = {1},
pages = {1--13},
title = {Efficient algorithms for shortest paths in sparse networks},
volume = {24},
year = {1977},
Bdsk-Url-1 = {https://doi.org/10.1145/321992.321993}}
@article{ek-tiaen-72,
author = {Edmonds, Jack and Karp, Richard M.},
date-added = {2020-07-12 17:49:11 -0500},
date-modified = {2020-07-12 17:49:33 -0500},
doi = {10.1145/321694.321699},
journal = {J. Assoc. Comput. Mach.},
number = {2},
pages = {248--264},
read = {1},
title = {Theoretical improvements in algorithmic efficiency of network flow problems},
volume = {19},
year = {1972},
Bdsk-Url-1 = {https://doi.org/10.1145/321694.321699}}
@article{t-stust-71,
author = {Tomizawa, Nobuaki},
comments = {reweighting successive shortest paths},
date-added = {2020-07-12 17:48:56 -0500},
date-modified = {2020-07-12 17:50:04 -0500},
doi = {10.1002/net.3230010206},
journal = {Networks},
pages = {173--194},
read = {1},
title = {On some techniques useful for solution of transportation network problems},
volume = {1},
year = {1971},
Bdsk-Url-1 = {https://doi.org/10.1002/net.3230010206}}
@article{w-pdmia-67,
author = {Waite, William M.},
comments = {Cycle detection in pne-vertex periodic graphs},
date-added = {2020-04-27 11:05:48 -0500},
date-modified = {2020-04-27 11:07:31 -0500},
doi = {10.1145/321386.321392},
journal = {J. Assoc. Comput. Mach.},
number = {2},
pages = {300--310},
title = {Path detection in multidimensional iterative arrays},
volume = {14},
year = {1967},
Bdsk-Url-1 = {https://doi.org/10.1145/321386.321392}}
@phdthesis{i-tdgtv-87,
author = {Iwano, Kazuo},
date-added = {2020-04-27 10:51:51 -0500},
date-modified = {2020-07-13 13:40:56 -0500},
month = {October},
school = {Princeton Univ.},
title = {Two-Dimensional Dynamic Graphs and their {VLSI} Applications},
url = {https://search.proquest.com/docview/303485362},
year = {1987},
Bdsk-Url-1 = {https://search.proquest.com/docview/303485362}}
@article{kmw-ocure-67,
author = {Karp, Richard M. and Miller, Raymond E. and Winograd, Shmuel},
date-added = {2020-04-24 14:43:51 -0500},
date-modified = {2020-07-12 17:34:29 -0500},
doi = {10.1145/321406.321418},
journal = {J. Assoc. Comput. Mach.},
keywords = {periodic graphs},
number = {3},
pages = {563--590},
read = {1},
title = {The organization of computations for uniform recurrence equations},
volume = {14},
year = {1967},
Bdsk-Url-1 = {https://doi.org/10.1145/321406.321418}}
@inproceedings{is-tcigw-87,
author = {Iwano, Kazuo and Steiglitz, Kenneth},
booktitle = {Proc. 19th Ann. ACM Symp. Theory Comput.},
date-added = {2020-04-24 14:43:51 -0500},
date-modified = {2020-04-24 16:15:31 -0500},
doi = {10.1145/28395.28401},
pages = {46--55},
read = {1},
title = {Testing for cycles in infintie graphs with periodic structure},
year = {1987},
Bdsk-Url-1 = {https://doi.org/10.1145/28395.28401}}
@article{rk-riati-88,
author = {Rao, Sailesh K. and Kailath, Thomas},
date-added = {2020-04-24 14:43:51 -0500},
date-modified = {2020-04-24 16:15:33 -0500},
doi = {10.1109/5.4402},
journal = {Proc. IEEE},
keywords = {preiodic graphs},
number = {3},
pages = {259--269},
read = {1},
title = {Regular iterative algorithms and their implementation on processor arrays},
volume = {76},
year = {1988},
Bdsk-Url-1 = {https://doi.org/10.1109/5.4402}}
@article{fw-tams-94,
author = {Fredman, Michael L. and Willard, Dan E.},
date-added = {2019-11-05 17:05:07 -0600},
date-modified = {2019-11-05 17:08:07 -0600},
doi = {10.1016/S0022-0000(05)80064-9},
journal = {J. Comput. Syst. Sci.},
number = {3},
pages = {533--551},
read = {1},
title = {Trans-dichotomous algorithms for minimum spanning trees and shortest paths},
volume = {48},
year = {1994},
Bdsk-Url-1 = {https://doi.org/10.1016/S0022-0000(05)80064-9}}
@incollection{e-mms-90,
author = {van Emde~Boas, Peter},
booktitle = {Algorithms and Complexity},
date-added = {2019-08-14 20:25:40 -0500},
date-modified = {2019-08-14 20:26:55 -0500},
doi = {10.1016/B978-0-444-88071-0.50006-0},
pages = {1--36},
read = {1},
series = {Handbook of Theoretical Computer Science},
title = {Machine Models and Simulations},
volume = {1},
year = {1990},
Bdsk-Url-1 = {https://doi.org/10.1016/B978-0-444-88071-0.50006-0}}
@article{cr-tbram-73,
author = {Cook, Stephen A. and Reckhow, Robert A.},
comments = {Defines the theoretical RAM model, ALGOL-RAM},
date-added = {2019-08-14 20:20:27 -0500},
date-modified = {2019-11-05 16:48:57 -0600},
doi = {10.1016/S0022-0000(73)80029-7},
journal = {J. Comput. Syst. Sci.},
number = {4},
pages = {354--375},
read = {1},
title = {Time Bounded Random Access Machines},
volume = {7},
year = {1973},
Bdsk-Url-1 = {https://doi.org/10.1016/S0022-0000(73)80029-7}}
@inproceedings{w-dnstm-83,
author = {Wiedermann, Juraj},
booktitle = {Information Processing 83, Proc. IFIP 9th World Computer Congress},
date-added = {2019-08-14 20:17:02 -0500},
date-modified = {2019-08-14 20:19:02 -0500},
pages = {163--168},
title = {Deterministic and Nondeterministic Simulation of the {RAM} by the {Turing} Machine},
year = {1983}}
@article{klp-fstmr-88,
author = {Katajainen, Jyrki and van Leeuwen, Jan and Penttonen, Martti},
date-added = {2019-08-14 20:13:12 -0500},
date-modified = {2019-08-14 20:16:56 -0500},
doi = {10.1137/0217005},
journal = {{SIAM} J. Comput.},
number = {1},
pages = {77--88},
read = {1},
title = {Fast Simulation of Turing Machines by Random Access Machines},
volume = {17},
year = {1988},
Bdsk-Url-1 = {https://doi.org/10.1137/0217005}}
@article{r-rrcs-91,
author = {Robson, John M.},
date-added = {2019-08-14 20:10:13 -0500},
date-modified = {2019-08-14 20:11:18 -0500},
doi = {10.1016/0304-3975(91)90177-4},
journal = {Theoret. Comput. Sci.},
number = {1},
pages = {141--149},
read = {1},
title = {An {$O(T\log T)$} Reduction from {RAM} Computations to Satisfiability},
volume = {82},
year = {1991},
Bdsk-Url-1 = {https://doi.org/10.1016/0304-3975(91)90177-4}}
@article{pf-racm-79,
author = {Pippenger, Nicholas and Fischer, Michael J.},
date-added = {2019-08-14 20:07:22 -0500},
date-modified = {2019-08-14 20:17:00 -0500},
doi = {10.1145/322123.322138},
journal = {J. Assoc. Comput. Mach.},
number = {2},
pages = {361--381},
read = {1},
title = {Relations among complexity measures},
volume = {26},
year = {1979},
Bdsk-Url-1 = {https://doi.org/10.1145/322123.322138}}
@article{c-spfrnc-88,
author = {Cook, Stephen A.},
date-added = {2019-08-14 20:00:20 -0500},
date-modified = {2019-08-14 20:06:28 -0500},
doi = {10.1016/0020-0190(88)90152-4},
journal = {Inf. Proc. Lett.},
month = {11 January},
number = {5},
pages = {269--270},
title = {Short propositional formulas represent nondeterministic computations},
volume = {26},
year = {1988},
Bdsk-Url-1 = {https://doi.org/10.1016/0020-0190(88)90152-4}}
@article{l-usp-73,
author = {Levin, Leonid A.},
booktitle = {Problems of Information Transmission},
date-added = {2019-08-14 19:44:17 -0500},
date-modified = {2019-08-14 20:16:58 -0500},
journal = {Problems Inform. Transmission},
number = {3},
pages = {265--266},
read = {0},
title = {Universal Sequential Search Problems},
url = {http://mi.mathnet.ru/eng/ppi/v9/i3/p115},
volume = {9},
year = {1973},
Bdsk-Url-1 = {http://mi.mathnet.ru/eng/ppi/v9/i3/p115}}
@inproceedings{c-ctpp-71,
author = {Cook, Stephen},
booktitle = {Proc. 3rd Ann. Symp. Theory Comput.},
date-added = {2019-08-14 19:42:18 -0500},
date-modified = {2019-08-14 19:43:27 -0500},
doi = {10.1145/800157.805047},
pages = {151--158},
read = {1},
title = {The complexity of theorem proving procedures},
year = {1971},
Bdsk-Url-1 = {https://doi.org/10.1145/800157.805047}}
@book{k-fa-97,
author = {Knuth, Donald E.},
date-added = {2019-08-14 19:37:29 -0500},
date-modified = {2019-08-14 19:40:25 -0500},
publisher = {Addison-Wesley},
read = {1},
series = {The Art of Computer Programming},
title = {Fundamental Algorithms},
volume = {I},
year = {1997}}
@article{bt-lspdw-09,
author = {Bradford, Phillip G. and Thomas, David A.},
date-added = {2019-03-13 14:45:14 +0100},
date-modified = {2019-03-13 14:49:46 +0100},
doi = {10.1051/ita/2009011},
journal = {RAIRO-Theor. Inf. Appl.},
keywords = {CFG shortest paths, negative edges},
number = {3},
pages = {567--583},
read = {1},
title = {Labeled shortest paths in digraphs with negative and positive edge weights},
volume = {43},
year = {2009},
Bdsk-Url-1 = {https://doi.org/10.1051/ita/2009011}}
@mastersthesis{f-sscl-78,
author = {Fajuyigbe, Oladele},
comments = {O(S_{RD}) time, where for CNF grammars S_{RD} = # production rules},
date-added = {2018-02-10 23:21:30 +0000},
date-modified = {2018-02-10 23:29:49 +0000},
read = {1},
school = {Oregon St. Univ.},
title = {The shortest strings in a context-free langauge},
url = {http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/9z903315x},
year = {1978},
Bdsk-Url-1 = {http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/9z903315x}}
@misc{gr-cpqws-17,
arxiv = {1612.08872v2},
author = {Grigorev, Semyon and Ragozina, Anastasiya},
date-added = {2018-02-10 23:11:30 +0000},
date-modified = {2018-02-10 23:12:18 +0000},
howpublished = {Preprint},
month = {January},
read = {1},
title = {Context-Free Path Querying with Structural Representation of Result},
year = {2017}}
@article{se-sqcg-08,
author = {Sevon, Petteri and Eronen, Lauri},
date-added = {2018-02-10 23:08:03 +0000},
date-modified = {2018-02-10 23:12:19 +0000},
doi = {10.1515/jib-2008-100},
journal = {J. Integrative Bioinformatics},
number = {2},
pages = {157--172},
read = {1},
title = {Subgraph Queries by Context-free Grammars},
volume = {5},
year = {2008},
Bdsk-Url-1 = {https://doi.org/10.1515/jib-2008-100}}
@misc{h-qpguc-16,
arxiv = {1502.02242v2},
author = {Hellings, Jelle},
date-added = {2018-02-10 22:59:40 +0000},
date-modified = {2018-02-10 23:01:00 +0000},
howpublished = {Preprint},
month = {January},
read = {1},
title = {Querying for Paths in Graphs using Context-Free Path Queries},
year = {2016}}
@inproceedings{h-ccpq-14,
author = {Hellings, Jelle},
booktitle = {Proc. 17th Int Conf. Database Theory},
date-added = {2018-02-10 22:57:48 +0000},
date-modified = {2018-02-10 23:01:00 +0000},
doi = {10.5441/002/icdt.2014.15},
pages = {119--130},
read = {1},
title = {Conjunctive Context-Free Path Queries},
year = {2014},
Bdsk-Url-1 = {https://doi.org/10.5441/002/icdt.2014.15}}
@inproceedings{mj-afsts-75,
author = {McLean, Michael J. and Johnston, Daniel B.},
booktitle = {Combaintorial Mathematics~{III}},
date-added = {2018-02-10 22:27:48 +0000},
date-modified = {2018-07-02 20:38:04 +0000},
doi = {10.1007/BFb0069557},
number = {452},
pages = {180--196},
publisher = {Springer},
read = {1},
series = {Lecture Notes Math.},
title = {An algorithm for finding the shortest terminal strings which can be produced from non-terminals in context-free grammars},
year = {1975},
Bdsk-Url-1 = {https://doi.org/10.1007/BFb0069557}}
@article{mr-icccr-00,
author = {Melski, David and Reps, Thomas},
comments = {O((N+T)^3 n^3) time},
date-added = {2017-11-25 23:30:33 +0000},
date-modified = {2017-11-25 23:44:58 +0000},
doi = {10.1016/S0304-3975(00)00049-9},
journal = {Theoret. Comput. Sci.},
keywords = {CFG reachability},
number = {1--2},
pages = {29--98},
read = {1},
title = {Interconvertibility of a class of set constraints and context-free-language reachability},
volume = {248},
year = {2000},
Bdsk-Url-1 = {https://dx.doi.org/10.1016/S0304-3975(00)00049-9}}
@inproceedings{y-gmdt-90,
author = {Yannakakis, Mihalis},
booktitle = {Proc. 9th ACM SIGACT-SIGMOD-SIGART Symp. Principles Database Syst.},
comments = {O(n^3) time for fixed grammar},
date-added = {2017-11-25 23:04:25 +0000},
date-modified = {2017-11-25 23:44:50 +0000},
doi = {10.1145/298514.298576},
keywords = {CFG reachability},
pages = {230--242},
read = {1},
title = {Graph-theoretic methods in database theory},
year = {1990},
Bdsk-Url-1 = {https://dx.doi.org/10.1145/298514.298576}}
@article{bjm-flcpp-00,
author = {Barrett, Chris and Jacob, Riko and Marathe, Madhav},
comments = {O(n^3 NP) timex},
date-added = {2017-09-28 01:34:21 +0000},
date-modified = {2017-11-25 23:45:17 +0000},
doi = {10.1137/S0097539798337716},
journal = {SIAM J. Comput.},
keywords = {CFG shortest paths},
number = {3},
pages = {809--837},
read = {1},
title = {Formal-language-constrained path problems},
volume = {30},
year = {2000},
Bdsk-Url-1 = {http://dx.doi.org/10.1137/S0097539798337716}}
@article{c-sarsm-08,
author = {Chaudhuri, Swarat},
date-added = {2017-09-27 15:00:58 +0000},
date-modified = {2017-09-27 15:04:11 +0000},
doi = {10.1145/1328438.1328460},
journal = {SIGPLAN Notices},
note = {\emph{Proc. 35th Ann. ACM SIGPLAN-SIGACT Symp. Principles Prog. Lang.}},
number = {1},
pages = {159--169},
read = {1},
title = {Subcubic algorithms for recursive state machines},
volume = {43},
year = {2008},
Bdsk-Url-1 = {http://dx.doi.org/10.1145/1328438.1328460}}
@article{dek-spp-82,
author = {Dolev, Danny and Even, Shimon and Karp, Richard M.},
date-added = {2017-09-27 14:51:28 +0000},
date-modified = {2017-09-27 14:53:12 +0000},
doi = {10.1016/S0019-9958(82)90401-6},
journal = {Inf. Control},
keywords = {CFL reachability, CYK-Shimbel},
number = {1--3},
pages = {57--68},
read = {1},
title = {On the security of ping-ping protocols},
volume = {55},
year = {1982},
Bdsk-Url-1 = {http://dx.doi.org/10.1016/S0019-9958(82)90401-6}}
@inproceedings{y-pctum-77,
author = {Yao, Andrew C. C.},
booktitle = {Proc. 18th Ann. Symp. Found. Comput. Sci.},
date-added = {2013-12-04 21:02:41 +0000},
date-modified = {2013-12-04 21:03:55 +0000},
title = {Probabilistic computations: Toward a unified measure of complexity},
volume = {222--227},
year = {1977}}
@book{clrs-ia-09,
author = {Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald R. and Stein, Clifford},
date-added = {2012-09-24 02:30:58 +0000},
date-modified = {2012-09-24 02:38:14 +0000},
publisher = {MIT Press},
read = {1},
title = {Introduction to Algorithms},
year = {2009}}
@techreport{b-mnbo-95,
author = {Bradford, Phillip G.},
date-added = {2012-09-21 04:14:23 +0000},
date-modified = {2012-09-21 04:21:23 +0000},
institution = {Max-Planck-Institut f{\"u}r Informatik},
number = {MPI-I-95-1-025},
read = {1},
title = {Matching nuts and bolts optimally},
type = {{Tech. Rep.}},
url = {http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1995-1-025},
year = {1995},
Bdsk-Url-1 = {http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1995-1-025}}
@article{abf-mnbf-96,
author = {Alon, Noga and Bradford, Phillip G. and Fleischer, Rudolf},
comments = {O(n log^2 n) deterministic},
date-added = {2012-09-21 04:08:48 +0000},
date-modified = {2012-09-21 04:10:02 +0000},
journal = {Inform. Proc. Lett.},
number = {3},
pages = {123--127},
read = {1},
title = {Matching nuts and bolts faster},
volume = {59},
year = {1996}}
@inproceedings{bf-mnbf-95,
author = {Bradford, Phillip G. and Fleischer, Rudolf},
booktitle = {Proc. 6th. Int. Symp. Algorithms Comput.},
comments = {O(n log^2 n) deterministic},
date-added = {2012-09-21 04:05:35 +0000},
date-modified = {2012-09-21 04:09:57 +0000},
editor = {Staples, John and Eades, Peter and Katoh, Naoki and Moffat, Alistair},
number = {1004},
pages = {402--408},
read = {1},
series = {Lecture Notes Comput. Sci.},
title = {Matching nuts and bolts faster},
year = {1995}}
@inproceedings{abfkno-mnb-94,
author = {Alon, Noga and Blum, Manuel and Fiat, Amos and Kannan, Sampath and Noar, Moni and Ostrovsky, Rafail},
booktitle = {Proc. 5th Ann. ACM-SIAM Symp. Discrete Algorithms},
comments = {O(n log^4 n) determinstic},
date-added = {2012-09-21 04:01:04 +0000},
date-modified = {2012-09-21 04:03:06 +0000},
pages = {690--696},
read = {1},
title = {Matching nuts and bolts},
year = {1994}}
@book{r-cwiaa-92,
author = {Rawlins, Gregory J. E.},
date-added = {2012-09-21 03:56:45 +0000},
date-modified = {2012-09-21 04:03:15 +0000},
keywords = {Nuts and bolts},
publisher = {Computer Science Press/W. H. Freeman},
read = {1},
title = {Compared To What?: An Introduction to The Analysis of Algorithms},
year = {1992}}
@article{js-mnbot-98,
author = {Koml{\'o}s, J{\'a}nos and Ma, Yuan and Szemer{\'e}di, Endre},
date-added = {2012-09-21 03:50:37 +0000},
date-modified = {2012-09-21 04:01:06 +0000},
journal = {SIAM J. Discrete Math.},
number = {3},
pages = {347--372},
read = {1},
title = {Matching nuts and bolts in ${O(n\log n)}$ time},
volume = {11},
year = {1998}}