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="Wegener, Ingo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Precision, local search and unimodal functions
Martin Dietzfelbinger
,
Jonathan E. Rowe
,
Ingo Wegener
,
Philipp Woelfel
Algorithmica
59
(3), 2011, pp. 301-322
Exact OBDD bounds for some fundamental functions
Beate Bollig
,
Niko Range
,
Ingo Wegener
Theory of Computing Systems
47
(2), 2010, pp. 593-609
Tight bounds for blind search on the integers
Martin Dietzfelbinger
,
Jonathan E. Rowe
,
Ingo Wegener
,
Philipp Woelfel
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 241-252
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
Thomas Jansen
,
Ingo Wegener
Theoretical Computer Science
386
(1-2), 2007, pp. 73-93
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Frank Neumann
,
Ingo Wegener
Theoretical Computer Science
378
(1), 2007, pp. 32-40
Detecting high-order interactions of single nucleotide polymorphisms using genetic programming
Robin Nunkesser
,
Thorsten Bernholt
,
Holger Schwender
,
Katja Ickstadt
,
Ingo Wegener
Bioinformatics
23
(24), 2007, pp. 3280-3288
Identity-based encryption gone wild
Michel Abdalla
,
Dario Catalano
,
Alexander W. Dent
,
John Malone-Lee
,
Gregory Neven
,
Nigel P. Smart
Lecture Notes in Computer Science
4052
, 2006, pp. 300-311
On the axiomatizability of priority
Luca Aceto
,
Taolue Chen
,
Wan Fokkink
,
Anna Ingolfsdottir
Lecture Notes in Computer Science
4052
, 2006, pp. 480-491
A finite equational base for CCS with left merge and communication merge
Luca Aceto
,
Wan Fokkink
,
Anna Ingolfsdottir
,
Bas Luttik
Lecture Notes in Computer Science
4052
, 2006, pp. 492-503
Cryptographically sound implementations for communicating processes
Pedro Adão
,
Cédric Fournet
Lecture Notes in Computer Science
4052
, 2006, pp. 83-94
Additive approximation for edge-deletion problems
Noga Alon
,
Asaf Shapira
,
Benny Sudakov
Lecture Notes in Computer Science
4051
, 2006, pp. 1-2
Preserving secrecy under refinement
Rajeev Alur
,
Pavol C̑erný
,
Steve Zdancewic
Lecture Notes in Computer Science
4052
, 2006, pp. 107-118
Constructing single- and multi-output Boolean functions with maximal algebraic immunity
Frederik Armknecht
,
Matthias Krause
Lecture Notes in Computer Science
4052
, 2006, pp. 180-191
New constructions of mechanisms with verification
Vincenzo Auletta
,
Roberto De Prisco
,
Paolo Penna
,
Giuseppe Persiano
,
Carmine Ventre
Lecture Notes in Computer Science
4051
, 2006, pp. 596-607
Length-bounded cuts and flows
Georg Baier
,
Thomas Erlebach
,
Alexander Hall
,
Ekkehard Köhler
,
Heiko Schilling
,
Martin Skutella
Lecture Notes in Computer Science
4051
, 2006, pp. 679-690
Invisible safety of distributed protocols
Ittai Balaban
,
Amir Pnueli
,
Lenore Zuck
Lecture Notes in Computer Science
4052
, 2006, pp. 528-539
Interpreting tree-to-tree queries
Michael Benedikt
,
Christoph Koch
Lecture Notes in Computer Science
4052
, 2006, pp. 552-564
New algorithms for regular expression matching
Philip Bille
Lecture Notes in Computer Science
4051
, 2006, pp. 643-654
Exact algorithms for exact satisfiability and number of perfect matchings
Andreas Björklund
,
Thore Husfeldt
Lecture Notes in Computer Science
4051
, 2006, pp. 548-559
Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction
Guy E. Blelloch
,
Kedar Dhamdhere
,
Eran Halperin
,
R. Ravi
,
Russell Schwartz
,
Srinath Sridhar
Lecture Notes in Computer Science
4051
, 2006, pp. 667-678
Expressive power of pebble automata
Mikoƚaj Bojańczyk
,
Mathias Samuelides
,
Thomas Schwentick
,
Luc Segoufin
Lecture Notes in Computer Science
4051
, 2006, pp. 157-168
The complexity of enriched
\mu
-calculi
Piero A. Bonatti
,
Carsten Lutz
,
Aniello Murano
,
Moshe Y. Vardi
Lecture Notes in Computer Science
4052
, 2006, pp. 540-551
Stopping times, metrics and approximate counting
Magnus Bordewich
,
Martin Dyer
,
Marek Karpinski
Lecture Notes in Computer Science
4051
, 2006, pp. 108-119
Quantifying information leakage in process calculi
Michele Boreale
Lecture Notes in Computer Science
4052
, 2006, pp. 119-131
Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
Patricia Bouyer
,
Serge Haddad
,
Pierre-Alain Reynier
Lecture Notes in Computer Science
4052
, 2006, pp. 420-431
Seiten 1
2
3
4
5
6
7
8
>