|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 11526 occurrences of 4704 keywords
|
|
|
Results
Found 29774 publication records. Showing 29763 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
23 | Peter Buchholz 0001 |
Bounding stationary results of Tandem networks with MAP input and PH service time distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS/Performance ![In: Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS/Performance 2006, Saint Malo, France, June 26-30, 2006, pp. 191-202, 2006, ACM, 1-59593-319-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
stationary analysis, Markov chains, bounds, Tandem queues |
23 | Mihai Patrascu, Mikkel Thorup |
Time-space trade-offs for predecessor search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 232-240, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
cell-probe complexity, predecessor search, lower bounds |
23 | Claudio Gentile |
The Robustness of the p-Norm Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 53(3), pp. 265-299, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
loss bounds, learning rate, dual norms, on-line model selection, on-line learning |
23 | Tarek F. Abdelzaher, Vivek Sharma 0004 |
A Synthetic Utilization Bound for Aperiodic Tasks with Resource Requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECRTS ![In: 15th Euromicro Conference on Real-Time Systems (ECRTS 2003), 2-4 July 2003, Porto, Portugal, Proceedings, pp. 141-150, 2003, IEEE Computer Society, 0-7695-1936-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Real-time scheduling, schedulability analysis, utilization bounds, aperiodic tasks |
23 | Mihai Patrascu |
Towards polynomial lower bounds for dynamic problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 603-610, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
3SUM, lower bounds, dynamic data structures |
23 | Natasa Jovanovic, Jan H. M. Korst, Ramon Clout, Verus Pronk, Ludo Tolhuizen |
Candle in the woods: asymptotic bounds on minimum blocking sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 148-152, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
asymptotic bounds, blocking set, farey sequences |
23 | Mourad Ahmane, Laurent Truffet |
Numerical Method for Bounds Computations of Discrete-Time Markov Chains with Different State Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASMTA ![In: Analytical and Stochastic Modeling Techniques and Applications, 16th International Conference, ASMTA 2009, Madrid, Spain, June 9-12, 2009. Proceedings, pp. 309-323, 2009, Springer, 978-3-642-02204-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Gamma-algorithm, comparison, bounds, Discrete-time Markov chains |
23 | Clémence Magnien, Matthieu Latapy, Michel Habib |
Fast computation of empirically tight bounds for the diameter of massive graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 13, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Diameter bounds, graph diameter |
23 | Per Austrin, Gunnar Kreitz |
Lower Bounds for Subset Cover Based Broadcast Encryption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AFRICACRYPT ![In: Progress in Cryptology - AFRICACRYPT 2008, First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11-14, 2008. Proceedings, pp. 343-356, 2008, Springer, 978-3-540-68159-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subset Cover, lower bounds, Broadcast Encryption, key revocation |
23 | Eric Allender, Michal Koucký 0001 |
Amplifying Lower Bounds by Means of Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 31-40, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
self-reducibility, lower bounds, circuit complexity |
23 | Jean-Michel Fourneau, Imène Kadi, Nihal Pekergin, Jérôme Vienne, Jean-Marc Vincent |
Perfect simulation and monotone stochastic bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VALUETOOLS ![In: Proceedings of the 2nd International Conference on Performance Evaluation Methodolgies and Tools, VALUETOOLS 2007, Nantes, France, October 22-27, 2007, pp. 65, 2007, ICST/ACM, 978-963-9799-00-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
coupling from the past, monotone Markov chains, stochastic bounds, perfect simulation |
23 | Jean-Michel Fourneau |
Discrete time stochastic automata networks: using structural properties and stochastic bounds to simplify the SAN. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VALUETOOLS ![In: Proceedings of the 2nd International Conference on Performance Evaluation Methodolgies and Tools, VALUETOOLS 2007, Nantes, France, October 22-27, 2007, pp. 84, 2007, ICST/ACM, 978-963-9799-00-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
stochastic bounds, aggregation, discrete time Markov chain, stochastic automata networks |
23 | Mila Nikolova |
Bounds on the Minimizers of (nonconvex) Regularized Least-Squares. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSVM ![In: Scale Space and Variational Methods in Computer Vision, First International Conference, SSVM 2007, Ischia, Italy, May 30 - June 2, 2007, Proceedings, pp. 496-507, 2007, Springer, 978-3-540-72822-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
???? norm, non-convex analysis, non-smooth analysis, regularization, inverse problems, restoration, variational methods, bounds, edge preservation |
23 | Minghu Ha 0001, Yan Li 0003, Jia Li, Da-Zeng Tian |
The key theorem and the bounds on the rate of uniform convergence of learning theory on Sugeno measure space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 49(3), pp. 372-385, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Sugeno measure, the empirical risk minimization principle, the key theorem, the bounds on the rate of uniform convergence |
23 | Sahand Haji Ali Ahmad, Aleksandar Jovicic, Pramod Viswanath |
On outer bounds to the capacity region of wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2770-2776, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
cut-set bounds, isometric embedding, ad hoc wireless networks, multihop, transport capacity, capacity region |
23 | Claude-Guy Quimper, Alexander Golynski, Alejandro López-Ortiz, Peter van Beek |
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 10(2), pp. 115-135, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
domain consistency, global constraints, bounds consistency |
23 | Christian Schulte 0001, Peter J. Stuckey |
When do bounds and domain propagation lead to the same search space? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 27(3), pp. 388-425, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Constraint (logic) programming, bounds propagation, domain propagation, program analysis, abstract interpretation, finite domain constraints |
23 | Raphael Chung-Wei Phan, Bok-Min Goi |
On the Security Bounds of CMC, EME, EME+ and EME* Modes of Operation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICICS ![In: Information and Communications Security, 7th International Conference, ICICS 2005, Beijing, China, December 10-13, 2005, Proceedings, pp. 136-146, 2005, Springer, 3-540-30934-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
tweakable schemes, disk encryption, security bounds, Block cipher, modes of operation, distinguisher |
23 | Thomas Bonald, Alexandre Proutière |
On performance bounds for the integration of elastic and adaptive streaming flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: Proceedings of the International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS 2004, June 10-14, 2004, New York, NY, USA, pp. 235-245, 2004, ACM, 1-58113-873-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
adaptive streaming traffic, flow-level analysis, insensitive bounds, multi-service network, elastic traffic |
23 | Mihai Patrascu, Erik D. Demaine |
Lower bounds for dynamic connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 546-553, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
cell-probe complexity, dynamic connectivity, dynamic graph problems, lower bounds for data structures, partial sums problem |
23 | Ingo Eble, Markus Neher 0001 |
ACETAF: A software package for computing validated bounds for Taylor coefficients of analytic functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 29(3), pp. 263-286, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
bounds for Taylor coefficients, Analytic functions |
23 | Marco A. Boschetti, Aristide Mingozzi |
The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 1(2), pp. 135-147, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Lower Bounds, Heuristic Algorithms, Cutting and Packing |
23 | Emilio Leonardi, Marco Mellia, Fabio Neri, Marco Ajmone Marsan |
Bounds on delays and queue lengths in input-queued cell switches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 50(4), pp. 520-550, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
scheduling, Performance evaluation, delay bounds, input queued switches |
23 | Angelo Gilio, Veronica Biazzo, Giuseppe Sanfilippo |
Coherence checking and propagation of lower probability bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 7(5), pp. 310-320, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
g-coherence checking, Lower conditional probability bounds, Non relevant gains, Basic sets, Propagation |
23 | Dino Ahr, Gerhard Reinelt |
New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 64-74, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Min-Max Optimization, Heuristics, Lower Bounds, Chinese Postman Problem, Arc Routing |
23 | Roberto Montemanni, D. H. Smith, Stuart M. Allen |
Lower Bounds for Fixed Spectrum Frequency Assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 107(1-4), pp. 237-250, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
radio frequency assignment, fixed spectrum problems, lower bounds |
23 | Aloysius K. Mok, Alex Xiang Feng |
Towards Compositionality in Real-Time Resource Partitioning Based on Regularity Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 22nd IEEE Real-Time Systems Symposium (RTSS 2001), London, UK, 2-6 December 2001, pp. 129-138, 2001, IEEE Computer Society, 0-7695-1420-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Utiliza-tion bounds, Open System, Real-Time Task Scheduling, Resource Partition |
23 | Manfred Göbel |
Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 9(6), pp. 559-573, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Higher order symmetry, Degree bounds, Rewriting techniques, Generators, Symmetric polynomials |
23 | Ueli M. Maurer, Stefan Wolf 0001 |
Lower Bounds on Generic Algorithms in Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding, pp. 72-84, 1998, Springer, 3-540-64518-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Diffie-Hellman protocol, roots in finite groups, complexity, lower bounds, discrete logarithms, generic algorithms |
23 | Walter Krämer |
A Priori Worst-Case Error Bounds for Floating-Point Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Symposium on Computer Arithmetic ![In: 13th Symposium on Computer Arithmetic (ARITH-13 '97), 6-9 July 1997, Asilomar, CA, USA, pp. 64-, 1997, IEEE Computer Society, 0-8186-7846-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Reliable Error Estimates, Table-lookup Algorithm, Error Bounds, Floating-Point Computations |
23 | Sumant Ramprasad, Naresh R. Shanbhag, Ibrahim N. Hajj |
Achievable bounds on signal transition activity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997, pp. 126-129, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
achievable bounds, busses, Low power, information theory, power estimation, CMOS circuits, switching activity |
23 | Dimitris Bertsimas |
The achievable region method in the optimal control of queueing systems; formulations, bounds and policies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 21(3-4), pp. 337-389, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
multiarmed bandits, optimization, policies, Queueing networks, bounds, loss networks |
23 | Hualou Liang, Guiliang Dai |
Error Estimation and Error Bounds for Neural Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANNES ![In: 2nd New Zealand Two-Stream International Conference on Artificial Neural Networks and Expert Systems (ANNES '95), November 20-23, 1995, Dunedin, New Zealand, pp. 42-44, 1995, IEEE Computer Society, 0-8186-7174-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Neural network, Error estimation, Error bounds |
23 | Christine Rüb |
Lower Bounds for Merging on the Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings, pp. 213-222, 1994, Springer, 3-540-57811-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Lower bounds, Hypercube, Sorting, Merging |
22 | Haibing Lu, Yingjiu Li |
Practical Inference Control for Data Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Dependable Secur. Comput. ![In: IEEE Trans. Dependable Secur. Comput. 5(2), pp. 87-98, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Data dependencies, Inference engines |
22 | Zouheir Rezki, David Haccoun, François Gagnon, Wessam Ajib |
A Tight Lower Bound on the Outage Probability of Spatially Correlated MIMO Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTC Spring ![In: Proceedings of the 65th IEEE Vehicular Technology Conference, VTC Spring 2007, 22-25 April 2007, Dublin, Ireland, pp. 2058-2062, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Xiang-Yang Li 0001, Shaojie Tang 0001, Ophir Frieder |
Multicast capacity for large scale wireless ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiCom ![In: Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, MOBICOM 2007, Montréal, Québec, Canada, September 9-14, 2007, pp. 266-277, 2007, ACM, 978-1-59593-681-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multicast, wireless ad hoc networks, capacity |
22 | Yingjiu Li, Haibing Lu, Robert H. Deng |
Practical Inference Control for Data Cubes (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
S&P ![In: 2006 IEEE Symposium on Security and Privacy (S&P 2006), 21-24 May 2006, Berkeley, California, USA, pp. 115-120, 2006, IEEE Computer Society, 0-7695-2574-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Eyal Gordon, Adi Rosén |
Competitive weighted throughput analysis of greedy protocols on DAGs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005, pp. 227-236, 2005, ACM, 1-58113-994-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Pramod Ramarao, Akhilesh Tyagi, Gyungho Lee |
Run-Time Support for Detection of Memory Access Violations to Prevent Buffer Overflow Exploits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISC ![In: Information Security, 6th International Conference, ISC 2003, Bristol, UK, October 1-3, 2003, Proceedings, pp. 366-380, 2003, Springer, 3-540-20176-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Eunice E. Santos |
Optimal Tridiagonal Solvers on Mesh Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACPC ![In: Parallel Computation, 4th International ACPC Conference Including Special Tracks on Parallel Numerics (ParNum'99) and Parallel Computing in Image Processing, Video Processing, and Multimedia, Salzburg, Austria, February 1999, Proceedings, pp. 28-37, 1999, Springer, 3-540-65641-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
22 | R. N. Uma, Joel Wein |
On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, pp. 394-408, 1998, Springer, 3-540-64590-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
22 | Jingsen Chen |
Average Cost to Produce Partial Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 155-163, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
22 | Sanjeev Rao Maddila, Dian Zhou |
Routing in general junctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(11), pp. 1174-1184, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
22 | George S. Lueker |
Improved bounds on the average length of longest common subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(3), pp. 17:1-17:38, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Arratia-Steele conjecture, dynamic programming, average-case analysis, Longest common subsequences |
22 | Giuliano Casale, Richard R. Muntz, Giuseppe Serazzi |
Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 57(6), pp. 780-794, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Performance, Operating Systems, Queuing theory, Modeling techniques, Computer Systems Organization, Performance of Systems, Performance of Systems, Software/Software Engineering |
22 | Sang Joon Kim, Patrick Mitran, Vahid Tarokh |
Performance Bounds for Bidirectional Coded Cooperation Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(11), pp. 5235-5241, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Eleftheria Athanasopoulou, Christoforos N. Hadjicostis |
Bounds on FSM Switching Activity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Signal Process. Syst. ![In: J. Signal Process. Syst. 53(3), pp. 411-418, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Low power design, Markov models, Hamming distance, State assignment, Switching activity |
22 | Ittai Abraham, Danny Dolev, Joseph Y. Halpern |
Lower Bounds on Implementing Robust and Resilient Mediators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008., pp. 302-319, 2008, Springer, 978-3-540-78523-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Huizhen Yu, Dimitri P. Bertsekas |
New Error Bounds for Approximations from Projected Linear Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EWRL ![In: Recent Advances in Reinforcement Learning, 8th European Workshop, EWRL 2008, Villeneuve d'Ascq, France, June 30 - July 3, 2008, Revised and Selected Papers, pp. 253-267, 2008, Springer, 978-3-540-89721-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Byran J. Smucker, Aleksandra B. Slavkovic |
Cell Bounds in Two-Way Contingency Tables Based on Conditional Frequencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Privacy in Statistical Databases ![In: Privacy in Statistical Databases, UNESCO Chair in Data Privacy International Conference, PSD 2008, Istanbul, Turkey, September 24-26, 2008. Proceedings, pp. 64-76, 2008, Springer, 978-3-540-87470-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Linear programming, Integer programming, Confidentiality, Statistical disclosure control, Contingency tables, Tabular data |
22 | Ron M. Roth, Gadiel Seroussi |
Bounds for Binary Codes With Narrow Distance Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(8), pp. 2760-2768, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Gil Wiechman, Igal Sason |
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(2), pp. 550-579, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Cong Ling 0001, Xiaofu Wu, Kwok H. Li, Alex ChiChung Kot |
Gallager Bounds for Noncoherent Decoders in Fading Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(12), pp. 4605-4614, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Florin Ciucu |
Network Calculus Delay Bounds in Queueing Networks with Exact Solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITC ![In: Managing Traffic Performance in Converged Networks, 20th International Teletraffic Congress, ITC20 2007, Ottawa, Canada, June 17-21, 2007, Proceedings, pp. 495-506, 2007, Springer, 978-3-540-72989-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Jinoo Joung, Jongtae Song, Soon Seok Lee |
Delay Bounds in Tree Networks with DiffServ Architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITC ![In: Managing Traffic Performance in Converged Networks, 20th International Teletraffic Congress, ITC20 2007, Ottawa, Canada, June 17-21, 2007, Proceedings, pp. 533-543, 2007, Springer, 978-3-540-72989-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Weihaw Chuang, Satish Narayanasamy, Brad Calder, Ranjit Jhala |
Bounds Checking with Taint-Based Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPEAC ![In: High Performance Embedded Architectures and Compilers, Second International Conference, HiPEAC 2007, Ghent, Belgium, January 28-30, 2007, Proceedings, pp. 71-86, 2007, Springer, 978-3-540-69337-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Mohak Shah |
Sample compression bounds for decision trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Fourth International Conference (ICML 2007), Corvallis, Oregon, USA, June 20-24, 2007, pp. 799-806, 2007, ACM, 978-1-59593-793-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Abbas El Gamal, Mehdi Mohseni, Sina Zahedi |
Bounds on capacity and minimum energy-per-bit for AWGN relay channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(4), pp. 1545-1561, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Imam Samil Yetik, Arye Nehorai |
Performance bounds on image registration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 54(5), pp. 1737-1749, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Firouz Behnamfar, Fady Alajaji, Tamás Linder |
Tight error bounds for space-time orthogonal block codes under slow Rayleigh flat fading. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 53(6), pp. 952-956, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson |
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 35(1-3), pp. 51-72, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
DPLL algorithms, satisfiability |
22 | Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender |
Degree-Based Treewidth Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings, pp. 101-112, 2005, Springer, 3-540-25920-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Jianjiang Lu, Baowen Xu, Dazhou Kang, Yanhui Li, Peng Wang 0004 |
Approximations of Concept Based on Multielement Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA ![In: Database and Expert Systems Applications, 16th International Conference, DEXA 2005, Copenhagen, Denmark, August 22-26, 2005, Proceedings, pp. 676-685, 2005, Springer, 3-540-28566-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Stefania Verachi, Steven D. Prestwich |
Bounds-Consistent Local Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 870, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson |
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 84-96, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Geunhyung Kim, Cheeha Kim |
Deterministic Edge-to-Edge Delay Bounds for a Flow in a DiffServ Network Domain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICOIN ![In: Information Networking, Networking Technologies for Broadband and Mobile Networks, International Conference ICOIN 2004, Busan, Korea, February 18-20, 2004, Revised Selected Papers, pp. 370-379, 2004, Springer, 3-540-23034-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Jong Chul Ye, Yoram Bresler, Pierre Moulin |
Cramer-Rao bounds for parametric shape estimation in inverse problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 12(1), pp. 71-84, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Mohammad Ali Khojastepour, Ashutosh Sabharwal, Behnaam Aazhang |
Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPSN ![In: Information Processing in Sensor Networks, Second International Workshop, IPSN 2003, Palo Alto, CA, USA, April 22-23, 2003, Proceedings, pp. 146-161, 2003, Springer, 3-540-02111-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Hermann Ney |
On the Relationship between Classification Error Bounds and Training Criteria in Statistical Pattern Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IbPRIA ![In: Pattern Recognition and Image Analysis, First Iberian Conference, IbPRIA 2003, Puerto de Andratx, Mallorca, Spain, June 4-6, 2003, Proceedings, pp. 636-645, 2003, Springer, 3-540-40217-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre |
New Lower and Upper Bounds for Graph Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings, pp. 70-80, 2003, Springer, 3-540-40205-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Aseem Agarwal, David T. Blaauw, Vladimir Zolotov, Sarma B. K. Vrudhula |
Statistical Timing Analysis Using Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2003 Design, Automation and Test in Europe Conference and Exposition (DATE 2003), 3-7 March 2003, Munich, Germany, pp. 10062-10067, 2003, IEEE Computer Society, 0-7695-1870-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Eli Ben-Sasson, Oded Goldreich 0001, Madhu Sudan 0001 |
Bounds on 2-Query Codeword Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 216-227, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | James R. Morrison, P. R. Kumar 0001 |
New Linear Program Performance Bounds for Closed Queueing Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 11(4), pp. 291-317, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
closed networks, closed reentrant lines, asymptotic loss, scheduling, performance evaluation, efficiency, throughput, Queueing networks |
22 | B. S. Panda 0001, Sajal K. Das 0001 |
An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2001, 8th International Conference, Hyderabad, India, December, 17-20, 2001, Proceedings, pp. 47-57, 2001, Springer, 3-540-43009-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Sriram V. Pemmaraju |
Equitable Coloring Extends Chernoff-Hoeffding Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings, pp. 285-296, 2001, Springer, 3-540-42470-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Eric Bax |
Partition-based and sharp uniform error bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks ![In: IEEE Trans. Neural Networks 10(6), pp. 1315-1320, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
22 | Tatsuaki Okamoto, Moti Yung |
Lower Bounds on Term-Based Divisible Cash Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography, First International Workshop on Practice and Theory in Public Key Cryptography, PKC '98, Pacifico Yokohama, Japan, February 5-6, 1998, Proceedings, pp. 72-82, 1998, Springer, 3-540-64693-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
22 | Diana Marculescu, Radu Marculescu, Massoud Pedram |
Theoretical bounds for switching activity analysis in finite-state machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISLPED ![In: Proceedings of the 1998 International Symposium on Low Power Electronics and Design, 1998, Monterey, California, USA, August 10-12, 1998, pp. 36-41, 1998, ACM, 1-58113-059-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
22 | Leah Epstein |
Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings, pp. 89-98, 1998, Springer, 3-540-64736-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
22 | Ralf Heckmann, Thomas Lengauer |
Computing Upper and Lower Bounds on Textile Nesting Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings, pp. 392-405, 1996, Springer, 3-540-61680-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
22 | James F. Kurose |
On Computing Per-session Performance Bounds in High-Speed Multi-hop Computer Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, Newport, Rhode Island, USA, June 1-5, 1992, pp. 128-139, 1992, ACM, 0-89791-507-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
20 | Igor Pak |
The product replacement algorithm is polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 476-485, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
product replacement algorithm, random group elements, generating /spl kappa/-tuples, random component, group algebra packages, MAGMA, state of the art analytic technique, polynomial bounds, sub exponential bounds, polynomial upper bound, heuristic, random walk, polynomials, random number generation, heuristic programming, symbol manipulation, group theory, graph connectivity, GAP |
20 | Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh 0001 |
The Quantum Complexity of Set Membership. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 554-562, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
quantum complexity, static set membership problem, bit table, quantum bit-probe model, black-box unitary transform, oracle calls, basis state superposition, space-probe tradeoff, computational complexity, query processing, lower bounds, quantum computing, upper bounds, linear algebra, linear algebra, set theory, probes, query answering, query algorithm |
20 | Dimitrios Stiliadis, Anujan Varma |
Latency-rate servers: a general model for analysis of traffic scheduling algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 6(5), pp. 611-624, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
fair queueing algorithms, delay bounds, performance bounds, traffic scheduling |
20 | Debasis Mitra 0001, John A. Morrison, K. G. Ramakrishnan |
ATM network design and optimization: a multirate loss network framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 4(4), pp. 531-543, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Erlang bounds, fixed-point equations, flow bounds, implied costs, steepest ascent, routing, EM algorithm, effective bandwidth, revenue maximization, asymptotic approximations |
20 | Richard Beigel, David Eppstein |
3-Coloring in Time O(1.3446n): A No-MIS Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 444-452, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
duality (mathematics), 3-coloring, worst case time bounds, 3-edge-coloring, 3-list-coloring, common generalization, symbol-system satisfiability, duality transformation, computational complexity, computability, decidability, NP-complete problems, graph colouring, time bounds, 3-SAT |
20 | Peter Auer, Manfred K. Warmuth |
Tracking the Best Disjunction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 312-321, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
best disjunction tracking, deterministic on-line learning algorithm, k-literal disjunctions, worst-case mistake bounds, learning (artificial intelligence), upper bounds, computational linguistics, randomised algorithms, amortized analysis, Winnow |
20 | Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts |
Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 392-401, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
competitive access time, dynamic storage rearrangement, industrial stacker crane warehouse, automatic robot run warehouse, disk track optimization, two dimensional memory management, bubble memory, doubly linked list management, computational complexity, database, graph theory, lower bounds, optimisation, database management systems, upper bounds, server, storage allocation, probability distribution, tree structure, tree data structures, operations research, undirected graph, process migration, competitive algorithms, competitive algorithms, warehouse, disk storage, mass storage systems |
20 | Eric Schenk |
Faster Approximate Agreement with Multi-Writer Registers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 714-723, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
multi-writer registers, wait-free approximate agreement problem, asynchronous shared memory, single-bit multi-writer multi-reader registers, wait-free single-writer multi-reader, wait-free multi-writer multi-reader, computational complexity, complexity, distributed algorithms, lower bounds, shared memory systems, upper bounds, shared registers |
20 | Bernd Gärtner, Günter M. Ziegler |
Randomized Simplex Algorithms on Klee-Mintny Cubes ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 502-510, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
quadratic worst-case behavior, randomized simplex algorithms, Klee-Minty cubes, quadratic lower bounds, quadratic upper bounds, complexity, linear programs, combinatorial models |
20 | György Turán, Farrokh Vatan |
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 553-564, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
explicit nonlinear lower bounds, computation of Boolean functions, bounded fan-in, real-valued functions, sign-representation, n-variable function, piecewise linear circuits, complexity, upper bounds, nondeterminism, analog circuits |
20 | Mario Szegedy |
A note on the Theta number of Lovász and the generalized Delsarte bound ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 36-39, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
semidefinite, /spl theta/ number, generalized Delsarte bound, convex programming upper bounds, programming upper bounds, convex programming |
20 | Baruch Awerbuch, Rainer Gawlick, Frank Thomson Leighton, Yuval Rabani |
On-line Admission Control and Circuit Routing for High Performance Computing and Communication ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 412-423, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
greedy-based approaches, on-line admission control, circuit routing, high performance communication, virtual circuit routing, real-lime database servers, lower bounds, high performance computing, hypercubes, trees, upper bounds, optimal algorithms, arrays, video-servers |
20 | Haripriyan Hampapuram, Michael L. Fredman |
Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 480-485, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
optimal bi-weighted binary trees, maintaining partial sums, complexity, data structure, lower bounds, upper bounds, weighting scheme, query operation |
20 | Amir M. Ben-Amram, Zvi Galil |
When can we sort in o(n log n) time? ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 538-546, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Boolean instructions, arithmetic instructions, nonuniform programs, double-precision multiplication, lower bounds, upper bounds, random access machine |
20 | Nicholas S. Bowen, Christos Nikolaou, Arif Ghafoor |
On the Assignment Problem of Arbitrary Process Systems to Heterogeneous Distributed Computer Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(3), pp. 257-273, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
arbitrary process systems, heterogeneous distributed computer systems, allocation algorithm, branch-and-bound-type algorithms, suboptimality tradeoff, heuristic allocation, workload patterns, performance evaluation, lower bounds, distributed databases, time complexity, hierarchical clustering, upper bounds, heuristic programming, assignment problem |
20 | Weijia Shang, José A. B. Fortes |
Independent Partitioning of Algorithms with Uniform Dependencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(2), pp. 190-206, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
uniform dependence algorithms, index sets, maximal independent partitions, optimality, parallel algorithms, computational complexity, computational complexity, lower bounds, upper bounds, multiple instruction multiple data, cardinality, MIMD machines |
20 | Yossi Azar, Andrei Z. Broder, Anna R. Karlin |
On-line Load Balancing (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 218-225, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
on-line greedy algorithm, online load balancing, randomised online algorithm, deterministic online algorithm, lower bounds, upper bounds, servers, LAN |
20 | Mahdi Abdelguerfi, Arun K. Sood |
Computational Complexity of Sorting and Joining Relations with Duplicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 3(4), pp. 496-503, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
duplicate values, attribute columns, distinct tuple values, multirelation, distinct elements, worst time complexity, binary comparisons, three-branch comparisons, natural join operation, computational complexity, computational complexity, relational databases, lower bounds, sorting, sorting, database theory, upper bounds, relations, joining, cardinality |
Displaying result #201 - #300 of 29763 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|