GLORIA — GEOMAR Library Ocean Research Information Access

Hits per page

hits 1 - 10 | 338 hits

Sorting

Online Resource

Types for proofs and programs : international workshop, TYPES '95, Torino, Italy, June 5 - 8, 1995 ; selected papers (1996)

Berardi, Stefano ; International Workshop TYPES 1995 3 ; TYPES 1995.06.05-08 3 ; [et al.]

Berlin [u.a.] : Springer

add to mindlist on the mindlist

Details Availability

Keywords: Logic design ; Computer science ; Artificial intelligence ; Machine theory. ; Compilers (Computer programs). ; Software engineering. ; Mathematical Logic and Formal Languages ; Computer Science ; Logics and Meanings of Programs ; Artificial Intelligence (incl. Robotics) ; Programming Languages, Compilers, Interpreters ; Konferenzschrift 1995 ; Typentheorie ; Beweistheorie ; Benutzeroberfläche

Description / Table of Contents: Implicit coercions in type systems -- A two-level approach towards lean proof-checking -- The greatest common divisor: A case study for program extraction from classical proofs -- Extracting a proof of coherence for monoidal categories from a proof of normalization for monoids -- A constructive proof of the Heine-Borel covering theorem for formal reals -- An application of constructive completeness -- Automating inversion of inductive predicates in Coq -- First order marked types -- Internal type theory -- An application of co-inductive types in Coq: Verification of the alternating bit protocol -- Conservativity of equality reflection over intensional type theory -- A natural deduction approach to dynamic logic -- An algorithm for checking incomplete proof objects in type theory with localization and unification -- Decidability of all minimal models -- Circuits as streams in Coq: Verification of a sequential multiplier -- Context-relative syntactic categories and the formalization of mathematical text -- A simple model construction for the Calculus of Constructions -- Optimized encodings of fragments of type theory in first order logic -- Organization and development of a constructive axiomatization.

Type of Medium: Online Resource

Pages: Online-Ressource (X, 296 S.)

Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer Lecture Notes Archive

ISBN: 9783540707226

Series Statement: Lecture notes in computer science 1158

URL: http://www.springerlink.com/content/n3055468032j

URL: http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-61780-8

URL: http://dx.doi.org/10.1007/3-540-61780-9

URL: https://doi.org/10.1007/3-540-61780-9

URL: https://zbmath.org/?q=an:0852.00045

URL: https://external.dandelon.com/download/attachments/dandelon/ids/DE004AF66632DA3CEB4CBC12579BF0047298C.pdf

DOI: 10.1007/3-540-61780-9

RVK:

SS 4800

Language: English

Note: Literaturangaben

Permalink

	Location	Call Number	Limitation	Availability

Others were also interested in ...

GEOMAR CATALOGUE

Link to Library Catalog

Online Resource

Conceptual modeling - ER '96 : 15th International Conference on Conceptual Modeling, Cottbus, Germany, October 7 - 10, 1996 ; proceedings (1996)

Thalheim, Bernhard 1952- ; ER 1996 15 ; ER 1996.10.07-10 15 ; [et al.]

Berlin [u.a.] : Springer

add to mindlist on the mindlist

Details Availability

Keywords: Computer science ; Logic design ; Information systems ; Management information systems ; Database management ; Information theory. ; Software engineering. ; Computer simulation. ; Data structures (Computer science). ; Business information services. ; Application software. ; Mathematical Logic and Formal Languages ; Computer Science ; Logics and Meanings of Programs ; Business Information Systems ; Database Management ; Information Systems Applications (incl.Internet) ; Konferenzschrift 1996 ; Entity-Relationship-Datenmodell ; Konzeptionelle Modellierung

Description / Table of Contents: Impact of objected oriented thinking on ER modeling -- Translation schemes and the fundamental problem of database design -- Schema design and knowledge discovery -- Decomposition of relationships through pivoting -- Understanding the implementation of IS-A relations -- Deductive object oriented schemas -- Verification problems in conceptual workflow specifications -- Process knowledge modeling -- The conceptual database design optimizer CoDO — Concepts, implementation, application -- ConQuer: A conceptual query language -- Using structural recursion as query mechanism for data models with references -- A modular design strategy for a flexible graphical database design environment: An experimental study -- Graph based modeling and implementation with EER/GRAL -- On the applicability of schema integration techniques to database interoperation -- Integration of inheritance trees as part of view generation for database federations -- A formal basis for dynamic schema integration -- Graphical Entity Relationship models: Towards a more user understandable representation of data -- Benefits and quality of data modelling — Results of an empirical analysis -- Normative language approach a framework for understanding -- Improving quality in conceptual modelling by the use of schema transformations -- An approach to maintaining optimized relational representations of entity-relationship schemas -- Transforming conceptual models to object-oriented database designs: Practicalities, properties, and peculiarities -- Representing partial spatial information in databases -- Specification of calendars and time series for temporal databases -- View-centered conceptual modelling -- Reverse engineering of relational database physical schemas -- Extracting n-ary relationships through database reverse engineering -- Inheritance as a conceptual primitive -- IO2 an algorithmic method for building inheritance graphs in object database design -- Workflow evolution -- A model for classification structures with evolution control -- Integrating versions in the OMT models.

Type of Medium: Online Resource

Pages: Online-Ressource (XII, 487 S.)

Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer Lecture Notes Archive

ISBN: 9783540706854

Series Statement: Lecture notes in computer science 1157

URL: http://www.springerlink.com/content/g25321067718

URL: http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-61784-6

URL: http://dx.doi.org/10.1007/BFb0019909

URL: https://doi.org/10.1007/BFb0019909

URL: https://zbmath.org/?q=an:0852.00042

URL: https://external.dandelon.com/download/attachments/dandelon/ids/DE004D6115F6A3EBE1233C12579CF00368E8B.pdf

DOI: 10.1007/BFb0019909

RVK:

ST 270

RVK:

SS 4800

RVK:

ST 300

Language: English

Note: Literaturangaben

Permalink

	Location	Call Number	Limitation	Availability

Others were also interested in ...

GEOMAR CATALOGUE

Link to Library Catalog

Online Resource

Broadband network traffic : performance evaluation and design of broadband multiservice networks ; final report of Action COST 242 (1996)

Roberts, James

Berlin [u.a.] : Springer

add to mindlist on the mindlist

Details Availability

Keywords: Computer science ; Computer Communication Networks ; Information systems ; Multimedia systems ; Telecommunication ; Application software. ; Computer networks . ; Electronic data processing ; Computer Communication Networks ; Communications Engineering, Networks ; Computer Science ; Multimedia Information Systems ; Management of Computing and Information Systems ; Information Systems Applications (incl.Internet) ; Breitbandkommunikation ; Breitbandübertragung

Description / Table of Contents: Broadband traffic characteristics -- Broadband service models -- Accounting for cell delay variation -- Statistical resource sharing -- Connection admission control -- Weighted fair queueing -- Access network design -- MAC protocols for access to B-ISDN -- Generic architecture and core network design -- Multiservice network dimensioning -- Virtual path network design -- Resource management and routing -- Traffic modelling -- General tools for queueing analysis -- Cell scale queueing -- Burst scale loss systems -- Burst scale delay systems -- Multi-rate models.

Type of Medium: Online Resource

Pages: Online-Ressource (XXII, 584 S.)

Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer Lecture Notes Archive

ISBN: 9783540706847

Series Statement: Lecture notes in computer science 1155

URL: http://www.springerlink.com/content/g1k43057042r

URL: http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-61815-7

URL: http://dx.doi.org/10.1007/3-540-61815-5

URL: https://doi.org/10.1007/3-540-61815-5

URL: https://external.dandelon.com/download/attachments/dandelon/ids/DE0045D6D9BFCB1AB0351C1257A33002C3998.pdf

DOI: 10.1007/3-540-61815-5

RVK:

SS 4800

RVK:

ZN 6230

Language: English

Note: Literaturverz. S. [547] - 584

Permalink

	Location	Call Number	Limitation	Availability

Others were also interested in ...

GEOMAR CATALOGUE

Link to Library Catalog

Online Resource

Cryptography and coding : 5th IMA conference, Cirencester, UK, December 18 - 20, 1995 ; proceedings (1995)

Boyd, Colin ; Institute of Mathematics and Its Applications ; IMA Conference on Cryptography and Coding 1995.12.18-20 5

Berlin [u.a.] : Springer

add to mindlist on the mindlist

Details Availability

Keywords: Computer Communication Networks ; Combinatorics ; Management information systems ; Computer science ; Data encryption (Computer science) ; Coding theory ; Cryptography. ; Information theory. ; Discrete mathematics. ; Computer networks . ; Business information services. ; Computer Communication Networks ; Coding and Information Theory ; Computer Science ; Combinatorics ; Data Encryption ; Business Information Systems ; Konferenzschrift 1995 ; Kryptologie ; Codierungstheorie

Description / Table of Contents: Design choices and security implications in implementing Diffie-Hellman key agreement -- A broadcast key distribution scheme based on block designs -- Minimal supports in linear codes -- Sequential decoding for a subcode of Reed Solomon Codes -- Linear Span analysis of a set of periodic sequence generators -- Minimal weight k-SR representations -- The main conjecture for MDS codes -- Some decoding applications of minimal realization -- The synthesis of perfect sequences -- Computation of low-weight parity checks for correlation attacks on stream ciphers -- A storage complexity based analogue of Maurer key establishment using public channels -- Soft decision decoding of Reed Solomon codes using the Dorsch algorithm -- Good codes based on very sparse matrices -- Quantum cryptography: Protecting our future networks with quantum mechanics -- Prepaid electronic cheques using public-key certificates -- How traveling salespersons prove their identity -- An elliptic curve analogue of McCurley's key agreement scheme -- Multi-dimensional ring TCM codes for fading channels -- Authentication codes: An area where coding and cryptology meet -- Efficient generation of binary words of given weight -- Distribution of recurrent sequences modulo prime powers -- On-line secret sharing -- Church-Rosser codes -- A new algorithm for finding minimum-weight words in large linear codes -- Coding and cryptography for speech and vision -- Some constructions of generalised concatenated codes based on unit memory codes -- A note on the hash function of Tillich and Zémor -- Cryptanalysis of Harari's identification scheme -- Analysis of sequence segment keying as a method of CDMA transmission -- Constructions for variable-length error-correcting codes.

Type of Medium: Online Resource

Pages: Online-Ressource (IX, 291 S.)

Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer Lecture Notes Archive

ISBN: 9783540492801

Series Statement: Lecture notes in computer science 1025

URL: http://www.springerlink.com/content/x14x81367p16

URL: http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-60693-2

URL: http://dx.doi.org/10.1007/3-540-60693-9

URL: https://doi.org/10.1007/3-540-60693-9

URL: https://zbmath.org/?q=an:0842.00051

URL: https://external.dandelon.com/download/attachments/dandelon/ids/DEAGI177F6.pdf

DOI: 10.1007/3-540-60693-9

RVK:

SS 4800

RVK:

SK 170

RVK:

SS 1995

RVK:

ST 276

Language: English

Note: Literaturangaben

Permalink

	Location	Call Number	Limitation	Availability

Others were also interested in ...

GEOMAR CATALOGUE

Link to Library Catalog

Online Resource

Graph drawing : Symposium on Graph Drawing, GD '95, Passau, Germany, September 20 - 22, 1995 ; proceedings (1996)

Brandenburg, Franz J. ; Symposium on Graph Drawing 1995 ; Symposium on Graph Drawing 1995.09.20-22 ; [et al.]

Berlin [u.a.] : Springer

add to mindlist on the mindlist

Details Availability

Keywords: Computer science ; Computer software ; Computational complexity ; Computer aided design ; Combinatorics ; Software engineering ; Computer graphics ; Discrete mathematics. ; Geometry. ; Algorithms. ; Computer-aided engineering. ; Computer Science ; Computer Graphics ; Combinatorics ; Algorithm Analysis and Problem Complexity ; Computer-Aided Engineering (CAD, CAE) and Design ; Software Engineering ; Discrete Mathematics in Computer Science ; Konferenzschrift 1995 ; Computergrafik ; Graphersetzungssystem

Description / Table of Contents: Quasi-planar graphs have a linear number of edges -- Universal 3-Dimensional visibility representations for graphs -- KGB a customizable graph browser -- Adocs: a drawing system for generic combinatorial structures -- New lower bounds for orthogonal graph drawings -- The effect of graph layout on inference from social network data -- Drawing nice projections of objects in space -- Optimal algorithms to embed trees in a point set -- An experimental comparison of force-directed and randomized graph drawing algorithms -- On the complexity of recognizing intersection and touching graphs of disks -- Fast interactive 3-D graph visualization -- GD-Workbench: A system for prototyping and testing graph drawing algorithms -- CABRI-Graph: A tool for research and teaching in graph theory -- Graph folding: Extending detail and context viewing into a tool for subgraph comparisons -- Upward numbering testing for triconnected graphs -- On a visibility representation of graphs -- 3D graph drawing with simulated annealing -- The botanical beauty of random binary trees -- The strength of weak proximity (extended abstract) -- COMAIDE: Information visualization using cooperative 3D diagram layout -- Vertex splitting and tension-free layout -- Drawing stressed planar graphs in three dimensions -- Graph-Drawing contest report -- New results on a visibility representation of graphs in 3D -- Generalized fisheye views of graphs -- Drawing high degree graphs with low bend numbers -- The drawing of configurations -- Upward drawings on planes and spheres -- Grid embedding of 4-connected plane graphs -- Recognizing leveled-planar dags in linear time -- Contact graphs of curves -- On representations of some thickness-two graphs -- Drawing force-directed graphs using Optigraph -- Exact and heuristic algorithms for 2-layer straightline crossing minimization -- Constraint-based spring-model algorithm for graph layout -- Layout algorithms of graph-like diagrams for GRADE windows graphic editors -- Grid intersection and box intersection graphs on surfaces -- How to draw outerplanar minimum weight triangulations -- Portable graph layout and editing -- A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs -- Incremental layout in DynaDAG -- Issues in interactive orthogonal graph drawing (preliminary version) -- Automatic drawing of compound digraphs for a real-time power system simulator -- Validating graph drawing aesthetics -- A fast heuristic for hierarchical Manhattan layout -- CLaX — A visualized compiler -- Crossing numbers of meshes -- Directed graphs drawing by Clan-based decomposition -- TOSCANA management system for conceptual data -- Graph layout adjustment strategies -- A generic compound graph visualizer/manipulator: D-ABDUCTOR -- Generating customized layouts -- GOVE Grammar-Oriented Visualisation Environment -- Swan: A data structure visualization system.

Type of Medium: Online Resource

Pages: Online-Ressource (XII, 526 S.)

Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer Lecture Notes Archive

ISBN: 9783540493518

Series Statement: Lecture notes in computer science 1027

URL: http://www.springerlink.com/content/n5r137481533

URL: http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-60723-6

URL: http://dx.doi.org/10.1007/BFb0021783

URL: https://doi.org/10.1007/BFb0021783

URL: https://external.dandelon.com/download/attachments/dandelon/ids/DE00406EBE509F0D6FDEBC12579D000355B97.pdf

DOI: 10.1007/BFb0021783

RVK:

SS 4800

RVK:

ST 320

Language: English

Note: Literaturangaben

Permalink

	Location	Call Number	Limitation	Availability

Others were also interested in ...

GEOMAR CATALOGUE

Link to Library Catalog

Online Resource

Funtional programming languages in education : first international symposium, FPLE '95, Nijmegen, The Netherlands, December 4 - 6, 1995 ; proceedings (1995)

Hartel, Pieter H. ; FPLE 1995 1 ; FPLE 1995.12.04-06 1 ; [et al.]

Berlin [u.a.] : Springer

add to mindlist on the mindlist

Details Availability

Keywords: Logic design ; Computer science ; Computer programming. ; Compilers (Computer programs). ; Programming Techniques ; Computer Science ; Logics and Meanings of Programs ; Konferenzschrift 1995 ; Funktionale Programmiersprache

Description / Table of Contents: Elementary strong functional programming -- Introducing computer science undergraduates to principles of programming through a functional language -- Teaching C after Miranda -- Requirements for an ideal first language -- A second year course on data structures based on functional programming -- Functional programming through the curriculum -- Experiences in teaching large scale functional programming -- Functional programming and mathematical objects -- Explaining algebraic theory with functional programs -- Inducing students to induct -- Conceptual structures for recursion -- Teaching functional circuit specification in Hydra -- Functional programming in a basic database course -- Using ?-RED as a teaching tool for functional programming and program execution -- Compiler construction using scheme -- Basic proof skills of computer science students -- The Dys-functional student.

Type of Medium: Online Resource

Pages: Online-Ressource (X, 309 S.)

Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer Lecture Notes Archive

ISBN: 9783540492528

Series Statement: Lecture notes in computer science 1022

URL: http://www.springerlink.com/content/v3956047q00n

URL: http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-60675-8

URL: http://dx.doi.org/10.1007/3-540-60675-0

URL: https://doi.org/10.1007/3-540-60675-0

URL: https://external.dandelon.com/download/attachments/dandelon/ids/DEAGI177EA.pdf

DOI: 10.1007/3-540-60675-0

RVK:

SS 4800

Language: English

Note: Literaturangaben

Permalink

	Location	Call Number	Limitation	Availability

Others were also interested in ...

GEOMAR CATALOGUE

Link to Library Catalog

Online Resource

Algorithms, concurrency and knowledge : 1995 Asian Computing Science Conference, ACSC '95, Pathumthani, Thailand, December 11 - 13, 1995 ; proceedings (1995)

Kanchanasut, Kanchana ; Asian Computing Science Conference 1995 1 ; Asian Computing Science Conference 1995.12.11-13 ; [et al.]

Berlin [u.a.] : Springer

add to mindlist on the mindlist

Details Availability

Keywords: Computer software ; Computer science ; Software engineering. ; Artificial intelligence. ; Algorithms. ; Computer Science ; Algorithm Analysis and Problem Complexity ; Konferenzschrift 1995 ; Wissensrepräsentation ; Nebenläufigkeit ; Algorithmus

Description / Table of Contents: Leapfrogging samplesort -- Spanning 2-trees -- Minimal linear invariants -- Parallel maximal matching on minimal vertex series parallel digraphs -- Efficient equality-testing and updating of sets -- Binary space partitions for sets of hyperrectangles -- Transformation of orthogonal term rewriting systems -- An automaton-driven frame disposal algorithm and its proof of correctness -- Labeled ?-calculus and a generalised notion of strictness -- Preemption primitives in reactive languages -- Multi-action process algebra -- Complexity as a basis for comparing semantic models of concurrency -- Combinatory formulations of concurrent languages -- Constraints for free in concurrent computation -- Formalizing inductive proofs of message recovery in distributed systems -- Detecting distributed termination in the presence of node failure -- An extended gradient model for NUMA multiprocessor systems -- Efficient parallel permutation-based range-join algorithms on mesh-connected computers -- Pipelined band join in shared-nothing systems -- Inductive logic programming based on genetic algorithm -- The equivalence of the subsumption theorem and the refutation-completeness for unconstrained resolution -- Probabilistic logic programming and Bayesian networks -- Deriving and applying logic program transformers -- Performance of a data-parallel concurrent constraint programming system -- Formalizing inductive proofs of network algorithms -- TROM — An object model for reactive system development -- Duration calculus specification of scheduling for tasks with shared resources -- Trace specifications of non-deterministic multi-object modules -- ESP-MC: An experiment in the use of verification tools.

Type of Medium: Online Resource

Pages: Online-Ressource (X, 410 S.)

Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer Lecture Notes Archive

ISBN: 9783540492627

Series Statement: Lecture notes in computer science 1023

URL: http://www.springerlink.com/content/j83765133855

URL: http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-60688-8

URL: http://dx.doi.org/10.1007/3-540-60688-2

URL: https://doi.org/10.1007/3-540-60688-2

URL: https://external.dandelon.com/download/attachments/dandelon/ids/DEAGI177E6.pdf

DOI: 10.1007/3-540-60688-2

RVK:

ST 130

RVK:

SS 4800

Language: English

Note: Literaturangaben

Permalink

	Location	Call Number	Limitation	Availability

Others were also interested in ...

GEOMAR CATALOGUE

Link to Library Catalog

Online Resource

Algorithmic learning theory : 6th international workshop, ALT '95, Fukuoka, Japan, October 18 - 20, 1995 ; proceedings (1995)

Jantke, Klaus P. 1951- ; ALT 1995 6 ; ALT 1995.10.18-20 6 ; [et al.]

Berlin [u.a.] : Springer

add to mindlist on the mindlist

Details Availability

Keywords: Computer science ; Artificial intelligence ; Computer Science ; Artificial Intelligence (incl. Robotics) ; Konferenzschrift 1995 ; Maschinelles Lernen ; Mathematische Lerntheorie

Description / Table of Contents: Grammatical inference: An old and new paradigm -- Efficient learning of real time one-counter automata -- Learning strongly deterministic even linear languages from positive examples -- Language learning from membership queries and characteristic examples -- Learning unions of tree patterns using queries -- Inductive constraint logic -- Incremental learning of logic programs -- Learning orthogonal F-Horn formulas -- Learning nested differences in the presence of malicious noise -- Learning sparse linear combinations of basis functions over a finite domain -- Inferring a DNA sequence from erroneous copies (abstract) -- Machine induction without revolutionary paradigm shifts -- Probabilistic language learning under monotonicity constraints -- Noisy inference and oracles -- Simulating teams with many conjectures -- Complexity of network training for classes of Neural Networks -- Learning ordered binary decision diagrams -- Simple PAC learning of simple decision lists -- The complexity of learning minor closed graph classes -- Technical and scientific issues of KDD (or: Is KDD a science?) -- Analogical logic program synthesis algorithm that can refute inappropriate similarities -- Reflecting and self-confident inductive inference machines -- On approximately identifying concept classes in the limit -- Application of kolmogorov complexity to inductive inference with limited memory.

Type of Medium: Online Resource

Pages: Online-Ressource (XV, 318 S.)

Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer Lecture Notes Archive

ISBN: 9783540474708

Series Statement: Lecture notes in computer science 997

URL: http://www.springerlink.com/content/uuxxu16g0112

URL: http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-60454-9

URL: http://dx.doi.org/10.1007/3-540-60454-5

URL: https://doi.org/10.1007/3-540-60454-5

URL: https://zbmath.org/?q=an:0856.68008

URL: https://external.dandelon.com/download/attachments/dandelon/ids/DEAGI1633A.pdf

DOI: 10.1007/3-540-60454-5

RVK:

SS 4800

RVK:

SS 1995

RVK:

ST 300

Language: English

Note: Literaturangaben

Permalink

	Location	Call Number	Limitation	Availability

Others were also interested in ...

GEOMAR CATALOGUE

Link to Library Catalog

Online Resource

The complexity of simple computer architectures (1995)

Müller, Silvia M.

Berlin [u.a.] : Springer

add to mindlist on the mindlist

Details Availability

Keywords: Computer science ; Computer system performance ; Microprogramming ; Logic design ; Electronics ; Electronic digital computers ; Computer arithmetic and logic units. ; Computer architecture. ; Microprocessors. ; Logic Design ; Arithmetic and Logic Structures ; System Performance and Evaluation ; Computer Science ; Processor Architectures ; Electronics and Microelectronics, Instrumentation ; Control Structures and Microprogramming ; Computerarchitektur ; Effizienz

Description / Table of Contents: The formal architecture model -- Functional modules -- Hardwired control -- Design of a minimal CPU -- Design of the DLX machine -- Trade-off analyses -- Interrupt -- Microprogrammed control -- Further applications of the architecture model.

Type of Medium: Online Resource

Pages: Online-Ressource (XII, 270 S.)

Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer Lecture Notes Archive

ISBN: 9783540477747

Series Statement: Lecture notes in computer science 995

URL: http://www.springerlink.com/content/t167w046w018

URL: http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-60580-5

URL: http://dx.doi.org/10.1007/3-540-60580-0

URL: https://doi.org/10.1007/3-540-60580-0

URL: https://zbmath.org/?q=an:0875.68038

URL: https://external.dandelon.com/download/attachments/dandelon/ids/DE004B59E61505AE86D6EC1257A440021EBC8.pdf

DOI: 10.1007/3-540-60580-0

RVK:

ST 150

RVK:

SS 4800

Language: English

Note: Literaturverz. S. [263] - 265

Permalink

	Location	Call Number	Limitation	Availability

Others were also interested in ...

GEOMAR CATALOGUE

Link to Library Catalog

Online Resource

Graph drawing : DIMACS international workshop, GD '94, Princeton, New Jersey, USA, October 10 - 12, 1994 ; proceedings (1995)

Tamassia, Roberto ; Center for Discrete Mathematics and Theoretical Computer Science ; GD 1994 ; [et al.]

Berlin [u.a.] : Springer

add to mindlist on the mindlist

Details Availability

Keywords: Computer science ; Computer software ; Computer aided design ; Combinatorics ; Electronics ; Software engineering ; Computer graphics ; Algorithms. ; Application software. ; Discrete mathematics. ; Computer Science ; Computer Graphics ; Combinatorics ; Algorithm Analysis and Problem Complexity ; Computer-Aided Engineering (CAD, CAE) and Design ; Electronics and Microelectronics, Instrumentation ; Software Engineering ; Konferenzschrift 1994 ; Computergrafik

Description / Table of Contents: Three-dimensional graph drawing -- 3-D visualization of program information (extended abstract and system demonstration) -- 3D layout of reachability graphs of communicating processes -- A flow approach to upward drawings of toroidal maps -- Improved algorithms and bounds for orthogonal drawings -- On bend-minimum orthogonal upward drawing of directed planar graphs -- Grid layouts of block diagrams — bounding the number of bends in each connection (extended abstract) -- On drawing a graph convexly in the plane (extended abstract) -- On drawing angle graphs -- Regular edge labelings and drawings of planar graphs -- Minimum-width grid drawings of plane graphs extend abstract -- Regular orientations, arboricity, and augmentation -- The polyhedral approach to the maximum planar subgraph problem: New chances for related problems -- Crossing numbers of graphs, lower bound techniques and algorithms: A survey -- Graph-drawing contest report -- Visibility graphs and oriented matroids (extended abstract) -- Rectangle-visibility representations of bipartite graphs -- On the number of directions in visibility representations of graphs (extended abstract) -- Directed VR-representable graphs have unbounded dimension -- GraphEd: A graphical platform for the implementation of graph algorithms (extended abstract and demo) -- Graph layout through the VCG tool -- Drawing telecommunication networks -- Reduction of visual complexity in dynamic graphs -- TOSCANA — A graphical tool for analyzing and exploring data -- Characterization and recognition of point-halfspace and related orders -- Redrawing a graph within a geometric tolerance -- On the difficulty of embedding planar graphs with inaccuracies -- A system for drawing graphs with geometric symmetry -- Demonstration of the interactive graph visualization system da Vinci -- CG: A graph drawing system using graph-grammar parsing -- A demonstration of interactive graph based visual language applications -- A simple algorithm for drawing large graphs on small screens -- Molecular graph eigenvectors for molecular coordinates -- On the computational complexity of upward and rectilinear planarity testing -- Upward planarity testing of outerplanar dags (extended abstract) -- Optimal-area upward drawings of AVL trees -- Upward drawing on the plane grid using less ink -- Proximity drawability: A survey extended abstract -- Proximity constraints and representable trees (extended abstract) -- Recognizing rectangle of influence drawable graphs (extended abstract) -- A simple and unified method for drawing graphs: Magnetic-spring algorithm -- Integration of declarative and algorithmic approaches for layout creation -- A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration) -- Drawing graphs by example efficiently: Trees and planar acyclic digraphs (extended abstract) -- Designing graph drawings by layout graph grammars -- Encoding presentation emphasis algorithms for graphs -- A practical approach to static node positioning -- Map generalization as a graph drawing problem -- A geometrical heuristic for drawing concept lattices -- Poster gallery report.

Type of Medium: Online Resource

Pages: Online-Ressource (X, 469 S.)

Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive

ISBN: 9783540491552

Series Statement: Lecture notes in computer science 894

URL: http://www.springerlink.com/content/pt8051p2070j

URL: http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-58950-1

URL: http://dx.doi.org/10.1007/3-540-58950-3

URL: https://doi.org/10.1007/3-540-58950-3

URL: https://zbmath.org/?q=an:0806.68007

URL: http://www.gbv.de/dms/bowker/toc/9783540589501.pdf

DOI: 10.1007/3-540-58950-3

RVK:

SS 4800

RVK:

ST 130

Language: English

Note: Literaturangaben

Permalink

	Location	Call Number	Limitation	Availability

Others were also interested in ...

GEOMAR CATALOGUE

Link to Library Catalog

hits 1 - 10 | 338 hits