Mark H. Siggers
2010
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 4 researchers here, as inferred from the citation graph.
Whom Mark H. Siggers trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Mark H. Siggers overall
Papers from Mark H. Siggers's perspective
Ordered by how strongly the researchers Mark H. Siggers trusts endorse each paper. Same corpus, a different order for every researcher.
- Existence theorems for weakly symmetric operations
- Algebraic structures in combinatorial problems
- I Computational Complexity
- Constraints
- Classifying the Complexity of Constraints Using Finite Algebras (SIAM journal on computing (Print))
- Varieties with few subalgebras of powers
- Complexity classifications of Boolean constraint satisfaction problems (SIAM monographs on discrete mathematics and applications)
- Research challenges in wireless networks of biomedical sensors (ACM/IEEE International Conference on Mobile Computing and Networking)
- Timing-sync protocol for sensor networks (ACM International Conference on Embedded Networked Sensor Systems)
- Smart kindergarten: sensor-based wireless networks for smart developmental problem-solving environments (ACM/IEEE International Conference on Mobile Computing and Networking)
Their papers
- A strong Mal’cev condition for locally finite varieties omitting the unary type (2010) — 100 citations