Items where department is "Mathematics"

University Structure (106206) LSE (106206) Academic Departments (62869) Mathematics (1461)
Number of items: 67.
None
  • University of London (2007). Advanced mathematical analysis. University of London Press.
  • ACM SIGMIS SIAM Activity Group on Discrete Mathematics Association for Computing Machinery Society for Industrial and Applied Mathematics (2007). On external subgraphs of a random graph. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 477-485). Association for Computing Machinery and Society for Industrial and Applied Mathematics.
  • Allen, Peter (2007). Almost every 2-SAT function is unate. Israel Journal of Mathematics, 161(1), 311-346. https://doi.org/10.1007/s11856-007-0081-z
  • Alpern, Steve (2007). Rendezvous search with revealed information: applications to the line. Journal of Applied Probability, 44(1), 1-15. https://doi.org/10.1239/jap/1175267160
  • Alpern, Steve, Katrantzi, Ioanna (2007). Equilbria of two-sided matching games. London School of Economics and Political Science.
  • Amini, O, Esperet, L, van den Heuvel, J (2007). Frugal colouring of graphs. London School of Economics and Political Science.
  • Anthony, Martin (2007). On the generalization error of fixed combinations of classifiers. Journal of Computer and System Sciences, 73(5), 725-734. https://doi.org/10.1016/j.jcss.2006.10.017
  • Barmpalias, George, Lewis-Pye, Andrew, Soskova, Mariya (2007). Working with the LR degrees. In Cai, Jin-Yi, Cooper, S. Barry, Zhu, Hong (Eds.), Theory and Applications of Models of Computation: 4th International Conference, Tamc 2007, Shanghai, China, May 22-25, 2007 (pp. 89-99). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_8
  • Batu, Tugkan, Berenbrink, Petra, Cooper, Colin (2007). Balanced allocations: balls-into-bins revisited and chains-into-bins. (LSE-CDAM-2007-34). London School of Economics and Political Science.
  • Batu, Tugkan, Berenbrink, Petra, Sohler, Christian (2007). A sublinear-time approximation scheme for bin packing. (CDAM Research Reports LSE-CDAM-2007-33). London School of Economics and Political Science.
  • Biggs, Norman (2007). The critical group from a cryptographic perspective. The Bulletin of the London Mathematical Society, 39(5), 829-836. https://doi.org/10.1112/blms/bdm070
  • Bingham, N. H., Ostaszewski, Adam (2007). Analytic automaticity: the theorems of Jones and Kominek. London School of Economics and Political Science.
  • Bingham, N. H., Ostaszewski, Adam (2007). Beyond Lebesgue and Baire: generic regular variation. London School of Economics and Political Science.
  • Bingham, N. H., Ostaszewski, Adam (2007). Beyond the theorems of Steinhaus and Ostrowski: combinatorial versions. London School of Economics and Political Science.
  • Bingham, N. H., Ostaszewski, Adam (2007). Duality and the Kestelman-Borwein-Ditor theorem. London School of Economics and Political Science.
  • Bingham, N. H., Ostaszewski, Adam (2007). Generic subadditive functions. London School of Economics and Political Science.
  • Bingham, N. H., Ostaszewski, Adam (2007). Genericity and the Kestelman-Borwein-Ditor Theorem. London School of Economics and Political Science.
  • Bingham, N. H., Ostaszewski, Adam (2007). Homotopy and the Kestelman-Borwein-Ditor theorem. London School of Economics and Political Science.
  • Bingham, N. H., Ostaszewski, Adam (2007). New automatic properties: subadditivity, convexity, uniformity. London School of Economics and Political Science.
  • Bingham, N. H., Ostaszewski, Adam (2007). Very slowly varying functions - II. (CDAM Research Report Series 2007-03). London School of Economics and Political Science.
  • Bingham, N. H., Ostaszewski, Adam (2007). The converse Ostrowski theorem. London School of Economics and Political Science.
  • Brightwell, Graham, Panagiotou, Konstantinos, Steger, Angelika (2007-01-07 - 2007-01-09) On extremal subgraphs of random graphs [Paper]. 18th ACM-SIAM Symposium on Discrete Algorithms, New Orleans LA, United States, USA.
  • Brightwell, Graham, Winkler, P (2007). Submodular percolation. London School of Economics and Political Science.
  • Böttcher, Julia, Schacht, Mathais, Taraz, Anusch (2007). On the bandwidth conjecture for 3-colourable graphs. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 618-626). Society for Industrial and Applied Mathematics.
  • Cereceda, L, van den Heuvel, J, Johnson, M (2007). Mixing 3-colourings in bipartite graphs (extended abstract). In Brandstädt, Andreas, Kratsch, Dieter, Müller, Haiko (Eds.), Graph-Theoretic Concepts in Computer Science : 33rd International Workshop (pp. 166-177). Springer Berlin / Heidelberg.
  • Cereceda, L, van den Heuvel, Jan, Johnson, M (2007). Finding paths between 3-colourings. London School of Economics and Political Science.
  • Cereceda, L, van den Heuvel, Jan, Johnson, M (2007). Mixing 3-colourings in bipartite graphs. London School of Economics and Political Science.
  • Curtain, RF, Mikkola, KM, Sasane, Amol (2007). The Hilbert-Schmidt property of feedback operators. Journal of Mathematical Analysis and Applications, 329(2), 1145-1160. https://doi.org/10.1016/j.jmaa.2006.07.037
  • Eaton, Nancy, Furedi, Z, Kostochka, Alexandr V, Skokan, Jozef (2007). Three representations of graphs. European Journal of Combinatorics, 28(4), 1087-1098. https://doi.org/10.1016/j.ejc.2006.04.002
  • Gapeev, Pavel V, Sottinen, T, Valkeila, E (2007). Robust replication under model uncertainty. (LSE-CDAM-2007-28). London School of Economics and Political Science.
  • Gapeev, Pavel V. (2007). Discounted optimal stopping for maxima of some jump-diffusion processes. Journal of Applied Probability, 44(3), 713-731. https://doi.org/10.1239/jap/1189717540
  • Gapeev, Pavel V. (2007). Perpetual barrier options in jump-diffusion models. Stochastics: an International Journal of Probability and Stochastic Processes, 79(1), 139-154. https://doi.org/10.1080/17442500601086381
  • Haxell, Penny, Luczak, Tomasz, Peng, Yuejian, Rodl, V, Rucinski, Andrzej, Skokan, Jozef (2007). The Ramsey number for hypergraph cycles II. London School of Economics and Political Science.
  • Hovakimyan, N, Lavretsky, E, Sasane, Amol (2007). Dynamic inversion for nonaffine-in-control systems via time-scale separation. Journal of Dynamical and Control Systems, 13(4), 451-465. https://doi.org/10.1007/s10883-007-9029-1
  • Janson, S, Luczak, Malwina (2007). Asymptotic normality of the k-core in random graphs. London School of Economics and Political Science.
  • Janson, S, Luczak, Malwina (2007). A new approach to the giant component problem. (CDAM Research Report Series LSE-CDAM-2007-38). London School of Economics and Political Science.
  • Janson, S, Luczak, Malwina (2007). A simple solution to the k-core problem. Random Structures and Algorithms, 30(1-2), 50-62. https://doi.org/10.1002/rsa.20147
  • Kohayakawa, Yoshiharu, Rödl, Vojtech, Schacht, Mathias, Sissokho, Papa, Skokan, Jozef (2007). Turán's theorem for pseudo-random graphs. Journal of Combinatorial Theory, Series A, 114(4), 631-657. https://doi.org/10.1016/j.jcta.2006.08.004
  • Levin, D, Luczak, Malwina, Peres, Y (2007). Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability. London School of Economics and Political Science.
  • Lewis-Pye, Andrew (2007). Π10 classes, strong minimal covers and hyperimmune-free degrees. Bulletin of the London Mathematical Society, 39(6), 845-855. https://doi.org/10.1112/blms/bdm083
  • Lewis-Pye, Andrew (2007). A random degree with strong minimal cover. Bulletin of the London Mathematical Society, 39(5), 848-856. https://doi.org/10.1112/blms/bdm074
  • Lewis-Pye, Andrew (2007). A single minimal complement for the c.e. degrees. Transactions of the American Mathematical Society, 359(12), 5817-5865. https://doi.org/10.1090/S0002-9947-07-04331-0
  • Lewis-Pye, Andrew, Barmpalias, George (2007). Randomness and the linear degrees of computability. Annals of Pure and Applied Logic, 145(3), 252-257. https://doi.org/10.1016/j.apal.2006.08.001
  • Lewis-Pye, Andrew, Montalbán, Antonio, Nies, André (2007). A weakly 2-random set that is not generalized low. In Cooper, S. Barry, Löwe, Benedikt, Sorbi, Andrea (Eds.), Computation and Logic in the Real World: Third Conference on Computability in Europe, Cie 2007, Siena, Italy, June 18-23, 2007 (pp. 474-477). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_49
  • Luczak, Malwina, McDiarmid, C (2007). Asymptotic distributions and chaos for the supermarket model. Electronic Journal of Probability, 12, 75-99.
  • Luczak, Malwina, McDiarmid, C (2007). Balanced routing of random calls. London School of Economics and Political Science.
  • Luczak, Malwina, Spencer, J (2007). The second largest component in the supercritical 2D Hamming graph. London School of Economics and Political Science.
  • Marciniszyn, M, Skokan, Jozef, Spohel, R, Stegar, A (2007). Asymmetric Ramsey properties of random graphs involving cliques. London School of Economics and Political Science.
  • Merhi, A, Zervos, Mihail (2007). A model for reversible investment capacity expansion. SIAM Journal on Control and Optimization, 46(3), 839-876. https://doi.org/10.1137/050640758
  • Mikkola, KM, Sasane, Amol (2007). A spectrally minimal realization formula for the Hardy algebra. Complex Analysis and Operator Theory, 1(4), 621-628. https://doi.org/10.1007/s11785-007-0021-2
  • Mikkola, Kalle, Sasane, Amol J. (2007). Tolokonnikov’s Lemma for Real H ∞ and the Real Disc Algebra. Complex Analysis and Operator Theory, 1(3), 439-446. https://doi.org/10.1007/s11785-007-0016-z
  • Ostaszewski, Adam, Gietzmann, Miles (2007). Value creation with dyes disclosure option: optimal risk-shielding with an upper tailed disclosure strategy. London School of Economics and Political Science.
  • Pretorius, Lou M., Swanepoel, Konrad (2007). A generalised Sylvester-Gallai theorem. Die Suid-Afrikaanse Tydskrif Vir Natuurwetenskap En Tegnologie, 26(1), 8-13.
  • Sasane, Amol (2007). Noncoherence of some rings of functions. Proceedings of the American Mathematical Society, 135(7), 2107-2111. https://doi.org/10.1090/S0002-9939-07-08704-7
  • Sasane, Amol (2007). Properties of a subalgebra of H{infty}(D) and stabilization. IMA Journal of Mathematical Control and Information, 25(1), 1-21. https://doi.org/10.1093/imamci/dnm010
  • Sasane, Amol (2007). An operator corona theorem for some subspaces of the Hardy space. Integral Equations and Operator Theory, 59(2), 245-256. https://doi.org/10.1007/s00020-007-1522-0
  • Sasane, Amol, Treil, S R (2007). Estimates in corona theorems for some subalgebras of the Hardy space. Arkiv FöR Matematik, 45(2), 351-380. https://doi.org/10.1007/s11512-007-0044-y
  • Simon, Robert (2007). How many times can a function be iterated? London School of Economics and Political Science.
  • Simon, Robert (2007). The structure of non-zero-sum stochastic games. Advances in Applied Mathematics, 38(1), 1-26. https://doi.org/10.1016/j.aam.2006.07.002
  • Swanepoel, Konrad (2007). Upper bounds for edge-antipodal and subequilateral polytopes. Periodica Mathematica Hungarica, 54(1), 99-106. https://doi.org/10.1007/s-10998-007-1099-0
  • Swanepoel, Konrad (2007). The local Steiner problem in finite-dimensional normed spaces. Discrete and Computational Geometry, 37(3), 419-442. https://doi.org/10.1007/s00454-006-1298-z
  • Zervos, Mihail (2007). The solution to a second order linear ordinary differential equation with a non-homogeneous term that is a measure. Stochastics: an International Journal of Probability and Stochastic Processes, 79(3 and), 363-382. https://doi.org/10.1080/17442500601100281
  • van den Heuvel, Jan, Havet, F, McDiarmid, C, Reed, B (2007). List colouring squares of planar graphs (extended abstract). Electronic Notes in Discrete Mathematics, 29, 515-519. https://doi.org/10.1016/j.endm.2007.07.079
  • van der Hofstad, R, Luczak, Malwina (2007). Random subgraphs of the 2D Hamming graph: the supercritical phase. London School of Economics and Political Science.
  • von Stengel, Bernhard (2007). Equalibrium computation for two-player games in strategic and extensive form. In Nisan, N, Roughgarden, T, Tardos, E (Eds.), Algorithmic Game Theory (pp. 53-78). Cambridge University Press.
  • von Stengel, Bernhard (2007). Games, geometry, and the computational complexity of finding equilibria. In Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge - Tark '07 (pp. 4-5). ACM Press. https://doi.org/10.1145/1324249.1324253
    • Public
  • Cereceda, Luis (2007). Mixing graph colourings [Doctoral thesis]. London School of Economics and Political Science. picture_as_pdf