X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Brandenburg  (5)
  • Lee, Der-Tsai  (5)
  • Computer Science  (5)
  • History
  • 1
    Book
    Book
    Algorithms and computation : 11th international conference, ISAAC 2000, Taipei, Taiwan, December 18 - 20, 2000 ; proceedings (2000)
    Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London : Springer
    Details
    UID:
    b3kat_BV013431069
    Format: XIV, 576 S. , graph. Darst.
    ISBN: 3540412557
    Series Statement: Lecture notes in computer science 1969
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Algorithmus ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    URL: Inhaltsverzeichnis
    URL: Kapitel 1
    URL: Cover
    URL: Inhaltstext
    Author information: Lee, Der-Tsai 1949-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Stabi Berlin get availability status
    FU Berlin get availability status
    UB Potsdam get availability status
    TU Berlin get availability status
  • 2
    Online Resource
    Online Resource
    Frontiers in algorithmics : 4th international workshop, FAW 2010, Wuhan, China, August 11-13, 2010 ; proceedings (2010)
    Berlin [u.a.] : Springer
    Details
    UID:
    b3kat_BV036672034
    Format: 1 Online-Ressource (XI, 339 S.) , graph. Darst.
    ISBN: 9783642145537
    Series Statement: Lecture notes in computer science 6213
    Additional Edition: Erscheint auch als Druck-Ausgabe, Paperback ISBN 978-3-642-14552-0
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Algorithmus ; Theoretische Informatik ; Konferenzschrift ; Konferenzschrift
    DOI: 10.1007/978-3-642-14553-7
    URL: Volltext
    URL: Volltext
    URL: Volltext  (lizenzpflichtig)
    URL: Inhaltstext
    Author information: Lee, Der-Tsai 1949-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    UB Potsdam
    BTU Cottbus
  • 3
    Online Resource
    Online Resource
    Computer security in the 21st century (2005)
    [Berlin u.a.] : Springer
    Details
    UID:
    b3kat_BV022390094
    Format: 1 Online-Ressource (XII, 268 S.) , graph. Darst.
    ISBN: 0387240055 , 9780387240053 , 9780387240060
    Language: English
    Subjects: Computer Science
    RVK:
    ST 276
    Keywords: Computersicherheit ; Konferenzschrift
    DOI: 10.1007/b104203
    URL: Volltext
    Author information: Lee, Der-Tsai 1949-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    BTU Cottbus
  • 4
    Online Resource
    Online Resource
    Algorithms and Computation : 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings (2012)
    Berlin, Heidelberg : Springer
    Details
    UID:
    gbv_1651968233
    Format: Online-Ressource (XVIII, 702 p. 117 illus, digital)
    ISBN: 9783642352614
    Series Statement: Lecture Notes in Computer Science
    Content: This book constitutes the refereed proceedings of the 23rd International Symposium on Algorithms and Computation, ISAAC 2012, held in Taipei, Taiwan, in December 2012. The 68 revised full papers presented together with three invited talks were carefully reviewed and selected from 174 submissions for inclusion in the book. This volume contains topics such as graph algorithms; online and streaming algorithms; combinatorial optimization; computational complexity; computational geometry; string algorithms; approximation algorithms; graph drawing; data structures; randomized algorithms; and algorithmic game theory
    Note: Literaturangaben
    Additional Edition: ISBN 9783642352607
    Additional Edition: Buchausg. u.d.T. Algorithms and computation Berlin : Springer, 2012 ISBN 364235260X
    Additional Edition: ISBN 9783642352607
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Algorithmus ; Algorithmische Geometrie ; Berechnungskomplexität ; Graph ; Kombinatorische Optimierung ; Konferenzschrift
    DOI: 10.1007/978-3-642-35261-4
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    URL: Inhaltstext
    URL: Inhaltstext
    URL: Inhaltsverzeichnis
    Author information: Chao, Kun-Mao 1963-
    Author information: Lee, Der-Tsai 1949-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    UB Potsdam
  • 5
    Online Resource
    Online Resource
    Computing and Combinatorics (vol. # 4112) : 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings (2006)
    Berlin, Heidelberg : Springer Berlin Heidelberg
    Details
    UID:
    gbv_1646694333
    Format: Online-Ressource (XIV, 528 p. Also available online, digital)
    ISBN: 9783540369264
    Series Statement: Lecture Notes in Computer Science 4112
    Content: Invited Talks -- The Unpredictable Deviousness of Models -- Security Issues in Collaborative Computing -- Session A -- A Simplicial Approach for Discrete Fixed Point Theorems -- On Incentive Compatible Competitive Selection Protocol -- Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands -- Aggregating Strategy for Online Auctions -- On Indecomposability Preserving Elimination Sequences -- Improved Algorithms for the Minmax Regret 1-Median Problem -- Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size -- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs -- Varieties Generated by Certain Models of Reversible Finite Automata -- Iterated TGR Languages: Membership Problem and Effective Closure Properties -- On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences -- Robust Quantum Algorithms with ?-Biased Oracles -- The Complexity of Black-Box Ring Problems -- Lower Bounds and Parameterized Approach for Longest Common Subsequence -- Finding Patterns with Variable Length Gaps or Don’t Cares -- The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy -- A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem -- A PTAS for Cutting Out Polygons with Lines -- On Unfolding Lattice Polygons/Trees and Diameter-4 Trees -- Restricted Mesh Simplification Using Edge Contractions -- Enumerating Non-crossing Minimally Rigid Frameworks -- Sequences Characterizing k-Trees -- On the Threshold of Having a Linear Treewidth in Random Graphs -- Reconciling Gene Trees with Apparent Polytomies -- Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes -- Computing Maximum-Scoring Segments in Almost Linear Time -- Session B -- Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants -- A Detachment Algorithm for Inferring a Graph from Path Frequency -- The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm -- Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms -- On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis -- Improved On-Line Broadcast Scheduling with Deadlines -- A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast -- On Lazy Bin Covering and Packing Problems -- Creation and Growth of Components in a Random Hypergraph Process -- Optimal Acyclic Edge Colouring of Grid Like Graphs -- An Edge Ordering Problem of Regular Hypergraphs -- Efficient Partially Blind Signature Scheme with Provable Security -- A Rigorous Analysis for Set-Up Time Models – A Metric Perspective -- Geometric Representation of Graphs in Low Dimension -- The On-Line Heilbronn’s Triangle Problem in d Dimensions -- Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes -- Approximating Min-Max (Regret) Versions of Some Polynomial Problems -- The Class Constrained Bin Packing Problem with Applications to Video-on-Demand -- MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees -- Minimum Clique Partition Problem with Constrained Weight for Interval Graphs -- Overlap-Free Regular Languages -- On the Combinatorial Representation of Information -- Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard -- Bimodal Crossing Minimization -- Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem -- On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem.
    Note: Literaturangaben , Lizenzpflichtig
    Additional Edition: ISBN 9783540369257
    Additional Edition: Buchausg. u.d.T. Computing and combinatorics Berlin : Springer, 2006 ISBN 3540369252
    Additional Edition: ISBN 9783540369257
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Theoretische Informatik ; Kombinatorik ; Berechenbarkeit ; Theoretische Informatik ; Kombinatorik ; Berechenbarkeit ; Konferenzschrift
    DOI: 10.1007/11809678
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    URL: Inhaltstext
    Author information: Chen, Danny Z.
    Author information: Lee, Der-Tsai 1949-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    UB Potsdam
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages