Maria Serna

Maria José Serna Iglesias (born 1959) is a Spanish computer scientist and mathematician whose research includes work on parallel approximation, on algorithms for cutwidth and linear layout of graphs, on algorithmic game theory, and on adversarial queueing networks. Provided by Wikipedia
Showing 1 - 20 results of 25 for search 'Serna, Maria', query time: 0.03s Refine Results
  1. 1
    Approximating Linear Programming is log-space complete for P C.T.I. Technical Report TR.89.10.98
    by Serna, Maria, 1959-
    Published 1989
    Book
  2. 2
    On the difficulty of Approximating Linear Programming C.T.I. Technical Report TR. 90.02.3
    by Serna, Maria, 1959-
    Published 1990
    Book
  3. 3
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings
    by Serna, Maria, 1959-
    Published 2010
    Get full text
    Electronic Kit Book
  4. 4
    The approximability of problems complete for P [C.T.I. Technical Report] TR. 89.02.74
    Book
  5. 5
    Tight RNC approximations to Max Flow [C.T.I. Technical Reports] TR. 90.01.1
    Book
  6. 6
    The structure of sets in P C.T.I. Technical Report TR. 90.04.11
    Book
  7. 7
    Applying P-completeness to Approximation Problems [C.T.I. Technical Reports] TR. 90.05.14
    Book
  8. 8
    Tight RNC approximations to Max Flow and Weighted Matching C.T.I. Technical Report TR 91.12.27
    Book
  9. 9
    A parallel algorithm for two processors precedence constraint scheduling C.T.I. Technical Report 91.04.11
    Book
  10. 10
    On RNC Approximate Counting (Extended Abstract) C.T.I. Technical Report TR 94.12.62
    Book
  11. 11
    Linear and Non-linear Systems: A Syrvey [C.T.I. Technical Report] TR 97.11.44
    Book
  12. 12
    The parallel complexity of the connected subgraph problem [C.T.I. Technical Reports TR. 90.10.23]
    Book
  13. 13
    Testing Whether a Graph has a Nontrivial 3-Connected Subgraph is P-Complete Under NC1 Reductions CTI Technical Report TR 76.2.89 [89.2.76]
    Book
  14. 14
    The Parallel Complexity of the Subgraph Connectivity Problem C.T.I. [Technical Report] TR. 89.04.82
    Book
  15. 15
    "Paradigms for Fast Parallel Approximability" [ C.T.I. Technical Reports] TR. 96.10.33
    Book
  16. 16
    A genetic approach for the parallel almost-uniform generation and approximate counting of matchings C.T.I. Technical Report TR 97.3.19
    Book
  17. 17
    Efficient Parallel Algorithms for Optimal Linear Arrangement of Trees C.T.I. Technical Report TR 92.02.04
    Book
  18. 18
    Efficient Parallel Algorithms for some Tree Layout Problems [Technical Report] CTI TR 95.5.24
    Book
  19. 19
    Algorithmic Game Theory 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings /
    Published 2012
    Other Authors: “…Serna, Maria…”
    Full Text via HEAL-Link
    Electronic eBook
  20. 20
    Experimental Algorithms 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006. Proceedings /
    Published 2006
    Other Authors: “…Serna, María…”
    Full Text via HEAL-Link
    Electronic eBook
Search Tools: RSS Feed – Email Search