Sivan TOLEDO, Ph.D. September 2002 LIST OF PUBLICATIONS BOOKS. 1. Sivan Toledo Operating Systems. 209 pages, in Hebrew, Academon, Jerusalem, 2001.
|
|
- Alyson Ellis
- 5 years ago
- Views:
Transcription
1 1 Sivan TOLEDO, Ph.D. September 2002 LIST OF PUBLICATIONS BOOKS 1. Sivan Toledo Operating Systems. 209 pages, in Hebrew, Academon, Jerusalem, ARTICLES IN JOURNALS 1. Pankaj K. Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo Computing a segment-center for a planar point set. Journal of Algorithms 15 (1993), Sivan Toledo Approximate parametric searching. Information Processing Letters 47 (1993), Micha Sharir, Sivan Toledo Extremal polygon containment problems. Computational Geometry Theory and Applications 4 (1994), (See also Proc. No. 2). 4. Pankaj K. Agarwal, Micha Sharir, Sivan Toledo Applications of parametric searching in geometric optimization. Journal of Algorithms 17 (1994), (See also Proc. No. 3). 5. Sivan Toledo On the communication complexity of the discrete Fourier transform. IEEE Signal Processing Letters 3 (1996), K. Kedem, M. Sharir, S. Toledo On critical orientations in the Kedem-Sharir motion planning algorithm. Discrete and Compututational Geometry 17 (1997), (See also Proc. No. 6). 7. Sivan Toledo Locality of reference in LU decomposition with partial pivoting. SIAM Journal on Matrix Analysis and Applications 18 (1997),
2 SivanT OLEDO, P h.d. P ublications 2 8. Charles E. Leiserson, Satish Rao, Sivan Toledo Efficient out-of-core algorithms for linear relaxation using blocking covers. Journal of Computer and System Sciences 54 (1997), (See also Proc. No. 7). 9. Sivan Toledo Improving memory-system performance of sparse matrix-vector multiplication. IBM Journal of Research and Development 41:6 (1997) (See also Proc. No. 16). 10. Eran Toledo, Sivan Toledo, Yael Almog, Solange Akselrod (authors not in alphabetical order) A vectorized algorithm for correlation dimension estimation. Physics Letters A 229 (1997) Anshul Gupta, Fred G. Gustavson, Mahesh Joshi, Sivan Toledo The design, implementation, and evaluation of a symmetric banded linear solver for distributed-memory parallel computers. ACM Transactions on Mathematical Software 24:1 (1998) (See also Proc. No. 15). 12. Alan Edelman, Peter McCorquodale, Sivan Toledo The future fast fourier transform? SIAM Journal on Scientific Computing 20:3 (1999) (See also Proc. No. 17). 13. Sivan Toledo. A simple technique for typesetting Hebrew with vowel points. TUGBoat 20:1 (1999) Sivan Toledo. Exploiting Rich Fonts. TUGBoat 21:2 (2000) John R. Gilbert and Sivan Toledo An Assessment of Incomplete-LU Preconditioners for Nonsymmetric Linear Systems. Informatica 24 (2000) Yaron Shoham and Sivan Toledo. Parallel randomized best-first minimax search. Artificial Inteligence, 137 (2002) Igor Brainman and Sivan Toledo. Nested-dissection orderings for sparse LU with partial pivoting. SIAM Journal on Matrix Analysis and Applications, 23 (2002) (See also Proc. No. 24, 25)
3 SivanT OLEDO, P h.d. P ublications Dror Irony and Sivan Toledo. Trading replication for communication in parallel distributed-memory dense solvers. Parallel Processing Letters, 12 (2002) (See also Proc. No. 26) 19. Sivan Toledo and Eran Rabani (authors not in alphabetical order) Very large electronic structure calculations using an out-of-core filter-diagonalization method. Journal of Computational Physics, 180 (2002), (See also Proc. No. 27) Accepted for publication 1. Erik G. Boman, Doron Chen, Bruce Hendrickson, and Sivan Toledo. Maximum-weight-basis preconditioners. Numerical Linear Algebra with Applications, 29 pages, to appear. 2. Michael Galperin, Sivan Toledo, and Abraham Nitzan. Numerical computation of tunneling fluxes. Journal of Chemical Physics, 27 pages, to appear. Submitted May 2002, accepted September (Authors not in alphabetical order.) Submitted for Publication 1. Marshall Bern, John R. Gilbert, Bruce Hendrickson, Nhat Nguyen, and Sivan Toledo Support-graph preconditioners. Submitted to SIAM Journal on Matrix Analysis and Applications, June 2000, 29 pages. We have received the referee reports in July 2002 and were asked by the editor to revise the paper and to resubmit the revised version, which we will do. (See also Proc. No. 18). 2. Doron Chen and Sivan Toledo. Vaidya s Preconditioners: Implementation and Experimental Study. Submitted to Electronic Transactions on Numerical Analysis, 20 pages, August (See also Proc. No. 28) 3. Dror Irony and Sivan Toledo. Communication lower bounds for distributed-memory matrix multiplication. Submitted to Journal of Parallel and Distributed Computing, 16 pages, April Dror Irony, Gil Shklarski, and Sivan Toledo. Parallel and Fully Recursive Multifrontal Supernodal Sparse Cholesky. Submitted to Future Generation Computer Systems, 13 pages. June (See also Proc. No. 31)
4 SivanT OLEDO, P h.d. P ublications 4 ARTICLES IN REFEREED COLLECTIONS 1. Sivan Toledo Maximizing non-linear concave functions in fixed dimensions. In Complexity in Numerical Computations (Panos M. Pardalos, ed.), , World Scientific, (See also Proc. No. 5). 2. Sivan Toledo A survey of out-of-core algorithms in numerical linear algebra. In External Memory Algorithms (James M. Abello and Jeffrey Scott Vitter, eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, (See also Proc. No. 19). PUBLICATIONS IN PROCEEDINGS OF CONFERENCES 1. Dov Sagi, Sivan Toledo (authors not in alphabetical order) Combining local difference signals across different spatial filter maps (an abstract). Annual Meeting of the Association for Research in Vision and Opthalmology, Supplement to Investigative Opthalmology and Visual Science, 30(4) (1990), Sivan Toledo Extremal polygon containment problems. Proceedings of the 7th ACM Symposium on Computational Geometry, (1991), Pankaj K. Agarwal, Micha Sharir, Sivan Toledo Applications of parametric searching in geometric optimization. Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms (1992), Sivan Toledo Competitive fault tolerance in area-universal networks. Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures (1992), Sivan Toledo Maximizing non-linear concave functions in fixed dimensions. Proceedings of the 33th Symposium on Foundations of Computer Science (1992), (An abstract appeared in the Proceedings of the 2th Annual MIT Student Workshop on Supercomputing Technologies, 1992.) 6. Klara Kedem, Micha Sharir, Sivan Toledo On critical orientations in the Kedem-Sharir motion planning algorithm for a convex polygon in the plane. Proceedings of the 5th Canadian Conference on Computational Geometry (1993),
5 SivanT OLEDO, P h.d. P ublications 5 7. Charles E. Leiserson, Satish Rao, Sivan Toledo Efficient out-of-core algorithms for linear relaxation using blocking covers. Proceedings of the 34th Symposium on Foundations of Computer Science (1993), Sivan Toledo Space sharing a scan network. In Proceedings of the 1993 MIT Student Workshop on Supercomputing Technologies (1993), Sivan Toledo PerfSim: A tool for automatic performance analysis of data-parallel Fortran programs. Proceedings of the 5th Symposium on the Frontiers of Massively Parallel Computation (1995), (An abstract appeared in the Proceedings of the 4th Annual MIT Student Workshop on Scalable Computing, , 1994.) 10. Sivan Toledo Preconditioning with a decoupled rowwise ordering on the CM-5. Proceedings of the 7th SIAM Conference on Parallel Processing for Scientific Computing (1995), (An abstract appeared in the Proceedings of the 4th Annual MIT Student Workshop on Scalable Computing, , 1994.) 11. Peter McCorquodale, Sivan Toledo A new communication-efficient distributed Fourier transform algorithm. Proceedings of the 5th Annual MIT Student Workshop on Scalable Computing, , Sivan Toledo Out-of-core Krylov-subspace methods. Proceedings of the 5th Annual MIT Student Workshop on Scalable Computing, , Sivan Toledo Performance prediction with Benchmaps. Proceedings of the 10th International Parallel Processing Symposium, Hawaii (April 1996), Sivan Toledo, Fred G. Gustavson (authors not in alphabetical order) The design and implementation of SOLAR, a portable library for scalable out-of-core linear algebra computations. Proceedings of the 4th Annual Workshop on I/O in Parallel and Distributed Systems, pages 28 40, Philadelphia, May (Also a poster presentation at the 8th SIAM Conference on Parallel Processing for Scientific Computing, March 1997.) 15. Anshul Gupta, Fred G. Gustavson, Mahesh Joshi, Sivan Toledo The design, implementation, and evaluation of a banded linear solver for distributedmemory parallel computers.
6 SivanT OLEDO, P h.d. P ublications 6 Proceedings of the Third International Workshop on Parallel Computing (PARA 96), Lyngby, Denmark, August Lecture Notes in Computer Science volume 1184, Springer-Verlag, Sivan Toledo Improving Instruction-Level Parallelism in Sparse Matrix-Vector Multiplication using Reordering, Blocking, and Prefetching. Proceedings of the 8th SIAM Conference on Parallel Processing for Scientific Computing, March Alan Edelman, Peter McCorquodale, Sivan Toledo The future fast fourier transform? Proceedings of the 8th SIAM Conference on Parallel Processing for Scientific Computing, March Marshall Bern, John R. Gilbert, Bruce Hendrickson, Nhat Nguyen, and Sivan Toledo. Support-graph preconditioners. Copper Mountain Conference On Iterative Methods, Copper Mountain, Colorado, unnumbered pages. 19. Sivan Toledo. A survey of out-of-core algorithms in numerical linear algebra. DIMACS Workshop on External-Memory Algorithms and Visualization, Piscataway, New Jersey, John R. Gilbert and Sivan Toledo. High-Performance Out-of-Core Sparse LU Factorization. Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing, San-Antonio, Texas, 1999, 10 pages on CDROM. 21. Tzu-Yi Chen, John R. Gilbert and Sivan Toledo. Toward an Efficient Column Minimum Degree Code for Symmetric Multiprocessors. Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing, San-Antonio, Texas, 1999, 11 pages on CDROM. 22. Sivan Toledo. Strategies for designing cache-friendly sparse-matrix codes. Book of abstracts of 4th International Congress on Industrial and Applied Mathematics, 175, Edinburgh, Scotland, 1999 (an abstract). 23. Sivan Toledo. Theoretical Analyses of Cache Misses in Dense-Linear Algebra Algorithms. Workshop on Linear Algebra with Recursive Algorithms, Lingby, Denmark, December page abstract. 24. Igor Brainman and Sivan Toledo. Nested-dissection orderings for sparse LU with partial pivoting. In Lubin Vulkuv, Jerzy Waśniewski, and Plamen Yalamov, editors, Proceedings of the
7 SivanT OLEDO, P h.d. P ublications 7 2nd Conference on Numerical Analysis and Applications, volume 1988 of Lecture Notes in Computer Science, pages , Rousse, Bulgaria, Jue Igor Brainman and Sivan Toledo. Nested-dissection orderings for sparse LU with partial pivoting. In Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing, Norfolk, Virginia, March pages on CDROM. 26. Dror Irony and Sivan Toledo. Communication-efficient parallel dense LU using a 3-dimensional approach. In Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing, Norfolk, Virginia, March pages on CDROM. 27. Eran Rabani and Sivan Toledo. Out-of-core SVD and QR decompositions. In Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing, Norfolk, Virginia, March pages on CDROM. 28. Doron Chen and Sivan Toledo. Implementation and evaluation of Vaidya s preconditioners. In Proceedings of Preconditioning 2001, Tahoe, California, 3 pages, April Sivan Toledo and Lars Knoll. Font subsetting and downloading in the PostScript printer driver of Qt/X11. In Proceedings of the XFree86 Technical Conference, Oakland, California, November Published by USENIX. 30. Sivan Toledo and Doron Chen. Multilevel support-graph preconditioners (an abstract). In the book of abstracts of Latsis 2002: Iterative Solvers for Large Linear Systems, page 36, Zurich, Switzerland, February Dror Irony, Gil Shklarski, and Sivan Toledo. Parallel and Fully Recursive Multifrontal Supernodal Sparse Cholesky. In Proceedings of International Conference on Computational Science (ICCS 2002), Amsterdam, April 2002, Part II, pages OTHER PUBLICATIONS (Magazine Articles) 1. Sivan Toledo Using menus and menu bars in applets JavaWorld ( 1(9), November Sivan Toledo. Typesetting Hebrew with L A TEX. In Eutupon, 6 (April 2001), Technical Reports
8 SivanT OLEDO, P h.d. P ublications 8 1. Pankaj K. Agarwal, Micha Sharir, Sivan Toledo An efficient multi-dimensional searching technique and its applications, Technical Report CS , Duke University, Daniel Cohen-Or and Sivan Toledo Fully-Coupled Geometry Encoding of Meshes. in preparation. 3. Eyal Baruch and Sivan Toledo Communication-Efficient Parallel Matrix Algorithms in Cilk. in preparation. 4. Vladimir Rotkin and Sivan Toledo Out-of-Core Sparse Direct Linear Solvers. in preparation.
Sivan TOLEDO, Ph.D. February 2003 LIST OF PUBLICATIONS BOOKS. 1. Sivan Toledo Operating Systems. 209 pages, in Hebrew, Academon, Jerusalem, 2001.
1 Sivan TOLEDO, Ph.D. February 2003 LIST OF PUBLICATIONS BOOKS 1. Sivan Toledo Operating Systems. 209 pages, in Hebrew, Academon, Jerusalem, 2001. ARTICLES IN JOURNALS 1. Pankaj K. Agarwal, Alon Efrat,
More informationNested-Dissection Orderings for Sparse LU with Partial Pivoting
Nested-Dissection Orderings for Sparse LU with Partial Pivoting Igor Brainman 1 and Sivan Toledo 1 School of Mathematical Sciences, Tel-Aviv University Tel-Aviv 69978, ISRAEL Email: sivan@math.tau.ac.il
More informationSparse Matrices. Mathematics In Science And Engineering Volume 99 READ ONLINE
Sparse Matrices. Mathematics In Science And Engineering Volume 99 READ ONLINE If you are looking for a ebook Sparse Matrices. Mathematics in Science and Engineering Volume 99 in pdf form, in that case
More informationPh.D. with Distinction in Computer Science Advisor: Prof. Micha Sharir Dissertation: Geometric Arrangements: Substructures and Algorithms
April 29, 2009 Esther Ezra phone (919) 660-6578 Levine Science Research Center D340 fax (919) 660-6502 Department of Computer Science, Duke University http://www.math.tau.ac.il/~estere Durham NC 27708
More informationPUBLICATIONS. Journal Papers
PUBLICATIONS Journal Papers [J1] X. Wu and L.-L. Xie, Asymptotic equipartition property of output when rate is above capacity, submitted to IEEE Transactions on Information Theory, August 2009. [J2] A.
More informationLecture 27: Fast Laplacian Solvers
Lecture 27: Fast Laplacian Solvers Scribed by Eric Lee, Eston Schweickart, Chengrun Yang November 21, 2017 1 How Fast Laplacian Solvers Work We want to solve Lx = b with L being a Laplacian matrix. Recall
More informationPreconditioning Linear Systems Arising from Graph Laplacians of Complex Networks
Preconditioning Linear Systems Arising from Graph Laplacians of Complex Networks Kevin Deweese 1 Erik Boman 2 1 Department of Computer Science University of California, Santa Barbara 2 Scalable Algorithms
More informationApplications of Geometric Spanner
Title: Name: Affil./Addr. 1: Affil./Addr. 2: Affil./Addr. 3: Keywords: SumOriWork: Applications of Geometric Spanner Networks Joachim Gudmundsson 1, Giri Narasimhan 2, Michiel Smid 3 School of Information
More informationResearch Article Polygon Morphing and Its Application in Orebody Modeling
Mathematical Problems in Engineering Volume 212, Article ID 732365, 9 pages doi:1.1155/212/732365 Research Article Polygon Morphing and Its Application in Orebody Modeling Hacer İlhan and Haşmet Gürçay
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 20: Sparse Linear Systems; Direct Methods vs. Iterative Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 26
More informationSolving Sparse Linear Systems. Forward and backward substitution for solving lower or upper triangular systems
AMSC 6 /CMSC 76 Advanced Linear Numerical Analysis Fall 7 Direct Solution of Sparse Linear Systems and Eigenproblems Dianne P. O Leary c 7 Solving Sparse Linear Systems Assumed background: Gauss elimination
More informationCurriculum Vitae Tim Ophelders last updated: September 12, 2018
Curriculum Vitae Tim Ophelders last updated: September 12, 2018 Personal Information Name Citizenship T. A. E. (Tim) Ophelders Dutch Work Address Email Department of Computational Mathematics, Science
More informationBichromatic Line Segment Intersection Counting in O(n log n) Time
Bichromatic Line Segment Intersection Counting in O(n log n) Time Timothy M. Chan Bryan T. Wilkinson Abstract We give an algorithm for bichromatic line segment intersection counting that runs in O(n log
More informationDirect Solvers for Sparse Matrices X. Li September 2006
Direct Solvers for Sparse Matrices X. Li September 2006 Direct solvers for sparse matrices involve much more complicated algorithms than for dense matrices. The main complication is due to the need for
More informationA Bibliography of Publications of Jingling Xue
A Bibliography of Publications of Jingling Xue Jingling Xue Department of Mathematics, Statistics and Computing Science Armidale, NSW 2351 Australia Tel: +61 67 73 3149 FAX: +61 67 73 3312 E-mail: xue@neumann.une.edu.au
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 5: Sparse Linear Systems and Factorization Methods Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis I 1 / 18 Sparse
More informationIlya Lashuk, Merico Argentati, Evgenii Ovtchinnikov, Andrew Knyazev (speaker)
Ilya Lashuk, Merico Argentati, Evgenii Ovtchinnikov, Andrew Knyazev (speaker) Department of Mathematics and Center for Computational Mathematics University of Colorado at Denver SIAM Conference on Parallel
More informationTesting Euclidean Spanners
Testing Euclidean Spanners Frank Hellweg Melanie Schmidt Christian Sohler Department of Computer Science Technical University of Dortmund 44227 Dortmund, Germany Abstract In this paper we develop a property
More informationA Compiler for Parallel Finite Element Methods. with Domain-Decomposed Unstructured Meshes JONATHAN RICHARD SHEWCHUK AND OMAR GHATTAS
Contemporary Mathematics Volume 00, 0000 A Compiler for Parallel Finite Element Methods with Domain-Decomposed Unstructured Meshes JONATHAN RICHARD SHEWCHUK AND OMAR GHATTAS December 11, 1993 Abstract.
More informationEmpirical Complexity of Laplacian Linear Solvers: Discussion
Empirical Complexity of Laplacian Linear Solvers: Discussion Erik Boman, Sandia National Labs Kevin Deweese, UC Santa Barbara John R. Gilbert, UC Santa Barbara 1 Simons Institute Workshop on Fast Algorithms
More informationPARALLEL COMPUTATION OF THE SINGULAR VALUE DECOMPOSITION ON TREE ARCHITECTURES
PARALLEL COMPUTATION OF THE SINGULAR VALUE DECOMPOSITION ON TREE ARCHITECTURES Zhou B. B. and Brent R. P. Computer Sciences Laboratory Australian National University Canberra, ACT 000 Abstract We describe
More informationThe Design and Implementation Of A New Out-of-Core Sparse Cholesky Factorization Method
The Design and Implementation Of A New Out-of-Core Sparse Cholesky Factorization Method VLADIMIR ROTKIN and SIVAN TOLEDO Tel-Aviv University We describe a new out-of-core sparse Cholesky factorization
More informationBrian Hamrick. October 26, 2009
Efficient Computation of Homology Groups of Simplicial Complexes Embedded in Euclidean Space TJHSST Senior Research Project Computer Systems Lab 2009-2010 Brian Hamrick October 26, 2009 1 Abstract Homology
More informationAdvances in Parallel Partitioning, Load Balancing and Matrix Ordering for Scientific Computing
Advances in Parallel Partitioning, Load Balancing and Matrix Ordering for Scientific Computing Erik G. Boman 1, Umit V. Catalyurek 2, Cédric Chevalier 1, Karen D. Devine 1, Ilya Safro 3, Michael M. Wolf
More informationLevel 3: Level 2: Level 1: Level 0:
A Graph Based Method for Generating the Fiedler Vector of Irregular Problems 1 Michael Holzrichter 1 and Suely Oliveira 2 1 Texas A&M University, College Station, TX,77843-3112 2 The University of Iowa,
More informationSymbolic Evaluation of Sums for Parallelising Compilers
Symbolic Evaluation of Sums for Parallelising Compilers Rizos Sakellariou Department of Computer Science University of Manchester Oxford Road Manchester M13 9PL United Kingdom e-mail: rizos@csmanacuk Keywords:
More informationCurriculum Vitæ. (Home address) 8399 Transvaal Blue Street Phone: (702) Las Vegas, NV Cell: (702)
Curriculum Vitæ Jan Bækgaard Pedersen School of Computer Science Phone: (702) 895 2557 University of Nevada, Las Vegas Fax: (702) 895 2639 4505 South Maryland Parkway Email: matt@cs.unlv.edu Las Vegas,
More informationSparse LU Factorization for Parallel Circuit Simulation on GPUs
Department of Electronic Engineering, Tsinghua University Sparse LU Factorization for Parallel Circuit Simulation on GPUs Ling Ren, Xiaoming Chen, Yu Wang, Chenxi Zhang, Huazhong Yang Nano-scale Integrated
More informationFast Multipole and Related Algorithms
Fast Multipole and Related Algorithms Ramani Duraiswami University of Maryland, College Park http://www.umiacs.umd.edu/~ramani Joint work with Nail A. Gumerov Efficiency by exploiting symmetry and A general
More informationMultigrid Methods for Markov Chains
Multigrid Methods for Markov Chains Hans De Sterck Department of Applied Mathematics, University of Waterloo collaborators Killian Miller Department of Applied Mathematics, University of Waterloo, Canada
More informationF k G A S S1 3 S 2 S S V 2 V 3 V 1 P 01 P 11 P 10 P 00
PRLLEL SPRSE HOLESKY FTORIZTION J URGEN SHULZE University of Paderborn, Department of omputer Science Furstenallee, 332 Paderborn, Germany Sparse matrix factorization plays an important role in many numerical
More informationMathematics and Computer Science
Technical Report TR-2006-010 Revisiting hypergraph models for sparse matrix decomposition by Cevdet Aykanat, Bora Ucar Mathematics and Computer Science EMORY UNIVERSITY REVISITING HYPERGRAPH MODELS FOR
More informationFlight Systems are Cyber-Physical Systems
Flight Systems are Cyber-Physical Systems Dr. Christopher Landauer Software Systems Analysis Department The Aerospace Corporation Computer Science Division / Software Engineering Subdivision 08 November
More informationCURRICULUM VITAE. June, 2013
CURRICULUM VITAE ד"ר אבי סופר Dr. Avi Soffer June, 2013 ORT Braude College, Department of Software Engineering, P.O. Box 78, Karmiel 2161002, Israel Telephone: +972-4-990-1720 Email: asoffer@braude.ac.il
More informationOptimizing Parallel Sparse Matrix-Vector Multiplication by Corner Partitioning
Optimizing Parallel Sparse Matrix-Vector Multiplication by Corner Partitioning Michael M. Wolf 1,2, Erik G. Boman 2, and Bruce A. Hendrickson 3 1 Dept. of Computer Science, University of Illinois at Urbana-Champaign,
More informationPlanar Graphs with Many Perfect Matchings and Forests
Planar Graphs with Many Perfect Matchings and Forests Michael Biro Abstract We determine the number of perfect matchings and forests in a family T r,3 of triangulated prism graphs. These results show that
More informationSparse Matrices and Graphs: There and Back Again
Sparse Matrices and Graphs: There and Back Again John R. Gilbert University of California, Santa Barbara Simons Institute Workshop on Parallel and Distributed Algorithms for Inference and Optimization
More informationA Performance Study of Parallel FFT in Clos and Mesh Networks
A Performance Study of Parallel FFT in Clos and Mesh Networks Rajkumar Kettimuthu 1 and Sankara Muthukrishnan 2 1 Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439,
More informationPresentation of the Electronic Letters on Computer Vision and Image Analysis (ELCVIA)
Electronic Letters on Computer Vision and Image Analysis 0(0):1-7, 2002 Presentation of the Electronic Letters on Computer Vision and Image Analysis (ELCVIA) H. Bunke Λ and J.J. Villanueva + Λ Institut
More informationDerrick Stolee. April 12,
1 / 38 University Of Nebraska Lincoln Computer Science & Mathematics April 12, 2008 s-dstolee1@math.unl.edu 2 / 38 Acknowledgments Research Assistance and Funding This research funded by UCARE USDA FCIC/RMA
More informationRadek Tezaur. Senior Research Engineer at Stanford University (2011-present) Research Associate at Stanford University (2004-present)
Radek Tezaur Aeronautics and Astronautics Stanford University Stanford, CA 94305 Phone: (650)725-9646 (office) Fax: (650) 723-0279 Email: rtezaur@stanford.edu Education Ph.D., Applied Mathematics, University
More informationConstructing Street-maps from GPS Trajectories
Constructing Street-maps from GPS Trajectories Mahmuda Ahmed, Carola Wenk The University of Texas @San Antonio Department of Computer Science Presented by Mahmuda Ahmed www.cs.utsa.edu/~mahmed Problem
More informationMethods for Enhancing the Speed of Numerical Calculations for the Prediction of the Mechanical Behavior of Parts Made Using Additive Manufacturing
Methods for Enhancing the Speed of Numerical Calculations for the Prediction of the Mechanical Behavior of Parts Made Using Additive Manufacturing Mohammad Nikoukar, Nachiket Patil, Deepankar Pal, and
More informationTexture Mapping using Surface Flattening via Multi-Dimensional Scaling
Texture Mapping using Surface Flattening via Multi-Dimensional Scaling Gil Zigelman Ron Kimmel Department of Computer Science, Technion, Haifa 32000, Israel and Nahum Kiryati Department of Electrical Engineering
More informationVisualizing and Animating Search Operations on Quadtrees on the Worldwide Web
Visualizing and Animating Search Operations on Quadtrees on the Worldwide Web František Brabec Computer Science Department University of Maryland College Park, Maryland 20742 brabec@umiacs.umd.edu Hanan
More informationThe Essence of Compiling with Continuations
RETROSPECTIVE: The Essence of Compiling with Continuations Cormac Flanagan Amr Sabry Bruce F. Duba Matthias Felleisen Systems Research Center Compaq cormac.flanagan@compaq.com Dept. of Computer Science
More informationFOR P3: A monolithic multigrid FEM solver for fluid structure interaction
FOR 493 - P3: A monolithic multigrid FEM solver for fluid structure interaction Stefan Turek 1 Jaroslav Hron 1,2 Hilmar Wobker 1 Mudassar Razzaq 1 1 Institute of Applied Mathematics, TU Dortmund, Germany
More informationarxiv: v1 [cs.dc] 13 Oct 2008
A SIMPLE LOCAL 3-APPROXIMATION ALGORITHM FOR VERTEX COVER VALENTIN POLISHCHUK AND JUKKA SUOMELA arxiv:0810.2175v1 [cs.dc] 13 Oct 2008 Abstract. We present a local algorithm (constant-time distributed algorithm)
More informationCONSTRUCTIONS OF QUADRILATERAL MESHES: A COMPARATIVE STUDY
South Bohemia Mathematical Letters Volume 24, (2016), No. 1, 43-48. CONSTRUCTIONS OF QUADRILATERAL MESHES: A COMPARATIVE STUDY PETRA SURYNKOVÁ abstrakt. Polygonal meshes represent important geometric structures
More informationA direct solver with reutilization of previously-computed LU factorizations for h-adaptive finite element grids with point singularities
Maciej Paszynski AGH University of Science and Technology Faculty of Computer Science, Electronics and Telecommunication Department of Computer Science al. A. Mickiewicza 30 30-059 Krakow, Poland tel.
More informationSparse Direct Solvers for Extreme-Scale Computing
Sparse Direct Solvers for Extreme-Scale Computing Iain Duff Joint work with Florent Lopez and Jonathan Hogg STFC Rutherford Appleton Laboratory SIAM Conference on Computational Science and Engineering
More informationA General Sparse Sparse Linear System Solver and Its Application in OpenFOAM
Available online at www.prace-ri.eu Partnership for Advanced Computing in Europe A General Sparse Sparse Linear System Solver and Its Application in OpenFOAM Murat Manguoglu * Middle East Technical University,
More informationPARDISO Version Reference Sheet Fortran
PARDISO Version 5.0.0 1 Reference Sheet Fortran CALL PARDISO(PT, MAXFCT, MNUM, MTYPE, PHASE, N, A, IA, JA, 1 PERM, NRHS, IPARM, MSGLVL, B, X, ERROR, DPARM) 1 Please note that this version differs significantly
More informationCSCE 689 : Special Topics in Sparse Matrix Algorithms Department of Computer Science and Engineering Spring 2015 syllabus
CSCE 689 : Special Topics in Sparse Matrix Algorithms Department of Computer Science and Engineering Spring 2015 syllabus Tim Davis last modified September 23, 2014 1 Catalog Description CSCE 689. Special
More informationA parallel direct/iterative solver based on a Schur complement approach
A parallel direct/iterative solver based on a Schur complement approach Gene around the world at CERFACS Jérémie Gaidamour LaBRI and INRIA Bordeaux - Sud-Ouest (ScAlApplix project) February 29th, 2008
More informationParallel Implementation of 3D FMA using MPI
Parallel Implementation of 3D FMA using MPI Eric Jui-Lin Lu y and Daniel I. Okunbor z Computer Science Department University of Missouri - Rolla Rolla, MO 65401 Abstract The simulation of N-body system
More informationTriangle Graphs and Simple Trapezoid Graphs
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 18, 467-473 (2002) Short Paper Triangle Graphs and Simple Trapezoid Graphs Department of Computer Science and Information Management Providence University
More informationCALCULATING RANKS, NULL SPACES AND PSEUDOINVERSE SOLUTIONS FOR SPARSE MATRICES USING SPQR
CALCULATING RANKS, NULL SPACES AND PSEUDOINVERSE SOLUTIONS FOR SPARSE MATRICES USING SPQR Leslie Foster Department of Mathematics, San Jose State University October 28, 2009, SIAM LA 09 DEPARTMENT OF MATHEMATICS,
More informationELLIOT ANSHELEVICH. Department of Computer Science Cornell University Upson Hall 5139 Ithaca, NY 14853
ELLIOT ANSHELEVICH eanshel@cs.cornell.edu Office: (607) 255-5578 Cell: (607) 262-6170 Fax: (607) 255-4428 http://www.cs.cornell.edu/people/eanshel Department of Computer Science Cornell University Upson
More informationGirija J. Narlikar Forbes Avenue girija
Girija J. Narlikar CMU Computer Science Dept. girija@cs.cmu.edu 5000 Forbes Avenue http://www.cs.cmu.edu/ girija Pittsburgh, PA 15213 Phone: (412) 268-3337 [O] Fax: (412) 268-5576 (412) 802-0459 [H] Research
More informationHigh-Performance Out-of-Core Sparse LU Factorization
High-Performance Out-of-Core Sparse LU Factorization John R. Gilbert Sivan Toledo Abstract We present an out-of-core sparse nonsymmetric LU-factorization algorithm with partial pivoting. We have implemented
More informationTwo-Dimensional Visualization for Internet Resource Discovery. Shih-Hao Li and Peter B. Danzig. University of Southern California
Two-Dimensional Visualization for Internet Resource Discovery Shih-Hao Li and Peter B. Danzig Computer Science Department University of Southern California Los Angeles, California 90089-0781 fshli, danzigg@cs.usc.edu
More informationTiling: A Data Locality Optimizing Algorithm
Tiling: A Data Locality Optimizing Algorithm Announcements Monday November 28th, Dr. Sanjay Rajopadhye is talking at BMAC Friday December 2nd, Dr. Sanjay Rajopadhye will be leading CS553 Last Monday Kelly
More informationImproving Performance of Sparse Matrix-Vector Multiplication
Improving Performance of Sparse Matrix-Vector Multiplication Ali Pınar Michael T. Heath Department of Computer Science and Center of Simulation of Advanced Rockets University of Illinois at Urbana-Champaign
More informationLarge-scale Structural Analysis Using General Sparse Matrix Technique
Large-scale Structural Analysis Using General Sparse Matrix Technique Yuan-Sen Yang 1), Shang-Hsien Hsieh 1), Kuang-Wu Chou 1), and I-Chau Tsai 1) 1) Department of Civil Engineering, National Taiwan University,
More informationSolvers for Linear Systems in Graph Laplacians
CS7540 Spectral Algorithms, Spring 2017 Lectures #22-#24 Solvers for Linear Systems in Graph Laplacians Presenter: Richard Peng Mar, 2017 These notes are an attempt at summarizing the rather large literature
More informationParallel and Fully Recursive Multifrontal Sparse Cholesky
Parallel and Fully Recursive Multifrontal Sparse Cholesky Dror Irony Gil Shklarski Sivan Toledo 1th December Abstract We describe the design, implementation, and performance of a new parallel sparse Cholesky
More informationMassively Parallel Computation for Three-Dimensional Monte Carlo Semiconductor Device Simulation
L SIMULATION OF SEMICONDUCTOR DEVICES AND PROCESSES Vol. 4 Edited by W. Fichtner, D. Aemmer - Zurich (Switzerland) September 12-14,1991 - Hartung-Gorre Massively Parallel Computation for Three-Dimensional
More informationCase Studies on Cache Performance and Optimization of Programs with Unit Strides
SOFTWARE PRACTICE AND EXPERIENCE, VOL. 27(2), 167 172 (FEBRUARY 1997) Case Studies on Cache Performance and Optimization of Programs with Unit Strides pei-chi wu and kuo-chan huang Department of Computer
More informationA linear algebra processor using Monte Carlo methods
A linear algebra processor using Monte Carlo methods Conference or Workshop Item Accepted Version Plaks, T. P., Megson, G. M., Cadenas Medina, J. O. and Alexandrov, V. N. (2003) A linear algebra processor
More informationGeometry. Geometric Graphs with Few Disjoint Edges. G. Tóth 1,2 and P. Valtr 2,3. 1. Introduction
Discrete Comput Geom 22:633 642 (1999) Discrete & Computational Geometry 1999 Springer-Verlag New York Inc. Geometric Graphs with Few Disjoint Edges G. Tóth 1,2 and P. Valtr 2,3 1 Courant Institute, New
More informationJohn Clements Department of Computer Science Cal Poly State University 1 Grand Street San Luis Obispo, CA (805)
Curriculum Vitae Contact Information Education John Clements Department of Computer Science Cal Poly State University 1 Grand Street San Luis Obispo, CA 93407 (805)756-6528 clements@brinckerhoff.org 2005
More informationModelling and implementation of algorithms in applied mathematics using MPI
Modelling and implementation of algorithms in applied mathematics using MPI Lecture 1: Basics of Parallel Computing G. Rapin Brazil March 2011 Outline 1 Structure of Lecture 2 Introduction 3 Parallel Performance
More informationPreparation Meeting. Recent Advances in the Analysis of 3D Shapes. Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers
Preparation Meeting Recent Advances in the Analysis of 3D Shapes Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers What You Will Learn in the Seminar Get an overview on state of the art
More informationA substructure based parallel dynamic solution of large systems on homogeneous PC clusters
CHALLENGE JOURNAL OF STRUCTURAL MECHANICS 1 (4) (2015) 156 160 A substructure based parallel dynamic solution of large systems on homogeneous PC clusters Semih Özmen, Tunç Bahçecioğlu, Özgür Kurç * Department
More informationParallel Quality Meshes for Earth Models
Parallel Quality Meshes for Earth Models John Burkardt Department of Scientific Computing Florida State University... 04 October 2016, Virginia Tech... http://people.sc.fsu.edu/ jburkardt/presentations/......
More informationAn Algorithm and Evaluations of Real Time Shortest Path according to current traffic on road
P P International Journal of Scientific Engineering and Applied Science (IJSEAS) - Volume-1, Issue-7,October 2015 An Algorithm and Evaluations of Real Time Shortest Path according to current traffic on
More informationarxiv:cs/ v1 [cs.cg] 13 Jun 2001
Hinged Kite Mirror Dissection David Eppstein arxiv:cs/0106032v1 [cs.cg] 13 Jun 2001 Abstract Any two polygons of equal area can be partitioned into congruent sets of polygonal pieces, and in many cases
More informationDistributed-memory Algorithms for Dense Matrices, Vectors, and Arrays
Distributed-memory Algorithms for Dense Matrices, Vectors, and Arrays John Mellor-Crummey Department of Computer Science Rice University johnmc@rice.edu COMP 422/534 Lecture 19 25 October 2018 Topics for
More informationLecture 4 Duality and Decomposition Techniques
Lecture 4 Duality and Decomposition Techniques Jie Lu (jielu@kth.se) Richard Combes Alexandre Proutiere Automatic Control, KTH September 19, 2013 Consider the primal problem Lagrange Duality Lagrangian
More informationProvably Efficient Non-Preemptive Task Scheduling with Cilk
Provably Efficient Non-Preemptive Task Scheduling with Cilk V. -Y. Vee and W.-J. Hsu School of Applied Science, Nanyang Technological University Nanyang Avenue, Singapore 639798. Abstract We consider the
More informationModel Reduction for High Dimensional Micro-FE Models
Model Reduction for High Dimensional Micro-FE Models Rudnyi E. B., Korvink J. G. University of Freiburg, IMTEK-Department of Microsystems Engineering, {rudnyi,korvink}@imtek.uni-freiburg.de van Rietbergen
More informationIntroduction to Geometric Algorithms
CS268: Geometric Algorithms Handout # 1 Design and Analysis Stanford University Monday, 28 March 2011 Lecture #1: Monday, 28 March 2011 Topics: Course Introduction [Revised Dates] Lecturer: Leonidas Guibas
More informationHIGH SPEED REALISATION OF DIGITAL FILTERS
HIGH SPEED REALISATION OF DIGITAL FILTERS A THESIS SUBMITTED FOR THE DEGREE OF MASTER OF PHILOSOPHY IN ELECTRICAL AND ELECTRONIC ENGINEERING AT THE UNIVERSITY OF HONG KONG BY TSIM TS1M MAN-TAT, JIMMY DEPARTMENT
More informationCURRICULUM VITÆ. Naama Kraus B.Sc. in Computer Science and Mathematics, Bar-Ilan University, Cum Laude GPA: 90.
CURRICULUM VITÆ Naama Kraus naamakraus@gmail.com Personal Information Home Address: 6 Trumpeldor Ave., Haifa, 32582, Israel Phone (Home): +972 4 8328216 Phone (Mobile): +972 55 6644563 Date of Birth: 29-APR-1974
More informationA New Smoothing Algorithm for Quadrilateral and Hexahedral Meshes
A New Smoothing Algorithm for Quadrilateral and Hexahedral Meshes Sanjay Kumar Khattri Department of Mathematics, University of Bergen, Norway sanjay@mi.uib.no http://www.mi.uib.no/ sanjay Abstract. Mesh
More informationMiddleware for Ubiquitous Computing
Middleware for Ubiquitous Computing Software Testing for Mobile Computing National Institute of Informatics Ichiro Satoh Abstract When a portable computing device is moved into and attached to a new local
More informationPerformance Evaluation of a New Parallel Preconditioner
Performance Evaluation of a New Parallel Preconditioner Keith D. Gremban Gary L. Miller Marco Zagha School of Computer Science Carnegie Mellon University 5 Forbes Avenue Pittsburgh PA 15213 Abstract The
More information6. Concluding Remarks
[8] K. J. Supowit, The relative neighborhood graph with an application to minimum spanning trees, Tech. Rept., Department of Computer Science, University of Illinois, Urbana-Champaign, August 1980, also
More informationJun Li, Ph.D. School of Computing and Information Sciences Phone:
Jun Li, Ph.D. School of Computing and Information Sciences Phone: + 1-305-348-4964 Florida International University Email: junli @ cs. fiu. edu 11200 SW 8th St, ECS 380, Miami, FL 33199 Web: http://users.cs.fiu.edu/
More informationJournal of Engineering Research and Studies E-ISSN
Journal of Engineering Research and Studies E-ISS 0976-79 Research Article SPECTRAL SOLUTIO OF STEADY STATE CODUCTIO I ARBITRARY QUADRILATERAL DOMAIS Alavani Chitra R 1*, Joshi Pallavi A 1, S Pavitran
More informationImproving Geographical Locality of Data for Shared Memory Implementations of PDE Solvers
Improving Geographical Locality of Data for Shared Memory Implementations of PDE Solvers Henrik Löf, Markus Nordén, and Sverker Holmgren Uppsala University, Department of Information Technology P.O. Box
More informationParallel Implementation of QRD Algorithms on the Fujitsu AP1000
Parallel Implementation of QRD Algorithms on the Fujitsu AP1000 Zhou, B. B. and Brent, R. P. Computer Sciences Laboratory Australian National University Canberra, ACT 0200 Abstract This paper addresses
More informationBrian F. Cooper. Distributed systems, digital libraries, and database systems
Brian F. Cooper Home Office Internet 2240 Homestead Ct. #206 Stanford University cooperb@stanford.edu Los Altos, CA 94024 Gates 424 http://www.stanford.edu/~cooperb/app/ (408) 730-5543 Stanford, CA 94305
More informationCYCLE DECOMPOSITIONS AND TRAIN TRACKS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume, Number, Pages S 000-999(0)07- Article electronically published on June, 00 CYCLE DECOMPOSITIONS AND TRAIN TRACKS CHARLES A. MATTHEWS AND DAVID J.
More informationA NEW MIXED PRECONDITIONING METHOD BASED ON THE CLUSTERED ELEMENT -BY -ELEMENT PRECONDITIONERS
Contemporary Mathematics Volume 157, 1994 A NEW MIXED PRECONDITIONING METHOD BASED ON THE CLUSTERED ELEMENT -BY -ELEMENT PRECONDITIONERS T.E. Tezduyar, M. Behr, S.K. Aliabadi, S. Mittal and S.E. Ray ABSTRACT.
More informationA Simplex based Dimension Independent Approach for Convex Decomposition of Nonconvex polytopes
A Simplex based Dimension Independent Approach for Convex Decomposition of Nonconvex polytopes Rizwan Bulbul, Farid Karimipour and Andrew U. Frank Institute of Geoinformation and Cartography Technical
More informationfspai-1.1 Factorized Sparse Approximate Inverse Preconditioner
fspai-1.1 Factorized Sparse Approximate Inverse Preconditioner Thomas Huckle Matous Sedlacek 2011 09 10 Technische Universität München Research Unit Computer Science V Scientific Computing in Computer
More informationWireless Communications, Information Theory, Physical Layer Security, Cyber Security for Smart Grid, Cryptography, Network Coding.
Mustafa El-Halabi Contact Information Fleifel Building Cell Phone: + (979) 422 4585 Mathaf E-mail: mhalabi@aust.edu.lb Beirut, Lebanon Webpage: https://mustafa-halabi.appspot.com/ Research Interests Education
More informationCollaborations with University of Coimbra and Budapest University of Technology and Economics
Energy Efficiency in Large Scale Distributed Systems Collaborations with University of Coimbra and Budapest University of Technology and Economics Torsten Braun, Universität Bern, Switzerland braun@iam.unibe.ch,
More information