Breaking the Θ(nlog2 n) barrier for sorting with
faults
Leighton, T.; Yuan Ma
Page(s): 734-743
Digital Object Identifier 10.1109/SFCS.1993.366814 Abstract
| Full Text: PDF (820 KB)
Rights and Permissions
The hardness of approximate optima in lattices, codes, and systems
of linear equations
Arora, S.; Babai, L.; Stern, J.; Sweedyk, Z.
Page(s): 724-733
Digital Object Identifier 10.1109/SFCS.1993.366815 Abstract
| Full Text: PDF (784 KB)
Rights and Permissions
External-memory computational geometry
Goodrich, M.T.; Jyh-Jong Tsay; Vengroff, D.E.; Vitter, J.S.
Page(s): 714-723
Digital Object Identifier 10.1109/SFCS.1993.366816 Abstract
| Full Text: PDF (800 KB)
Rights and Permissions
Efficient out-of-core algorithms for linear relaxation using
blocking covers
Leiserson, C.E.; Rao, S.; Toledo, S.
Page(s): 704-713
Digital Object Identifier 10.1109/SFCS.1993.366817 Abstract
| Full Text: PDF (812 KB)
Rights and Permissions
On choosing a dense subgraph
Kortsarz, G.; Peleg, D.
Page(s): 692-701
Digital Object Identifier 10.1109/SFCS.1993.366818 Abstract
| Full Text: PDF (696 KB)
Rights and Permissions
A Chernoff bound for random walks on expander graphs
Gillman, D.
Page(s): 680-691
Digital Object Identifier 10.1109/SFCS.1993.366819 Abstract
| Full Text: PDF (888 KB)
Rights and Permissions
Eavesdropping games: a graph-theoretic approach to privacy in
distributed systems
Franklin, M.; Galil, Z.; Yung, M.
Page(s): 670-679
Digital Object Identifier 10.1109/SFCS.1993.366820 Abstract
| Full Text: PDF (816 KB)
Rights and Permissions
A sub-linear time distributed algorithm for minimum-weight spanning
trees
Garay, J.A.; Kutten, S.; Peleg, D.
Page(s): 659-668
Digital Object Identifier 10.1109/SFCS.1993.366821 Abstract
| Full Text: PDF (688 KB)
Rights and Permissions
Fast algorithms for constructing t-spanners and paths with stretch
t
Near-linear cost sequential and distributed constructions of sparse
neighborhood covers
Awerbuch, B.; Berger, B.; Cowen, L.; Peleg, D.
Page(s): 638-647
Digital Object Identifier 10.1109/SFCS.1993.366823 Abstract
| Full Text: PDF (708 KB)
Rights and Permissions
An O(nlog3 n) algorithm for the real root problem
Reif, J.H.
Page(s): 626-635
Digital Object Identifier 10.1109/SFCS.1993.366824 Abstract
| Full Text: PDF (752 KB)
Rights and Permissions
Counting rational points on curves over finite fields
Ming-Deh Huang; Ierardi, D.
Page(s): 616-625
Digital Object Identifier 10.1109/SFCS.1993.366825 Abstract
| Full Text: PDF (764 KB)
Rights and Permissions
Directed vs. undirected monotone contact networks for threshold
functions
Halldorsson, M.M.; Radhakrishnan, J.; Subrahmanyam, K.V.
Page(s): 604-613
Digital Object Identifier 10.1109/SFCS.1993.366826 Abstract
| Full Text: PDF (692 KB)
Rights and Permissions
Signal propagation, with application to a lower bound on the depth
of noisy formulas
Evans, W.; Schulman, L.J.
Page(s): 594-603
Digital Object Identifier 10.1109/SFCS.1993.366827 Abstract
| Full Text: PDF (676 KB)
Rights and Permissions
Refining a triangulation of a planar straight-line graph to
eliminate large angles
Mitchell, S.A.
Page(s): 583-592
Digital Object Identifier 10.1109/SFCS.1993.366828 Abstract
| Full Text: PDF (688 KB)
Rights and Permissions
A compact piecewise-linear Voronoi diagram for convex sites in the
plane
McAllister, M.; Kirkpatrick, D.; Snoeyink, J.
Page(s): 573-582
Digital Object Identifier 10.1109/SFCS.1993.366829 Abstract
| Full Text: PDF (744 KB)
Rights and Permissions
A polynomial time algorithm for counting integral points in
polyhedra when the dimension is fixed
Barvinok, A.I.
Page(s): 566-572
Digital Object Identifier 10.1109/SFCS.1993.366830 Abstract
| Full Text: PDF (428 KB)
Rights and Permissions
The NC equivalence of planar integer linear programming and
Euclidean GCD
Shallcross, D.; Pan, V.; Yu Lin-Kriz
Page(s): 557-564
Digital Object Identifier 10.1109/SFCS.1993.366831 Abstract
| Full Text: PDF (460 KB)
Rights and Permissions
On bounded queries and approximation
Chang, R.; Gasarch, W.I.
Page(s): 547-556
Digital Object Identifier 10.1109/SFCS.1993.366832 Abstract
| Full Text: PDF (768 KB)
Rights and Permissions
What can we sort in o(nlog n) time?
Ben-Amram, A.M.; Galil, Z.
Page(s): 538-546
Digital Object Identifier 10.1109/SFCS.1993.366833 Abstract
| Full Text: PDF (628 KB)
Rights and Permissions
Better lower bounds on detecting affine and spherical degeneracies
Erickson, J.; Seidel, R.
Page(s): 528-536
Digital Object Identifier 10.1109/SFCS.1993.366834 Abstract
| Full Text: PDF (688 KB)
Rights and Permissions
The union of convex polyhedra in three dimensions
Aronov, B.; Sharir, M.
Page(s): 518-527
Digital Object Identifier 10.1109/SFCS.1993.366835 Abstract
| Full Text: PDF (772 KB)
Rights and Permissions
Efficient computation of Euclidean shortest paths in the plane
Hershberger, J.; Suri, S.
Page(s): 508-517
Digital Object Identifier 10.1109/SFCS.1993.366836 Abstract
| Full Text: PDF (896 KB)
Rights and Permissions
Almost tight upper bounds for lower envelopes in higher dimensions
Sharir, M.
Page(s): 498-507
Digital Object Identifier 10.1109/SFCS.1993.366837 Abstract
| Full Text: PDF (816 KB)
Rights and Permissions
A weak version of the Blum, Shub and Smale model
Koiran, P.
Page(s): 486-495
Digital Object Identifier 10.1109/SFCS.1993.366838 Abstract
| Full Text: PDF (728 KB)
Rights and Permissions
Cart
