Christopher A. Sikorski

Affiliations:
  • University of Utah, Salt Lake City, Utah, USA


According to our database1, Christopher A. Sikorski authored at least 20 papers between 1985 and 2011.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2011
Circumscribed ellipsoid algorithm for fixed-point problems.
Math. Comput., 2011

2009
Guest editors' preface: Issue dedicated to Professor Frank Stenger.
J. Complex., 2009

2008
Sensor node localization methods based on local observations of distributed natural phenomena.
Proceedings of the IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems, 2008

2007
Computational sensor networks.
Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 29, 2007

2004
Computational Engineering and Science Program at the University of Utah.
Proceedings of the Computational Science, 2004

2003
A recursive algorithm for the infinity-norm fixed point problem.
J. Complex., 2003

2002
Joint AMS-SIAM Conference.
J. Complex., 2002

2001
Computational Engineering and Science Program at the University of Utah.
Proceedings of the Computational Science - ICCS 2001, 2001

Optimal solution of nonlinear equations.
Clarendon Press, ISBN: 978-0-19-510690-9, 2001

1999
Approximating Fixed Points of Weakly Contracting Mappings.
J. Complex., 1999

1997
Out-of-Core Streamline Visualization on Large Unstructured Meshes.
IEEE Trans. Vis. Comput. Graph., 1997

1996
Efficient Streamline, Streamribbon, and Streamtube Constructions on Unstructured Grids.
IEEE Trans. Vis. Comput. Graph., 1996

1995
Selected topics in approximation and computation.
Oxford University Press, ISBN: 978-0-19-508059-9, 1995

1993
Grid-based mapping for autonomous mobile robot.
Robotics Auton. Syst., 1993

An Ellipsoid Algorithm for the Computation of Fixed Points.
J. Complex., 1993

1988
Can we approximate zeros of functions with nonzero topological degree?
J. Complex., 1988

1987
Complexity of fixed points, I.
J. Complex., 1987

1986
For which error criteria can we solve nonlinear equations?
J. Complex., 1986

Complexity of computing topological degree of lipschitz functions in n dimensions.
J. Complex., 1986

1985
Optimal solution of nonlinear equations.
J. Complex., 1985


  Loading...