|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 18 publication records. Showing 18 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach |
Pattern Matching in Multiple Streams  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach |
The Complexity of Flood Filling Games.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby |
The complexity of weighted and unweighted #CSP.  |
J. Comput. Syst. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphaël Clifford, Markus Jalsenius, Benjamin Sach |
Streaming Pattern Matching with Relabelling  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Raphaël Clifford, Markus Jalsenius |
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach |
Space Lower Bounds for Online Pattern Matching  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach |
Pattern Matching under Polynomial Transformation  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Raphaël Clifford, Markus Jalsenius |
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model.  |
ICALP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach |
Space Lower Bounds for Online Pattern Matching.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby |
The complexity of weighted and unweighted #CSP  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach |
The Complexity of Flood Filling Games  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract)  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Approximating Bounded-Degree Boolean #CSP.  |
STACS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach |
The Complexity of Flood Filling Games.  |
FUN  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The complexity of weighted Boolean #CSP with mixed signs.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Approximating Bounded-Degree Boolean #CSP  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Markus Jalsenius, Kasper Pedersen |
A Systematic Scan for 7-colourings of the Grid.  |
Int. J. Found. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Weighted Boolean #CSP with Mixed Signs  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|