|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8195 occurrences of 3892 keywords
|
|
|
Results
Found 19615 publication records. Showing 19615 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
22 | Masato Notomi, Tadao Murata |
Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(5), pp. 325-336, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
hierarchical reachability graph, bounded Petri nets, concurrent-software analysis, communication protocol software, hierarchically organized state space, deadlock state, successor states, software engineering, Petri nets, efficiency, tractability, markings, state explosion, multiprocessing programs, hierarchical systems, state-space methods, Ada programs |
22 | Mathias Barra |
Bounded minimalisation and bounded counting in argument-bounded idc's. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 20(5), pp. 753-779, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
22 | Muhammad Yasser, Agus Trisanto, Ayman Haggag, Jianming Lu, Hiroo Sekiya, Takashi Yahagi |
An Adaptive Sliding Mode Control Using Simple Adaptive Control for A Class of SISO Nonlinear Systems with Bounded-Input Bounded-Output and Bounded Nonlinearity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 45th IEEE Conference on Decision and Control, CDC 2006, San Diego, CA, USA, December 13-15, 2006, pp. 1599-1604, 2006, IEEE, 1-4244-0171-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Ziny Flikop |
Bounded Input Bounded Predefined Control Bounded Output ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.AI/0411015, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
22 | Gregory R. Wheeler |
Rational Acceptance and Conjunctive/Disjunctive Absorption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 15(1-2), pp. 49-63, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
rational acceptance, the lottery paradox, System P, bounded uncertain reasoning, probabilistic logic |
22 | Chamseddine Talhi, Nadia Tawbi, Mourad Debbabi |
Execution monitoring enforcement for limited-memory systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PST ![In: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services, PST 2006, Markham, Ontario, Canada, October 30 - November 1, 2006, pp. 38, 2006, ACM. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bounded history automata, enforcement mechanisms, locally-testable properties, security policies, execution monitoring, edit automata |
22 | Hyunho Yang, Kiseon Kim |
Delay Guaranteed Fair Queueing(DGFQ) in Multimedia Packet Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MMNS ![In: Management of Multimedia Networks and Services, 6th IFIP/IEEE International Conference, MMNS 2003, Belfast, Northern Ireland, UK, September 7-10, 2003, Proceedings, pp. 170-182, 2003, Springer, 3-540-20050-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Quality of Service (QoS), Multimedia Network, Fair Queueing, Bounded Delay |
22 | Dirk P. Kroese, Victor F. Nicola |
Efficient simulation of a tandem Jackson network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Model. Comput. Simul. ![In: ACM Trans. Model. Comput. Simul. 12(2), pp. 119-141, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Bounded relative error, tandem Jackson network, importance sampling, orthogonal polynomials, rare event simulation, Markov additive processes |
22 | Arnold Beckmann |
A Note on Universal Measures for Weak Implicit Computational Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, Proceedings, pp. 53-67, 2002, Springer, 3-540-00010-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Dynamic ordinals, Witness oracle TURING machines, Weak implicit computational complexity, Bounded arithmetic |
22 | Robert D. Rosebrugh, Richard J. Wood |
Boundedness and Complete Distributivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 9(5), pp. 437-456, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
bounded suprema, completely distributive, adjunction |
22 | Hongjun Zhu, Jianwen Su, Oscar H. Ibarra |
Toward Spatial Joins for Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSDBM ![In: Proceedings of the 12th International Conference on Scientific and Statistical Database Management, Berlin, Germany, July 26-28, 2000, pp. 231-244, 2000, IEEE Computer Society, 0-7695-0686-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
I/O bounded polygon, trapezoid, polygon, spatial join |
22 | Mark R. Greenstreet |
Real-Time Merging. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASYNC ![In: 5th International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '99), 19-22 April 1999, Barcelona, Spain, pp. 186-, 1999, IEEE Computer Society, 0-7695-0031-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
bounded-time, receptive mixer, real-time, merging, arbitration, metastability |
22 | Piotr Berman, Marek Karpinski |
On Some Tighter Inapproximability Results (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 200-209, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Approximation Hardness, Bounded Dependency Satisfiability, Breakpoint Graphs, Node Cover, Approximation Algorithms, Independent Set, MAX-CUT, Sorting by Reversals |
22 | Suad Alagic, Jose Solorzano, David Gitchell |
Orthogonal to the Java Imperative. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECOOP ![In: ECOOP'98 - Object-Oriented Programming, 12th European Conference, Brussels, Belgium, July 20-24, 1998, Proceedings, pp. 212-233, 1998, Springer, 3-540-64737-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
F-bounded polymorphism, Java Virtual Machine, Declarative languages, orthogonal persistence |
22 | Shashidhar Thakur, D. F. Wong 0001 |
Simultaneous area and delay minimum K-LUT mapping for K-exact networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 1995 International Conference on Computer Design (ICCD '95), VLSI in Computers and Processors, October 2-4, 1995, Austin, TX, USA, Proceedings, pp. 402-408, 1995, IEEE Computer Society, 0-8186-7165-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
area/delay minimum K-LUT mapping, K-exact networks, technology mapping problem, lookup table FPGAs, area minimization problem, K-bounded networks, delay minimization problem, flow-map algorithm, field programmable gate arrays, computational complexity, complexity, NP-complete, logic design, polynomial time algorithm, programmable logic arrays, table lookup, minimisation of switching nets |
22 | Olga Saukh, Robert Sauter, Pedro José Marrón |
Time-Bounded and Space-Bounded Sensing in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCOSS ![In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, Santorini Island, Greece, June 11-14, 2008, Proceedings, pp. 357-371, 2008, Springer, 978-3-540-69169-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Slim Abdellatif, Guy Juanole |
Improving the admissibility of flows with bounded arrivals and bounded delay requirements in rate-controlled packet networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO-SEAA ![In: 31st EUROMICRO Conference on Software Engineering and Advanced Applications (EUROMICRO-SEAA 2005), 30 August - 3 September 2005, Porto, Portugal, pp. 304-312, 2005, IEEE Computer Society, 0-7695-2431-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Tanmoy Chakraborty 0001, Sanjeev Khanna |
Nash Dynamics in Constant Player and Bounded Jump Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings, pp. 196-207, 2009, Springer, 978-3-642-04644-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Alain Lambert, Dominique Gruyer, Bastien Vincke, Emmanuel Seignez |
Consistent outdoor vehicle localization by bounded-error state estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 11-15, 2009, St. Louis, MO, USA, pp. 1211-1216, 2009, IEEE, 978-1-4244-3803-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Joël Ouaknine, Alexander Rabinovich, James Worrell 0001 |
Time-Bounded Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2009 - Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings, pp. 496-510, 2009, Springer, 978-3-642-04080-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Wei Chen 0018, Wenhui Zhang |
Bounded Model Checking of ACTL Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TASE ![In: TASE 2009, Third IEEE International Symposium on Theoretical Aspects of Software Engineering, 29-31 July 2009, Tianjin, China, pp. 90-99, 2009, IEEE Computer Society, 978-0-7695-3757-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Michael R. Fellows, Danny Hermelin, Frances A. Rosamond |
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 149-160, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Natasha Alechina, Brian Logan 0001, Nguyen Hoang Nga, Abdur Rakib |
Reasoning about Other Agents' Beliefs under Bounded Resources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KRAMAS ![In: Knowledge Representation for Agents and Multi-Agent Systems, First International Workshop, KRAMAS 2008, Sydney, Australia, September 17, 2008, Revised Selected Papers, pp. 1-15, 2008, Springer, 978-3-642-05300-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Serena Fritsch, Aline Senart, Douglas C. Schmidt, Siobhán Clarke |
Time-bounded adaptation for automotive system software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE ![In: 30th International Conference on Software Engineering (ICSE 2008), Leipzig, Germany, May 10-18, 2008, pp. 571-580, 2008, ACM, 978-1-60558-079-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
automotive software systems, taxonomy, dynamic adaptation |
21 | Sanjiv Kapoor, Mohammad Sarwat |
Bounded-Diameter Minimum-Cost Graph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(4), pp. 779-794, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Sven Schewe, Bernd Finkbeiner |
Bounded Synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 5th International Symposium, ATVA 2007, Tokyo, Japan, October 22-25, 2007, Proceedings, pp. 474-488, 2007, Springer, 978-3-540-75595-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Rotem Oshman, Orna Grumberg |
A New Approach to Bounded Model Checking for Branching Time Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 5th International Symposium, ATVA 2007, Tokyo, Japan, October 22-25, 2007, Proceedings, pp. 410-424, 2007, Springer, 978-3-540-75595-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Yanyan Xu 0001, Wei Chen 0018, Liang Xu, Wenhui Zhang |
Evaluation of SAT-based Bounded Model Checking of ACTL Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TASE ![In: First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering, TASE 2007, June 5-8, 2007, Shanghai, China, pp. 339-348, 2007, IEEE Computer Society, 0-7695-2856-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Joost-Pieter Katoen, Ivan S. Zapreev |
Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QEST ![In: Third International Conference on the Quantitative Evaluation of Systems (QEST 2006), 11-14 September 2006, Riverside, California, USA, pp. 301-310, 2006, IEEE Computer Society, 0-7695-2665-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella |
Length-Bounded Cuts and Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 679-690, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Rida A. Bazzi, Yin Ding |
Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, pp. 299-313, 2006, Springer, 3-540-44624-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Fault Tolerance, Replication, Atomic, Timestamps, Wait-Free, Byzantine |
21 | Iyad A. Kanj, Ljubomir Perkovic |
Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALGOSENSORS ![In: Algorithmic Aspects of Wireless Sensor Networks, Second International Workshop, ALGOSENSORS 2006, Venice, Italy, July 15, 2006, Revised Selected Papers, pp. 95-106, 2006, Springer, 3-540-69085-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(6), pp. 866-893, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph |
21 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca |
New Graph Classes of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(5), pp. 623-645, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Feodor F. Dragan, Chenyu Yan |
Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 583-592, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Héctor Cancela 0001, Gerardo Rubino, Bruno Tuffin |
Bounded Relative Efficiency in Rare Event Simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAINT Workshops ![In: 2005 IEEE/IPSJ International Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops), 31 January - 4 February 2005, Trento, Italy, pp. 272-275, 2005, IEEE Computer Society, 0-7695-2263-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Witold Charatonik, Lilia Georgieva, Patrick Maier 0001 |
Bounded Model Checking of Pointer Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings, pp. 397-412, 2005, Springer, 3-540-28231-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan |
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 13-27, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 830-839, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
21 | Sobeeh Almukhaizim, Petros Drineas, Yiorgos Makris |
On Concurrent Error Detection with Bounded Latency in FSMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2004 Design, Automation and Test in Europe Conference and Exposition (DATE 2004), 16-20 February 2004, Paris, France, pp. 596-603, 2004, IEEE Computer Society, 0-7695-2085-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Satoshi Matsumoto, Takayoshi Shoudai |
Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004, Proceedings, pp. 425-439, 2004, Springer, 978-3-540-23356-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
The Bidimensional Theory of Bounded-Genus Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 191-203, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | José Bacelar Almeida, Paulo Sérgio Almeida, Carlos Baquero |
Bounded Version Vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4-7, 2004, Proceedings, pp. 102-116, 2004, Springer, 3-540-23306-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Galina Pasko, Alexander A. Pasko, M. Ikeda, Tosiyasu L. Kunii |
Advanced Metamorphosis Based on Bounded Space-time Blending. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MMM ![In: 10th International Multimedia Modeling Conference (MMM 2004), 5-7 January 2004, Brisbane, Australia, pp. 211-, 2004, IEEE Computer Society, 0-7695-2084-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Piotr Berman, Marek Karpinski |
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 623-632, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Stefan Dziembowski, Ueli M. Maurer |
Tight security proofs for the bounded-storage model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 341-350, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Alexander Zelikovsky, Ion I. Mandoiu |
Practical approximation algorithms for zero- and bounded-skew trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 407-416, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
21 | Keijo Heljanko, Ilkka Niemelä |
Bounded LTL Model Checking with Stable Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPNMR ![In: Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, Vienna, Austria, September 17-19, 2001, Proceedings, pp. 200-212, 2001, Springer, 3-540-42593-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Keijo Heljanko |
Bounded Reachability Checking with Process Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings, pp. 218-232, 2001, Springer, 3-540-42497-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Joan Bagaria |
Bounded forcing axioms as principles of generic absoluteness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 39(6), pp. 393-401, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | János Csirik, Gerhard J. Woeginger |
Resource Augmentation for Online Bounded Space Bin Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 296-304, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
asymptotic worst case ratio, approximation algorithm, Online algorithm, competitive analysis, bin packing, resource augmentation |
21 | Lev D. Beklemishev |
Open Least Element Principle and Bounded Query Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings, pp. 389-404, 1999, Springer, 3-540-66536-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Kyoung Jun Lee, Yong Sik Chang |
Time-Bounded Negation Framework for Multi-Agent Coordination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRIMA ![In: Multiagent Platforms, First Pacific Rim International Workshop on Multi-Agents, PRIMA '98, Singapore, November 23, 1998, Selected Papers, pp. 61-75, 1998, Springer, 3-540-65967-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
21 | Arvind Gupta, Naomi Nishimura |
Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, pp. 453-464, 1996, Springer, 3-540-60922-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
21 | Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng |
Resource Bounded Randomness and Weakly Complete Problems. ![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. 369-377, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
21 | Sunil Arya, Michiel H. M. Smid |
Efficient Construction of a Bounded Degree Spanner with Low Weight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings, pp. 48-59, 1994, Springer, 3-540-58434-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
21 | Ofer Amrani, Yair Be'ery, Alexander Vardy |
Bounded-Distance Decoding of the Leech Lattice and the Golay Code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algebraic Coding ![In: Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings, pp. 236-248, 1993, Springer, 3-540-57843-9. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
21 | Tirza Hirst, David Harel |
On the Power of Bounded Concurrency II: The Pushdown Automata Level. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings, pp. 1-17, 1990, Springer, 3-540-52590-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
21 | Edward P. F. Chan, Héctor J. Hernández |
On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 23-25, 1987, San Diego, California, USA, pp. 48-57, 1987, ACM, 0-89791-223-3. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
21 | Isolde Adler, Mark Weyer |
Tree-Width for First Order Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings, pp. 71-85, 2009, Springer, 978-3-642-04026-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Shude Zhou, Robert B. Heckendorn, Zengqi Sun |
Detecting the epistatic structure of generalized embedded landscape. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Genet. Program. Evolvable Mach. ![In: Genet. Program. Evolvable Mach. 9(2), pp. 125-155, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Linkage detection, Generalized embedded landscape, Genetic algorithm, Fourier transform, Epistasis, Problem structure |
21 | Itai Benjamini, Oded Schramm, Asaf Shapira |
Every minor-closed property of sparse graphs is testable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 393-402, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minor closed properties, graph algorithms, property testing |
21 | Wenhui Zhang |
Model Checking with SAT-Based Characterization of ACTL Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFEM ![In: Formal Methods and Software Engineering, 9th International Conference on Formal Engineering Methods, ICFEM 2007, Boca Raton, FL, USA, November 14-15, 2007, Proceedings, pp. 191-211, 2007, Springer, 978-3-540-76648-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison |
Satisfiability of a Spatial Logic with Tree Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 130-145, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Michiro Kondo, Mayuka F. Kawaguchi |
Partially Ordered Set with Residuated t-norm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 35th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2005), 18-21 May 2005, Calgary, Canada, pp. 26-29, 2005, IEEE Computer Society, 0-7695-2336-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Erik D. Demaine, Mohammad Taghi Hajiaghayi |
Equivalence of local treewidth and linear local treewidth and its algorithmic applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 840-849, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
21 | M. R. K. Krishna Rao |
Input-Termination of Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR ![In: Logic Based Program Synthesis and Transformation, 14th International Symposium, LOPSTR 2004, Verona, Italy, August 26-28, 2004, Revised Selected Papers, pp. 215-230, 2004, Springer, 3-540-26655-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Yuji Sasaki, Katsushi Inoue, Akira Ito, Yue Wang 0002 |
A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers, pp. 185-196, 2002, Springer, 3-540-40431-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Georg Gottlob, Nicola Leone, Francesco Scarcello |
Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 21-23, 2001, Santa Barbara, California, USA, 2001, ACM, 1-58113-361-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Eli Gafni, Michael Merritt, Gadi Taubenfeld |
The concurrency hierarchy, and algorithms for unbounded concurrency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001, pp. 161-169, 2001, ACM, 1-58113-383-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Jason Cong, Songjie Xu |
Performance-driven technology mapping for heterogeneous FPGAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(11), pp. 1268-1281, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Shlomo Moran, Marc Snir, Udi Manber |
Applications of Ramsey's Theorem to Decision Tree Complexity ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 32(4), pp. 938-949, October 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
21 | Franz-Josef Brandenburg |
On the Height of Syntactical Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theoretical Computer Science ![In: Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, March 23-25, 1981, Proceedings, pp. 13-21, 1981, Springer, 3-540-10576-X. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
18 | Yingshu Li, Chunyu Ai, Chinh T. Vu, Yi Pan 0001, Raheem A. Beyah |
Delay-Bounded and Energy-Efficient Composite Event Monitoring in Heterogeneous Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 21(9), pp. 1373-1385, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Composite event detection, wireless sensor networks, energy efficiency, bounded delay |
18 | Lucas C. Cordeiro, Bernd Fischer 0002, João Marques-Silva 0001 |
Continuous Verification of Large Embedded Software Using SMT-Based Bounded Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECBS ![In: 17th IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, ECBS 2010, Oxford, England, UK, 22-26 March 2010, pp. 160-169, 2010, IEEE Computer Society, 978-0-7695-4005-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Embedded Software Verification, Bounded Model Checking, Satisfiability Modulo Theories |
18 | Zhi Fang, Lejian Liao, Ruoyu Chen |
Bounded Model Checking for Web Service Discovery and Composition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNPD ![In: 11th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computing, SNPD 2010, London, England, UK, June 9-11, 2010, pp. 201-206, 2010, IEEE Computer Society, 978-0-7695-4088-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Web Service Composition, Bounded Model Checking, Web Service Discovery |
18 | Elena Dubrova, Maxim Teslenko, Ming Liu |
Finding Attractors in Synchronous Multiple-Valued Networks Using SAT-Based Bounded Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 40th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2010, Barcelona, Spain, 26-28 May 2010, pp. 144-149, 2010, IEEE Computer Society, 978-0-7695-4024-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
multiple-valued network, SAT, bounded model checking, gene regulatory network, attractor |
18 | Vasant A. Ubhaya |
Lipschitzian Operators in Best Approximation by Bounded or Continuous Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 1902-1905, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximation problem, Minimum distance problem, Best estimate, Continuous selection operator, Lipschitzian selection operator, Uniform norm, Quasiconvex function, Isotone functions, Majorants and minorants, Selection, Convex function, Continuous function, Best approximation, Bounded function |
18 | Anil Maheshwari, Norbert Zeh |
I/O-Efficient Algorithms for Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(3), pp. 413-469, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Algorithms, Graph algorithms, External memory algorithms, Bounded treewidth |
18 | Bart J. Janssen, Remco Duits |
Linear Image Reconstruction by Sobolev Norms on the Bounded Domain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 84(2), pp. 205-219, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Generalized sampling, Bounded domain, Interpolation, Image reconstruction, Reconstruction, Scale space, Singular point, Sobolev space, Deep structure |
18 | Li-Xia Song |
On Nilpotent Matrices over Bounded Distributive Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IITSI ![In: Second International Symposium on Intelligent Information Technology and Security Informatics, IITSI 2009, January 23-25, 2009, Moscow, Russia, pp. 51-53, 2009, IEEE Computer Society, 978-0-7695-3579-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bounded distributive lattice, Nilpotent matrices, Prime filter, Directed graph |
18 | Libor Barto, Marcin Kozik |
Constraint Satisfaction Problems of Bounded Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 595-603, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bounded width, constraint satisfaction problem, local consistency |
18 | Shu-Heng Chen, Ren-Jie Zeng, Tina Yu |
Analysis of micro-behavior and bounded rationality in double auction markets using co-evolutionary GP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GEC Summit ![In: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC Summit 2009, Shanghai, China, June 12-14, 2009, pp. 807-810, 2009, ACM, 978-1-60558-326-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
double-auction market, co-evolution, bounded-rationality |
18 | Dongkai Zhang, Wenli Feng, Jiqing Qiu, Meijuan Shang |
Numerical Bounded Solutions of Fuzzy Volterra Integral Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (6) ![In: Sixth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2009, Tianjin, China, 14-16 August 2009, 6 Volumes, pp. 344-348, 2009, IEEE Computer Society, 978-0-7695-3735-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Fuzzy Volterra integral equations, Bounded solutions, Fuzzy number |
18 | Lucas C. Cordeiro, Bernd Fischer 0002, João Marques-Silva 0001 |
SMT-Based Bounded Model Checking for Embedded ANSI-C Software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: ASE 2009, 24th IEEE/ACM International Conference on Automated Software Engineering, Auckland, New Zealand, November 16-20, 2009, pp. 137-148, 2009, IEEE Computer Society, 978-0-7695-3891-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Embedded ANSI-C Software, Bounded Model Checking, Satisfiability Modulo Theories |
18 | Omid Shahmirzadi, Sergio Mena, André Schiper |
Relaxed Atomic Broadcast: State-Machine Replication Using Bounded Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SRDS ![In: 28th IEEE Symposium on Reliable Distributed Systems (SRDS 2009), Niagara Falls, New York, USA, September 27-30, 2009, pp. 3-11, 2009, IEEE Computer Society, 978-0-7695-3826-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
relaxed atomic broadcast, bounded memory, State-Machine replication |
18 | Bin Fu, Zhixiang Chen 0001 |
Sublinear time width-bounded separators and their application to the protein side-chain packing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 15(4), pp. 387-407, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Width-bounded separator, Random sampling, Sublinear time algorithm |
18 | Hamed Janzadeh, Ahmad Kardan |
A Multi-Issue Negotiation Mechanism for Bounded Rational Negotiators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Fifth International Conference on Information Technology: New Generations (ITNG 2008), 7-8 April 2008, Las Vegas, Nevada, USA, pp. 156-161, 2008, IEEE Computer Society, 978-0-7695-3099-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Game Theory, Optimization Methods, Bounded Rationality, Multi-Issue Negotiation |
18 | Gennaro Cordasco, Vittorio Scarano, Arnold L. Rosenberg |
Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 18(7), pp. 973-982, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
data structures for parallel systems, bounded-conflict parallel memory access, data structures, parallel architectures, parallel systems, data mapping, graph labeling, Parallel memory systems |
18 | Han Cai, Do Young Eun |
Crossing over the bounded domain: from exponential to power-law inter-meeting time in manet. ![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. 159-170, 2007, ACM, 978-1-59593-681-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
bounded domain, exponential vs. power-law, inter-meeting time distribution, time and space scaling, mobile ad-hoc network |
18 | Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi |
Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pp. 310-311, 2007, ACM, 978-1-59593-616-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
information theoretic, fault tolerance, replication, atomic, bounded, wait-free, byzantine |
18 | Lukasz Kowalik, Maciej Kurowski |
Oracles for bounded-length shortest paths in planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(3), pp. 335-363, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Bounded length, shortest path, planar graph, dynamic environment, oracle |
18 | F. H. Chang, H. B. Chen, J. Y. Guo, Frank K. Hwang, Uriel G. Rothblum |
One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(3), pp. 321-339, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Bounded-shape partition, Sum partition, Schur convex function, Optimal partition |
18 | Jochen Könemann, Asaf Levin, Amitabh Sinha |
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 41(2), pp. 117-129, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Degree-bounded spanning trees, Approximation algorithms, Spanning trees, Bicriteria approximation |
18 | Mirela Damian, Sriram V. Pemmaraju |
Computing Optimal Diameter-Bounded Polygon Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(1), pp. 1-14, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Diameter-bounded, Approximation algorithm, Polygon decomposition |
18 | Hossein Hajiabolhassan, Xuding Zhu |
Sparse H-Colourable Graphs of Bounded Maximum Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(1), pp. 65-71, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Uniquely H-colourable graphs, Bounded maximum degree, Girth |
18 | Aarti Gupta, Malay K. Ganai, Chao Wang 0001, Zijiang Yang 0006, Pranav Ashar |
Learning from BDDs in SAT-based bounded model checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 40th Design Automation Conference, DAC 2003, Anaheim, CA, USA, June 2-6, 2003, pp. 824-829, 2003, ACM, 1-58113-688-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
BDD learning, learning, SAT, BDDs, bounded model checking, boolean satisfiability, SAT solvers, property checking |
18 | Xiaohua Jia |
A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 6(6), pp. 828-837, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
delay-bounded multicast, distributed routing algorithm, multimedia systems, multicast routing, real-time communications |
18 | Jason Cong, Andrew B. Kahng, Cheng-Kok Koh, Chung-Wen Albert Tsao |
Bounded-skew clock and Steiner routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 3(3), pp. 341-388, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
(inter)connection, boundary merging and embedding, bounded-skew, interior merging and embedding, merging region, merging segment, pathlength delay, VLSI, low power, synchronization, Steiner tree, clock tree, Elmore delay, zero-skew |
18 | Lisa Cingiser DiPippo, Victor Fay Wolfe |
Object-Based Semantic Real-Time Concurrency Control with Bounded Imprecision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 9(1), pp. 135-147, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Bounded imprecision, real-time object-oriented databases, semantic concurrency control |
Displaying result #201 - #300 of 19615 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|