|
Search the dblp DataBase
K. Sikorski:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Shyh-Kuang Ueng, K. Sikorski
An out-of-core method for computing connectivities of large unstructured meshes. [Citation Graph (0, 0)][DBLP] EGPGV, 2002, pp:97-103 [Conf]
- Kwan-Liu Ma, K. Sikorski
A Distributed Solution and Visualization for 3D Flow Simulation. [Citation Graph (0, 0)][DBLP] PPSC, 1991, pp:287-294 [Conf]
- Shyh-Kuang Ueng, K. Sikorski
Parallel Visualization of 3D Finite Element Analysis Data. [Citation Graph (0, 0)][DBLP] PPSC, 1995, pp:808-813 [Conf]
- Shyh-Kuang Ueng, K. Sikorski, Kwan-Liu Ma
Fast Algorithms for Visualizing Fluid Motion in Steady Flow on Unstructured Grids. [Citation Graph (0, 0)][DBLP] IEEE Visualization, 1995, pp:313-320 [Conf]
- Spencer D. Shellman, K. Sikorski
A Two-Dimensional Bisection Envelope Algorithm for Fixed Points. [Citation Graph (0, 0)][DBLP] J. Complexity, 2002, v:18, n:2, pp:641-659 [Journal]
- Spencer D. Shellman, K. Sikorski
Algorithm 825: A deep-cut bisection envelope algorithm for fixed points. [Citation Graph (0, 0)][DBLP] ACM Trans. Math. Softw., 2003, v:29, n:3, pp:309-325 [Journal]
- Spencer D. Shellman, K. Sikorski
Algorithm 848: A recursive fixed-point algorithm for the infinity-norm case. [Citation Graph (0, 0)][DBLP] ACM Trans. Math. Softw., 2005, v:31, n:4, pp:580-586 [Journal]
- Shyh-Kuang Ueng, K. Sikorski
A note on a linear time algorithm for constructing adjacency graphs of 3D FEA data. [Citation Graph (0, 0)][DBLP] The Visual Computer, 1996, v:12, n:9, pp:445-450 [Journal]
Search in 0.001secs, Finished in 0.002secs
|