Items where department is "Mathematics"

University Structure (106206) LSE (106206) Academic Departments (62869) Mathematics (1461)
Number of items: 41.
2005
  • SIAM (2005-01-22) Counting Eulerian circuits is #P-complete [Paper]. Workshop on analytic algorithmics and combinatorics, Vancouver, Canada, CAN.
  • Alpern, Steven (2005). How to search a tree to which Eulerian networks are attached. (CDAM research report CDAM-LSE- 2005-14). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven, Baston, Vic (2005). Rendezvous on a planar lattice. Operations Research, 53(6), 996 - 1006. https://doi.org/10.1287/opre.1050.0217
  • Alpern, Steven, Katrantzi, Ioanna, Reyniers, Diane J. (2005). Mathematical models of mutual mate choice. (CDAM research report CDAM-LSE-2005-20). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven, Prasad, V. (2005). Towers, conjugacy and coding. (CDAM research report series CDAM-LSE-2005-21). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven, Prasad, V. S. (2005). Rotational (and other) representations of stochastic matrices. (CDAM research report series CDAM-LSE-2005-13). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven, Reyniers, Diane J. (2005). Strategic mating with common preferences. Journal of Theoretical Biology, 237(4), 337-354. https://doi.org/10.1016/j.jtbi.2003.09.021
  • Anthony, Martin (2005). Connections between neural networks and boolean functions. (CDAM research report series CDAM-LSE-2005-25). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Anthony, Martin (2005). Decision lists. (CDAM research report series CDAM-LSE-2005-23). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Anthony, Martin (2005). Learning boolean functions. (CDAM research report series CDAM-LSE-2005-24). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Anthony, Martin, Hammer, P. L., Subasi, E., Subasi, M. (2005). Using a similarity measure for credible classification. (CDAM research report series CDAM-LSE-2005-22). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Ball, Joseph A., Mikkola, Kalle M., Sasane, Amol (2005). State-space formulas for the Nehari-Takagi problem for nonexponentially stable infinite-dimensional systems. SIAM Journal on Control and Optimization, 44(2), 531-563. https://doi.org/10.1137/S0363012903433024
  • Batu, Tugkan, Cenk Sahinalp, Suhleyman (2005). Locally consistent parsing and applications to approximate string comparisons. In De Felice, Clelia, Restivo, Antonio (Eds.), Developments in Language Theory, 9th International Conference, Dlt 2005 (pp. 22-35). Springer Berlin / Heidelberg.
  • Batu, Tugkan, Dasgupta, Sanjoy, Kumar, Ravi, Rubinfeld, Ronitt (2005). The complexity of approximating the entropy. SIAM Journal on Computing, 35(1), 132-150. https://doi.org/10.1137/S0097539702403645
  • Batu, Tugkan, Rubinfeld, Ronitt, White, Patrick (2005). Fast approximate PCPs for multidimensional bin-packing problems. Information and Computation, 196(1), 42-56. https://doi.org/10.1016/j.ic.2004.10.001
  • Böttcher, Julia (2005). Coloring sparse random k-colorable graphs in polynomial expected time. In Je¸drzejowicz, Joanna, Szepietowski, Andrzej (Eds.), Mathematical Foundations of Computer Science 2005: 30th International Symposium, Mfcs 2005, Gdansk, Poland, August 29–september (pp. 156-167). Springer Berlin / Heidelberg. https://doi.org/10.1007/11549345_15
  • Cereceda, Luis, van den Heuvel, Jan, Johnson, Matthew (2005). Connectedness of the graph of vortex-colourings. (CDAM research report series CDAM-LSE-2005-11). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Cooper, S. Barry, Lewis-Pye, Andrew, Yang, Yue (2005). Properly Σ2 minimal degrees and 0″ complementation. Mathematical Logic Quarterly, 51(3), 274-276. https://doi.org/10.1002/malq.200410027
  • Curtain, Ruth, Mikkola, Kalle, Sasane, Amol (2005). The Hilbert-Schmidt property of feedback operators. (CDAM research report series CDAM-LSE-2005-15). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • De Bonis, Annalisa, Katona, Gyula O. H., Swanepoel, Konrad (2005). Largest family without A union B contained in C intersect D. Journal of Combinatorial Theory, Series A, 111(2), 331-336. https://doi.org/10.1016/j.jcta.2005.01.002
  • Gapeev, Pavel V. (2005). The spread option optimal stopping game. In Kyprianou, A., Schoutens, W., Wilmott, P. (Eds.), Exotic Option Pricing and Advanced Levy Models (pp. 293-305). John Wiley & Sons.
  • Gapeev, Pavel V., Kühn, C. (2005). Perpetual convertible bonds in jump-diffusion models. Statistics and Decisions, 23(1), 15-31. https://doi.org/10.1524/stnd.2005.23.1.15
  • Gapeev, Pavel V. (2005). The disorder problem for compound Poisson processes with exponential jumps. Annals of Applied Probability, 15(1A), 487-499. https://doi.org/10.1214/105051604000000981
  • Hovakimyan, Naira, Lavretsky, Eugene, Sasane, Amol (2005). Dynamic inversion for nonaffine-in-control systems via time-scale separation: part I. In Proceedings of the 2005 American Control Conference (June 8-June 10, 2005, Hilton Portland & Executive Tower, Portland, Oregon) (pp. 3542-3547). American Automatic Control Council; Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/ACC.2005.1470522
  • Hovakimyan, Naira, Lavretsky, Eugene, Sasane, Amol J. (2005-06-08 - 2005-06-10) Dynamic inversion for nonaffine-in-control systems via time-scale separation: part 1 [Paper]. American Control conference, Portland, United States, USA.
  • Iftime, Orest, Kaashoek, Marinus, Sasane, Amol (2005). A Grassmannian band method approach to the Nehari-Takagi Problem. Journal of Mathematical Analysis and Applications, 310(1), 97-115. https://doi.org/10.1016/j.jmaa.2005.01.048
  • Kohayakawa, Yoshiharu, Simonovits, Miklós, Skokan, Jozef (2005). The 3-colored Ramsey number of odd cycles. Electronic Notes in Discrete Mathematics, 19(1), 397-402. https://doi.org/10.1016/j.endm.2005.05.053
  • Lewis-Pye, Andrew (2005). On a question of sacks: a partial solution on the positive side. In Cooper, S. Barry, Löwe, Benedikt, Torenvliet, Leen (Eds.), New Computational Paradigms: First Conference on Computability in Europe, Cie 2005, Amsterdam, the Netherlands, June 8-12, 2005 (pp. 275-286). Springer Berlin / Heidelberg. https://doi.org/10.1007/11494645_34
  • Lewis-Pye, Andrew (2005). The minimal complementation property above 0′. Mathematical Logic Quarterly, 51(5), 470-492. https://doi.org/10.1002/malq.200410044
  • Luczak, Malwina J, McDiarmid, Colin (2005). On the power of two choices: balls and bins in continuous time. Annals of Applied Probability, 15(3), 1733-1764. https://doi.org/10.1214/105051605000000205
  • Luczak, Malwina J, Norris, James (2005). Strong approximation for the supermarket model. Annals of Applied Probability, 15(3), 2038-2061. https://doi.org/10.1214/105051605000000368
  • Ostaszewski, Adam (2005). Returns to costly pre-bargaining claims: taking a principled stand. (CDAM research report series LSE-CDAM-2005-07). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Peng, Yuejian, Rödl, Vojtech, Skokan, Jozef (2005). Counting small cliques in 3-uniform hypergraphs. Combinatorics, Probability and Computing, 14(3), 371-413. https://doi.org/10.1017/S0963548304006546
  • Rödl, Vojtech, Nagle, Brendan, Skokan, Jozef, Schacht, Mathias, Kohayakawa, Yoshiharu (2005). The hypergraph regularity method and its applications. Proceedings of the National Academy of Sciences of the United States of America, 102(23), 8109-8113. https://doi.org/10.1073/pnas.0502771102
  • Rödl, Vojtech, Skokan, Jozef (2005). Counting subgraphs in quasi-random 4-uniform hypergraphs. Random Structures & Algorithms, 26(1-2), 160-203. https://doi.org/10.1002/rsa.20056
  • Sasane, Amol (2005). Irrational transfer function classes, coprime factorization and stabilization. (CDAM research report CDAM-LSE-2005-08). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Sasane, Amol (2005). On the coherence of some irrational transfer function classes. (CDAM research report series CDAM-LSE-2005-16). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Sasane, Amol (2005). Stability of switching infinite-dimensional systems. Automatica, 41(1), 75-78. https://doi.org/10.1016/j.automatica.2004.07.013
  • Simon, Robert (2005). The structure of non-zero-sum stochastic games. (CDAM research report series LSE-CDAM-2005-19). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Swanepoel, Konrad (2005). Quantitative illumination of convex bodies and vertex degrees of geometric Steiner minimal trees. Mathematika, 52(1), 47-52. https://doi.org/10.1112/S0025579300000322
  • van den Heuvel, Jan, Johnson, Matthew (2005). The external network problem with edge- or arc-connectivity requirements. In Lopez-Ortiz, Alejandro, Hamel, Angele (Eds.), Combinatorial and Algorithmic Aspects of Networking (pp. 114-126). Springer Berlin / Heidelberg.