SIAM J. Control and Optimization 2014
Top Research Directions
The 2 research directions with SIAM J. Control and Optimization 2014 papers, ranked by paper count. Share is the fraction of the edition’s papers in the direction.
| # | Direction | Papers | Share |
|---|---|---|---|
| 1 | Distributed Coordination over Quantized Communication Channels | 1 | 50.0% |
| 2 | Distributed State Estimation over Multi Agent Networks | 1 | 50.0% |
Download all directions as CSV
Institutions
Institutions credited by SIAM J. Control and Optimization 2014 papers: a paper credits every institution named in its affiliations, once. 2 institutions share 2 credited papers.
| # | Institution | Papers | Share | 2013 | 2013 rank |
|---|---|---|---|---|---|
| 1 | University of Illinois Urbana-Champaign | 2 | 100.0% | 1 | 2 |
| 2 | UCLouvain | 1 | 50.0% | 1 | 1 |
Download all institutions as CSV
About this data
Papers. SIAM J. Control and Optimization 2014 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-19 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “SIAM J. Control and Optimization 2014”, https://lacuna.tiptreesystems.com/venue/siam-j-control-and-optimization/2014.
Top Authors
| Author | Papers |
|---|---|
| Alex Olshevsky | 2 |
Papers
| Title |
|---|
| Consensus with Ternary Messages |
| How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard |