Works matching IS 14324350 AND DT 2015 AND VI 57 AND IP 1
Results: 10
On the Parameterized Complexity of Computing Balanced Partitions in Graphs.
- Published in:
- Theory of Computing Systems, 2015, v. 57, n. 1, p. 1, doi. 10.1007/s00224-014-9557-5
- By:
- Publication type:
- Article
Minimizing Rosenthal Potential in Multicast Games.
- Published in:
- Theory of Computing Systems, 2015, v. 57, n. 1, p. 81, doi. 10.1007/s00224-014-9573-5
- By:
- Publication type:
- Article
Lower Bounds for Tropical Circuits and Dynamic Programs.
- Published in:
- Theory of Computing Systems, 2015, v. 57, n. 1, p. 160, doi. 10.1007/s00224-014-9574-4
- By:
- Publication type:
- Article
Deciding Determinism of Regular Languages.
- Published in:
- Theory of Computing Systems, 2015, v. 57, n. 1, p. 97, doi. 10.1007/s00224-014-9576-2
- By:
- Publication type:
- Article
Restarting Transducers, Regular Languages, and Rational Relations.
- Published in:
- Theory of Computing Systems, 2015, v. 57, n. 1, p. 195, doi. 10.1007/s00224-014-9579-z
- By:
- Publication type:
- Article
Finding Disjoint Paths in Split Graphs.
- Published in:
- Theory of Computing Systems, 2015, v. 57, n. 1, p. 140, doi. 10.1007/s00224-014-9580-6
- By:
- Publication type:
- Article
Random Sequences with Respect to a Measure Defined by Two Linear Fractional Transformations.
- Published in:
- Theory of Computing Systems, 2015, v. 57, n. 1, p. 226, doi. 10.1007/s00224-014-9585-1
- By:
- Publication type:
- Article
LP-Based Covering Games with Low Price of Anarchy.
- Published in:
- Theory of Computing Systems, 2015, v. 57, n. 1, p. 238, doi. 10.1007/s00224-014-9587-z
- By:
- Publication type:
- Article
On Avoiding Spare Aborts in Transactional Memory.
- Published in:
- Theory of Computing Systems, 2015, v. 57, n. 1, p. 261, doi. 10.1007/s00224-015-9607-7
- By:
- Publication type:
- Article
The Complexity of Debate Checking.
- Published in:
- Theory of Computing Systems, 2015, v. 57, n. 1, p. 36, doi. 10.1007/s00224-014-9547-7
- By:
- Publication type:
- Article