Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Veni Madhavan, C.E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing the shortest path tree in a weak visibility polygon
Subir Kumar Ghosh
,
Anil Maheshwari
,
Sudebkumar Prasant Pal
,
Sanjeev Saluja
,
C.E. Veni Madhavan
Lecture Notes in Computer Science
560
, 1991, pp. 369-389
An efficient distributed algorithm for finding articulation points, bridges, and biconnected components in asynchronous networks
Mohan Ahuja
,
Yahui Zhu
Lecture Notes in Computer Science
405
, 1989, pp. 99-108
Average case complexity analysis of RETE pattern-match algorithm and average size of join in databases
Luc Albert
Lecture Notes in Computer Science
405
, 1989, pp. 223-241
Robust decompositions of polyhedra
Chanderjit L. Bajaj
,
Tamal K. Dey
Lecture Notes in Computer Science
405
, 1989, pp. 267-279
An adaptive regulator approach for the design of load sharing algorithms
F. Bonomi
,
P.J. Fleming
,
P. Steinberg
Lecture Notes in Computer Science
405
, 1989, pp. 121-130
An algebraic compositional semantics of an object oriented notation with concurrency
Ruth Breu
,
Elena Zucca
Lecture Notes in Computer Science
405
, 1989, pp. 131-142
Gate matrix layout revisited: Algorithmic performance and probabilistic analysis
Sajal K. Das
,
Narsingh Deo
,
Sushil Prasad
Lecture Notes in Computer Science
405
, 1989, pp. 280-290
A natural semantics for logic programs with negation
Phan Minh Dung
,
Kanchana Kanchanasut
Lecture Notes in Computer Science
405
, 1989, pp. 78-88
Algebraic software development concepts for module and configuration families
Hartmut Ehrig
,
Werner Fey
,
Horst Hansen
,
Michael Löwe
,
Dean Jacobs
Lecture Notes in Computer Science
405
, 1989, pp. 181-192
An efficient implicit data structure for path testing and searching in rooted trees and forests
Giorgio Gambosi
,
Marco Protasi
,
Maurizio Talamo
Lecture Notes in Computer Science
405
, 1989, pp. 252-266
Deducing causal relationships in CCS
Jeremy Gunawardena
Lecture Notes in Computer Science
405
, 1989, pp. 161-170
On the limitations of locally robust positive reductions
Lane A. Hemachandra
,
Sanjay Jain
Lecture Notes in Computer Science
405
, 1989, pp. 193-203
A proof system for communicating processes with value-passing
M. Hennessy
Lecture Notes in Computer Science
405
, 1989, pp. 325-339
Parallel parsing on a one-way linear array of finite-state machines
Oscar H. Ibarra
,
Tao Jiang
,
Hui Wang
Lecture Notes in Computer Science
405
, 1989, pp. 291-300
A linear-time recognition algorithm for
P_4
-reducible graphs
B. Jamison
,
S. Olariu
Lecture Notes in Computer Science
405
, 1989, pp. 1-19
An autoepistemic logical view of knowledge base
Y.J. Jiang
Lecture Notes in Computer Science
405
, 1989, pp. 68-77
Time and real-time in programs
Mathai Joseph
Lecture Notes in Computer Science
405
, 1989, pp. 312-324
The Frobenius problem
Ravi Kannan
Lecture Notes in Computer Science
405
, 1989, pp. 242-251
Annotated program transformations
Viktor N. Kasyanov
Lecture Notes in Computer Science
405
, 1989, pp. 171-180
Query evaluation with null values: How complex is completeness?
V.S. Lakshmanan
Lecture Notes in Computer Science
405
, 1989, pp. 204-222
A transformation system for deductive database modules with perfect model semantics
Michael J. Maher
Lecture Notes in Computer Science
405
, 1989, pp. 89-98
An axiomatization of event structures
Madhavan Mukund
,
P.S. Thiagarajan
Lecture Notes in Computer Science
405
, 1989, pp. 143-160
Fast parallel approximations of the maximum weighted cut problem through derandomization
Grammati Pantziou
,
Paul Spirakis
,
Christos Zaroliagis
Lecture Notes in Computer Science
405
, 1989, pp. 20-29
A new class of separators and planarity of chordal graphs
P. Sreenivasa Kumar
,
C.E. Veni Madhavan
Lecture Notes in Computer Science
405
, 1989, pp. 30-43
Optimal parallel algorithms on circular-arc graphs
A. Srinivasa Rao
,
C. Pandu Rangan
Lecture Notes in Computer Science
405
, 1989, pp. 44-55
Seiten 1
2
>