Forschungspapier (740)

10961.
Forschungspapier
Voigt, M.: On Generalizing Decidable Standard Prefix Classes of First-Order Logic. (2017), 34 S.
10962.
Forschungspapier
Voigt, M.: The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals is Decidable. (2017), 27 S.
10963.
Forschungspapier
Voigt, M.: A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment. (2017), 38 S.
10964.
Forschungspapier
Xu, W.; Chatterjee, A.; Zollhöfer, M.; Rhodin, H.; Mehta, D.; Seidel, H.-P.; Theobalt, C.: MonoPerfCap: Human Performance Capture from Monocular Video. (2017), 13 S.
10965.
Forschungspapier
Yates, A.; Cohan, A.; Goharian, N.: Depression and Self-Harm Risk Assessment in Online Forums. (2017), 14 S.
10966.
Forschungspapier
Yates, A.; Hui, K.: DE-PACRR: Exploring Layers Inside the PACRR Model. (2017), 5 S.
10967.
Forschungspapier
Zhang, Y.; Humbert, M.; Surma, B.; Manoharan, P.; Vreeken, J.; Backes, M.: CTRL+Z: Recovering Anonymized Social Graphs. (2017), 18 S.
10968.
Forschungspapier
Ábrahám, E.; Abbott, J.; Becker, B.; Bigatti, A. M.; Brain, M.; Buchberger, B.; Cimatti, A.; Davenport, J. H.; England, M.; Fontaine, P. et al.; Forrest, S.; Griggio, A.; Kroening, D.; Seiler, W. M.; Sturm, T.: Satisfiability Checking and Symbolic Computation. (2016), 3 S.
10969.
Forschungspapier
Ábrahám, E.; Abbott, J.; Becker, B.; Bigatti, A. M.; Brain, M.; Buchberger, B.; Cimatti, A.; Davenport, J. H.; England, M.; Fontaine, P. et al.; Forrest, S.; Griggio, A.; Kroening, D.; Seiler, W. M.; Sturm, T.: SC2: Satisfiability Checking meets Symbolic Computation (Project Paper). (2016), 15 S.
10970.
Forschungspapier
Abraham, I.; Chechik, S.; Krinninger, S.: Fully Dynamic All-pairs Shortest Paths with Worst-case Update-time revisited. (2016), 21 S.
10971.
Forschungspapier
Abraham, I.; Durfee, D.; Koutis, I.; Krinninger, S.; Peng, R.: On Fully Dynamic Graph Sparsifiers. (2016), 67 S.
10972.
Forschungspapier
Babu, J.; Basavaraju, M.; Chandran, L. S.; Francis, M. C.: On Induced Colourful Paths in Triangle-free Graphs. (2016), 11 S.
10973.
Forschungspapier
Becker, R.; Karrenbauer, A.; Krinninger, S.; Lenzen, C.: Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. (2016), 30 S.
10974.
Forschungspapier
Becker, R.; Karrenbauer, A.; Mehlhorn, K.: An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. (2016), 17 S.
10975.
Forschungspapier
Becker, R.; Sagraloff, M.; Sharma, V.; Yap, C.: A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration. (2016), 53 S.
10976.
Forschungspapier
Bei, X.; Garg, J.; Hoefer, M.; Mehlhorn, K.: Computing Equilibria in Markets with Budget-Additive Utilities. (2016), 21 pages S.
10977.
Forschungspapier
Bhattacharyya, A.; Malinowski, M.; Fritz, M.: Spatio-Temporal Image Boundary Extrapolation. (2016), 10 S.
10978.
Forschungspapier
Blanchette, J. C.; Böhme, S.; Popescu, A.; Smallbone, N.: Encoding Monomorphic and Polymorphic Types. (2016), LMCS-2014-1018 S.
10979.
Forschungspapier
Bodwin, G.; Krinninger, S.: Fully Dynamic Spanners with Worst-Case Update Time. (2016), 22 S.
10980.
Forschungspapier
Brand, C.; Sagraloff, M.: On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. (2016), 21 S.
Zur Redakteursansicht