Andrzej Lingas (57 results)

Paperback. Condition: Very Good. Paperback in very good condition. From the offices of Bell Northern Europe. Lecture Notes in Computer Science; 700. Minor shelfwear to the cover. Label on inside front cover; stamp on half title page. The binding is sound with clear content throughout. CM. Used.

Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Hardcover. Condition: Very Good. No Jacket. Hardcover 2003 library bound edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Laminatedovers and text in very good condition. Series: Lecture Notes in Computer Science ;2751.[xii, 431 p. : ill. ; 24 cm].

Condition: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: New.

Paperback or Softback. Condition: New. Swat '88: 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings. Book.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: As New. Unread book in perfect condition.

Condition: As New. Unread book in perfect condition.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Condition: New. In English.

Paperback. Condition: New. 2003rd. The papers in this volume were presented at the 14th Symposium on Fun- mentals of Computation Theory. The symposium was established in 1977 as a biennial event for researchers interested in all aspects of theoretical computer science, in particular in al- rithms, complexity, and formal and logical methods. The previous FCT con- rences were held in the following cities: Poznan ' (Poland, 1977), Wendisch-Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus (Germany, 1985), Kazan (Russia, 1987), Szeged (Hungary, 1989), Gosen-Berlin (Germany, 1991), Szeged (Hungary, 1993), Dresden (Germany, 1995), Krak' ow (Poland, 1997), Iasi (Romania, 1999), and Riga (Latvia, 2001). The FCT conferences are coordinated by the FCT steering committee, which consistsofB.Chlebus(Denver/Warsaw),Z.Esik(Szeged),M.Karpinski(Bonn), A. Lingas (Lund), M. Santha (Paris), E. Upfal (Providence), and I. Wegener (Dortmund).The call for papers sought contributions on original research in all aspects of theoretical computer science including design and analysis of algorithms, abstract data types, approximation algorithms, automata and formal lang- ges, categorical and topological approaches, circuits, computational and str- turalcomplexity,circuitandprooftheory,computationalbiology,computational geometry, computer systems theory, concurrency theory, cryptography, domain theory, distributed algorithms and computation, molecular computation, qu- tum computation and information, granular computation, probabilistic com- tation, learning theory, rewriting, semantics, logicin computer science, speci?- tion, transformation and veri?cation, and algebraic aspects of computer science. There were 73 papers submitted, of which the majority were very good. …

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Condition: New. In English.

Condition: New. In English.

Condition: New. In English.

Condition: As New. Unread book in perfect condition.

Condition: As New. Unread book in perfect condition.

Condition: Très bon. Algorithm Theory - SWAT '96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings | Karlsson, Lingas | Springer, 1996. In-8° broché, 453 pages. Couverture propre. Dos solide. Intérieur frais sans soulignage ou annotation. Exemplaire de bibliothèque : petit code barre en pied de 1re de couv., cotation au dos, rares et discrets petits tampons à l'intérieur de l'ouvrage. Très bon état général [NM51] Pour les expéditions internationales, nous consulter au préalable pour l ajustement des frais de port qui seront peut-être revus à la baisse/ For international shipments, please contact us in advance to adjust shipping costs. |.…

Condition: New.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributionspresent original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood. …

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the Fifth Scandinavian Workshop on Algorithm Theory, SWAT '96, held in Reykjavik, Iceland, in July 1996.The 35 full papers included in the book in revised version were carefully selected from a total of 95 submissions; also included are abstracts or full versions of three invited talks by prominent researchers. All in all, the collection of articles reports state-of-the-art results on various topics of current design and analysis of algorithms.…

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Approximability 1.- Proving Integrality Gaps without Knowing the Linear Program.- An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT.- Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques.- Approximability 2.- Inapproximability Results for Bounded Variants of Optimization Problems.- Approximating the Pareto Curve with Local Search for the Bicriteria TSP(1,2) Problem.- Scheduling to Minimize Max Flow Time: Offline and Online Algorithms.- Algorithms 1.- Linear Time Algorithms for Some NP-Complete Problems on (P 5,Gem)-Free Graphs.- Graph Searching, Elimination Trees, and a Generalization of Bandwidth.- Constructing Sparse t-Spanners with Small Separators.- Composing Equipotent Teams.- Algorithms 2.- Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers.- An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates.- Periodic Multisorting Comparator Networks.- Fast Periodic Correction Networks.- Networks and Complexity.- Games and Networks.- One-Way Communication Complexity of Symmetric Boolean Functions.- Circuits on Cylinders.- Computational Biology.- Fast Perfect Phylogeny Haplotype Inference.- On Exact and Approximation Algorithms for Distinguishing Substring Selection.- Complexity of Approximating Closest Substring Problems.- Computational Geometry.- On Lawson's Oriented Walk in Random Delaunay Triangulations.- Competitive Exploration of Rectilinear Polygons.- An Improved Approximation Algorithm for Computing Geometric Shortest Paths.- Adaptive and Compact Discretization for Weighted Region Optimal Path Finding.- On Boundaries of Highly Visible Spaces and Applications.- Computational Models and Complexity.- Membrane Computing.- Classical SimulationComplexity of Quantum Machines.- Using Depth to Capture Average-Case Complexity.- Structural Complexity.- Non-uniform Depth of Polynomial Time and Space Simulations.- Dimension- and Time-Hierarchies for Small Time Bounds.- Baire's Categories on Small Complexity Classes.- Formal Languages.- Operations Preserving Recognizable Languages.- Languages Defined by Generalized Equality Sets.- Context-Sensitive Equivalences for Non-interference Based Protocol Analysis.- On the Exponentiation of Languages.- Kleene's Theorem for Weighted Tree-Automata.- Logic.- Weak Cardinality Theorems for First-Order Logic.- Compositionality of Hennessy-Milner Logic through Structural Operational Semantics.- On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems.…