Fix references
This commit is contained in:
parent
b09ad74243
commit
3d55acb386
6
list.tex
6
list.tex
|
@ -160,7 +160,7 @@
|
|||
\bibitem{gro14}
|
||||
A. Grønlund and S. Pettie.
|
||||
Threesomes, degenerates, and love triangles.
|
||||
\emph{2014 IEEE 55th Annual Symposium on Foundations of Computer Science},
|
||||
In \emph{Proceedings of the 55th Annual Symposium on Foundations of Computer Science},
|
||||
621--630, 2014.
|
||||
|
||||
\bibitem{gru39}
|
||||
|
@ -316,7 +316,7 @@
|
|||
\bibitem{sha75}
|
||||
M. I. Shamos and D. Hoey.
|
||||
Closest-point problems.
|
||||
\emph{16th Annual Symposium on Foundations of Computer Science}, 151--162, 1975.
|
||||
In \emph{Proceedings of the 16th Annual Symposium on Foundations of Computer Science}, 151--162, 1975.
|
||||
|
||||
\bibitem{sha81}
|
||||
M. Sharir.
|
||||
|
@ -355,7 +355,7 @@
|
|||
\bibitem{tar84}
|
||||
R. E. Tarjan and U. Vishkin.
|
||||
Finding biconnected componemts and computing tree functions in logarithmic parallel time.
|
||||
\emph{25th Annual Symposium on Foundations of Computer Science}, 12--20, 1984.
|
||||
In \emph{Proceedings of the 25th Annual Symposium on Foundations of Computer Science}, 12--20, 1984.
|
||||
|
||||
\bibitem{tem61}
|
||||
H. N. V. Temperley and M. E. Fisher.
|
||||
|
|
Loading…
Reference in New Issue