![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Steven Fortune
Person information
- affiliation: Bell Labs
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j30]Andrea Francini, Steven Fortune, Thierry Klein, Marco Ricca:
A low-cost methodology for profiling the power consumption of network equipment. IEEE Commun. Mag. 53(5): 250-256 (2015) - [j29]Steven Fortune:
Equivalence and generalization in a layered network model. J. Comput. Syst. Sci. 81(8): 1698-1714 (2015) - 2013
- [c29]Spyridon Antonakopoulos, Steven Fortune, Rae McLellan, Lisa Zhang:
Collector-based cell reordering in load-balanced switch fabrics. HPSR 2013: 1-6 - [c28]Spyridon Antonakopoulos, Steven Fortune, Rae McLellan, Lisa Zhang:
Worst-case delay bounds for uniform load-balanced switch fabrics. ICC 2013: 3792-3796 - [c27]Marco Ricca, Andrea Francini, Steven Fortune, Thierry Klein:
An assessment of power-load proportionality in network systems. SustainIT 2013: 1-8
2000 – 2009
- 2009
- [j28]Steven Fortune, Martin Zirngibl:
Enabling science and technology. Bell Labs Tech. J. 14(3): 1-5 (2009) - [j27]Steven Fortune:
Algorithmic Choice of Optical Amplifiers Respecting Noise and Nonlinearity Constraints. JOCN 1(5): 366-375 (2009) - 2007
- [j26]Eric S. Fisher, Steven Fortune, Martin K. Gladstein, Suresh Goyal, William B. Lyons
, James H. Mosher Jr., Gordon T. Wilfong:
Economic modeling of global test strategy I: Mathematical models. Bell Labs Tech. J. 12(1): 161-173 (2007) - [j25]Eric S. Fisher, Steven Fortune, Martin K. Gladstein, Suresh Goyal, William B. Lyons
, James H. Mosher Jr., Gordon T. Wilfong:
Economic modeling of global test strategy II: Software system and examples. Bell Labs Tech. J. 12(1): 175-186 (2007) - 2006
- [j24]Chandra Chekuri, Paul Claisse, René-Jean Essiambre, Steven Fortune, Daniel C. Kilper
, Wonsuck Lee, Nachi K. Nithi, Iraj Saniee, F. Bruce Shepherd, Christopher A. White, Gordon T. Wilfong, Lisa Zhang:
Design tools for transparent optical networks. Bell Labs Tech. J. 11(2): 129-143 (2006) - 2004
- [r1]Steven Fortune:
Voronoi Diagrams and Delaunay Triangulations. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 513-528 - 2003
- [e2]Steven Fortune:
Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003. ACM 2003, ISBN 1-58113-663-3 [contents] - 2002
- [j23]Steven Fortune:
Editorial. Comput. Geom. 22(1-3): 1-3 (2002) - [j22]Steven Fortune:
An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials. J. Symb. Comput. 33(5): 627-646 (2002) - 2001
- [c26]Steven Fortune:
Polynomial root finding using iterated Eigenvalue computation. ISSAC 2001: 121-128 - 2000
- [j21]Steven Fortune:
Introduction. Algorithmica 27(1): 1-4 (2000) - [c25]Steven Fortune:
Exact computations of the inertia symmetric integer matrices. STOC 2000: 556-564 - [e1]Siu-Wing Cheng, Otfried Cheong, Pankaj K. Agarwal, Steven Fortune:
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, Clear Water Bay, Hong Kong, China, June 12-14, 2000. ACM 2000, ISBN 1-58113-224-7 [contents]
1990 – 1999
- 1999
- [j20]Boris Aronov
, Steven Fortune:
Approximating Minimum-Weight Triangulations in Three Dimensions. Discret. Comput. Geom. 21(4): 527-549 (1999) - [j19]Steven Fortune:
Vertex-Rounding a Three-Dimensional Polyhedral Subdivision. Discret. Comput. Geom. 22(4): 593-618 (1999) - [c24]Steven Fortune:
Topological Beam Tracing. SCG 1999: 59-68 - 1998
- [j18]Nina Amenta, Steven Fortune:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 8(2): 117-118 (1998) - [c23]Steven Fortune:
Vertex-Rounding a Three-Dimensional Polyhedral Subdivision. SCG 1998: 116-125 - [c22]Kevin Weiler, Tom Duff, Steven Fortune, Chris Hoffman, Thomas J. Peters:
Is robust geometry possible? (panel). SIGGRAPH Abstracts and Applications 1998: 217-219 - 1997
- [j17]L. Paul Chew, Steven Fortune:
Sorting Helps for Voronoi Diagrams. Algorithmica 18(2): 217-228 (1997) - [j16]Steven Fortune:
Polyhedral modelling with multiprecision integer arithmetic. Comput. Aided Des. 29(2): 123-133 (1997) - [j15]Steven Fortune:
Editor's Foreword. Int. J. Comput. Geom. Appl. 7(4): 269-270 (1997) - [j14]Vinko Erceg, Steven Fortune, Jonathan Ling, Anthony J. Rustako Jr., Reinaldo A. Valenzuela:
Comparisons of a Computer-Based Propagation Prediction Tool with Experimental Data Collected in Urban Microcelluar Environments. IEEE J. Sel. Areas Commun. 15(4): 677-684 (1997) - [c21]Boris Aronov, Steven Fortune:
Average-Case Ray Shooting and Minimum Weight Triangulations. SCG 1997: 203-211 - 1996
- [j13]Steven Fortune, Christopher J. Van Wyk:
Static Analysis Yields Efficient Exact Integer Arithmetic for Computational Geometry. ACM Trans. Graph. 15(3): 223-248 (1996) - [c20]Steven Fortune:
Robustness Issues in Geometric Algorithms. WACG 1996: 9-14 - [c19]Steven Fortune:
A Beam-Tracing Algorithm for Prediction of Indoor Radio Propagation. WACG 1996: 157-166 - 1995
- [j12]Steven Fortune:
Numerical stability of algorithms for 2-d Delaunay triangulations. Int. J. Comput. Geom. Appl. 5: 193-213 (1995) - [c18]Steven Fortune:
Polyhedral modelling with exact arithmetic. Symposium on Solid Modeling and Applications 1995: 225-234 - 1994
- [c17]Steven Fortune, Christopher J. Van Wyk:
Robust Implementation of Geometric Algorithms Using Exact Arithmetic. IMA Conference on the Mathematics of Surfaces 1994: 233-248 - 1993
- [j11]Boris Aronov
, Steven Fortune, Gordon T. Wilfong:
The Furthest-Site Geodesic Voronoi Diagram. Discret. Comput. Geom. 9: 217-255 (1993) - [j10]Steven Fortune:
A note on Delaunay diagonal flips. Pattern Recognit. Lett. 14(9): 723-726 (1993) - [c16]Steven Fortune, Christopher J. Van Wyk:
Efficient Exact Arithmetic for Computational Geometry. SCG 1993: 163-172 - 1992
- [c15]Steven Fortune:
Numerical Stability of Algorithms for 2D Delaunay Triangulations. SCG 1992: 83-92 - 1991
- [j9]Steven Fortune, Gordon T. Wilfong:
Planning Constrained Motion. Ann. Math. Artif. Intell. 3(1): 21-82 (1991) - [j8]Boris Aronov
, Steven Fortune, Gordon T. Wilfong:
Minimum-Speed Motions. Int. J. Robotics Res. 10(3): 228-239 (1991) - [c14]Steven Fortune, Victor Milenkovic:
Numerical Stability of Algorithms for Line Arrangements. SCG 1991: 334-341 - [p1]Steven Fortune:
Numerical Stability of Geometric Algorithms. Curves and Surfaces 1991: 189-192
1980 – 1989
- 1989
- [c13]Steven Fortune:
Stable Maintenance of Point Set Triangulations in Two Dimensions. FOCS 1989: 494-499 - 1988
- [c12]Boris Aronov
, Steven Fortune, Gordon T. Wilfong:
The Furthest-Site Geodesic Voronoi Diagram. SCG 1988: 229-240 - [c11]Steven Fortune, Gordon T. Wilfong:
Planning Constrained Motion. STOC 1988: 445-459 - 1987
- [j7]Steven Fortune:
A Sweepline Algorithm for Voronoi Diagrams. Algorithmica 2: 153-174 (1987) - 1986
- [j6]Brenda S. Baker, Steven Fortune, Stephen R. Mahaney:
Polygon Containment under Translation. J. Algorithms 7(4): 532-548 (1986) - [c10]Steven Fortune:
A Sweepline Algorithm for Voronoi Diagrams. SCG 1986: 313-322 - [c9]Steven Fortune, Gordon T. Wilfong, Chee Yap:
Coordinated motion of two robot arms. ICRA 1986: 1216-1223 - 1985
- [j5]Ashok K. Chandra, Steven Fortune, Richard J. Lipton:
Unbounded Fan-In Circuits and Associative Functions. J. Comput. Syst. Sci. 30(2): 222-234 (1985) - [c8]Steven Fortune:
A Fast Algorithm for Polygon Containment by Translation (Extended Abstract). ICALP 1985: 189-198 - [c7]Brenda S. Baker, Steven Fortune, Eric Grosse:
Stable prehension with a multi-fingered hand. ICRA 1985: 570-575 - [c6]Brenda S. Baker, Steven Fortune, Eric Grosse:
Stable Prehension with Three Fingers. STOC 1985: 114-120 - 1984
- [c5]Steven Fortune, Michael Merritt:
Poker Protocols. CRYPTO 1984: 454-464 - 1983
- [j4]Steven Fortune, Daniel Leivant, Michael J. O'Donnell:
The Expressiveness of Simple and Second-Order Type Structures. J. ACM 30(1): 151-185 (1983) - [c4]Ashok K. Chandra, Steven Fortune, Richard J. Lipton:
Lower Bounds for Constant Depth Circuits for Prefix Problems. ICALP 1983: 109-117 - [c3]Ashok K. Chandra, Steven Fortune, Richard J. Lipton:
Unbounded Fan-in Circuits and Associative Functions. STOC 1983: 52-60 - 1980
- [j3]Steven Fortune, John E. Hopcroft, James Wyllie:
The Directed Subgraph Homeomorphism Problem. Theor. Comput. Sci. 10: 111-121 (1980)
1970 – 1979
- 1979
- [b1]Steven Fortune:
Topics in Computational Complexity. Cornell University, USA, 1979 - [j2]Steven Fortune, John E. Hopcroft:
A Note on Rabin's Nearest-Neighbor Algorithm. Inf. Process. Lett. 8(1): 20-23 (1979) - [j1]Steven Fortune:
A Note on Sparse Complete Sets. SIAM J. Comput. 8(3): 431-433 (1979) - 1978
- [c2]Steven Fortune, John E. Hopcroft, Erik Meineche Schmidt:
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes. ICALP 1978: 227-240 - [c1]Steven Fortune, James Wyllie:
Parallelism in Random Access Machines. STOC 1978: 114-118
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint