Pruv@ijcar 2018
Top Research Directions
The 3 research directions with Pruv@ijcar 2018 papers, ranked by paper count. Share is the fraction of the edition’s papers in the direction.
| # | Direction | Papers | Share |
|---|---|---|---|
| 1 | Component Caching in Combinatorial Search and Reasoning | 1 | 50.0% |
| 2 | Overcoming the Curse of Dimensionality in Reachability Analysis | 1 | 50.0% |
| 3 | The Geometric Curse of Dimensionality | 1 | 50.0% |
Download all directions as CSV
Institutions
Institutions credited by Pruv@ijcar 2018 papers: a paper credits every institution named in its affiliations, once. 5 institutions share 2 credited papers.
| # | Institution | Papers | Share |
|---|---|---|---|
| 1 | Chinese Academy of Sciences | 2 | 100.0% |
| 2 | Institute of Software | 2 | 100.0% |
| 3 | University of Chinese Academy of Sciences | 2 | 100.0% |
| 4 | 01hsx4r68 | 1 | 50.0% |
| 5 | Peking University | 1 | 50.0% |
Download all institutions as CSV
About this data
Papers. Pruv@ijcar 2018 lists 2 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.
Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers.
Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 2 of 2 papers (100.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.
Data. Counts come from Lacuna’s data build of 2026-11-20 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Pruv@ijcar 2018”, https://lacuna.tiptreesystems.com/venue/pruv-ijcar/2018.
Top Authors
| Author | Papers |
|---|---|
| Feifei Ma | 2 |
| Cunjing Ge | 1 |
| Jian Zhang | 1 |
Papers
| Title |
|---|
| A New Probabilistic Algorithm for Approximate Model Counting |
| VolCE: An Efficient Tool for Solving #SMT(LA) Problems |