The following pages link to Computer Science Review (Q394965):
Displaying 50 items.
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- A survey on tree matching and XML retrieval (Q394973) (← links)
- Privacy and verifiability in voting systems: methods, developments and trends (Q395657) (← links)
- Book review of: L. Lovász, Large networks and graph limits (Q395659) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Graph clustering (Q458448) (← links)
- Book review of: Phillip Kaye, Raymond Laflamme, Michele Mosca, An introduction to quantum computing (Q458449) (← links)
- Designing reliable algorithms in unreliable memories (Q458451) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms (Q458454) (← links)
- A survey of state vectors (Q458456) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- Book review of: E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema, S. Weinstein, Finite model theory and its applications (Q458460) (← links)
- Book review of: J. Kogan, Introduction to clustering large and high-dimensional data (Q458461) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- A survey of constraint-based programming paradigms (Q458465) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Computational challenges in systems biology (Q458470) (← links)
- Multi-criterion Pareto based particle swarm optimized polynomial neural network for classification: a review and state-of-the-art (Q458473) (← links)
- Book review of: N. Nisan (ed.), T. Roughgarden (ed.), É. Tardos (ed.), V. Vazirani (ed.), Algorithmic game theory. Foreword by C. H. Papadimitriou (Q458474) (← links)
- Book review of: Kurt Mehlhorn, Peter Sanders, Algorithms and data structures: the basic toolbox (Q458475) (← links)
- Worst-case equilibria (Q458478) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- A note on proofs of existence of Nash equilibria in finite strategic games, of two players (Q458483) (← links)
- The \(k\)-server problem (Q458484) (← links)
- Some results of Christos Papadimitriou on internet structure, network routing, and web information (Q458485) (← links)
- Reservoir computing approaches to recurrent neural network training (Q458488) (← links)
- An overview on XML similarity: background, current trends and future directions (Q458492) (← links)
- A survey of repair methods used as constraint handling techniques in evolutionary algorithms (Q458493) (← links)
- Book review of: J. Shallit, A second course in formal languages and automata theory (Q458494) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Combating online in-auction fraud: clues, techniques and challenges (Q458500) (← links)
- Book review of: Robin Sharp, Principles of protocol design (Q458502) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Book review of: Oded Goldreich, Computational complexity: a conceptual perspective (Q458505) (← links)
- On the energy balance problem in distributed sensor networks (Q465654) (← links)
- Book review of: Y. Shoham and K. Leyton-Brown, Multiagent systems. Algorithmic, game-theoretic, and logical foundations. (Q465655) (← links)
- Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms. (Q465657) (← links)
- The cook-book approach to the differential equation method (Q465658) (← links)
- Performance models for wireless channels (Q465660) (← links)
- Book review of: S. Arora and B. Barak, Computational complexity: a modern approach. (Q465661) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- DNA-inspired information concealing: a survey (Q465664) (← links)
- Introduction to the special issue on foundations of adaptive networked societies of tiny artefacts (Q465665) (← links)
