Browse by Subject

All Subjects   Computer Science   Theoretical Computer Science

Subcategories: There are no further subcategories

70 Results for this Subject

Subscribe to RSS feed for this result set

51. Possible futures for the architecture of the Internet

Roscoe, Timothy (2007)


Videos

52. Ramsey and Turán type problems in random graphs

Marciniszyn, Martin (2006)


Doctoral and Habilitation Theses

53. Random walk algorithms for SAT and constraint satisfaction problems

Schneider, Stefan (2010)


Master Theses

54. Reoptimization of NP-hard problems

Zych, Anna (2012)


Doctoral and Habilitation Theses

55. Restricted types of malleability

Rüedlinger, A. (2011)


Master Theses

56. Robust logic and structural properties of the sequent calculus

Hösli, Brigitte (1993)


Reports

57. SCSM - synchronous composition of sequential machines

Fierz, Hugo (1994)


Reports

58. Secure bits with quantum pseudo-telepathy

Ambühl, Tobias (2009)


Master Theses

59. Security of quantum key distribution

Renner, Renato (2005)


Doctoral and Habilitation Theses

60. Server placements, Roman domination and other dominating set variants

Pagourtzis, Aris, Penna, Paolo, Schlude, Konrad, Steinhöfel, Kathleen, Taylor, David Scot and Widmayer, Peter (2001)


Reports

61. Singularities make spatial join scheduling hard

Neyer, Gabriele and Widmayer, Peter (1997)


Reports

62. Tensor norms and non-locality

Dukaric, Dejan D. (2012)


Doctoral and Habilitation Theses

63. The formal definition of Anlauff's eXtensible abstract state machines

Kutter, Philipp W. (2002)


Reports

64. Theory and applications of runtime monitoring metric first-order temporal logic

Müller, Samuel (2009)


Doctoral and Habilitation Theses

65. The quest for three-partite marginal quantum non-locality and a link to contextuality

Amirtham, Adarsh (2012)


Master Theses

66. The spectrum of a glued matrix

Parlett, Beresford N. and Vömel, Christof


Reports

67. Topologie diskreter Strukturen

Feichtner-Kozlov, Dmitry (2005)


Videos

68. Toward feasible solutions of NP-complete problems

Lieberherr, Karl (1975)


Reports

69. Using interval diagram techniques for the symbolic verification of timed automata

Strehl, Karsten (1998)


Reports

70. Verification condition generation for permission logics with abstract predicates and abstraction functions

Heule, Stefan, Kassios, Ioannis T., Müller, Peter and Summers, Alexander J. (2012)


Reports