EDBT 2026 Demo / reviewers in the wild / expert
Yongquan Lu
dblp:53/3084
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 2016
0000-0002-1739-8153ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Program synthesis and code generation · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program synthesis and code generation
constraint-based synthesis |
0.2 | 1 | 2016 | Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations · OOPSLA 2016 |
Program synthesis and code generation
deductive program synthesis |
0.2 | 1 | 2016 | Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations · OOPSLA 2016 |
Program synthesis and code generation
inductive program synthesis |
0.2 | 1 | 2016 | Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations · OOPSLA 2016 |
Algorithms and data structures › recursive algorithms
divide-and-conquer |
0.1 | 1 | 2016 | Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations · OOPSLA 2016 |
Algorithms and data structures
dynamic programming |
0.1 | 1 | 2016 | Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations · OOPSLA 2016 |
Methods — techniques the papers use, named apart from their topics
refinement types · 0.5deductive reasoning · 0.5constraint solving · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Improved Parallel Gaussian Elimination Algorithm in Magnetotelluric Occam's Inversion
Pengdong Gao, Yongquan Lu |
ICIC (2) | 3 |
| 2016 | Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformationsabstractWe introduce a framework allowing domain experts to manipulate computational terms in the interest of deriving better, more efficient implementations.It employs deductive reasoning to generate provably correct efficient implementations from a very high-level specification of an algorithm, and inductive constraint-based synthesis to improve automation. Semantic information is encoded into program terms through the use of refinement types. Shachar Itzhaky, Rohit Singh 0002, Armando Solar-Lezama, Kuat Yessenov, Yongquan Lu, Charles E. Leiserson, Rezaul Alam Chowdhury |
OOPSLA | 5 |
| 2009 | Parallel adaptive simplification of massive meshesabstractA parallel simplification method based on vertex clustering for out-of-core meshes is presented in this paper. To reduce file I/O, only one linear scan is performed in this method to partition the original model into equal batches. Then vertex normal vectors and coefficients of each triangle plane are calculated with some inter-task communications. The portion assigned to each processor is simplified by an improved vertex clustering method. Finally, all reduced data are sent back to the master node and assembled into the simplified mesh. The partition stitching is fulfilled simply by using a global vertex index. A lot of experiments have demonstrated that the proposed method can handle extremely large data set and speed up the execution time obviously as well as produce approximations with high quality. Pengdong Gao, Yongquan Lu, Chu Qiu, Wenhua Yu |
CAD/Graphics | 3 |
| 2009 | A Parallel Memory Efficient Framework for Out-of-Core Mesh SimplificationabstractA general parallel framework is presented in this paper for simplification of very large mesh models. This framework is implemented on a dedicated cluster. To guarantee not to thrash the virtual memory system, load balancing is performed in this framework by providing an intelligent partitioning of the inputting model using a parallel global sorting. This partitioning ensures a near optimal utilization of the computational resources, and then ensures high quality output, low runtime and high parallel efficiency. To test the usability of this framework, we have implemented a parallel version of an improved vertex clustering simplification. A serial of experimental results have demonstrated that using this framework the parallel simplification is memory efficient and can handle extremely large data set as well as speed up the execution obviously. Yongquan Lu, Pengdong Gao, Chu Qiu, Rui Lv |
HPCC | 1 |