This book provides an overview of Mexico's political evolution since it became independent from Spain in 1821, and its current constitutional arrangements, principles and structures. The aim is to explain this evolution as the result of struggles between the interests and ideologies of different groups within Mexican society, each with a different political vision of how the State should be organised. Chapter 1 reviews Mexico's constitutional trajectory, and explains why democracy, republicanism, federalism, separation of state and church, protection of fundamental rights and the Nation's ownership of mineral resources first became constitutional principles. Chapters 2, 3, 4 and 5 deal respectively with democracy and the electoral system, and the legislative, executive and judicial branches of federal government. Chapter 6 introduces the institutional structure of Mexico's federal system, while Chapter 7 discusses the rules, principles and institutions for the protection of human rights. Chapter 8 examines the constitutional regime of Mexico's economy. The conclusion explains how a series of factors has combined to produce a gap between the formal Constitution and what can be seen as the living Constitution; bridging that gap presents Mexican politics and society with one of its great contemporary challenges.

This book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.

This book constitutes the refereed proceedings of the 5th International Symposium on Algorithmic Game Theory, SAGT 2012, held in Barcelona, Spain, in October 2012. The 22 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 65 submissions. The papers present original research at the intersection of Algorithms and Game Theory and address various current topics such as solution concepts in game theory; efficiency of equilibria and price of anarchy; complexity classes in game theory; computational aspects of equilibria; computational aspects of fixed-point theorems; repeated games; evolution and learning in games; convergence of dynamics; coalitions, coordination and collective action; reputation, recommendation and trust systems; graph-theoretic aspects of social networks; network games; cost-sharing algorithms and analysis; computing with incentives; algorithmic mechanism design; computational social choice; decision theory, and pricing; auction algorithms and analysis; economic aspects of distributed computing; internet economics and computational advertising.

This book constitutes the refereed proceedings of the 5th International Workshop on Experimental and Efficient Algorithms, WEA 2006, held in Menorca, Spain, May 2006. The book presents 26 revised full papers together with 3 invited talks. The application areas addressed include most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, scheduling, searching, sorting, string matching, coding, networking, and more.

TheWorkshoponRandomizationandApproximationTechniquesinComputer Science, Random'98, focuses on algorithmic and complexity aspects arising inthedevelopmentofe cientrandomizedsolutionstocomputationallydi cult problems. Itaims,inparticular,atfosteringthecooperationamongpractitioners andtheoreticiansandamongalgorithmicandcomplexityresearchersinthe eld. RANDOM'98,heldattheUniversityofBarcelona(UPC),October8{10,1998, isthesecondintheseries,afterBologna. This volume contains all contributed papers accepted for presentation at theworkshop,togetherwithinvitedlecturesbyJosepD az(UPCBarcelona), AlanM. Frieze(CarnegieMellonU. ),MichaelLuby(ICSIBerkeley),andEmo Welzl(ETHZuric .. h). Thecontributedpaperswereselectedoutofseveraldozen submissions received in response to the call for papers. All papers published intheworkshopproceedingswereselectedbytheprogramcommitteeonthe basisofrefereereports. Considerablee ortwasdevotedtotheevaluationofthe submissionsbytheprogramcommitteeandanumberofotherreferees. Extensive feedbackwasprovidedtoauthorsasaresult,whichwehopehasprovenhelpful tothem. Wewouldliketothankalloftheauthorswhorespondedtothecallforpapers, ourinvitedspeakers,thereferees,andthemembersoftheprogramcommittee: MichaelLuby,Chair,ICSIBerkeley AndreiBroder,DigitalSystemsResearchCenter BernardChazelle,PrincetonU. AndreaClementi,U. ofRome AnnaKarlin,U. ofWashington RichardKarp,U. ofWashington ClaireKenyon,U. ofParisSud MichaelMitzenmacher,DigitalSystemsResearchCenter RajeevMotwani,StanfordU. PrabhakarRaghavan,IBM MariaSerna,UPCBarcelona AlistairSinclair,U. ofCalifornia,Berkeley MadhuSudan,MIT AviWigderson,HebrewU. PeterWinkler,BellLabs WegratefullyacknowledgesupportfromtheEuropeanAssociationINTAS, theComissionatperaUniversitatsiRecerca{GeneralitatdeCatalunya,and Universitat Polit ecnica de Catalunya. Finally, we would like to thank Helena Martinez,CarmeAlvarez,ConradoMartinez,andJordiPetitiSilvestrefortheir helpinthepreparationofthemeeting. August1998 MichaelLuby,Jos eD. P. Rolim,MariaJ. Serna Contents Invited Paper Disjoint Paths in Expander Graphs via Random Walks: A Short Survey 1 AlanM. Frieze RegularPapers A Derandomization Using Min-Wise Independent Permutations 15 AndreiZ. Broder,MosesCharikarandMichaelMitzenmacher An Algorithmic Embedding of Graphs via Perfect Matchings 25 VojtechR.. odl,AndrzejRucin 'skiandMichelleWagner Deterministic Hypergraph Coloring and Its Applications 35 Chi-JenLu On the De-randomization of Space-Bounded Computations 47 RoyArmoni Talagrand's Inequality and Locality in Distributed Computing 60 DevdattP. Dubhashi On-Line Bin-Stretching 71 YossiAzarandOdedRegev Combinatorial Linear Programming: Geometry Can Help 82 BerndGar .. tner A Note on Bounding the Mixing Time by Linear Programming 97 AbrahamSharell Robotic Exploration, Brownian Motion and Electrical Resistance 116 IsraelA. Wagner,MichaelLindenbaumandAlfredM. Bruckstein Fringe Analysis of Synchronized Parallel Algorithms on 2-3 Trees 131 RicardoBaeza-Yates,JoaquimGabarro 'andXavierMesseguer On Balls and Bins with Deletions 145 RichardCole,AlanFrieze,BruceM. Maggs,MichaelMitzenmacher Andr'eaW. Richa,RameshK.

This book constitutes the refereed proceedings of the 4th European Symposium on Algorithms, ESA '96, held in Barcelona, Spain, in September 1996.
The book presents 40 revised full papers selected from 124 submissions; also are included extended abstracts of two invited presentations. The papers included cover all research areas on algorithms and their analysis as it is carried out in the fields of computer science, discrete applied and algorithmic mathematics, operations research, and all other areas of algorithms-oriented research, design and analysis.

This book is divided into two parts, the first of which seeks to connect the phase transitions of various disciplines, including game theory, and to explore the synergies between statistical physics and combinatorics. Phase Transitions has been an active multidisciplinary field of research, bringing together physicists, computer scientists and mathematicians. The main research theme explores how atomic agents that act locally and microscopically lead to discontinuous macroscopic changes. Adopting this perspective has proven to be especially useful in studying the evolution of random and usually complex or large combinatorial objects (like networks or logic formulas) with respect to discontinuous changes in global parameters like connectivity, satisfiability etc. There is, of course, an obvious strategic element in the formation of a transition: the atomic agents "selfishly" seek to optimize a local parameter. However, up to now this game-theoretic aspect of abrupt, locally triggered changes had not been extensively studied. In turn, the book's second part is devoted to mathematical and computational methods applied to the pricing of financial contracts and the measurement of financial risks. The tools and techniques used to tackle these problems cover a wide spectrum of fields, like stochastic calculus, numerical analysis, partial differential equations, statistics and econometrics. Quantitative Finance is a highly active field of research and is increasingly attracting the interest of academics and practitioners alike. The material presented addresses a wide variety of new challenges for this audience.

Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject.

A young Mexican American from East LA journeys south to Texas to find his father and on the road becomes involved in a great intrigue involving serial murder, including an attempt on his own life that erases all memory of his existence up to the moment of impact. After more than a quarter of a century of living as a stranger even to himself, and now a second attempt on his life, he is forced to try to find those responsible when his children become at risk, and he faces incredible odds that he fears are the demons from his former life that have arisen and come back to haunt him, and to finish the job they started once upon a time.

Under the weight of colliding cultures, a young chicano named Adam Duane agonizes over the mystery of his brother's death. Was it murder, or was it the self-inflicted resolution to a life baffled by a secret that Adam helped to keep until the time came to use it as a weapon against Cal, his brother? Descending to the darker fringe where the worst of the Americano and the Mexicano meet, Adam now faces self-doubt and a greater riddle: Is he his brother's keeper, or is he using him as an excuse to let himself free-fall even further into amorality and self-corruption? Far removed from the sun-drenched sandlot of his childhood, Adam feels himself an exile from the things that once gave meaning to his life, marooned by winter in a land that once was Paradise.