Items where department is "Mathematics"

University Structure (106667) LSE (106667) Academic Departments (63150) Mathematics (1470)
Number of items: 65.
A
  • Alpern, Steven, Baston, Vic (2006). Rendezvous in higher dimensions. SIAM Journal on Control and Optimization, 44(6), 2233 - 2252. https://doi.org/10.1137/S0363012904443531
  • Alpern, Steven, Baston, Vic (2006). A common notion of clockwise can help in planar rendezvous. European Journal of Operational Research, 175(2), 688-706. https://doi.org/10.1016/j.ejor.2005.03.050
  • Alpern, Steven, Baston, Vic, Gal, Schmuel (2006). Network search games with immobile hider, without a designated searcher starting point. (CDAM research report series LSE-CDAM-2006-03). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven, Baston, Vic, Gal, Shmuel (2006). Searching symmetric networks with Utilitarian Postman paths. (CDAM research report series LSE-CDAM-2006-05). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven, Fokkink, Robbert, Lindelauf, Roy, Olsder, Geert Jan (2006). Numerical approaches to the 'princess and monster' game on the interval. (CDAM research report series LSE-CDAM-2006-18). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven, Fokkink, Robbert, Lindelauf, Roy, Olsder, Geert Jan (2006). The 'princess and monster' game on an interval. (CDAM research report series LSE-CDAM-2006-17). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven, Gal, Shmuel (2006). Two conjectures on rendezvous in K3. (CDAM research report series LSE-CDAM-2006-21). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Anthony, Martin, Hammer, Peter Ladislaw (2006). A Boolean measure of similarity. Discrete Applied Mathematics, 154(16), 2242-2246. https://doi.org/10.1016/j.dam.2006.04.011
  • Anthony, Martin, Harvey, M (2006). Advanced linear algebra. University of London Press.
  • Anthony, Martin, Ratsaby, Joel (2006). Maximal width learning of binary functions. (CDAM research report series CDAM-LSE-2006-11). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Anthony, Martin, Franco, Leonardo (2006). The influence of oppositely classified examples on the generalization complexity of Boolean functions. IEEE Transactions on Neural Networks, 17(3), 578-590. https://doi.org/10.1109/TNN.2006.872352
  • Appa, Gautam, Magos, D., Mourtos, Ioannis (2006). On multi-index assignment polytopes. Linear Algebra and Its Applications, 416(2-3), 224-241. https://doi.org/10.1016/j.laa.2005.11.009
  • Appa, Gautam, Magos, D., Mourtos, Ioannis (2006). Searching for mutually orthogonal Latin squares via integer and constraint programming. European Journal of Operational Research, 173(2), 519-530. https://doi.org/10.1016/j.ejor.2005.01.048
  • Appa, Gautam, Magos, D., Mourtos, Ioannis (2006). A new class of facets for the Latin square polytope. Discrete Applied Mathematics, 154(6), 900-911. https://doi.org/10.1016/j.dam.2005.09.014
  • Appa, Gautam, Magos, D., Mourtos, Ioannis, Janssen, Jeannette (2006). On the Orthogonal Latin Square polytope. Discrete Mathematics, 306(2), 171-187. https://doi.org/10.1016/j.disc.2005.10.020
  • Brightwell, Graham, Alon, Noga, Kierstead, H. A, Kostochka, A. V, Winkler, P (2006). Dominating sets in k-majority tournaments. Journal of Combinatorial Theory, Series B, 96(3), 374-387. https://doi.org/10.1016/j.jctb.2005.09.003
  • Franco, L., Subirats, J.L., Anthony, Martin, Jerez, J.M. (2006). A new constructive approach for creating all linearly separable (threshold) functions. In International Joint Conference on Neural Networks, 2006. Ijcnn '06 (pp. 4791-4796). IEEE. https://doi.org/10.1109/IJCNN.2006.247155
    • B
  • Ball, J. A., Sasane, Amol J. (2006-07-24 - 2006-07-28) Hautus tests for the controllability and observability of multidimensional systems [Other]. 17th International Symposium on Mathematical Theory of Networks and Systems, Kyoto, Japan, JPN.
  • Barbour, A. D., Luczak, Malwina J. (2006). Laws of large numbers for epidemic models with countably many types. (CDAM research report LSE-CDAM-2006-14). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Barmpalias, George, Lewis-Pye, Andrew (2006). A c.e. real that cannot be sw-computed by any Ω number. Notre Dame Journal of Formal Logic, 47(2), 197-209. https://doi.org/10.1305/ndjfl/1153858646
  • Barmpalias, George, Lewis-Pye, Andrew (2006). The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees. Notre Dame Journal of Formal Logic, 47(3), 361-370. https://doi.org/10.1305/ndjfl/1163775443
  • Barmpalias, George, Lewis-Pye, Andrew (2006). The ibT degrees of computably enumerable sets are not dense. Annals of Pure and Applied Logic, 141(1-2), 51-60. https://doi.org/10.1016/j.apal.2005.10.001
  • Batu, Tugkan, Ergun, Funda, Cenk, Sahinalp (2006). Oblivious string embeddings and edit distance approximations. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm (pp. 792-801). ACM Press. https://doi.org/10.1145/1109557.1109644
  • Belomestny, Denis, Gapeev, Pavel V. (2006). An iteration procedure for solving integral equations related to optimal stopping problems. (SFB 649 discussion paper). Humboldt-Universität zu Berlin.
  • Biggs, Norman (2006). The critical group from a cryptographic perspective. (CDAM Research Report LSE-CDAM 2006-07). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Bingham, N. H., Ostaszewski, Adam (2006). Foundations of regular variation. (CDAM research report LSE-CDAM-2006-22). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Brightwell, Graham, Bollobás, Bela (2006). How many graphs are unions of k-cliques? Journal of Graph Theory, 52(2), 87-107. https://doi.org/10.1002/jgt.20138
  • Lewis-Pye, Andrew (2006). The jump classes of minimal covers. In Beckmann, A., Berger, U., Löwe, B. & Tucker, J. V. (Eds.), Logical Approaches to Computational Barriers: Second Conference on Computability in Europe, Cie 2006, Swansea, Uk, June 30-July (pp. 307-318). Springer Berlin / Heidelberg. https://doi.org/10.1007/11780342_33
  • Lewis-Pye, Andrew, Barmpalias, George (2006). Random reals and Lipschitz continuity. Mathematical Structures in Computer Science, 16(5), 737-749. https://doi.org/10.1017/S0960129506005445
  • Sasane, Amol J, Ball, Joseph A (2006). Equivalence of a behavioral distance and the gap metric. Systems and Control Letters, 55(3), 214-222. https://doi.org/10.1016/j.sysconle.2005.07.007
  • Zervos, Mihail, Bronstein, A L (2006). Sequential entry and exit decisions with an ergodic performance criterion. Stochastics, 78(2), 99-121. https://doi.org/10.1080/17442500600715840
  • Zervos, Mihail, Bronstein, Anne Laure, Hughston, Lane P, Pistorius, Martijn R (2006). Discretionary stopping of one-dimensional Itô diffusions with a staircase reward function. Journal of Applied Probability, 43(4), 984-996. https://doi.org/10.1239/jap/1165505201
  • van den Heuvel, Jan, Brightwell, Graham, Stougie, Leen (2006). A linear bound on the diameter of the transportation polytope. Combinatorica, 26(2), 133-139. https://doi.org/10.1007/s00493-006-0010-5
    • D
  • Marciniszyn, Martin, Skokan, Jozef, Spöhel, Reto, Steger, Angelika (2006). Threshold functions for asymmetric Ramsey properties involving cliques. In Diaz, J., Jansen, K., Rolim, J. D. P. & Zwick, U. (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (pp. 462-474). Springer Berlin / Heidelberg. https://doi.org/10.1007/11830924_42
    • E
  • Elkies, Noam, Pretorius, Lou M., Swanepoel, Konrad (2006). Sylvester-Gallai theorems for complex numbers and quaternions. Discrete and Computational Geometry, 35(3), 361-373. https://doi.org/10.1007/s00454-005-1226-7
    • F
  • von Stengel, Bernhard, Forges, Francoise (2006). Extensive form correlated equilibrium: definition and computational complexity. (CDAM research report LSE-CDAM-2006-04). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
    • G
  • Gapeev, Pavel V. (2006). Discounted optimal stopping for maxima in diffusion models with finite horizon. Electronic Journal of Probability, 11(38), 1031-1048.
  • Gapeev, Pavel V., Küchler, U. (2006). On Markovian short rates in term structure models driven by different jump-diffusion processes. Statistics and Decisions, 24(2), 255-271. https://doi.org/10.1524/stnd.2006.24.2.255
  • Gapeev, Pavel V., Peskir, G. (2006). The Wiener disorder problem with finite horizon. Stochastic Processes and Their Applications, 116(12), 1770-1791. https://doi.org/10.1016/j.spa.2006.04.005
  • Gapeev, Pavel V., Reiss, M. (2006). An optimal stopping problem in a diffusion-type model with delay. Statistics and Probability Letters, 76(6), 601-608. https://doi.org/10.1016/j.spl.2005.09.006
  • Georgiou, Nicholas (2006). Random structures for partially ordered sets [Doctoral thesis]. London School of Economics and Political Science.
  • Gupta, Arvind, van den Heuvel, Jan, Manuch, Jan, Stacho, Ladislav, Zhao, Xiaohong (2006). On the complexity of ordered colorings. (CDAM research report series LSE-CDAM-2006-16). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Ohlson, James A., Ostaszewski, Adam, Gao, Zhan (2006). Dividend policy irrelevancy and the construct of earnings. (CDAM research report LSE-CDAM-2006-23). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
    • H
  • Haxell, Penny, Luczak, Tomasz, Peng, Yuejian, Rödl, Vojtech, Rucinski, Andrzej, Simonovits, Miklós, Skokan, Jozef (2006). The Ramsey number for hypergraph cycles I. Journal of Combinatorial Theory, Series A, 113(1), 67-83. https://doi.org/10.1016/j.jcta.2005.02.005
    • J
  • Jack, Andrew, Zervos, Mihail (2006). Impulse and absolutely continuous ergodic control of one-dimensional Ito diffusions. In Kabanov, Y., Lipster, R. & Stoyanov, J. (Eds.), From Stochastic Calculus to Mathematical Finance: the Shiryaev Festschrift (pp. 295-314). Springer Berlin / Heidelberg.
  • Jack, Andrew, Zervos, Mihail (2006). Impulse control of one-dimensional Itô diffusions with an expected and a pathwise ergodic criterion. Applied Mathematics and Optimization, 54(1), 71-93. https://doi.org/10.1007/s00245-005-0853-y
  • Janson, Svante, Luczak, Malwina J. (2006). A simple solution to the k-core problem. (CDAM research report series 2006 LSE-CDAM-2006-13). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Zervos, Mihail, Jack, Andrew (2006). A singular control problem with an expected and a pathwise ergodicperformance criterion. Journal of Applied Mathematics and Stochastic Analysis, 2006(82538), 1-19. https://doi.org/10.1155/JAMSA/2006/82538
    • K
  • Kim, Seog-Jin, Nakprasit, Kittikorn, Pelsmajer, Michael, Skokan, Jozef (2006). Transversal numbers of translates of a convex body. Discrete Mathematics, 306(18), 2166-2173. https://doi.org/10.1016/j.disc.2006.05.014
    • L
  • Luczak, Malwina J, McDiarmid, Colin (2006). On the maximum queue length in the supermarket model. Annals of Probability, 34(2), 493-527. https://doi.org/10.1214/00911790500000710
  • Luczak, Malwina J., Luczak, Tomasz (2006). The phase transition in the cluster-scaled model of a random graph. Random Structures and Algorithms, 28(2), 215-246. https://doi.org/10.1002/rsa.20088
  • Luczak, Malwina J., McDiarmid, Colin (2006). Asymptotic distributions and chaos for the supermarket model. (CDAM research report series LSE-CDAM-2006-12). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Zervos, Mihail, Lasserre, Jean Bernard, Prieto-Rumeau, T (2006). Pricing a class of exotic options via moments and SDP relaxations. Mathematical Finance, 16(3), 429-494. https://doi.org/10.1111/j.1467-9965.2006.00279.x
    • M
  • Martini, Horst, Swanepoel, Konrad (2006). Antinorms and Radon curves. Aequationes Mathematicae, 72(1-2), 110-138. https://doi.org/10.1007/s00010-006-2825-y
  • Martini, Horst, Swanepoel, Konrad (2006). Low-degree minimal spanning trees in normed spaces. Applied Mathematics Letters, 19(2), 122-125. https://doi.org/10.1016/j.aml.2005.03.011
    • O
  • Ostaszewski, Adam (2006). Returns to costly pre-bargaining claims: taking a principled stand. Journal of Economic Studies, 33(2), 144-170. https://doi.org/10.1108/01443580610666091
    • P
  • Pretorius, Lou M., Swanepoel, Konrad (2006). Blockings sets in small finite linear spaces. Ars Combinatoria, 80, 275-315.
    • R
  • Rödl, Vojtech, Skokan, Jozef (2006). Applications of the regularity lemma for uniform hypergraphs. Random Structures and Algorithms, 28(2), 180-194. https://doi.org/10.1002/rsa.20108
    • S
  • Sasane, Amol (2006). An operator corona theorem for a class of subspaces of H∞. (CDAM research report series LSE-CDAM-2006-02). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Sasane, Amol, Treil, Sergei (2006). Estimates in corona theorems for some subalgebras of the Hardy space. (CDAM research report LSE-CDAM-2006-09). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Savani, Rahul (2006). Finding Nash equilibria of bimatrix games [Doctoral thesis]. London School of Economics and Political Science.
  • Simon, Robert (2006). Value and perfection in stochastic games. Israel Journal of Mathematics, 156(1), 285-310. https://doi.org/10.1007/BF02773836
  • Simon, Robert (2006). The common knowledge of formula exclusion. (CDAM research report series LSE-CDAM-2006-19). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Swanepoel, Konrad, Schurmann, Achill (2006). Three-dimensional antipodal and norm-equilateral sets. Pacific Journal of Mathematics, 228(2), 349-370.
  • von Stengel, Bernhard, Savani, Rahul (2006). Hard-to-solve bimatrix games. Econometrica, 74(2), 397-429. https://doi.org/10.1111/j.1468-0262.2006.00667.x
    • This list was generated on Fri Feb 27 05:30:48 2026 GMT.