Christian Trefftz

According to our database1, Christian Trefftz authored at least 44 papers between 1990 and 2023.

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

2023
Evaluating performance and portability of high-level programming models: Julia, Python/Numba, and Kokkos on exascale nodes.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

Divide-and-Conquer Algorithms for Computing Three-Dimensional Voronoi Diagrams.
Proceedings of the IEEE International Conference on Electro Information Technology, 2023

Calculating an Approximate Voronoi Diagram using QuadTrees and Triangles.
Proceedings of the IEEE International Conference on Electro Information Technology, 2023

2022
Optimizing Trade-offs Between Distance and Coverage for Facility Location.
Proceedings of the 2022 IEEE International Conference on Electro Information Technology, 2022

2021
A Novelty Search and Metamorphic Testing Approach to Automatic Test Generation.
Proceedings of the 14th IEEE/ACM International Workshop on Search-Based Software Testing, 2021

An Algorithm to solve a Facility Location Problem using a Discrete Approximation to the Voronoi Diagram.
Proceedings of the IEEE International Conference on Electro Information Technology, 2021

2020
A Divide-and-Conquer Algorithm for Computing Voronoi Diagrams.
Proceedings of the 2020 IEEE International Conference on Electro Information Technology, 2020

Data Allocation and Replication in Data Center: Tradeoff and Solutions.
Proceedings of the 2020 IEEE International Conference on Electro Information Technology, 2020

2019
Parallelizing FluidC, a Community Finding Algorithm.
Proceedings of the 2019 IEEE International Conference on Electro Information Technology, 2019

Data Placement Strategy in Data Center.
Proceedings of the 2019 IEEE International Conference on Electro Information Technology, 2019

Repel Communities and Multipartite Networks.
Proceedings of the Complex Networks and Their Applications VIII, 2019

A Parallel Algorithm to Calculate an Approximation to the Order-K Voronoi Diagram using Java Streams and Thrust.
Proceedings of the IEEE 9th Annual Computing and Communication Workshop and Conference, 2019

2018
The difference between optimal and germane communities.
Soc. Netw. Anal. Min., 2018

Exhaustive community enumeration on a cluster.
Proceedings of the IEEE 8th Annual Computing and Communication Workshop and Conference, 2018

2017
Covers, partitions and a heuristic to calculate two-covers.
Proceedings of the IEEE International Conference on Electro Information Technology, 2017

2016
Exhaustive Community Enumeration in Parallel.
Parallel Process. Lett., 2016

2015
Parallelizing an algorithm to find communities using the Jaccard metric.
Proceedings of the IEEE International Conference on Electro/Information Technology, 2015

2014
Enumerating Communities for a Deeper Understanding of Community Finding.
Proceedings of the 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT), Warsaw, Poland, August 11-14, 2014, 2014

Using an unrank framework to solve small instances of NP-hard problems on graphical processing units.
Proceedings of the IEEE International Conference on Electro/Information Technology, 2014

Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing units.
Proceedings of the IEEE International Conference on Electro/Information Technology, 2014

2013
Community finding within the community set space.
Proceedings of the 7th Workshop on Social Network Mining and Analysis, 2013

Revisiting a Pattern for Processing Combinatorial Objects in Parallel.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Parallel Implementations of FGMRES for Solving Large, Sparse Non-Symmetric Linear Systems.
Proceedings of the International Conference on Computational Science, 2013

Parallelizing an algorithm to decide if a bipartite graph is shellable.
Proceedings of the IEEE International Conference on Electro-Information Technology , 2013

Parallelizing a heuristic for the Maximum Clique Problem on GPUs and clusters of workstations.
Proceedings of the IEEE International Conference on Electro-Information Technology , 2013

2012
An algorithm to solve the Dominating Set Problem on GPUs.
Proceedings of the 2012 IEEE International Conference on Electro/Information Technology, 2012

High-performance implementations of a clustering algorithm for finding network communities.
Proceedings of the 2012 IEEE International Conference on Electro/Information Technology, 2012

2009
Accelerated Discovery of Discrete M-Clusters/Outliers on the Raster Plane Using Graphical Processing Units.
Proceedings of the Computational Science, 2009

Opportunities for parallelism when implementing algorithms in VHDL - a case study - Shift-Or.
Proceedings of the 2009 IEEE International Conference on Electro/Information Technology, 2009

2008
Computation of Voronoi diagrams using a graphics processing unit.
Proceedings of the 2008 IEEE International Conference on Electro/Information Technology, 2008

2007
An Investigation on Testing of Parallelized Code with OpenMP.
Proceedings of the A Practical Programming Model for the Multi-Core Era, 2007

2006
Voronoi-diagram based heuristics for the location of mobile and unreliable service providers.
Proceedings of the IASTED International Conference on Advances in Computer Science and Technology, 2006

2004
Using XML in a compiler course.
Proceedings of the 9th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2004

Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
Parallel Algorithms to Find the Voronoi Diagram and the Order-k Voronoi Diagram.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

2002
Observations about an Approximate Algorithm for the Point Robot Motion Planning Problem.
Proceedings of the 22nd International Conference of the Chilean Computer Science Society (SCCC 2002), 2002

1995
A Scalable Eigenvalue Solver for Symmetric Tridiagonal Matrices.
Parallel Comput., 1995

A Parallel Algorithm for the Singular Value Problem in Bidiagonal Matrices.
Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, 1995

1994
Design and Performance Evaluation of a Distributed Eigenvalue Solver on a Workstation Cluster.
Proceedings of the 14th International Conference on Distributed Computing Systems, 1994

1993
A Scalable Eigenvalue Solver for Symmetric Tridiagonal Matrices.
Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993

MultiSim: A Simulation Tool for the Study of Large-Scale Multiprocessors.
Proceedings of the MASCOTS '93, 1993

Efficient Broadcast in All-Port Wormhole-Routed Hypercubes.
Proceedings of the 1993 International Conference on Parallel Processing, 1993

1991
An algorithm for approximating Dirichlet tessellations (abstract only).
Proceedings of the 19th annual conference on Computer Science, 1991

1990
Cooperation of the Pattern Recognition Techniques of Dirichlet Tessellations with Political Science to Produce Ward Partitioning of Cities Without Bias (Abstract).
Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, 1990


  Loading...