default search action
Christian Trefftz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
- [j3]Jerry Scripps
, Christian Trefftz, Zachary Kurmas:
The difference between optimal and germane communities. Soc. Netw. Anal. Min. 8(1): 44:1-44:19 (2018) - 2016
- [j2]Christian Trefftz, Hugh McGuire, Zachary Kurmas, Jerry Scripps:
Exhaustive Community Enumeration in Parallel. Parallel Process. Lett. 26(2): 1650006:1-1650006:16 (2016) - 1995
- [j1]Christian Trefftz, C. C. Huang, Philip K. McKinley, Tien-Yien Li, Zhonggang Zeng:
A Scalable Eigenvalue Solver for Symmetric Tridiagonal Matrices. Parallel Comput. 21(8): 1213-1240 (1995)
Conference and Workshop Papers
- 2024
- [c43]Dan Dietsche, T. Elise Dettling, Christian Trefftz, Byron DeVries:
Comparing Data Structures Used in Divide-and-Conquer Three-Dimensional Voronoi Diagrams. EIT 2024: 1-5 - [c42]Levi Klamer, T. Elise Dettling, Dan Dietsche, Christian Trefftz, Byron DeVries:
Language Timing for Computing Voronoi Diagrams. EIT 2024: 1-5 - 2023
- [c41]T. Elise Dettling, Byron DeVries, Christian Trefftz:
Calculating an Approximate Voronoi Diagram using QuadTrees and Triangles. eIT 2023: 133-136 - [c40]Dan Dietsche, T. Elise Dettling, Christian Trefftz, Byron DeVries:
Divide-and-Conquer Algorithms for Computing Three-Dimensional Voronoi Diagrams. eIT 2023: 357-361 - [c39]William F. Godoy
Evaluating performance and portability of high-level programming models: Julia, Python/Numba, and Kokkos on exascale nodes. IPDPS Workshops 2023: 373-382 - 2022
- [c38]Jhoseph Ruiz Fachin, Christian Trefftz, Xiang Cao, Byron DeVries:
Optimizing Trade-offs Between Distance and Coverage for Facility Location. EIT 2022: 346-351 - 2021
- [c37]Christian Trefftz, Byron DeVries, Benjamin Jenkins:
An Algorithm to solve a Facility Location Problem using a Discrete Approximation to the Voronoi Diagram. EIT 2021: 86-90 - [c36]Byron DeVries, Christian Trefftz:
A Novelty Search and Metamorphic Testing Approach to Automatic Test Generation. SBST@ICSE 2021: 8-11 - 2020
- [c35]Xiang Cao, Byron DeVries, Jerry Scripps, Christian Trefftz:
Data Allocation and Replication in Data Center: Tradeoff and Solutions. EIT 2020: 239-244 - [c34]Elijah Smith, Christian Trefftz, Byron DeVries:
A Divide-and-Conquer Algorithm for Computing Voronoi Diagrams. EIT 2020: 495-499 - 2019
- [c33]Christian Trefftz, Debaditya Gautam, Joseph S. Szakas:
A Parallel Algorithm to Calculate an Approximation to the Order-K Voronoi Diagram using Java Streams and Thrust. CCWC 2019: 30-33 - [c32]Jerry Scripps, Christian Trefftz, Gregory Wolffe, Roger Ferguson, Xiang Cao:
Repel Communities and Multipartite Networks. COMPLEX NETWORKS (1) 2019: 105-115 - [c31]Xiang Cao, Jerry Scripps, Christian Trefftz, Zachary Kurmas:
Data Placement Strategy in Data Center. EIT 2019: 114-119 - [c30]Christian Trefftz, Ronald Rounsifer, Jerry Scripps:
Parallelizing FluidC, a Community Finding Algorithm. EIT 2019: 141-144 - 2018
- [c29]Christian Trefftz, Hugh McGuire, Zack Kurmas, Jerry Scripps, Juan D. Pineda:
Exhaustive community enumeration on a cluster. CCWC 2018: 233-237 - 2017
- [c28]Christian Trefftz, Zack Kurmas, Jerry Scripps:
Covers, partitions and a heuristic to calculate two-covers. EIT 2017: 1-6 - 2015
- [c27]Jerry Scripps, Christian Trefftz:
Parallelizing an algorithm to find communities using the Jaccard metric. EIT 2015: 370-372 - 2014
- [c26]Christian Trefftz, Andrés Santamaría-Galvis, Roberto Cruz
Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing units. EIT 2014: 100-102 - [c25]Nicholas Vogel, Colin Uhen, Zachary Burnside, Sergio Botero, Christian Trefftz, Gregory Wolffe:
Using an unrank framework to solve small instances of NP-hard problems on graphical processing units. EIT 2014: 495-500 - [c24]Zachary Kurmas, Hugh McGuire, Jerry Scripps, Christian Trefftz:
Enumerating Communities for a Deeper Understanding of Community Finding. WI-IAT (2) 2014: 35-42 - 2013
- [c23]Roberto Cruz, Nancy Lopez, Christian Trefftz:
Parallelizing a heuristic for the Maximum Clique Problem on GPUs and clusters of workstations. EIT 2013: 1-6 - [c22]Andrés Santamaría-Galvis, Roberto Cruz
Parallelizing an algorithm to decide if a bipartite graph is shellable. EIT 2013: 1-3 - [c21]Byron DeVries, Joe Iannelli, Christian Trefftz, Kurt A. O'Hearn, Gregory Wolffe:
Parallel Implementations of FGMRES for Solving Large, Sparse Non-Symmetric Linear Systems. ICCS 2013: 491-500 - [c20]Christian Trefftz, Jerry Scripps:
Revisiting a Pattern for Processing Combinatorial Objects in Parallel. IPDPS Workshops 2013: 1889-1893 - [c19]Jerry Scripps, Christian Trefftz:
Community finding within the community set space. SNAKDD 2013: 13:1-13:9 - 2012
- [c18]Alex Restrepo, Andrés Solano, Jerry Scripps, Christian Trefftz, Jonathan Engelsma, Gregory Wolffe:
High-performance implementations of a clustering algorithm for finding network communities. EIT 2012: 1-6 - [c17]Christian Trefftz:
An algorithm to solve the Dominating Set Problem on GPUs. EIT 2012: 1-4 - 2009
- [c16]Barry Schulz, Chirag Parikh, Christian Trefftz:
Opportunities for parallelism when implementing algorithms in VHDL - a case study - Shift-Or. EIT 2009: 235-238 - [c15]Christian Trefftz, Joseph S. Szakas, Igor Majdandzic, Gregory Wolffe:
Accelerated Discovery of Discrete M-Clusters/Outliers on the Raster Plane Using Graphical Processing Units. ICCS (1) 2009: 934-943 - 2008
- [c14]Igor Majdandzic, Christian Trefftz, Gregory Wolffe:
Computation of Voronoi diagrams using a graphics processing unit. EIT 2008: 437-441 - 2007
- [c13]Robert Barnhart, Christian Trefftz, Paul C. Jorgensen, Yonglei Tao:
An Investigation on Testing of Parallelized Code with OpenMP. IWOMP 2007: 125-128 - 2006
- [c12]Joseph S. Szakas, Christian Trefftz:
Voronoi-diagram based heuristics for the location of mobile and unreliable service providers. ACST 2006: 73-78 - 2004
- [c11]Joseph S. Szakas, Christian Trefftz:
Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull. IPDPS 2004 - [c10]D. Robert Adams, Christian Trefftz:
Using XML in a compiler course. ITiCSE 2004: 4-6 - 2003
- [c9]Christian Trefftz, Joseph S. Szakas:
Parallel Algorithms to Find the Voronoi Diagram and the Order-k Voronoi Diagram. IPDPS 2003: 270 - 2002
- [c8]Christian Trefftz, Helmuth Trefftz:
Observations about an Approximate Algorithm for the Point Robot Motion Planning Problem. SCCC 2002: 52- - 1995
- [c7]Christian Trefftz, Philip K. McKinley, Tien-Yien Li, Zhonggang Zeng:
A Parallel Algorithm for the Singular Value Problem in Bidiagonal Matrices. PP 1995: 62-67 - 1994
- [c6]Christian Trefftz, C. C. Huang, Philip K. McKinley, Tien-Yien Li, Zhonggang Zeng:
Design and Performance Evaluation of a Distributed Eigenvalue Solver on a Workstation Cluster. ICDCS 1994: 608-615 - 1993
- [c5]Philip K. McKinley, Christian Trefftz:
Efficient Broadcast in All-Port Wormhole-Routed Hypercubes. ICPP (2) 1993: 288-291 - [c4]Philip K. McKinley, Christian Trefftz:
MultiSim: A Simulation Tool for the Study of Large-Scale Multiprocessors. MASCOTS 1993: 57-62 - [c3]Christian Trefftz, Philip K. McKinley, Tien-Yien Li, Zhonggang Zeng:
A Scalable Eigenvalue Solver for Symmetric Tridiagonal Matrices. PPSC 1993: 602-609 - 1991
- [c2]Joseph S. Szakas, Christian Trefftz:
An algorithm for approximating Dirichlet tessellations (abstract only). ACM Conference on Computer Science 1991: 692 - 1990
- [c1]Joseph S. Szakas, Christian Trefftz:
Cooperation of the Pattern Recognition Techniques of Dirichlet Tessellations with Political Science to Produce Ward Partitioning of Cities Without Bias (Abstract). ACM Conference on Computer Science 1990: 439
Informal and Other Publications
- 2023
- [i1]William F. Godoy, Pedro Valero-Lara, T. Elise Dettling, Christian Trefftz, Ian Jorquera, Thomas Sheehy, Ross G. Miller, Marc González Tallada, Jeffrey S. Vetter, Valentin Churavy:
Evaluating performance and portability of high-level programming models: Julia, Python/Numba, and Kokkos on exascale nodes. CoRR abs/2303.06195 (2023)
Coauthor Index
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-09-02 00:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: