Forschungspapier (740)

11041.
Forschungspapier
Thimmaraju, K.; Shastry, B.; Fiebig, T.; Hetzelt, F.; Seifert, J.-P.; Feldmann, A.; Schmid, S.: Reins to the Cloud: Compromising Cloud Systems via the Data Plane. (2016), 14 S.
11042.
Forschungspapier
Urbani, J.; Dutta, S.; Gurajada, S.; Weikum, G.: KOGNAC: Efficient Encoding of Large Knowledge Graphs. (2016), 8 S.
11043.
Forschungspapier
Wu, H.; Ning, Y.; Chakraborty, P.; Vreeken, J.; Tatti, N.; Ramakrishnan, N.: Generating Realistic Synthetic Population Datasets. (2016), 16 S.
11044.
Forschungspapier
Wu, H.; Sun, M.; Vreeken, J.; Tatti, N.; North, C.; Ramakrishnan, N.: Interactive and Iterative Discovery of Entity Network Subgraphs. (2016), 10 S.
11045.
Forschungspapier
Darwish, O.; Elmasry, A.; Katajainen, J.: Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls. (2015), 21 pages S.
11046.
Forschungspapier
Duan, R.; Garg, J.; Mehlhorn, K.: An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. (2015), 17 S.
11047.
Forschungspapier
Shcherbatyi, I.; Bulling, A.; Fritz, M.: GazeDPM: Early Integration of Gaze Information in Deformable Part Models. (2015), 14 S.
11048.
Forschungspapier
Bromberger, M.; Sturm, T.; Weidenbach, C.: Linear Integer Arithmetic Revisited. (2015), 34 S.
11049.
Forschungspapier
Teucke, A.; Weidenbach, C.: First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation. (2015), 16 S.
11050.
Forschungspapier
Metzler, S.; Miettinen, P.: On Defining SPARQL with Boolean Tensor Algebra. (2015)
11051.
Forschungspapier
Alagi, G.; Weidenbach, C.: NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment. (2015), 43 S.
11052.
Forschungspapier
Blanchette, J. C.; Popescu, A.; Traytel, D.: Foundational Extensible Corecursion. (2015), 12 S.
11053.
Forschungspapier
Barkatou, M. A.; Jaroschek, M.; Maddah, S. S.: Formal Solutions of Completely Integrable Pfaffian Systems With Normal Crossings. (2015), 31 S.
11054.
Forschungspapier
Boissonnat, J.-D.; Dyer, R.; Ghosh, A.: A Probabilistic Approach to Reducing the Algebraic Complexity of Computing Delaunay Triangulations. (2015), 24 pages S.
11055.
Forschungspapier
Censor-Hillel, K.; Kaski, P.; Korhonen, J. H.; Lenzen, C.; Paz, A.; Suomela, J.: Algebraic Methods in the Congested Clique. (2015), 30 S.
11056.
Forschungspapier
Chalermsook, P.; Goswami, M.; Kozma, L.; Mehlhorn, K.; Saranurak, T.: Self-Adjusting Binary Search Trees: What Makes Them Tick? (2015), 19 S.
11057.
Forschungspapier
Chalermsook, P.; Goswami, M.; Kozma, L.; Mehlhorn, K.; Saranurak, T.: Greedy Is an Almost Optimal Deque. (2015), 15 S.
11058.
Forschungspapier
Chalermsook, P.; Goswami, M.; Kozma, L.; Mehlhorn, K.; Saranurak, T.: Pattern-avoiding Access in Binary Search Trees. (2015), To be presented at FOCS 2015 S.
11059.
Forschungspapier
Cygan, M.; Pilipczuk, M.; Pilipczuk, M.; van Leeuwen, E. J.; Wrochna, M.: Polynomial Kernelization for Removing Induced Claws and Diamonds. (2015), 17 S.
11060.
Forschungspapier
Darwish, O.; Mehlhorn, K.: Improved Balanced Flow Computation Using Parametric Flow. (2015), 6 S.
Zur Redakteursansicht