• Corpus ID: 4901675

# Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada

@inproceedings{Froese2016ProceedingsOT,
title={Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada},
author={Vincent Froese and Iyad A. Kanj and Andr{\'e} Nichterlein and Rolf Niedermeier},
year={2016}
}
• Published in
2016
• Computer Science
A fundamental problem in Distributed Computing is the Pattern Formation problem, where some independent mobile entities, called robots, have to rearrange themselves in such a way as to form a given figure from every possible (non-degenerate) initial configuration. In the present paper, we consider robots that operate in the Euclidean plane and are dimensionless, anonymous, oblivious, silent, asynchronous, disoriented, nonchiral, and non-rigid. For this very elementary type of robots, the…

## References

SHOWING 1-10 OF 422 REFERENCES

• Mathematics, Computer Science
SIAM J. Discret. Math.
• 2013
It is proved that if $\ell \leq O(n^{(1-\epsilon)/2})$ then f(n,\ell) \geq \Omega(\sqrt{n\log_\ell n})$, which implies all previously known lower bounds on$f(n)$and improves them when$\ell\$ is not fixed.
• Computer Science, Mathematics
SODA
• 2014
This work shows, by reduction from Vertex Cover, that---unless the polynomial hierarchy collapses---PLC has no kernel of total size O(k2-e) bits, which implies the claimed lower bound on the number of points.
• Computer Science, Mathematics
STOC '10
• 2010
It is shown that if satisfiability for n-variable d-CNF formulas has a protocol of cost O(nd-ε) then coNP is in NP/poly, which implies that the polynomial-time hierarchy collapses to its third level.
• Computer Science, Mathematics
ESA
• 2002
These algorithms lead to fixed-parameter tractable algorithms for many geometric and non-geometric covering problems.
• Computer Science
• 1978
It is proved here that the number ofrules in any irredundant Horn knowledge base involving n propositional variables is at most n 0 1 times the minimum possible number of rules.
Eventually, you will very discover a new experience and endowment by spending more cash. yet when? accomplish you take that you require to get those all needs next having significantly cash? Why
An algorithm for computing witness sets of points, line segments and, if necessary, regions in O(n 4 ) time is proposed and determines whether guarding the boundary of a polygon is sucient to guard the entire polygon.