Found: 5
Select item for more details and to access through your institution.
Set Cover Problems with Small Neighborhood Covers.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 8, p. 1763, doi. 10.1007/s00224-017-9842-1
- By:
- Publication type:
- Article
Improved algorithms for resource allocation under varying capacity.
- Published in:
- Journal of Scheduling, 2018, v. 21, n. 3, p. 313, doi. 10.1007/s10951-017-0515-3
- By:
- Publication type:
- Article
Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 4, p. 447, doi. 10.1007/s00224-012-9405-4
- By:
- Publication type:
- Article
Time-Space Tradeoff in Derandomizing Probabilistic Logspace.
- Published in:
- Theory of Computing Systems, 2006, v. 39, n. 1, p. 189, doi. 10.1007/s00224-005-1264-9
- By:
- Publication type:
- Article
On the non-approximability of points-to analysis.
- Published in:
- Acta Informatica, 2002, v. 38, n. 8, p. 587, doi. 10.1007/s00236-002-0081-8
- By:
- Publication type:
- Article