R Cole
U Vishkin
- AHU-74.A.V. Aho, J.E. Hopcroft and .I.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974. Google Scholar
Digital Library
- AS-83.B. Awerbuch and Y. Shiloach, "New connectivity and MSF algorithms for Ultracomputer and PRAM", Proc. 1983 International Conf. on Parallel Processing (1983), 175-179.Google Scholar
- Br-74.R.P. Brent, "The parallel evaluation of general arithmetic expressions, J. ACM 21,2 (1974), 201-206. Google ScholarDigital Library
- CLC-81.F.Y. Chin, J. Lain and I. Chen, "Optimal parallel algorithms for the connected component problems," Proc. 1981 International Conf. on Parallel Processing (1981), 170-175.Google Scholar
- CLC-82.F.Y. Chin, J. Lam and I. Chen, "Efficient parallel algorithms for some graph problems", Comm. ACM 25.9, 659- 665. Google ScholarDigital Library
- C-86.R. Cole, "An optimal parallel selection algorithm", in preparation.Google Scholar
- CS-85.R. Cole and A. Siegel, "On information flow and sorting: new upper and lower bounds for VLSI circuits", 26th Annual Syrup. on Foundations off computer Science, 208-221. Google ScholarDigital Library
- CV-86.R. Cole and U. Vishkin, "Efficient parallel graph algorithms", in preparation.Google Scholar
- CY-85.R. Cole and C. Yap, "A parallel median algorithm", IPL 20, 137-139.Google ScholarCross Ref
- FMRW-85.F.E. Fich, F. Meyer auf der Heide, P. Ragde and A. Wigderson, "One ,two, three..infinity: lower bound for parallel computation", Proc. 17th Annual ACM Syrup. on Theory of Computing (1985), 48-58. Google ScholarDigital Library
- FL-80.M. Fisher and L. Ladner, "Parallel prefix computation", JACM 27,4(1980), 831-838. Google ScholarDigital Library
- GLR-83.A. Gottlieb, B.D. Lubachevsky and L. Rudolph, "Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors". ACM TOPLAS, I983, 164-189. Google ScholarDigital Library
- HCS-79.D.S. Hirschberg, A.K. Chandra and D.V. Sarwate, "Computing connected components on parallel computers", CACM, 22,8(1979), 461-464. Google ScholarDigital Library
- HMS-83.P. Hochschild, E. Mayr and A. Siegel, "Techniques for solving graph algorithms in parallel environments", Proc 24th Annual Syrup. on Foundations of Computer Science, 351-359. Google ScholarDigital Library
- IM-85.A. Israeli and S. Moran. private communication.Google Scholar
- KRS-85.C.P. Kruskal, L. Rudolph and M. Snir, "Efficient parallel algorithms for graph problems". Proc. 1985 International Conf. on Parallel Processing, 180-185.Google Scholar
- MW-85.F. Meyer auf der Heide and A. Wigderson. "The complexity of parallel sorting", Proc. 26th IEEE Annual Conf. on Foundations of Computer Science (1985), 532-540.Google ScholarDigital Library
- SV-82.Y. Shiloach and U. Vishkin, " An O(logn) parallel connectivity algorithm, J. Algorithms 3.1, 57-67.Google Scholar
- TV-85.R.E. Tarjan and U. Vishkin, "An efficient parallel biconnectivity algorithm", SIAM J. of Comput., 14,4(1985), 862- 874.Google ScholarCross Ref
- Va-75.L. Valiant, "Parallelism in comparison problems", SIAM J. Comput. 4(3), 348-355.Google ScholarCross Ref
- Vi-83a.U. Vishkin, "Synchronous parallel computation - a survey", TR 71, Dept. of Computer science, Courant Institute, NYU. 1983.Google Scholar
- Vi-83b.U. Vishkin, "An optimal parallel algorithm for selection", manuscript, 1983.Google Scholar
- Vi-84a.U. Vishkin, "An optimal parallel connectivity algorithm", Discrete Applied Math. 9 (I984), 197-207.Google ScholarCross Ref
- Vi-84b.U. Vishkin, "Randomized speed-ups in parallel computation", Proc. 16th Annual ACM Syrup. on Theory of Computing (1984), 230-239. Google ScholarDigital Library
- Vi-85.U. Vishkin, "On efficient parallel strong orientation", lnfor- ,nation Processing Letters 20 (1985), 235-240.Google ScholarCross Ref
- W-79.J.C. Wyllie, "The complexity of parallel computation," TR 79-387, Department of Computer Science, Cornel1 University, Ithaca, New York, 1979. Google ScholarDigital Library
Index Terms
- Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms
Recommendations
Deterministic thermal micro-reflow of lithographic structures for Sub-10-nm metallic gaps fabrication
AbstractMetallic nanogaps are a kind of fundamental building blocks for nanoelectronics and nanoplasmonics. However, its reliable fabrication remains challenging and thus developing additional approaches to fabricate ultrasmall metallic ...
Graphical abstractDisplay Omitted
Highlights- We report a new post-assembly method to fabricate tiny metallic gaps by micro-reflow of lithographic nanostructures.
Ceramic micro parts produced by micro injection molding: latest developments
Powder injection molding is a preferred technology for the production of micro parts or microstructured parts. Derived from the well known thermoplastic injection molding technique it is suitable for a large-scale production of ceramic and metallic ...
A variotherm mold for micro metal injection molding
In this paper, a variotherm mold was designed and fabricated for the production of 316L stainless steel microstructures by micro metal injection molding (μMIM). The variotherm mold incorporated a rapid heating/cooling system, vacuum unit, hot sprue and ...
Comments