Publications | Lund University Publications

1 – 10 of 13

show: 10
|
sort: year (new to old)

News feed Embed this list Save this search Mark all Export

Cancel

Embed this list

copy and paste the html snippet below into your own page:

<iframe src="https://lup.lub.lu.se/search/publication?embed=1&q=issn+exact+%220097-5397%22&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

« previous
1
2
next »

2022
Mark SUBLINEAR CONVERGENCE OF A TAMED STOCHASTIC GRADIENT DESCENT METHOD IN HILBERT SPACE
Eisenmann, Monika ^LU and Stillfjord, Tony ^LU (2022) In SIAM Journal on Computing 51(4).
- Contribution to journal › Article
2020
Mark Supercritical space-width trade-offs for resolution
Berkholz, Christoph and Nordström, Jakob ^LU (2020) In SIAM Journal on Computing 49(1). p.98-118
- Contribution to journal › Article
2019
Mark Shortest two disjoint paths in polynomial time
Björklund, Andreas ^LU and Husfeldt, Thore ^LU (2019) In SIAM Journal on Computing 48(6). p.1698-1710
- Contribution to journal › Article
2015
Mark Space complexity in polynomial calculus
Filmus, Yuval ; Lauria, Massimo ; Nordström, Jakob ^LU ; Ron-Zewi, Noga and Thapen, Neil (2015) In SIAM Journal on Computing 44(4). p.1119-1153
- Contribution to journal › Article
2014
Mark Determinant Sums for Undirected Hamiltonicity
Björklund, Andreas ^LU (2014) In SIAM Journal on Computing 43(1). p.280-299
- Contribution to journal › Article
2012
Mark The complexity of inferring a minimally resolved phylogenetic supertree
Jansson, Jesper ; Lemence, Richard S. and Lingas, Andrzej ^LU (2012) In SIAM Journal on Computing 41(1). p.272-291
- Contribution to journal › Article
2009
Mark Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
Czumaj, Artur and Lingas, Andrzej ^LU (2009) In SIAM Journal on Computing 39(2). p.431-444
- Contribution to journal › Article
Mark Set partitioning via inclusion-exclusion
Björklund, Andreas ^LU ; Husfeldt, Thore ^LU and Koivisto, Mikko (2009) In SIAM Journal on Computing 39(2). p.546-563
- Contribution to journal › Article
Mark Narrow proofs may be spacious : Separating space and width in resolution
Nordström, Jakob ^LU (2009) In SIAM Journal on Computing 39(1). p.59-121
- Contribution to journal › Article
2005
Mark Polynomial time approximation schemes for max-bisection on planar and geometric graphs
Jansen, K ; Karpinski, M ; Lingas, Andrzej ^LU and Seidel, E (2005) In SIAM Journal on Computing 35(1). p.110-119
- Contribution to journal › Article

« previous
1
2
next »

your query:: Remove issn: 0097-5397