Qiuyang Mang

Orcid: 0009-0000-4462-8527

According to our database1, Qiuyang Mang authored at least 25 papers between 2023 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
OpenDeepThink: Parallel Reasoning via Bradley-Terry Aggregation.
CoRR, May, 2026

FrontierSmith: Synthesizing Open-Ended Coding Problems at Scale.
CoRR, May, 2026

Do Androids Dream of Breaking the Game? Systematically Auditing AI Agent Benchmarks with BenchJack.
CoRR, May, 2026

PLOP: Cost-Based Placement of Semantic Operators in Hybrid Query Plans.
CoRR, April, 2026

Combee: Scaling Prompt Learning for Self-Improving Language Model Agents.
CoRR, April, 2026

SVG-EAR: Parameter-Free Linear Compensation for Sparse Video Generation via Error-aware Routing.
CoRR, March, 2026

EvoX: Meta-Evolution for Automated Discovery.
CoRR, February, 2026

AdaEvolve: Adaptive LLM Driven Zeroth-Order Optimization.
CoRR, February, 2026

SkyDiscover: A Flexible, Adaptive Framework for AI-Driven Scientific and Algorithmic Discovery.
Proceedings of the ACM Conference on AI and Agentic Systems, 2026

Curing Miracle Steps in LLM Mathematical Reasoning with Rubric Rewards.
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2026

2025
Scalable Approximate Biclique Counting over Large Bipartite Graphs.
Proc. VLDB Endow., December, 2025

FrontierCS: Evolving Challenges for Evolving Intelligence.
CoRR, December, 2025

Continuum: Efficient and Robust Multi-Turn LLM Agent Scheduling with KV Cache Time-to-Live.
CoRR, November, 2025

AutoCode: LLMs as Problem Setters for Competitive Programming.
CoRR, October, 2025

Automated Discovery of Test Oracles for Database Management Systems Using LLMs.
CoRR, October, 2025

Finding Logic Bugs in Graph-processing Systems via Graph-cutting.
Proc. ACM Manag. Data, June, 2025

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index.
Proc. VLDB Endow., February, 2025

Reproducibility Report for ACM SIGMOD 2025 Paper: 'Parallel <i>k</i>-Core Decomposition: Theory and Practice'.
Proceedings of the Reproducibility Reports of the 2025 International Conference on Management of Data, 2025

2024
Finding Logic Bugs in Spatial Database Engines via <i>Affine Equivalent Inputs</i>.
Proc. ACM Manag. Data, December, 2024

Finding Logic Bugs in Spatial Database Engines via Affine Equivalent Inputs.
CoRR, 2024

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index.
CoRR, 2024

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Testing Graph Database Systems via Equivalent Query Rewriting.
Proceedings of the 46th IEEE/ACM International Conference on Software Engineering, 2024

2023
Retromorphic Testing: A New Approach to the Test Oracle Problem.
CoRR, 2023

Automated Testing and Improvement of Named Entity Recognition Systems.
Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2023


  Loading...