Algorithmica is a monthly peer reviewed, scientific journal, published by Springer Science+Business Media focused on research and application ofâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Parikshit Gopalan, Raghu Meka, Omer Reingold
- computational complexity
- 2012

Given a DNF formula f on n variables, the two natural size measures are the number of terms or size s(f) and the maximum width ofâ€¦Â (More)

Is this relevant?

2010

2010

- Amit Chakrabarti, Graham Cormode, Ranganath Kondapally, Andrew McGregor
- 2010 IEEE 51st Annual Symposium on Foundations ofâ€¦
- 2010

This paper makes three main contributions to the theory of communication complexity and stream computation. First, we present newâ€¦Â (More)

Is this relevant?

2008

2008

- Marcin Mucha
- 2008

We present a randomized algorithm for finding maximum matchings in planar graphs in time O(n'~ where co is the exponent of theâ€¦Â (More)

Is this relevant?

2006

2006

(1 + 1) [1636, 1637, 2320, 2205]. (1 + ) [1067]. (1 + Î») [2458]. (2âˆ’ c 1 âˆš N ) [1357]. (2t+ 1) [799]. (k âˆ’ 1) [1177]. (s, t) [446â€¦Â (More)

Is this relevant?

2006

2006

- Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang
- Theory of Computing Systems
- 2006

Consider the dynamic program h(n)=minâ€‰1â‰¤jâ‰¤n a(n,j), where a(n,j) is some formula that may (online) or may not (offline) depend onâ€¦Â (More)

Is this relevant?

2000

2000

We consider the problem of planning sensor control strategies that enable a sensor to be automatically conngured for robot tasksâ€¦Â (More)

Is this relevant?

1996

1996

Â

Is this relevant?

1995

1995

- T Let
- 1995

NI 90] H. Nagamochi and T. Ibaraki, \Linear time algorithms for nding k-edge-connected and k-node-connected spanning subgraphsâ€¦Â (More)

Is this relevant?

1992

1992

- Monika Henzinger
- 1992

We present an algorithm for maintaining the biconnected components of a graph during a sequence of edge insertions and deletionsâ€¦Â (More)

Is this relevant?

1992