_id,doi,title
635,10.1007/978-3-319-56617-7_2,Scrypt is maximally memory hard
636,10.1007/978-3-319-65765-3_11,On the quantitative semantics of regular expressions over real-valued signals
637,10.1007/978-3-319-63688-7_5,Be adaptive avoid overcommitting
639,10.1007/978-3-319-63390-9_3,Non-polynomial worst case analysis of recursive programs
640,10.1007/978-3-319-56617-7_1,Depth-robust graphs and their cumulative memory complexity
642,10.1090/mcom/3201,Localization errors in solving stochastic partial differential equations in the whole space
6426,10.15479/AT:IST-2018-853-v2-2,Synchronizing the asynchronous
644,10.1137/16M1091836,The complexity of general-valued CSPs
645,10.1007/978-3-319-63387-9_10,Value iteration for long run average reward in markov decision processes
646,10.1007/978-3-319-58771-4_19,A novel convex relaxation for non binary discrete tomography
647,10.1007/978-3-319-65765-3_7,Conic abstractions for hybrid systems
648,10.1007/978-3-319-55911-7_43,On the complexity of breaking pseudoentropy
650,10.1007/978-3-319-55911-7_42,A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds
6517,10.4230/LIPICS.ISAAC.2017.34,Embedding graphs into embedded graphs
6519,10.4230/LIPICS.CSL.2017.18,Improved set-based symbolic algorithms for parity games
6526,10.1109/isit.2017.8006529,On the complexity of estimating Rènyi divergences
6527,10.1145/3133956.3134031,Practical graphs for optimal side-channel resistant memory-hard functions
653,10.1038/ng.3764,Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer
654,10.1242/dev.144915,"Creating to understand – developmental biology meets engineering in Paris"
655,10.7554/eLife.23136,Bacterial flagella grow through an injection diffusion mechanism