%{search_type} search results

• A sound and complete proof system for partial program correctness
• The problem of reachability and verification of programs
• Assertion programming
• Complexity classes of formal languages
• Fast probabilistic algorithms
• Relative succinctness of representations of languages and separation of complexity classes
• On two types of loops
• Full abstraction for a simple parallel programming language
• On some developments in cryptography and their applications to computer science
• Searching, sorting and information theory
• Lcf: A way of doing proofs with a machine
• Axioms or algorithms
• Power from power series
• Computational complexity of string and graph ident ification
• A survey of grammar and l forms-1978
• A theoretical study on the time analysis of programs
• Completeness problems in verification of programs and program schemes
• Relationships between AFDL's and cylinders
• Computable data types
• Program equivalence and provability
• Interactive L systems with almost interactionless behaviour
• On the simplification of constructions in degrees of unsolvability via computational complexity
• An algebraic extension of the Chomsky
• hierarchy
• Bounds on computational complexity and approximability of initial segments of recursive sets
• On the weighted path length of binary search trees for unknown access probabilities
• Computational complexity of approximation algorithms for combinatorial problems
• A reduct-and-closure algorithm for graphs
• Small universal Minsky machines
• Parallel and two-way recognizers of directed acyclic graphs
• Fully effective solutions of recursive domain equations
• A note on computational complexity of a statistical deducibility testing procedure
• Context free normal systems
• New proofs for jump dpda's
• Synchronization and maximality for very pure subsemigroups of a free semigroup
• On the sets of minimal indices of partial recursive functions
• Some remarks on Boolean sums
• On the propositional algorithmic logic
• Ch(k) grammars: A characterization of LL(k) languages
• A uniform approach to balanced binary and multiway trees
• On the generative capacity of some classes of grammars with regulated rewriting
• Validity test for Floyd's operator-precedence parsing algorithms
• On the languages of bounded Petri nets
• Dyck language D2 is not absolutely parallel
• Fixed points in the power-set algebra of infinite trees
• On relaxation rules in algorithmic logic
• L-Fuzzy functorial automata
• Schematics of structural parallel programming and its applications
• On axiomatization of deterministic propositional dynamic logic
• Bounded recursion and complexity classes
• Characterization of rational and algebraic power series
• A crossing measure for 2-tape Turing machines
• The complexity of lexicographic sorting and searching
• An algebraic approach to concurrence
• On multitape automata
• A turing machine oracle hierarchy
• A survey of some syntactic results in the?-calculus
• On rational expressions representing infinite rational trees : Application to the structure of flow charts.

What do an illegal drug importer, a stolen car exporter, a Hells Angels member, an accountant, and an airplane hijacker have in common? Like most people, they all operate in social networks-and at times, they come together in criminal networks which, though tightly structured and controlled, undergo constant change. Inside Criminal Networks takes a social network perspective to a variety of illegal enterprises, focusing on these organizations' "flexible order" and the collective coping and adjustment strategies of offenders when key members or opportunities are lost. Rich with communication data, electronic surveillance material, and other law-enforcement investigative sources, case studies pursue a number of analytical paths into the partnerships, pecking orders, and situations in flux (e.g., street gang presence within drug distribution), and identify central challenges to research (e.g., are these failed networks if members are arrested?). Flexibility is revealed as a driving force as the book examines: Operational structures and dynamics. Roles of key and peripheral players. The tentative balance between efficiency and security. Criminal network positions and individual traits. Uses of legitimate actors in illegal settings. Adaptation when networks are disrupted. Compellingly written and meticulously presented, Inside Criminal Networks offers rare up-close insights to readers in the criminology and organized crime research fields, and to social network theorists and analysts

This two-volume set LNCS 6593 and 6594 constitutes the refereed proceedings of the 10th International Conference on Adaptive and Natural Computing Algorithms, ICANNGA 2010, held in Ljubljana, Slovenia, in April 2010. The 83 revised full papers presented were carefully reviewed and selected from a total of 144 submissions. The second volume includes 41 papers organized in topical sections on pattern recognition and learning, soft computing, systems theory, support vector machines, and bioinformatics.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 19th International Symposium on Algorithms and Computation, ISAAC 2008, held in Gold Coast, Australia in December 2008. The 78 revised full papers together with 3 invited talks presented were carefully reviewed and selected from 229 submissions for inclusion in the book. The papers are organized in topical sections on approximation algorithms, online algorithms, data structure and algorithms, game theory, graph algorithms, fixed parameter tractability, distributed algorithms, database, approximation algorithms, computational biology, computational geometry, complexity, networks, optimization as well as routing.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 7th International Workshop on Experimental and Efficient Algorithms, WEA 2008, held in Provincetown, MA, USA, in May/June 2008. The 26 revised full papers were carefully reviewed and selected from numerous submissions and present current research on experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. Special focus is put on the use of experimental methods to guide the design, analysis, implementation, and evaluation of algorithms, heuristics, and optimization programs.
(source: Nielsen Book Data)

• Invited Lectures.- Nash Equilibria: Where We Stand.- Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation.- Arrangements in Geometry: Recent Advances and Challenges.- Contributed Papers: Design and Analysis Track.- Nash Equilibria in Voronoi Games on Graphs.- Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation.- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks.- Finding Frequent Elements in Non-bursty Streams.- Tradeoffs and Average-Case Equilibria in Selfish Routing.- On the Variance of Subset Sum Estimation.- On Minimum Power Connectivity Problems.- On the Cost of Interchange Rearrangement in Strings.- Finding Mobile Data: Efficiency vs. Location Inaccuracy.- A Faster Query Algorithm for the Text Fingerprinting Problem.- Polynomial Time Algorithms for Minimum Energy Scheduling.- k-Mismatch with Don't Cares.- Finding Branch-Decompositions and Rank-Decompositions.- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover.- Linear-Time Ranking of Permutations.- Radix Sorting with No Extra Space.- Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation.- Order Statistics in the Farey Sequences in Sublinear Time.- New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks.- Dial a Ride from k-Forest.- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue.- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication.- Optimal Algorithms for k-Search with Application in Option Pricing.- Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra.- Stackelberg Strategies for Atomic Congestion Games.- Good Quality Virtual Realization of Unit Ball Graphs.- Algorithms for Playing Games with Limited Randomness.- Approximation of Partial Capacitated Vertex Cover.- Optimal Resilient Dynamic Dictionaries.- Determining the Smallest k Such That G Is k-Outerplanar.- On the Size of Succinct Indices.- Compact Oracles for Approximate Distances Around Obstacles in the Plane.- Convex Combinations of Single Source Unsplittable Flows.- Farthest-Polygon Voronoi Diagrams.- Equitable Revisited.- Online Scheduling of Equal-Length Jobs on Parallel Machines.- k-Anonymization with Minimal Loss of Information.- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs.- Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling.- Bundle Pricing with Comparable Items.- Approximating Interval Scheduling Problems with Bounded Profits.- Pricing Tree Access Networks with Connected Backbones.- Distance Coloring.- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching.- To Fill or Not to Fill: The Gas Station Problem.- Online Bandwidth Allocation.- Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems.- On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems.- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs.- Dynamic Plane Transitive Closure.- Contributed Papers: Engineering and Applications Track.- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments.- Estimating Clustering Indexes in Data Streams.- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics.- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step.- Fast and Compact Oracles for Approximate Distances in Planar Graphs.- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces.- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks.- Algorithms to Separate -Chvatal-Gomory Cuts.- Fast Lowest Common Ancestor Computations in Dags.- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem.- Solutions to Real-World Instances of PSPACE-Complete Stacking.- Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough.- An Experimental Study of New and Known Online Packet Buffering Algorithms.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 15th Annual European Symposium on Algorithms, ESA 2007, held in Eilat, Israel, in October 2007 in the context of the combined conference ALGO 2007. The 63 revised full papers presented together with abstracts of three invited lectures address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 14th Annual European Symposium on Algorithms, ESA 2006, held in Zurich, Switzerland, in September 2006, in the context of the combined conference ALGO 2006. The 70 revised full papers presented together with abstracts of 3 invited lectures were carefully reviewed and selected from 287 submissions. The papers address all current subjects in algorithmics, reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 5th International Workshop on Experimental and Efficient Algorithms, WEA 2006, held in Cala Galdana, Menorca, Spain in May 2006. The 26 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 92 submissions. The book is devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, scheduling, searching, sorting, string matching, coding, networking, etc.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 13th Annual European Symposium on Algorithms, ESA 2005, held in Palma de Mallorca, Spain, in September 2005 in the context of the combined conference ALGO 2005. The 75 revised full papers presented together with abstracts of 3 invited lectures were carefully reviewed and selected from 244 submissions. The papers address all current issues in algorithmics reaching from design and mathematical issues over real-world applications in various fields up to engineering and analysis of algorithms.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 12th Annual European Symposium on Algorithms, ESA 2004, held in Bergen, Norway in September 2004. The 70 revised full papers presented were carefully reviewed from 208 submissions. The scope of the papers spans the entire range of algorithmics from design and mathematical issues to real-world applications in various fields, and engineering and analysis of algorithms.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the Third International Workshop on Experimental and Efficient Algorithms, WEA 2004, held in Angra dos Reis, Brazil in May 2004. The 40 revised full papers presented together with abstracts of two invited talks were carefully reviewed and selected from numerous submissions. The book is devoted to the areas of design, analysis, and experimental evaluation of algorithms. Among the topics covered are scheduling, heuristics, combinatorial optimization, evolutionary optimization, graph computations, labeling, robot navigation, shortest path algorithms, flow problems, searching, randomization and derandomization, string matching, graph coloring, networking, error detecting codes, timetabling, sorting, energy minimization, etc.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 11th Annual European Symposium on Algorithms, ESA 2003, held in Budapest, Hungary, in September 2003.The 66 revised full papers presented were carefully reviewed and selected from 165 submissions. The scope of the papers spans the entire range of algorithmics from design and mathematical analysis issues to real-world applications, engineering, and experimental analysis of algorithms.
(source: Nielsen Book Data)