Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 7. Library - 2. All Years - 8. Journal Short Titles

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Journal Full Title / ISSNYearAuthor/EditorTitle
Show details for 0178-46170178-4617
Show details for Acta Inform.Acta Inform.
Show details for AlgorithmicaAlgorithmica
Show details for Algorithmica Algorithmica
Show details for Appl. Math. Lett.Appl. Math. Lett.
Show details for CGTACGTA
Show details for CombinatoricaCombinatorica
Show details for Commun. ACMCommun. ACM
Show details for Comput. Geom.Comput. Geom.
Show details for Comput. Geom., Theory Appl.Comput. Geom., Theory Appl.
Show details for Discrete Comput. Geom.Discrete Comput. Geom.
Show details for Discrete Math.Discrete Math.
Show details for Distrib. Comput.Distrib. Comput.
Show details for EATCS BulletinEATCS Bulletin
Show details for EIKEIK
Show details for Eur. J. Oper. Res.Eur. J. Oper. Res.
Show details for Form. Methods Syst. Des.Form. Methods Syst. Des.
Show details for Graphs Comb.Graphs Comb.
Show details for IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.
Show details for IEEE Trans. Parallel Distrib. Syst.IEEE Trans. Parallel Distrib. Syst.
Show details for IEICE Trans. Inf. & Syst.IEICE Trans. Inf. & Syst.
Show details for IJCGAIJCGA
Show details for Inf. Comput.Inf. Comput.
Show details for Inf. Process. Lett.Inf. Process. Lett.
IPL
Show details for Int. J. Found. Comput. Sci.Int. J. Found. Comput. Sci.
Show details for IPLIPL
Show details for J Intell Inf SystJ Intell Inf Syst
Show details for J. AlgorithmsJ. Algorithms
Show details for J. Parallel Distrib. Comput.J. Parallel Distrib. Comput.
Show details for Math CompMath Comp
Show details for Math. Program. AMath. Program. A
Show details for MCSMCS
Show details for Nord. J. Comput.Nord. J. Comput.
Show details for Parallel Comput.Parallel Comput.
Show details for Parallel Processing LettersParallel Processing Letters
Show details for RAIRORAIRO
Show details for Random Struct. AlgorithmsRandom Struct. Algorithms
Show details for RSARSA
Hide details for SIAM J. Comput.SIAM J. Comput.
SIAM Journal on Computing
0097-5397
2010Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa
Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439
SIAM Journal on Computing
0097-5397
1998Albers, SusanneImproved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693
SIAM Journal on Computing
0097-5397
1998Barnes, Greg
Edmonds, Jeff A.
Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202
SIAM Journal on Computing
0097-5397
1998Bodlaender, Hans L.
Hagerup, Torben
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746
SIAM Journal on Computing
0097-5397
1998Bradford, Phillip Gnassi
Rawlins, Gregory J.E.
Shannon, Greogory E.
Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490
SIAM Journal on Computing
0097-5397
1998Crochemore, Maxime
Gasieniec, Leszek
Hariharan, Ramesh
Muthukrishnan, S.
Rytter, Wojciech
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681
SIAM Journal on Computing
0097-5397
1998Ferragina, Paolo
Gross, Roberto
Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736
SIAM Journal on Computing
0097-5397
1998Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel
Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
SIAM Journal of Computing
0097-5397
1996Arikati, Srinivasa Rao
Maheshwari, Anil
Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338
SIAM Journal on Computing
0097-5397
1996Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170
SIAM Journal on Computing
0097-5397
1996Garg, Naveen
Vazirani, Vijay V.
Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251
SIAM Journal on Computing
0097-5397
1996Kapoor, Sanjiv
Smid, Michiel
New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796
SIAM Journal on Computing
0097-5397
1995Cheriyan, Joseph
Hagerup, Torben
A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226
SIAM Journal on Computing
0097-5397
1995Cole, Richard
Hariharan, Ramesh
Paterson, Mike
Zwick, Uri
Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45
SIAM Journal on Computing
0097-5397
1995Han, Xiaofeng
Kelsen, Pierre
Ramachandran, Vijaya
Tarjan, Robert E.
Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
SIAM Journal on Computing
0097-5397
1995Hariharan, Ramesh
Kapoor, Sanjiv
Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265
Show details for SICOMPSICOMP
Show details for SIDMASIDMA
Show details for TALGTALG
Show details for TCSTCS
Show details for Theor. Comput. Sci.Theor. Comput. Sci.
Show details for ToCTToCT
Show details for TOSNTOSN
Show details for (Not Categorized)(Not Categorized)

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)